Ad-Hoc, Mobile, and Wireless Networks

Volume 3158 of the series Lecture Notes in Computer Science pp 294-299

Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks

  • Johnson KuruvilaAffiliated withSITE, University of Ottawa
  • , Amiya NayakAffiliated withSITE, University of Ottawa
  • , Ivan StojmenovicAffiliated withSITE, University of Ottawa

* Final gross prices may vary according to local VAT.

Get Access


In this article we propose several new progress based, localized, power and cost aware algorithms for routing in ad hoc wireless networks. Node currently holding the packet will forward it to a neighbor, closer to destination than itself, which minimizes the ratio of power and/or cost to reach that neighbor, and the progress made, measured as the reduction in distance to destination, or projection along the line to destination. In localized algorithms, each node makes routing decisions solely on the basis of location of itself, its neighbors and destination. The new algorithms are based on the notion of proportional progress. The new power and cost localized schemes are conceptually simpler than existing schemes, and have similar or somewhat better performance in our experiments. Our localized schemes are also shown to be competitive with globalized shortest weighted path based schemes.