loading...
BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks
Dallas, Texas October 18-October 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/QSHINE.2004.13First International Conference on Qua ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ning Li, University of Illinois at Urbana-Champaign
Jennifer C. Hou, University of Illinois at Urbana-Champaign
The power-efficient broadcast for multi-hop wireless networks is discussed in this paper. We first investigate the trade-off between (i) using larger transmission power to reach more nodes in one hop and (ii) using smaller power and relaying broadcast messages through multiple hops. Analysis indicates that multi-hop broadcast is more power-efficient if α ≥ 2.2, where the power consumption model is P(r, α) = c₀ ⋅ rα + c₁. Based on the analysis, we propose Broadcast on Local Minimum Spanning Tree (BLMST). An underlying topology is first derived using Local Minimum Spanning Tree (LMST), a localized topology control algorithm. Broadcast messages are then simply relayed through the derived topology in a constrained flooding fashion. BLMST is fully localized, scalable, and power-efficient. Simulation results show that the performance of BLMST is comparable to that of existing centralized algorithms.
Citation:
Ning Li, Jennifer C. Hou, "BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks," qshine, pp.44-51, First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.