H. Sreenivas and H.H. Ali (USA)
Routing, Ad-Hoc Networks, Connected Dominating Sets, Simulation, Genetic Algorithms.
This paper presents a new approach to routing in wireless ad hoc networks using graph theoretic concepts. Routing remains a challenging problem in ad hoc networks due to the associated multi-hop nature and dynamic network topology. We propose a new evolutionary approach to constructing a stable connected dominating set in an ad hoc network. Since the mobile nodes that constitute an ad hoc network are constantly in motion, the network configuration is subject to constant change in a manner that resembles the biological process of mutation. Each change in the network topology may be viewed as a mutation in the sequence representing the nodes in the network, hence resembling an evolutionary process. Simulation studies are conducted to evaluate the performance of the evolutionary routing approach and compare it with known approaches. We show that our evolutionary routing approach outperforms the other routing algorithms with respect to end-to-end packet delay, throughput and packet delivery ratio across several different scenarios. Thus, we demonstrate the advantages of utilizing a genetic algorithm to construct a backbone that is used to effectively route packets in an ad hoc wireless network.
Important Links:
Go Back
