A Routing Algorithm Based on Cellular Automata for Mobile Adhoc Networks
Mobile Ad hoc NETworks (MANETs) are self organizing, adaptive and infrastructure less networks. Analyzing these networks is a complex task due to the high mobility and rapid topology change. Routing in MANETs is one of the challenging tasks. Although a lot of researches have done in this area, the usage of cellular automata in routing for MANETs has not been explored. The proposed routing algorithm is a new cellular automaton based routing algorithm for mobile ad hoc networks, which finds a route that not only has least number of hops but also supports Quality of service. The solution presented here, is based on selecting a delay constrained shortest path between source and destination as a best route by using cellular automata.