TY - GEN
T1 - Interference-resilient information exchange
AU - Gilbert, Seth
AU - Guerraoui, Rachid
AU - Kowalski, Dariusz R.
AU - Newport, Calvin
PY - 2009
Y1 - 2009
N2 - This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C available channels. We assume no shared secret keys or third-party infrastructure. The running time of our protocol depends on the gap between C and t: when the number of channels C =Ω(t2), the running time is linear; when only C = t+1 channels are available, the running time is exponential. We prove that exponential-time is unavoidable in the latter case. At the core of our protocol lies a combinatorial function, possibly of independent interest, described for the first time in this paper: the multi-selector. A multi-selector generates a sequence of channel assignments for each device such that every sufficiently large subset of devices is partitioned onto distinct channels by at least one of these assignments.
AB - This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C available channels. We assume no shared secret keys or third-party infrastructure. The running time of our protocol depends on the gap between C and t: when the number of channels C =Ω(t2), the running time is linear; when only C = t+1 channels are available, the running time is exponential. We prove that exponential-time is unavoidable in the latter case. At the core of our protocol lies a combinatorial function, possibly of independent interest, described for the first time in this paper: the multi-selector. A multi-selector generates a sequence of channel assignments for each device such that every sufficiently large subset of devices is partitioned onto distinct channels by at least one of these assignments.
UR - http://www.scopus.com/inward/record.url?scp=70349684521&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349684521&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2009.5062150
DO - 10.1109/INFCOM.2009.5062150
M3 - Conference contribution
AN - SCOPUS:70349684521
SN - 9781424435135
T3 - Proceedings - IEEE INFOCOM
SP - 2249
EP - 2257
BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009
Y2 - 19 April 2009 through 25 April 2009
ER -