Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
MINIMUM POWER BROADCAST TREES FOR WIRELESS NETWORKS: OPTIMIZING USING THE VIABILITY LEMMA
 

Summary: MINIMUM POWER BROADCAST TREES FOR WIRELESS NETWORKS:
OPTIMIZING USING THE VIABILITY LEMMA
Robert J. Marks II, Arindam K. Das, Mohamed El-Sharkawi
Department of Electrical Engineering
Box 352500, University of Washington
Seattle, WA 98125
Payman Arabshahi, Andrew Gray
Jet Propulsion Laboratory
4800 Oak Grove Drive, MS 238-343
Pasadena, CA 91109
ABSTRACT
Wireless multicast/broadcast sessions, unlike wired net-
works, inherently reaches several nodes with a single trans-
mission. For omnidirectional wireless broadcast to a node,
all nodes closer will also be reached. An algorithm for
constructing the minimum power tree in wireless networks
was first proposed by Wieselthier et al.. The broadcast
incremental power (BIP) algorithm suggested by them is
a "node-based" minimum-cost tree algorithm for wireless
networks. We propose an alternate search based paradigm

  

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

 

Collections: Engineering