Cellular Automata Construction for Novel Routing over Hexagonal Grid for Mobile Ad-hoc Networks

Abstract

We address the problem of constructing an efficient route algorithm for Mobile Ad-hoc Network setting up QoS routes based on route discovery mechanism of AODV protocol and cellular automata. A Mobile Ad-hoc Network (MANET) consists of mobile nodes which are free to move arbitrarily due to its dynamic nature, adaptive and infrastructure less in nature. It is very tough task to have a snap of a network topology in this dynamic nature. Many research works have done to find a shortest path in MANET, it may give a better solution for finding an optimal path but difficult to augment with QoS constraints and its energy utilization. Here we have proposed an algorithm based on hexagonal cellular automata model for giving an efficient algorithm. This algorithm applies ADOV protocol and Lee's algorithm for constructing a shortest route and it considers energy and delay/bandwidth constraints as its basic metrics. These two metrics give a basic criterion for selecting a path between source and destination nodes through hexagonal cellular automata. Finally it is modeled with a matrix to implement it.