Cited By
View all- Bu GLotker ZPotop-Butucaru MRabie M(2023)Lower and upper bounds for deterministic convergecast with labeling schemesTheoretical Computer Science10.1016/j.tcs.2023.113775952:COnline publication date: 31-Mar-2023
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
Article No.: 14, Pages 1 - 17
Abstract
Broadcast is one of the fundamental network communication primitives. One node of a network, called the source, has a message that has to be learned by all other nodes. We consider broadcast in radio networks, modeled as simple undirected connected graphs with a distinguished source. Nodes communicate in synchronous rounds. In each round, a node can either transmit a message to all its neighbours, or stay silent and listen. At the receiving end, a node v hears a message from a neighbour w in a given round if v listens in this round and if w is its only neighbour that transmits in this round. If more than one neighbour of a node v transmits in a given round, we say that a collision occurs at v. 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 neighbour transmits).
We are interested in the feasibility of deterministic broadcast in radio networks. If nodes of the network do not have any labels, deterministic broadcast is impossible even in the four-cycle. On the other hand, if all nodes have distinct labels, then broadcast can be carried out, e.g., in a round-robin fashion, and hence O(log n)-bit labels are sufficient for this task in n-node networks. In fact, O(log Δ)-bit labels, where Δ is the maximum degree, are enough to broadcast successfully. Hence, it is natural to ask if very short labels are sufficient for broadcast. Our main result is a positive answer to this question. We show that every radio network can be labeled using 2 bits in such a way that broadcast can be accomplished by some universal deterministic algorithm that does not know the network topology nor any bound on its size. Moreover, at the expense of an extra bit in the labels, we can get the following additional strong property of our algorithm: there exists a common round in which all nodes know that broadcast has been completed. Finally, we show that 3-bit labels are also sufficient to solve both versions of broadcast in the case where it is not known a priori which node is the source.
References
[1]
Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, and Theis Rauhe. 2006. Compact labeling scheme for ancestor queries. SIAM J. Comput. 35, 6 (2006), 1295–1309.
[2]
Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. 1991. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 2 (1991), 290–298.
[3]
Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. 1992. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 1 (1992), 104–126.
[4]
Danilo Bruschi and Massimiliano Del Pinto. 1997. Lower bounds for the broadcast problem in Mobile radio networks. Distributed Computing 10, 3 (1997), 129–135.
[5]
Gewu Bu, Maria Potop-Butucaru, and Mikaël Rabie. 2020. Wireless broadcast with short labels. In Proceedings of the 8th International Conference on Networked Systems (NETYS’20). Lecture Notes in Computer Science (LNCS), vol. 12129, Springer.
[6]
Imrich Chlamtac and Shay Kutten. 1985. On broadcasting in radio networks-problem analysis and protocol design. IEEE Trans. Communications 33, 12 (1985), 1240–1246.
[7]
Imrich Chlamtac and O. Weinstein. 1987. Distributed ”Wave” broadcasting in mobil multi-hop radio networks. In Proceedings of the 7th International Conference on Distributed Computing Systems(Berlin, Germany, September 1987). IEEE Computer Society, 82–89.
[8]
Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. 2002. Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15, 1 (2002), 27–38.
[9]
Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, and John Michael Robson. 2000. Deterministic radio broadcasting. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP’20), (Geneva, Switzerland, July 9-15, 2000), Lecture Notes in Computer Science, Vol. 1853. Springer, 717–728.
[10]
Marek Chrobak, Leszek Gasieniec, and Wojciech Rytter. 2002. Fast broadcasting and gossiping in radio networks. J. Algorithms 43, 2 (2002), 177–189.
[11]
Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri. 2003. Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302, 1–3 (2003), 337–364.
[12]
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, and David Peleg. 2008. Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4, 4 (2008), 42:1–42:18.
[13]
Artur Czumaj and Peter Davies. 2016. Faster deterministic communication in radio networks. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, (ICALP’16), (July 11-15, 2016, Rome, Italy) (LIPIcs), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.), Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 139:1–139:14.
[14]
Artur Czumaj and Wojciech Rytter. 2006. Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60, 2 (2006), 115–143.
[15]
Dariusz Dereniowski and Andrzej Pelc. 2012. Drawing maps with advice. J. Parallel Distrib. Comput. 72, 2 (2012), 132–143.
[16]
Michael Elkin and Guy Kortsarz. 2007. An improved algorithm for radio broadcast. ACM Trans. Algorithms 3, 1 (2007), 8:1–8:21.
[17]
Faith Ellen and Seth Gilbert. 2020. Constant-length labelling schemes for faster deterministic radio broadcast. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’20), Virtual Event, (July 15-17, 2020), Christian Scheideler and Michael Spear (Eds.). ACM, 213–222.
[18]
Faith Ellen, Barun Gorain, Avery Miller, and Andrzej Pelc. 2017. Constant-length labeling schemes for deterministic radio broadcast. CoRR abs/1710.03178 (2017). arxiv:1710.03178http://arxiv.org/abs/1710.03178
[19]
Yuval Emek, Pierre Fraigniaud, Amos Korman, and Adi Ros é n. 2011. Online computation with advice. Theor. Comput. Sci. 412, 24 (2011), 2642–2656.
[20]
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, and Andrzej Pelc. 2009. Distributed computing with advice: Information sensitivity of graph coloring. Distributed Computing 21, 6 (2009), 395–403.
[21]
Pierre Fraigniaud, David Ilcinkas, and Andrzej Pelc. 2008. Tree exploration with advice. Inf. Comput. 206, 11 (2008), 1276–1287.
[22]
Pierre Fraigniaud, David Ilcinkas, and Andrzej Pelc. 2010. Communication algorithms with advice. J. Comput. Syst. Sci. 76, 3-4 (2010), 222–232.
[23]
Pierre Fraigniaud, Amos Korman, and Emmanuelle Lebhar. 2010. Local MST computation with short advice. Theory Comput. Syst. 47, 4 (2010), 920–933.
[24]
Emanuele G. Fusco, Andrzej Pelc, and Rossella Petreschi. 2016. Topology recognition with advice. Inf. Comput. 247 (2016), 254–265.
[25]
Iris Gaber and Yishay Mansour. 2003. Centralized broadcast in multihop radio networks. J. Algorithms 46, 1 (2003), 1–20.
[26]
Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, and Tomasz Radzik. 2007. Deterministic communication in radio networks with large labels. Algorithmica 47, 1 (2007), 97–117.
[27]
Leszek Gasieniec, David Peleg, and Qin Xin. 2007. Faster communication in known topology radio networks. Distributed Computing 19, 4 (2007), 289–300.
[28]
Leszek Gasieniec, Igor Potapov, and Qin Xin. 2007. Time efficient centralized gossiping in radio networks. Theor. Comput. Sci. 383, 1 (2007), 45–58.
[29]
Cyril Gavoille, David Peleg, St é phane P é rennes, and Ran Raz. 2004. Distance labeling in graphs. J. Algorithms 53, 1 (2004), 85–112.
[30]
Christian Glacet, Avery Miller, and Andrzej Pelc. 2017. Time vs. information tradeoffs for leader election in anonymous trees. ACM Trans. Algorithms 13, 3 (2017), 31:1–31:41.
[31]
Barun Gorain and Andrzej Pelc. 2017. Short labeling schemes for topology recognition in wireless tree networks. In Proceedings of the 24th International Coloqyium on Structural Information and Communication Complexity, (SIROCCO’17), (Porquerolles, France, June 19-22, 2017), Revised Selected Papers (Lecture Notes in Computer Science), Shantanu Das and S é bastien Tixeuil (Eds.), Vol. 10641. Springer, 37–52.
[32]
Barun Gorain and Andrzej Pelc. 2018. Finding the size of a radio network with short labels. In Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, January 4-7, 2018, Paolo Bellavista and Vijay K. Garg (Eds.). ACM, 10:1–10:10.
[33]
David Ilcinkas, Dariusz R. Kowalski, and Andrzej Pelc. 2010. Fast radio broadcasting with advice. Theor. Comput. Sci. 411, 14-15 (2010), 1544–1557.
[34]
Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. 2004. Labeling schemes for flow and connectivity. SIAM J. Comput. 34, 1 (2004), 23–40.
[35]
Amos Korman, Shay Kutten, and David Peleg. 2010. Proof labeling schemes. Distributed Computing 22, 4 (2010), 215–233.
[36]
Dariusz R. Kowalski and Andrzej Pelc. 2005. Broadcasting in undirected ad hoc radio networks. Distributed Computing 18, 1 (2005), 43–57.
[37]
Dariusz R. Kowalski and Andrzej Pelc. 2005. Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333, 3 (2005), 355–371.
[38]
Dariusz R. Kowalski and Andrzej Pelc. 2007. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing 19, 3 (2007), 185–195.
[39]
Dariusz R. Kowalski and Andrzej Pelc. 2013. Leader election in ad hoc radio networks: A keen ear helps. J. Comput. Syst. Sci. 79, 7 (2013), 1164–1180.
[40]
Eyal Kushilevitz and Yishay Mansour. 1998. An Omega(D log (N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 3 (1998), 702–712.
[41]
Nicolas Nisse and David Soguet. 2009. Graph searching with advice. Theoret. Comput. Sci. 410, 14 (2009), 1307–1318.
Index Terms
- Constant-Length Labeling Schemes for Deterministic Radio Broadcast
Recommendations
Constant-Length Labelling Schemes for Faster Deterministic Radio Broadcast
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and ArchitecturesIn this paper, we consider the problem of broadcast from a specified source node in a known synchronous radio network. In 2019, Ellen, Gorain, Miller and Plc showed that this is possible if each node in the network only stores 2 (carefully chosen) bits ...
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
SPAA '19: The 31st ACM Symposium on Parallelism in Algorithms and ArchitecturesBroadcast is one of the fundamental network communication primitives. One node of a network, called the source, has a message that has to be learned by all other nodes. We consider broadcast in radio networks, modeled as simple undirected connected ...
Optimal deterministic broadcasting in known topology radio networks
We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm, which, given a graph G with source s, produces a fast broadcast scheme in the radio ...
Comments
Information & Contributors
Information
Published In
September 2021
111 pages
Copyright © 2021 Association for Computing Machinery.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 September 2021
Accepted: 01 October 2020
Revised: 01 September 2020
Received: 01 December 2019
Published in TOPC Volume 8, Issue 3
Check for updates
Author Tags
Qualifiers
- Research-article
- Refereed
Funding Sources
- Natural Sciences and Engineering Research Council of Canada (NSERC), Discovery
- Research Chair in Distributed Computing at the Université du Québec en Outaouais
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 76Total Downloads
- Downloads (Last 12 months)20
- Downloads (Last 6 weeks)2
Reflects downloads up to
Other Metrics
Citations
Cited By
View all- Bu GLotker ZPotop-Butucaru MRabie M(2023)Lower and upper bounds for deterministic convergecast with labeling schemesTheoretical Computer Science10.1016/j.tcs.2023.113775952:COnline publication date: 31-Mar-2023
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format