Issue No. 02 - February (2009 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.105
Kerem Bulbul , Sabanci University, Istanbul
Ozgur Ercetin , Sabanci University, Istanbul
Tonguç Ünlüyurt , Sabanci University, Istanbul
We consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between the source and any node in the network. We measure the delay to a given node in the number of hops data travels from the source to that node, and our objective in this paper is to construct an energy-efficient broadcast tree that has a maximum depth Δ, where Δ; represents the end-to-end hop constraint in the network. We characterize the optimal solution to a closely related problem in massively dense networks using a dynamic programming formulation. We prove that the optimal solution can be obtained by an algorithm of polynomial time complexity O(Δ²). The solution to the dynamic program indicates that there is a single optimal policy applicable to all massively dense networks. Elaborating on the insights provided by the structure of the problem in massively dense networks, we design an algorithm for finding a solution to the hop constrained minimum power broadcasting problem in general networks. By extensive simulations, we demonstrate that our proposed optimization-based algorithm generates broadcast trees within 20% of optimality for general dense networks.
energy efficiency, multicast, optimization
K. Bulbul, O. Ercetin and T. Ünlüyurt, "Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks," in IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 188-202, 2008.