Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A CLUSTER-MERGE ALGORITHM FOR SOLVING THE MINIMUM POWER BROADCAST PROBLEM IN LARGE SCALE WIRELESS NETWORKS
 

Summary: A CLUSTER-MERGE ALGORITHM FOR SOLVING THE MINIMUM POWER
BROADCAST PROBLEM IN LARGE SCALE WIRELESS NETWORKS
Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi
Department of Electrical Engineering
University of Washington
Box 352500, Seattle, WA 98195.
{arindam,marks,melshark}@ee.washington.edu
and
Payman Arabshahi, Andrew Gray
Jet Propulsion Laboratory
4800 Oak Grove Drive, MS 238-343
Pasadena, CA 91109.
{payman,gray}@arcadia.jpl.nasa.gov
ABSTRACT
In this paper, we address the minimum power broadcast
problem in wireless networks. Assuming nodes are equipped
with omni-directional antennas, the inherently broadcast na-
ture 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.

  

Source: Arabshahi, Payman - Applied Physics Laboratory & Department of Electrical Engineering, University of Washington at Seattle

 

Collections: Engineering