By Topic

Energy-efficient broadcast and multicast routing in ad hoc wireless 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

4 Author(s)
Cheng, M.X. ; Dept. of Comput. Sci. & Eng., Minnesota Univ., Minneapolis, MN, USA ; Jinhua Sun ; Manki Min ; Ding-Zhu Du

This paper considers the problem of broadcasting in large ad hoc wireless networks. We focus on the energy-efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session. The minimum spanning tree (MST) has the property that the longest edge in the tree is the shortest among all the spanning trees, We introduce a new algorithm called minimum longest edge (MLE) that constructs a broadcast tree using MST. This algorithm provides a scheme to balance the energy consumption among all nodes. The simulation results show that MLE improves the energy balance and network lifetime for a wide range of networks, and the improvement is more significant when the network size increases.

Published in:

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

Date of Conference:

9-11 April 2003