Document Open Access Logo

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

Authors Adam Gańczorz , Tomasz Jurdziński , Mateusz Lewko, Andrzej Pelc

PDF
Thumbnail PDF

File

LIPIcs.DISC.2021.22.pdf
  • Filesize: 0.9 MB
  • 20 pages

Document Identifiers

Author Details

Adam Gańczorz
  • Institute of Computer Science, University of Wrocław, Poland
Tomasz Jurdziński
  • Institute of Computer Science, University of Wrocław, Poland
Mateusz Lewko
  • Institute of Computer Science, University of Wrocław, Poland
Andrzej Pelc
  • Département d'informatique, University of Québec en Outaouais, Gatineau, Canada

Funding

  • Gańczorz, Adam: Supported by the National Science Centre, Poland, grant 2017/25/B/ST6/ 02010.
  • Jurdziński, Tomasz: Supported by the National Science Centre, Poland, grant 2017/25/B/ST6/02010.
  • Lewko, Mateusz: Supported by the National Science Centre, Poland, grant 2017/25/B/ST6/02010.
  • Pelc, Andrzej: Partially supported by NSERC discovery grant 2018-03899 and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.

Cite AsGet BibTex

Adam Gańczorz, Tomasz Jurdziński, Mateusz Lewko, and Andrzej Pelc. Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 22:1-22:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.DISC.2021.22

Abstract

We consider the fundamental problems of size discovery and topology recognition in radio networks modeled by simple undirected connected graphs. Size discovery calls for all nodes to output the number of nodes in the graph, called its size, and in the task of topology recognition each node has to learn the topology of the graph and its position in it. We do not assume collision detection: in case of a collision, node v does not hear anything (except the background noise that it also hears when no neighbor transmits). The time of a deterministic algorithm for each of the above problems is the worst-case number of rounds it takes to solve it. Nodes have labels which are (not necessarily different) binary strings. Each node knows its own label and can use it when executing the algorithm. The length of a labeling scheme is the largest length of a label. For size discovery, we construct a labeling scheme of length O(log logΔ) (which is known to be optimal, even if collision detection is available) and we design an algorithm for this problem using this scheme and working in time O(log² n), where n is the size of the graph. We also show that time complexity O(log² n) is optimal for the problem of size discovery, whenever the labeling scheme is of optimal length O(log logΔ). For topology recognition, we construct a labeling scheme of length O(logΔ), and we design an algorithm for this problem using this scheme and working in time O (DΔ+min(Δ²,n)), where D is the diameter of the graph. We also show that the length of our labeling scheme is asymptotically optimal.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • size discovery
  • topology recognition
  • radio network
  • labeling scheme

Metrics

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

Related Versions

