On the complexity and distributed construction of energy-efficient broadcast trees in wireless ad hoc networks

Authors:
A. S. Ahluwalia;E. H. Modiano
Affiliations:
Massachusetts Inst. of Technol., Cambridge, MA, USA;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2005

Citing 0
Cited 7

Interface placement in constructing widest spanning tree for multi-channel multi-interface wireless mesh networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Adjustable convergecast tree protocol for wireless sensor networks

Computer Communications
Energy efficient cooperative broadcasting in wireless networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Minimum power multicast algorithms for wireless networks with a Lagrangian relaxation approach

Wireless Networks
A mobility model for studying wireless communication and the complexity of problems in the model

Networks
Block-level packet recovery with network coding for wireless reliable multicast

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-efficient reliable data dissemination in duty-cycled wireless sensor networks

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the energy-efficient broadcasting problem in ad hoc wireless networks. First, we show that finding the minimum-energy broadcast tree is NP-complete. We then develop a distributed clustering algorithm that computes energy-efficient broadcast trees in polynomial time. Our distributed algorithm computes all N possible broadcast trees simultaneously, while requiring O(N2) messages to be exchanged between nodes. We compare our algorithm's performance to the best-known centralized algorithm, and show that it constructs trees consuming, on average, only 18% more energy. We also consider the possibility of having multiple source nodes that can be used to broadcast the message and adapt our algorithm to compute energy-efficient broadcast trees with multiple source nodes. We observe a reduction in the amount of energy needed to form the broadcast tree that is linear in the number of source nodes.