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

  • Johnson Kuruvila
  • Amiya Nayak
  • Ivan Stojmenovic
Conference paper

DOI: 10.1007/978-3-540-28634-9_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3158)
Cite this paper as:
Kuruvila J., Nayak A., Stojmenovic I. (2004) Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks. In: Nikolaidis I., Barbeau M., Kranakis E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2004. Lecture Notes in Computer Science, vol 3158. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Johnson Kuruvila
    • 1
  • Amiya Nayak
    • 1
  • Ivan Stojmenovic
    • 1
  1. 1.SITEUniversity of OttawaCanada

Personalised recommendations