Please use this identifier to cite or link to this item:
|Title:||Leveraging channel diversity to gain efficiency and robustness for wireless broadcast|
|Citation:||Dolev, S.,Gilbert, S.,Khabbazian, M.,Newport, C. (2011). Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6950 LNCS : 252-267. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-24100-0_25|
|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. © 2011 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2018
checked on Nov 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.