Interference-resilient information exchange

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2249-2257

  Gilbert, Seth ^a   Guerraoui, Rachid ^a   Kowalski, Dariusz R ^b   Newport, Calvin ^c  

^a EPFL   (Switzerland)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL ASSIGNMENT; COMBINATORIAL FUNCTIONS; INFORMATION EXCHANGES; MULTI-CHANNEL; RADIO NETWORKS; RUNNING TIME; SHARED SECRETS; SINGLE-HOP;

NETWORK PROTOCOLS;

EID: 70349684521     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062150     Document Type: Conference Paper

References (27)

1. Bluetooth Specification v. 2.1, July 2007, http://www.bluetooth. com/NR/rdonlyres/F8E8276A-3898-4EC6-B7DA-E5535258B056/6545/Core-V21-EDR.zip.
2. S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport, "Secure communication over radio channels," in Proceedings of the Symposium on Principles of Distributed Computing (PODC), August 2008.
3. J. Komlos and A. Greenberg, "An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels," IEEE Trans. on Information Theory, pp. 302-306, March 1985.
4. A. D. Bonis, L. Gasieniec, and U. Vaccaro, "Optimal two-stage algorithms for group testing problems," SIAM J. on Computing, vol. 34, no. 5, pp. 1253-1270, 2005.
5. S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport, "Gossiping in a multi-channel radio network: An oblivious approach to coping with malicious interference," in Proceedings of the Symposium on Distributed Computing (DISC), 2007.
6. S. Gilbert, R. Guerraoui, D. R. Kowalski, and C. Newport, "Interference-resilient information exchange," Tech. Rep., 2008, http://lpd.epfl.ch/sgilbert/pubs/InfoExchange-TR.pdf.
7. P. Indyk, "Explicit constructions of selectors and related combinatorial structures, with applications," in Proceedings of the Symposium on Discrete Algorithms (SODA), 2002.
8. M. Chrobak, L. Gasieniec, and W. Rytter, "Fast broadcasting and gossiping in radio networks," J. of Algorithms, vol. 43, no. 2, pp. 575-581, 2002.
9. M. Chrobak, L. Gasieniec, and D. R. Kowalski, "The wake-up problem in multi-hop radio networks," SIAM Journal of Computing, vol. 36, no. 5, pp. 1453-1471, 2007.
10. A. Czumaj and W. Rytter, "Broadcasting algorithms in radio networks with unknown topology," in Proceedings of the Symposium on Foundations of Computer Science (FOCS), October 2003.
11. D. E. Willard, "Log-logarithmic selection resolution protocols in a multiple access channel," SIAM J. of Computing, vol. 15, no. 2, pp. 468-477, 1986.
12. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, "A lower bound for radio broadcast," J. of Computer and System Sciences, vol. 43, no. 2, pp. 290-298, October 1992.
13. R. Bar-Yehuda, O. Goldreich, and A. Itai, "On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization," J. of Computer and System Sciences, vol. 45, no. 1, pp. 104-126, 1992.
14. D. Kowalski and A. Pelc, "Time of deterministic broadcasting in radio networks with local knowledge," SIAM J. on Computing, vol. 33, no. 4, pp. 870-891, 2004.
15. E. Kushelevitz and Y. Mansour, "An Ω(Dlog(N/D)) lower bound for broadcast in radio networks," in Proceedings of the Symposium on Principles of Distributed Computing (PODC), 1993.
16. B. Chlebus and D. Kowalski, "Robust gossiping with an application to consensus," J. of Computer and System Sciences, vol. 72, pp. 1262-1281, 2006.
17. B. S. Chlebus, L. Gasieniec, A. Lingas, and A. T. Pagourtzis, "Oblivious gossiping in ad-hoc radio networks," in Proceedings of the Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), 2001.
18. R. Bar-Yehuda, A. Israeli, and A. Itai, "Multiple communication in multi-hop radio networks," SIAM J. on Computing, vol. 22, no. 4, pp. 875-887, 1993.
19. E. Kranakis, D. Krizanc, and A. Pelc, "Fault-tolerant broadcasting in radio networks," Journal of Algorithms, vol. 39, no. 1, pp. 47-67, 2001.
20. A. Clementi, A. Monti, and R. Silvestri, "Round robin is optimal for fault-tolerant broadcasting on wireless networks," J. of Parallel and Distributed Computing, vol. 64, no. 1, pp. 89-96, 2004.
21. -, "Optimal f-reliable protocols for the do-all problem on single-hop wireless networks," in Proceedings of the International Symposium on Algorithms and Computation (ISAAC), 2002, pp. 320-331.
22. C.-Y. Koo, "Broadcast in radio networks tolerating byzantine adversarial behavior," in Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2004, pp. 275-282.
23. V. Bhandari and N. H. Vaidya, "On reliable broadcast in a radio network." in Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2005, pp. 138-147.
24. A. Pelc and D. Peleg, "Feasibility and complexity of broadcasting with random transmission failures," in Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2005.
25. C.-Y. Koo, V. Bhandari, J. Katz, and N. H. Vaidya, "Reliable broadcast in radio networks: The bounded collision case," in Proceedings of the Symposium on Principles of Distributed Computing (PODC), 2006.
26. S. Gilbert, R. Guerraoui, and C. Newport, "Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks," in Proceedings of the Conference on Principles of Distributed Systems (OPODIS), December 2006.
27. J. L. Carter and M. N. Wegman, "Universal classes of hash functions (extended abstract)," in Proceedings of the Symposium on Theory of Computing (STOC), 1977.