Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
r-shrink: A Heuristic for Improving Minimum Power Broadcast Trees in Wireless Networks
 

Summary: r-shrink: A Heuristic for Improving Minimum
Power Broadcast Trees in Wireless Networks
Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi, Payman Arabshahi, Andrew Gray
Abstract-- Broadcasting in wireless networks, unlike wired
networks, inherently reaches several nodes with a single trans-
mission. For omni-directional wireless broadcast to a node,
all nodes closer will also be reached. This property can be
used to compute routing trees which minimize the sum of the
transmitter powers. It has been shown that this problem is
NP-complete. In this paper, we present the r-shrink proce-
dure, a heuristic for improving the solutions obtained using
fast sub-optimal algorithms. Specifically, we focus on the low-
complexity BIP algorithm and Prim's minimum spanning tree
algorithm and show through extensive simulations that better
solutions are obtained almost always, with considerably lower
tree power, if the proposed procedure is used to improve the
trees generated using these algorithms.
I. Introduction
Broadcasting/multicasting in wireless networks is fun-
damentally different as compared to wired networks, since

  

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

 

Collections: Engineering