BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks

  • Authors:
  • Ning Li;Jennifer C. Hou

  • Affiliations:
  • University of Illinois at Urbana-Champaign;University of Illinois at Urbana-Champaign

  • Venue:
  • QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.