a simple automata based model for stable routing in dynamic ad hoc networks
This paper focuses on routing protocols for ad hoc networks where nodes can be either awake or sleeping or breakdown and where links can be nonpersistent because of both mobility and the state of the nodes. Routing protocols for ad hoc networks already exist but because of uncertainties they produce a significant traffic overhead. We propose a new algorithm aiming at maximizing the existence probability of a route over a given time period. 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 automata. We exhibit closed form expressions for the existence probabilities of the network elements. Our proposition allows fast computation for stable routes.
routing ad hoc networks path stability uncertainties modeling