Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

Shlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin Newport

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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.

Original languageEnglish
Title of host publicationDistributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages252-267
Number of pages16
DOIs
StatePublished - 2 Nov 2011
Event25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy
Duration: 20 Sep 201122 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6950 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Symposium on Distributed Computing, DISC 2011
Country/TerritoryItaly
CityRome
Period20/09/1122/09/11

Fingerprint

Dive into the research topics of 'Leveraging channel diversity to gain efficiency and robustness for wireless broadcast'. Together they form a unique fingerprint.

Cite this