By Topic

An Effective Algorithm for Computing Energy-Efficient Broadcasting Trees in All-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

2 Author(s)
Bein, D. ; Dept. of Comput. Sci., Univ. of Texas at Dallas, Dallas, TX ; Zheng, S.Q.

Given a wireless network in which node positions are fixed and a specific source node r in the network, the minimum energy broadcasting problem (MEB) asks each node to adjust its transmission range to create a spanning tree rooted at r with minimum total energy. This problem is NP-complete for both general graphs as well as Euclidean space graphs.We propose a heuristic algorithm, called Greedy Tradeoff (GT) algorithm for the MEB problem. We compare the broadcasting trees computed by our GT algorithm with the broadcasting trees computed by two previously proposed algorithms, BIP and IMBM, in terms of total power, tree height, and the number of leave nodes. Our results show that the performance of our GT algorithm is better than the performances of BIP and IMBM.

Published in:

Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on

Date of Conference:

17-20 June 2008