Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

Shlomi Dolev; Seth Gilbert; Majid Khabbazian; Calvin Newport

doi:10.1007/978-3-642-24100-0_25

Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

Shlomi Dolev, Seth Gilbert, Majid Khabbazian, Calvin Newport

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

16 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 language	English
Title of host publication	Distributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages	252-267
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-24100-0_25
State	Published - 2 Nov 2011
Event	25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy Duration: 20 Sep 2011 → 22 Sep 2011

Publication series

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

Conference

Conference	25th International Symposium on Distributed Computing, DISC 2011
Country/Territory	Italy
City	Rome
Period	20/09/11 → 22/09/11

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-24100-0_25

Cite this

Dolev, S., Gilbert, S., Khabbazian, M., & Newport, C. (2011). Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. In Distributed Computing - 25th International Symposium, DISC 2011, Proceedings (pp. 252-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6950 LNCS). https://doi.org/10.1007/978-3-642-24100-0_25

Dolev, Shlomi ; Gilbert, Seth ; Khabbazian, Majid et al. / Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. 2011. pp. 252-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8a33eba1c0a94bb9a5460f3171746f75,

title = "Leveraging channel diversity to gain efficiency and robustness for wireless broadcast",

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.",

author = "Shlomi Dolev and Seth Gilbert and Majid Khabbazian and Calvin Newport",

year = "2011",

month = nov,

day = "2",

doi = "10.1007/978-3-642-24100-0_25",

language = "English",

isbn = "9783642240997",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "252--267",

booktitle = "Distributed Computing - 25th International Symposium, DISC 2011, Proceedings",

note = "25th International Symposium on Distributed Computing, DISC 2011 ; Conference date: 20-09-2011 Through 22-09-2011",

}

Dolev, S, Gilbert, S, Khabbazian, M & Newport, C 2011, Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. in Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6950 LNCS, pp. 252-267, 25th International Symposium on Distributed Computing, DISC 2011, Rome, Italy, 20/09/11. https://doi.org/10.1007/978-3-642-24100-0_25

Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. / Dolev, Shlomi; Gilbert, Seth; Khabbazian, Majid et al.
Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. 2011. p. 252-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6950 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

AU - Dolev, Shlomi

AU - Gilbert, Seth

AU - Khabbazian, Majid

AU - Newport, Calvin

PY - 2011/11/2

Y1 - 2011/11/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80055037570&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24100-0_25

DO - 10.1007/978-3-642-24100-0_25

M3 - Conference contribution

AN - SCOPUS:80055037570

SN - 9783642240997

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 252

EP - 267

BT - Distributed Computing - 25th International Symposium, DISC 2011, Proceedings

T2 - 25th International Symposium on Distributed Computing, DISC 2011

Y2 - 20 September 2011 through 22 September 2011

ER -

Dolev S, Gilbert S, Khabbazian M, Newport C. Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. In Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. 2011. p. 252-267. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-24100-0_25

Leveraging channel diversity to gain efficiency and robustness for wireless broadcast

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this