Computer Science – Networking and Internet Architecture
Scientific paper
2012-02-21
Computer Science
Networking and Internet Architecture
6 pages,3 figures
Scientific paper
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. And we obtain the alternative path or backup path to avoid reroute discovery in the case of link failure or node failure.
Agarwal Swati
Nikhil Kumar
Sharma Pankaj
No associations
LandOfFree
Securing a mobile adhoc network from routing attacks through the application of genetic algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Securing a mobile adhoc network from routing attacks through the application of genetic algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Securing a mobile adhoc network from routing attacks through the application of genetic algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-423504