By Topic

Energy efficient online routing in wireless ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shpungin, H. ; Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB, Canada

In this paper we study the minimum total energy and maximum network lifetime routing problem in wireless ad hoc networks. We develop competitive online schemes for an infinite sequence of random routing requests with provable approximation factors in both measures. In addition, we produce fundamental bounds on the expected total energy consumption and network lifetime in the optimal offline solution. Our results are verified through simulations. In the course of our analysis we derive an interesting property of shortest path trees (SPT) for a random point process. We show that the maximum edge length of any SPT is asymptotically equal to the maximum edge length of a minimum spanning tree. This result is of self interest for the study of energy efficient routing as many heuristics rely on SPTs.

Published in:

Sensor, Mesh and Ad Hoc Communications and Networks (SECON), 2011 8th Annual IEEE Communications Society Conference on

Date of Conference:

27-30 June 2011