Mobility

Securing a Mobile Adhoc Network from Routing Attacks Through the Application of Genetic Algorithm

Download Now Free registration required

Executive Summary

In recent years, the static Shortest Path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, Genetic Algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [Mobile Ad hoc NETworks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. GA's are able to find, if not the shortest, at least an optimal path between source and destination in mobile ad-hoc network nodes.

  • Format: PDF
  • Size: 390.38 KB