Please use this identifier to cite or link to this item:
|Title:||Optimal broadcast in shared spectrum radio networks|
|Citation:||Ghaffari, M.,Gilbert, S.,Newport, C.,Tan, H. (2012). Optimal broadcast in shared spectrum radio networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7702 LNCS : 181-195. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-35476-2_13|
|Abstract:||This paper studies single hop broadcast in a single hop shared spectrum radio network. The problem requires a source to deliver a message to n receivers, where only a polynomial upper bound on n is known. The model assumes that in each round, each device can participate on 1 out of C ≥ available communication channels, up to t < C of which might be disrupted, preventing communication. This disruption captures the unpredictable message loss that plagues real shared spectrum networks. The best existing solution to the problem, which comes from the systems literature, requires O (Ct/C-t log n) rounds. Our algorithm, by contrast, solves the problem in O(C/C-t⌈t/ n⌉ log n) rounds, when C ≥ log n, and in O(C/C-t log n · log log n) rounds, when C is smaller. It accomplishes this improvement by deploying a self-regulating relay strategy in which receivers that already know useful information coordinate themselves to efficiently assist the source's broadcast. We conclude by proving these bounds tight for most cases. © 2012 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 Jan 10, 2019
checked on Dec 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.