Minimizing broadcast latency and redundancy in ad hoc networks

Authors:
Rajiv Gandhi;Arunesh Mishra;Srinivasan Parthasarathy
Affiliations:
Department of Computer Science, Rutgers University, Camden, NJ;Computer Sciences Department, University of Wisconsin-Madison, Madison, WI;IBM T. J. Watson Research Center, Hawthorne, NY
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2008

Citing 20
Cited 10

Tree-Based Broadcasting in Multihop Radio Networks

IEEE Transactions on Computers
Unit disk graphs

Discrete Mathematics - Topics on domination
A lower bound for radio broadcast

Journal of Computer and System Sciences
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Making transmission schedules immune to topology changes in multi-hop packet radio networks

IEEE/ACM Transactions on Networking (TON)
Flooding for reliable multicast in multi-hop ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Multicast tree construction and flooding in wireless ad hoc networks

Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Spine routing in ad hoc networks

Cluster Computing
Deterministic Broadcasting Time in Radio Networks of Unknown Topology

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Delay-Constrained Minimum Spanning Tree Problem

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Distributed construction of connected dominating set in wireless ad hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Scheduling of broadcasts in multihop wireless networks

The handbook of ad hoc wireless networks
Localized techniques for broadcasting in wireless sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing

Multi-team data flow optimization in wireless multi-rate multi-hop networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient wireless broadcasting using onion decoding

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Interference-aware broadcast scheduling in wireless networks

Ad Hoc Networks
Synchronous multicast and broadcast service in multi-rate IEEE 802.16j WiMAX relay network

Wireless Networks
Minimum-Cost broadcast through varying-size neighborcast

ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
A weight-value algorithm for finding connected dominating sets in a MANET

Journal of Network and Computer Applications
Interference-free energy efficient scheduling in wireless ad hoc networks

Ad Hoc Networks
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Performance analysis of broadcast in multi-channel multi-radio wireless mesh networks

WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Minimizing broadcast latency and redundancy in asynchronous wireless sensor networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

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 networks. Our objective is to minimize the latency and the number of transmissions in the broadcast. We show that minimum latency broadcasting is NP-complete for ad hoc networks. We also present a simple 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 transmissions are within O(1) times their respective optimal values. Our algorithm and analysis extend 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.