By Topic

A constrained shortest-path energy-aware routing algorithm for wireless sensor 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

3 Author(s)
Youssef, M. ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; Younis, M. ; Arisha, K.A.

While traditional routing protocols try to minimize the end-to-end delay or maximize the throughput, most energy-aware routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. We introduce a new energy-aware routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional routing and energy-aware routing algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional routing algorithms and the energy-aware routing algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.

Published in:

Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 IEEE  (Volume:2 )

Date of Conference:

Mar 2002