GARA: a geometry aided routing algorithm: Research Articles
Ovidiu Daescu, G. Fasui, K. Haridoss · Communications and Mobile Computing · 2006
We consider the problem of finding the most sustainable path (MSP) between two nodes in a wireless mobile ad hoc network (MANET). A MSP between two nodes is a path that maximizes the probability of path existence under some probability model. We show how to exploit geometric properties in computing the reliability of a path in the resulting mobility graph G, prove that simple shortest path algorithms such as Dijkstra's algorithm cannot be directly applied in this scenario, and propose an algorithm for computing a single pair MSP in a modified representation of G. To improve reliability in routing, we also discuss the computation of k most sustainable paths under the link metric and under the standard shortest path formulation. Copyright © 2006 John Wiley & Sons, Ltd.