Document Open Access Logo

Deterministic Blind Radio Networks

Authors Artur Czumaj, Peter Davies

PDF
Thumbnail PDF

File

LIPIcs.DISC.2018.15.pdf
  • Filesize: 411 kB
  • 17 pages

Document Identifiers

Author Details

Artur Czumaj
  • University of Warwick, Coventry, UK
Peter Davies
  • University of Warwick, Coventry, UK

Funding

Research partially supported by the Centre for Discrete Mathematics and its Applications (DIMAP), by EPSRC award EP/D063191/1, and by EPSRC award EP/N011163/1.

Cite AsGet BibTex

Artur Czumaj and Peter Davies. Deterministic Blind Radio Networks. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.DISC.2018.15

Abstract

Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fundamental communications primitives such as broadcasting and wake-up. However, almost all of these algorithms assume knowledge of the number of participating nodes and the range of possible IDs, and often make the further assumption that the latter is linear in the former. These are very strong assumptions for models which were designed to capture networks of weak devices organized in an ad-hoc manner. It was believed that without this knowledge, deterministic algorithms must necessarily be much less efficient. In this paper we address this fundamental question and show that this is not the case. We present deterministic algorithms for blind networks (in which nodes know only their own IDs), which match or nearly match the running times of the fastest algorithms which assume network knowledge (and even surpass the previous fastest algorithms which assume parameter knowledge but not small labels). Specifically, in multiple access channels with k participating nodes and IDs up to L, we give a wake-up algorithm requiring O((k log L log k)/(log log k)) time, improving dramatically over the O(L^3 log^3 L) time algorithm of De Marco et al. (2007), and a broadcasting algorithm requiring O(k log L log log k) time, improving over the O(L) time algorithm of Gasieniec et al. (2001) in most circumstances. Furthermore, we show how these same algorithms apply directly to multi-hop radio networks, achieving even larger running time improvements.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Networks → Network algorithms
Keywords
  • Broadcasting
  • Deterministic Algorithms
  • Radio Networks

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290-298, 1991. Google Scholar
  2. 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. Google Scholar
  3. B. Chlebus, L. Gasieniec, D. R. Kowalski, and T. Radzik. On the wake-up problem in radio networks. In Proceedings of the 32nd Annual International Colloquium on Automata, Languages and Programming (ICALP), pages 347-359, 2005. Google Scholar
  4. B. Chlebus and D. R. Kowalski. A better wake-up in radio networks. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 266-274, 2004. Google Scholar
  5. B. Chlebus and D. R. Kowalski. Almost optimal explicit selectors. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory (FCT), pages 270-280, 2005. Google Scholar
  6. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. Distributed Computing, 15(1):27-38, 2002. Google Scholar
  7. B. S. Chlebus, L. Gasieniec, A. Östlin, and J. M. Robson. Deterministic radio broadcasting. In Proceedings of the 27th Annual International Colloquium on Automata, Languages and Programming (ICALP), pages 717-728, 2000. Google Scholar
  8. M. Chrobak, L. Gasieniec, and D. R. Kowalski. The wake-up problem in multihop radio networks. SIAM Journal on Computing, 36(5):1453-1471, 2007. Google Scholar
  9. M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177-189, 2002. Google Scholar
  10. A. E. F. Clementi, A. Monti, and R. Silvestri. Distributed broadcasting in radio networks of unknown topology. Theoretical Computer Science, 302(1-3):337-364, 2003. Google Scholar
  11. A. Czumaj and P. Davies. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. In Proceedings of the 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 3-12, 2017. Google Scholar
  12. A. Czumaj and P. Davies. Brief announcement: Randomized blind radio networks. In Proceedings of the 32nd International Symposium on Distributed Computing (DISC), pages 44:1-44:3, 2018. Google Scholar
  13. A. Czumaj and P. Davies. Deterministic communication in radio networks. SIAM Journal on Computing, 47(1):218-240, 2018. Google Scholar
  14. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS), pages 492-501, 2003. Google Scholar
  15. L. Gasieniec, A. Pelc, and D. Peleg. The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics, 14(2):207-222, 2001. Google Scholar
  16. M. Ghaffari, B. Haeupler, and M. Khabbazian. Randomized broadcast in radio networks with collision detection. In Proceedings of the 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 325-334, 2013. Google Scholar
  17. B. Haeupler and D. Wajc. A faster distributed radio broadcast primitive. In Proceedings of the 35th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 361-370, 2016. Google Scholar
  18. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 697-704, 2002. Google Scholar
  19. T. Jurdziński and G. Stachowiak. Probabilistic algorithms for the wakeup problem in single-hop radio networks. Theory of Computing Systems, 38(3):347-367, 2005. Google Scholar
  20. D. Kowalski. On selection problem in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 158-166, 2005. Google Scholar
  21. D. Kowalski and A. Pelc. Faster deterministic broadcasting in ad hoc radio networks. SIAM Journal on Discrete Mathematics, 18(2):332-346, 2004. Google Scholar
  22. D. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. Distributed Computing, 18(1):43-57, 2005. Google Scholar
  23. E. Kushilevitz and Y. Mansour. An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing, 27(3):702-712, 1998. Google Scholar
  24. G. De Marco. Distributed broadcast in unknown radio networks. SIAM Journal on Computing, 39(6):2162-2175, 2010. Google Scholar
  25. G. De Marco and A. Pelc. Faster broadcasting in unknown radio networks. Information Processing Letters, 79(2):53-56, 2001. Google Scholar
  26. G. De Marco, M. Pelegrini, and G. Sburlati. Faster deterministic wakeup in multiple access channels. Discrete Apllied Mathematics, 155(8):898-903, 2007. Google Scholar
  27. D. Peleg. Time-efficient broadcasting in radio networks: A review. In Proceedings of the 4th International Conference on Distributed Computing and Internet Technology (ICDCIT), pages 1-18, 2007. Google Scholar
  28. D. E. Willard. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing, 15(2):468-477, 1986. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact