Abstract
We study information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. The goal is to deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task even if the tree topology is unknown. In the deterministic case, assuming that the nodes are labeled with small integers, we give an \(O(n)\)-time protocol that uses unbounded messages, and an \(O(n\log n)\)-time protocol using bounded messages. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and-forward protocol with running time \(O(n^{1.5})\), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an \(O(n\log n)\)-time protocol and we prove that this bound is asymptotically optimal.
Research supported by grants CCF-1217314 (NSF) and H98230-13-1-0228 (NSA).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, A., Spencer, J.: The Probabilistic Method. Wiley, Hoboken (2008)
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290–298 (1991)
Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM J. Comput. 22(4), 875–887 (1993)
Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129–135 (1997)
Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distrib. Comput. 15(1), 27–38 (2002)
Chlebus, B.S., Kowalski, D.R., Radzik, T.: Many-to-many communication in radio networks. Algorithmica 54(1), 118–139 (2009)
Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology (2014). arXiv 1407.1521
Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2), 177–189 (2002)
Chrobak, M., Gasieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. Networks 43(2), 119–124 (2004)
Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1–3), 337–364 (2003)
Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)
De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08), pp. 208–217 (2008)
Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of \(r\) others. Isr. J. Math. 51(1–2), 79–89 (1985)
Erdös, P., Turán, P.: On a problem of Sidon in additive number theory and on some related problems. J. London Math. Soc. 16, 212–215 (1941)
Gąsieniec, L.: On efficient gossiping in radio networks. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 2–14. Springer, Heidelberg (2010)
Gasieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad hoc radio networks. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 397–407. Springer, Heidelberg (2004)
Khabbazian, M., Kowalski, D.R.: Time-efficient randomized multiple-message broadcast in radio networks. In: Proceedings of the 30th Annual Symposium on Principles of Distributed Computing, PODC’11, pp. 373–380 (2011)
Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Math. 18(2), 332–346 (2004)
Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18(1), 43–57 (2005)
Kushilevitz, E., Mansour, Y.: An \(\Omega (D\log (N/D)\) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702–712 (1998)
Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340–349. Springer, Heidelberg (2002)
Strahler, A.: Hypsometric (area-altitude) analysis of erosional topology. Bull. Geol. Soc. Amer. 63, 117–1142 (1952)
Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publl. Math. de l’I.H.E.S. 81, 73–205 (1995)
Viennot, X.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317–329 (2003)
An, Y.X.: \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks. Algorithmica 36(1), 93–96 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R. (2014). Information Gathering in Ad-Hoc Radio Networks with Tree Topology. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-12691-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12690-6
Online ISBN: 978-3-319-12691-3
eBook Packages: Computer ScienceComputer Science (R0)