By Topic

A Label Based Greedy Algorithm for Minimum Energy Consumption Multicast Routing 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
$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

2 Author(s)
Lin Lin ; State Key Lab. of Wireless Mobile Commun., Beijing, China ; Qiwu Wu

We study the problem of computing multicast trees with minimal energy consumption in multi-hop wireless ad hoc networks. We demonstrate in this paper, that for two multicast trees having the same number of forwarding nodes in an ad hoc network, the one with least steiner nodes consumes least bandwidth. A greedy Label Based Greedy Algorithm (LBGA) is presented. Our algorithm LBGA with time complexity O(n2) is an improvement of the existed multicast algorithms. At the end of the paper, we give an example to show the improvement on three representative algorithms by our LBGA.

Published in:

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2011 International Conference on

Date of Conference:

10-12 Oct. 2011