Interference-Resilient Information Exchange

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 =Omega(t^2), 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.

[1]  Dan E. Willard,et al.  Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..

[2]  Dariusz R. Kowalski,et al.  Gossiping to reach consensus , 2002, SPAA '02.

[3]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2006, J. Algorithms.

[4]  Michael A. Bender,et al.  Adversarial contention resolution for simple channels , 2005, SPAA '05.

[5]  Annalisa De Bonis,et al.  Optimal Two-Stage Algorithms for Group Testing Problems , 2005, SIAM J. Comput..

[6]  C. SIAMJ..  AN Ω(D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS∗ , 1998 .

[7]  Andrea E. F. Clementi,et al.  Round Robin is optimal for fault-tolerant broadcasting on wireless networks , 2001, J. Parallel Distributed Comput..

[8]  Rachid Guerraoui,et al.  Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference , 2007 .

[9]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[10]  Dariusz R. Kowalski,et al.  Almost Optimal Explicit Selectors , 2005, FCT.

[11]  Marek Chrobak,et al.  The wake-up problem in multi-hop radio networks , 2004, SODA '04.

[12]  Jennifer C. Hou,et al.  Capacity of wireless ad-hoc networks under ultra wide band with power constraint , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Rachid Guerraoui,et al.  Secure communication over radio channels , 2008, PODC '08.

[14]  Andrea E. F. Clementi,et al.  Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks , 2002, ISAAC.

[15]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[16]  Dariusz R. Kowalski,et al.  Robust gossiping with an application to consensus , 2006, J. Comput. Syst. Sci..

[17]  Nitin H. Vaidya,et al.  Connectivity and Capacity of Multi-Channel Wireless Networks with Channel Switching Constraints , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  N.H. Vaidya,et al.  Secure capacity of multi-hop wireless networks with random key pre-distribution , 2008, IEEE INFOCOM Workshops 2008.

[19]  Andrzej Pelc,et al.  Fault-Tolerant Broadcasting in Radio Networks , 2001, J. Algorithms.

[20]  János Komlós,et al.  An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.

[21]  János Komlós,et al.  Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels' , 1985, IEEE Transactions on Information Theory.

[22]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[23]  Annalisa De Bonis,et al.  Generalized Framework for Selectors with Applications in Optimal Group Testing , 2003, ICALP.

[24]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[25]  Andrzej Lingas,et al.  Oblivious gossiping in ad-hoc radio networks , 2001, DIALM '01.

[26]  Sampath Kannan,et al.  A bound on the capacity of backoff and acknowledgment-based protocols , 2004, SIAM J. Comput..

[27]  Rachid Guerraoui,et al.  Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks , 2009, Theor. Comput. Sci..

[28]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.

[29]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[30]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

[31]  Andrzej Pelc,et al.  Feasibility and complexity of broadcasting with random transmission failures , 2007, Theor. Comput. Sci..

[32]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[33]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[34]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[35]  Larry Carter,et al.  Universal classes of hash functions (Extended Abstract) , 1977, STOC '77.

[36]  Nitin H. Vaidya,et al.  Reliable broadcast in radio networks: the bounded collision case , 2006, PODC '06.

[37]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[38]  Nitin H. Vaidya,et al.  Capacity of multi-channel wireless networks: impact of number of channels and interfaces , 2005, MobiCom '05.

[39]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[40]  Andrzej Pelc,et al.  Time of Deterministic Broadcasting in Radio Networks with Local Knowledge , 2004, SIAM J. Comput..

[41]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[42]  Nitin H. Vaidya,et al.  On reliable broadcast in a radio network , 2005, PODC '05.

[43]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[44]  Andrzej Pelc,et al.  Deterministic broadcasting time in radio networks of unknown topology , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..