A Routing Algorithm based on Cellular Automata for Mobile Ad-hoc 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. A simulator has been developed to evaluate a routing protocol and the obtained results indicate that the efficiency of the proposed protocol especially in satisfying QoS requirements.
Keywords: Mobile Ad-hoc Networks, Routing, Quality of Service, Cellular Automata.
Download Full-Text
ABOUT THE AUTHORS
Azadeh Ghalavand
Dept. of Computer. Eng, South Tehran Branch, Islamic Azad University Tehran, Iran
Ahmad Khademzadeh
Education and International Scientific Cooperation Dept, Iran Telecommunication Research Center
Arash Dana
Dept. of Elect. Eng. ,Central Tehran Branch, Islamic Azad University, Tehran, Iran
Golnoosh Ghalavand
Dept. of Computer. Eng, Science And Research Branch, Islamic Azad University, Tehran, Iran
Azadeh Ghalavand
Dept. of Computer. Eng, South Tehran Branch, Islamic Azad University Tehran, Iran
Ahmad Khademzadeh
Education and International Scientific Cooperation Dept, Iran Telecommunication Research Center
Arash Dana
Dept. of Elect. Eng. ,Central Tehran Branch, Islamic Azad University, Tehran, Iran
Golnoosh Ghalavand
Dept. of Computer. Eng, Science And Research Branch, Islamic Azad University, Tehran, Iran