Genetic Algorithm for Shortest Path in Ad Hoc Networks

Abstract

The decentralized nature of ad hoc wireless networks makes them suitable for a variety of applications, where the central nodes cannot be invoked and can improve the scalability of large map networks, the topology of the ad hoc network may change rapidly and unexpectedly. Mobile Ad hoc (VANET) are used for communication between vehicles that helps vehicles to behave intelligently during vehicle collisions, accidents…one of the most problems confronted in this network, is finding the shortest path (SP) from the source to the destination of course within a short time. In this paper Genetic Algorithm is an excellent approach to solving complex problem in optimization with difficult constraints and network topologies, the developed genetic algorithm is compared with another algorithm which contains a topology database for evaluate the quality of our solution and between Dijkstra’s algorithm. The results simulation affirmed the potential of the proposed genetic algorithm.