By Topic

A cluster-merge algorithm for solving the minimum power broadcast problem in large scale 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
$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

5 Author(s)
A. K. Das ; Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA ; R. J. Marks ; M. El-Sharkawi ; P. Arabshahi
more authors

In this paper, we address the minimum power broadcast problem in wireless networks. Assuming nodes are equipped with omni-directional antennas, the inherently broadcast nature of wireless networks can be exploited to compute power efficient routing trees. We propose a 2-stage cluster-merge algorithm for computing minimum power broadcast trees. The cluster phase is a look-ahead variant of the broadcast incremental power algorithm [Wieselthier, J.E., et al., 2000] and the merge phase is a probabilistic positive reinforcement search procedure, as used in swarm intelligence algorithms. A local tree-improvement procedure is incorporated as an optional step in the merge phase to boost the performance of the algorithm. A key advantage of such a cluster based approach is significant reduction in time complexity. Simulations show that the algorithm is able to generate high quality solutions in relatively little computational time.

Published in:

Military Communications Conference, 2003. MILCOM '03. 2003 IEEE  (Volume:1 )

Date of Conference:

13-16 Oct. 2003