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.