Hop constrained energy-efficient broadcasting: insights from massively dense ad hoc networks

This is the latest version of this item.

Abstract

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. Our objective in this paper is to construct an energy-efficient broadcast tree that has a maximum depth D, where D represents the end-to-end delay 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(D^2). 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 delay 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.

Available Versions of this Item

• Delay Constrained Energy-Efficient Broadcasting: Insights From Massively Dense Ad Hoc Networks. (deposited 30 Oct 2007 16:17)
  • Hop Constrained Energy-Efficient Broadcasting: Insights From Massively Dense Ad Hoc Networks. (deposited 06 Nov 2008 10:30)
    • Hop constrained energy-efficient broadcasting: insights from massively dense ad hoc networks. (deposited 04 Feb 2009 13:52)
      • Hop constrained energy-efficient broadcasting: insights from massively dense ad hoc networks. (deposited 20 Feb 2009 09:17) [Currently Displayed]