Kinetic spanning trees for minimum-power routing in MANETs

A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of shortest-path spanning trees is determined, valid until the time of the next node trajectory change. By computing the sequence of trees using one execution of the distributed routing algorithm, in contrast to computing the tree for a single time instant, the number of routing messages is substantially reduced. Moreover, the total power required to route through the trees as a function of time is also lower.

[1]  Leonidas J. Guibas,et al.  Kinetic data structures: a state of the art report , 1998 .

[2]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[3]  Leonidas J. Guibas,et al.  Parametric and kinetic minimum spanning trees , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4]  Greg N. Frederickson.  Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees , 1997, SIAM J. Comput..

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Shashi Shekhar,et al.  A performance analysis of hierarchical shortest path algorithms , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[7]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .