By Topic

Constructing energy-efficient multicast trees with delay constraints in 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
$33 $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)
Wen-Lin Yang ; Dept. of Inf. Technol., Nat. Pingtung Inst. of Commerce, Taiwan

In this paper, we study the problem concerning how to construct a delay-constrained multicast tree with minimum power-consumption so that real-time multimedia applications can be supported in ad hoc wireless networks. Based on a number of link-replacing strategies, we present a heuristic called ELR algorithm for determining a multicast tree for the problem. Our ELR algorithm begins with a two-level multicast tree and then iteratively replaces the high-power links with lower-power links in order to reduce the total power required by the multicast tree. The simulation results show that for a given delay constraint the multicast tree found by our ELR algorithm requires less power than the one found by the previous published method.

Published in:

19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)  (Volume:1 )

Date of Conference:

28-30 March 2005