An Automaton Model for Stable Routing in Ad-Hoc Network Based on Two States CTMC

Efficient routing protocols in wireless networks with and without infrastructure are challenging task in scenario of the 21st century. Routing protocols must work in a dynamic and unstable environment. The most important cause of the uncertainties and randomness of the topology is the mobility of nodes, which can lead the appearance and disappearance of communication links between the nodes, which in turn affects the route stability in routing. To minimize route breaking issues, it is important to find a route that supports longer time. To deal with uncertainties in dynamic environment of ad-hoc networks and in order to get stable routing, various mathematical models have been proposed. In this paper, we have propounded a simple automaton model for stable routing based on two states continuous time markov chain (CTMC) for random mobility pattern. Two probability equations have been derived using CTMC in order to predict the uncertainties due to unexpected changes and random propagation delay of network state information. Evaluated probability using derived equations is high for more stable communication in routing.