Minimizing broadcast latency and redundancy in ad hoc networks

  • Authors:

  • Rajiv Gandhi;Srinivasan Parthasarathy;Arunesh Mishra

  • Affiliations:

  • University of Maryland, College Park, MD;University of Maryland, College Park, MD;University of Maryland, College Park, MD

  • Venue:
  • Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node end a message to all the other nodes in the network. In this paper, we consider the problem of collision-free broadcasting in ad hoc wireless networks. Our objective is to minimize the latency and the number of retransmission in the broadcast. We show that minimum latency broadcasting i NP-hard for ad hoc wireless networks. We also present a simple and distributed collision-free broadcasting algorithm for broadcasting a message. For networks with bounded node transmission ranges, our algorithm simultaneously guarantees that the latency and the number of retransmission are within O(1)times their respective optimal values. Our algorithm and analysis extends to the case when multiple messages are broadcast from multiple sources. Experimental studies indicate that our algorithm perform much better in practice than the analytical guarantee provided for the worst case.