Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

Authors:
Shlomi Dolev;Seth Gilbert;Majid Khabbazian;Calvin Newport
Affiliations:
Ben-Gurion University, Beersheba, Israel;National University of Singapore, Singapore;University of Winnipeg, Winnipeg, Canada;MIT CSAIL, Cambridge
Venue:
DISC'11 Proceedings of the 25th international conference on Distributed computing
Year:
2011

Citing 24
Cited 3

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
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Broadcasting in undirected ad hoc radio networks

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Journal of Parallel and Distributed Computing
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

SIAM Journal on Computing
Broadcast in radio networks tolerating byzantine adversarial behavior

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Reliable broadcast in radio networks: the bounded collision case

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping

SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Secure communication over radio channels

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient uncoordinated FHSS anti-jamming communication

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Reliable distributed computing on unreliable radio channels

Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Optimal deterministic broadcasting in known topology radio networks

Distributed Computing
The wireless synchronization problem

Proceedings of the 28th ACM symposium on Principles of distributed computing
The abstract MAC layer

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Decomposing broadcast algorithms using abstract MAC layers

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
What is the use of collision detection (in wireless networks)?

DISC'10 Proceedings of the 24th international conference on Distributed computing
A jamming-resistant MAC protocol for multi-hop wireless networks

DISC'10 Proceedings of the 24th international conference on Distributed computing
Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Leader election in shared spectrum radio networks

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Maximal independent sets in multichannel radio networks

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Decomposing broadcast algorithms using abstract MAC layers

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses two primary questions: (i) How much faster can we disseminate information in a large wireless network if we have multiple communication channels available (as compared to relying on only a single communication channel)? (ii) Can we still disseminate information reliably, even if some subset of the channels are disrupted? In answer to the first question, we reduce the cost of broadcast to O(log log n) rounds/hop, approximately, for sufficiently many channels. We answer the second question in the affirmative, presenting two different algorithms, while at the same time proving a lower bound showing that disrupted channels have unavoidable costs.