Skip to Main Content
We consider the problem of finding the most sustainable path (MSP) between two nodes in a wireless mobile ad-hoc network. An 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 the k most sustainable paths under a link metric, where the length of a path is given by the number of edges along the path, and under the standard shortest path formulation. We also discuss implementations and experimental results.