Minimizing broadcast latency and redundancy in ad hoc networks

Rajiv Gandhi, Srinivasan Parthasarathy, Arunesh Mishra

Research output: Contribution to conferencePaperpeer-review

127 Scopus citations

Abstract

Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting, a source node sends 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 retransmissions in the broadcast. We show that minimum latency broadcasting is 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 retransmissions 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 algorithms perform much better in practice than the analytical guarantees provided for the worst case.

Original languageEnglish (US)
Pages222-232
Number of pages11
DOIs
StatePublished - 2003
Externally publishedYes
EventMOBIHOC 2003: PROCEEDINGS OF The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing - Annapolis, MD, United States
Duration: Jun 1 2003Jun 3 2003

Other

OtherMOBIHOC 2003: PROCEEDINGS OF The Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing
CountryUnited States
CityAnnapolis, MD
Period6/1/036/3/03

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Keywords

  • Ad hoc networks
  • Approximation algorithms
  • Broadcasting
  • NP-hardness

Fingerprint Dive into the research topics of 'Minimizing broadcast latency and redundancy in ad hoc networks'. Together they form a unique fingerprint.

Cite this