References

  1. Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290-298, 1991. Google Scholar
  2. Stephen Alstrup, Haim Kaplan, Mikkel Thorup, and Uri Zwick. Adjacency labeling schemes and induced-universal graphs. SIAM J. Discret. Math., 33(1):116-137, 2019. Google Scholar
  3. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci., 45(1):104-126, 1992. Google Scholar
  4. Gewu Bu, Zvi Lotker, Maria Potop-Butucaru, and Mikael Rabie. Lower and upper bounds for deterministic convergecast with labeling schemes. Manuscript, HAL Id: hal-02650472, 2020. Google Scholar
  5. Marek Chrobak, Leszek Gasieniec, and Wojciech Rytter. Fast broadcasting and gossiping in radio networks. J. Algorithms, 43(2):177-189, 2002. URL: https://doi.org/10.1016/S0196-6774(02)00004-4.
  6. Artur Czumaj and Peter Davies. Exploiting spontaneous transmissions for broadcasting and leader election in radio networks. J. ACM, 68(2):13:1-13:22, 2021. URL: https://doi.org/10.1145/3446383.
  7. Faith Ellen and Seth Gilbert. Constant-length labelling schemes for faster deterministic radio broadcast. In Christian Scheideler and Michael Spear, editors, SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 213-222. ACM, 2020. Google Scholar
  8. Faith Ellen, Barun Gorain, Avery Miller, and Andrzej Pelc. Constant-length labeling schemes for deterministic radio broadcast. In C. Scheideler and P. Berenbrink, editors, 31st Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, pages 171-178. ACM, 2019. Google Scholar
  9. Yuval Emek, Pierre Fraigniaud, Amos Korman, and Adi Rosén. Online computation with advice. Theor. Comput. Sci., 412(24):2642-2656, 2011. URL: https://doi.org/10.1016/j.tcs.2010.08.007.
  10. Pierre Fraigniaud, David Ilcinkas, and Andrzej Pelc. Communication algorithms with advice. J. Comput. Syst. Sci., 76(3-4):222-232, 2010. URL: https://doi.org/10.1016/j.jcss.2009.07.002.
  11. Pierre Fraigniaud, Amos Korman, and Emmanuelle Lebhar. Local MST computation with short advice. Theory Comput. Syst., 47(4):920-933, 2010. URL: https://doi.org/10.1007/s00224-010-9280-9.
  12. Emanuele G. Fusco, Andrzej Pelc, and Rossella Petreschi. Topology recognition with advice. Inf. Comput., 247:254-265, 2016. URL: https://doi.org/10.1016/j.ic.2016.01.005.
  13. Adam Ganczorz, Tomasz Jurdzinski, Mateusz Lewko, and Andrzej Pelc. Deterministic size discovery and topology recognition in radio networks with short labels. CoRR, abs/2105.10595, 2021. URL: http://arxiv.org/abs/2105.10595.
  14. Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, and Tomasz Radzik. Deterministic communication in radio networks with large labels. Algorithmica, 47(1):97-117, 2007. Google Scholar
  15. Leszek Gasieniec, David Peleg, and Qin Xin. Faster communication in known topology radio networks. Distributed Comput., 19(4):289-300, 2007. URL: https://doi.org/10.1007/s00446-006-0011-z.
  16. Mohsen Ghaffari, Bernhard Haeupler, and Majid Khabbazian. Randomized broadcast in radio networks with collision detection. In Panagiota Fatourou and Gadi Taubenfeld, editors, PODC, pages 325-334. ACM, 2013. URL: https://doi.org/10.1145/2484239.2484248.
  17. Christian Glacet, Avery Miller, and Andrzej Pelc. Time vs. information tradeoffs for leader election in anonymous trees. ACM Trans. Algorithms, 13(3):31:1-31:41, 2017. Google Scholar
  18. Barun Gorain and Andrzej Pelc. Short labeling schemes for topology recognition in wireless tree networks. In S. Das and S. Tixeuil, editors, 24th International Colloquium, SIROCCO 2017, volume 10641 of Lecture Notes in Computer Science, pages 37-52. Springer, 2017. Google Scholar
  19. Barun Gorain and Andrzej Pelc. Finding the size of a radio network with short labels. In P. Bellavista and V. K. Garg, editors, Proc. of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, pages 10:1-10:10. ACM, 2018. Google Scholar
  20. David Ilcinkas, Dariusz R. Kowalski, and Andrzej Pelc. Fast radio broadcasting with advice. Theor. Comput. Sci., 411(14-15):1544-1557, 2010. URL: https://doi.org/10.1016/j.tcs.2010.01.004.
  21. Dariusz R. Kowalski and Andrzej Pelc. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, 19(3):185-195, 2007. URL: https://doi.org/10.1007/s00446-006-0007-8.
  22. Dariusz R. Kowalski and Andrzej Pelc. Leader election in ad hoc radio networks: A keen ear helps. J. Comput. Syst. Sci., 79(7):1164-1180, 2013. URL: https://doi.org/10.1016/j.jcss.2013.04.003.
  23. Colin Krisko and Avery Miller. Labeling schemes for deterministic radio multi-broadcast. CoRR, abs/2104.08644, 2021. URL: http://arxiv.org/abs/2104.08644.
  24. Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, and Ioan Todinca. Graph reconstruction in the congested clique. J. Comput. Syst. Sci., 113:1-17, 2020. 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