Stability Oriented Routing in Mobile Ad-Hoc Networks Based on Simple Automatons

Abstract

Since wireless ad-hoc networks with mobile nodes have not stable topology, the classical network functions as the routing are difficult to realize. The router nodes and the links between them are not stable and can appear and disappear randomly. So, classic routing algorithms can not be used successfully. New approaches should be used which deals with these dynamic changes. To avoid frequent route requests and volatile routes due to uncertain information, the objective of the routing can correspond to the route stability. The route computation can be based on random variables and becomes probabilistic routing. Our book chapter focuses on modeling the resilience of these information for ad hoc networks where topology information is uncertain. Our model is based on a dynamic graph where the existence of the nodes and the communication capability between them are modeled by simple two state automaton where the transitions are initiated by random events.