Coordinator-Oriented Forwarding for Energy Efficiency in Large-Scale Wireless Ad-hoc Networks
E. J. Kim, Subhankar Dhar, Michael Q. Rieck · 2004
This paper describes a distributed power-aware routing protocol that finds the least power consuming paths between any two nodes in the network. The routing algorithm is based on link state information available at the nodes that belong to the k-SPR set. The k-SPR set is computed based on a priority-based SPR algorithm that assigns a priority to each node depending on the node’s remaining battery life. This k-SPR set derives its motivation from the previous work done by the authors to find shortest paths in an ad hoc network using local information.