Survey on evolutionary computation methods for cybersecurity of mobile ad hoc networks
Name
12065_2018_154_ReferencePDF.pdf
Size
1.81 MB
Format
Adobe PDF
Checksum (MD5)
e3e02e248fc8d2e8a2c2b437998d852b
Author(s) • •
Kusyk, Janusz
Uyar, M. U
Sahin, Cem S
Date Issued
May 18, 2018
Publisher
Springer Berlin Heidelberg
Version
Author's final manuscript
Abstract
Abstract
In this paper, a comprehensive survey of evolutionary computation (EC) methods for cybersecurity of mobile ad hoc networks (MANETs) is presented. Typically, EC methods are named based on the natural processes inspiring them, such as swarm intelligence (e.g., ant colony optimization, artificial bee colony, and particle swarm optimization), evolutionary algorithms (e.g., genetic algorithms, genetic programming, grammatical evolution, and differential evolution), artificial immune systems, and evolutionary games analyzing strategic interactions among different population types. We introduce these methods with their typical applications, and commonly used algorithms to improve cybersecurity within the scope of MANETs. Ongoing and speedy topology changes, multi-hop communication, non-hierarchical organization, and power and computational limitations are among the intrinsic characteristics of MANETs causing cybersecurity vulnerabilities. We describe basic defense mechanisms in MANETs for vulnerability detection, attack deterrence, prevention and recovery, and risk mitigation. We classify principal applications of EC as intrusion detection, trust management, and cryptography in cybersecurity systems to counter measure adversarial activities.
MIT Department
Lincoln Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s12065-018-0154-4