The wireless synchronization problem

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 190-199

  Dolev, Shlomi ^a   Gilbert, Seth ^b   Guerraoui, Rachid ^b   Kuhn, Fabian ^c   Newport, Calvin ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b EPFL   (Switzerland)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; C.2.1 network architecture and design : wireless networks; Theory

Indexed keywords

C.2.1 [NETWORK ARCHITECTURE AND DESIGN]: WIRELESS NETWORKS; COMMUNICATION MEDIUM; LOWER BOUNDS; NARROW BANDS; RADIO NETWORKS; RADIO SPECTRA; RUNNING TIME; SINGLE-HOP; SYNCHRONIZATION PROBLEM; THEORY;

ADAPTIVE ALGORITHMS; COMPUTER SCIENCE; CONTROL THEORY; DISTRIBUTED COMPUTER SYSTEMS; NETWORK ARCHITECTURE;

WIRELESS NETWORKS;

EID: 70350641370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582749     Document Type: Conference Paper

References (31)

1. N. Abramson. The aloha system - another approach for computer communications. Proceedings of the Fall Joint Computer Conference, 37:281-285, 1970.
2. I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty. Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks, 50(13):2127-2159, 2006.
3. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. On the complexity of radio communication. In Proceedings of the Symposium on Theory of Computing, 1989.
4. R. Bar-Yehuda, O. Goldreich, and A. Itai. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distributed Computing, 5:67-71, 1991.
5. 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. Journal of Computer and System Sciences, 45(1):104-126, 1992.
6. A. D. Bonis, L. Gasieniec, and U. Vaccaro. Optimal two-stage algorithms for group testing problems. SIAM Journal on Computing, 34(5):1253-1270, 2005.
7. I. Chlamtac and S. Kutten. On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications, 33(12):1240-1246, 1985.
8. B. Chlebus and D. Kowalski. A better wake-up in radio networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2004.
9. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Proceedings of the Symposium on Discrete Algorithms, 2000.
10. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in ad hoc radio networks. Distributed Computing, 15(1):27-38, 2002.
11. M. Chrobak, L. Gasieniec, and D. Kowalski. The wake-up problem in multi-hop radio networks. In Proceedings of the Symposium on Discrete Algorithms, 2004.
12. M. Chrobak, L. Gasieniec, and W. Rytter. broadcasting and gossiping in radio networks. Journal of Algorithms, 43:177-189, 2002.
13. A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel and Distributed Computing, 64(1):89-96, 2004.
14. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the Symposium on the Foundations of Computer Science, 2003.
15. 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 International Symposium on Distributed Computing, 2007.
16. S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport. Secure communication over radio channels. In Proceedings of the International Symposium on Principles of Distributed Computing, 2008.
17. M. Farach-Colton, R. J. Fernandes, and M. A. Mosteiro. Lower bounds for clear transmissions in radio networks. In Proceedings of the Latin American Symposium on Theoretical Informatics, 2006.
18. L. Gasieniec, A. Pelc, and D. Peleg. The wakeup problem in synchronous broadcast systems. SIAM Journal of Discrete Mathematics, 14(2):207-222, 2001.
19. S. Gilbert, R. Guerraoui, D. Kowalski, and C. Newport. Interference-resilient information exchange. In Proceedings of the IEEE Conference on Computer Communications, 2009.
20. R. Gummadi, D. Wetherall, B. Greenstein, and S. Seshan. Understanding and mitigating the impact of rf interference on 802.11 networks. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2007.
21. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the Symposium on Discrete Algorithms, 2002.
22. T. Jurdzinski and G. Stachowiak. Probabilistic algorithms for the wakeup problem in single-hop radio networks. In Proceedings of the International Symposium on Algorithms and Computation, 2002.
23. J. Komlos and A. Greenberg. An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels. IEEE Transactions on Information Theory, March 1985.
24. D. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In Proceedings of the International Symposium on Principles of Distributed Computing, 2003.
25. D. Kowalski and A. Pelc. Time of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism. In Proceedings of the Colloquium on Structural Information and Communication Complexity, 2003.
26. D. Kowalski and A. Pelc. Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing, 33(4):870-891, 2004.
27. D. R. Kowalski and A. Pelc. Deterministic broadcasting time in radio networks of unknown topology. In Proceedings of the Symposium on the Foundations of Computer Science, 2002.
28. E. Kranakis, D. Krizanc, and A. Pelc. Fault-tolerant broadcasting in radio networks. In Proceedings of the Annual European Symposium on Algorithms, 1998.
29. D. Meier, Y. Pignolet, S. Schmid, and R. Wattenhofer. Speed dating despite jammers. In Proceedings of the International Conference on Distributed Computing in Sensor Systems, 2009.
30. M. Strasser, S. Capkun, C. Popper, and M. Cagalj. Jamming-resistant key establishment using uncoordinated frequency hopping. In Proceedings of the Symposium on Security and Privacy, 2008.
31. M. Strasser, C. Popper and S. Capkun. Efficient uncoordinated FHSS anti-jamming communication. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing, 2009.