Advertisement

Algorithmica

, Volume 80, Issue 3, pp 1013–1040 | Cite as

Faster Information Gathering in Ad-Hoc Radio Tree Networks

  • Marek Chrobak
  • Kevin P. Costello
Article
  • 66 Downloads
Part of the following topical collections:
  1. Special Issue on Theoretical Informatics

Abstract

We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc property refers to the fact that the topology of the network is unknown when the computation starts. Aggregation of rumors is not allowed, which means that each node may transmit at most one rumor in one step. We focus on networks with tree topologies, that is we assume that the network is a tree with all edges directed towards the root, but, being ad-hoc, its actual topology is not known. We provide two deterministic algorithms for this problem. For the model that does not assume any collision detection nor acknowledgement mechanisms, we give an \(O(n\log \log n)\)-time algorithm, improving the previous upper bound of \(O(n\log n)\). We then show that this running time can be reduced to O(n), which is asymptotically optimal, if the model allows for acknowledgements of successful transmissions.

Notes

Acknowledgements

We would like to thank the anonymous reviewers for multiple comments that helped us improve the paper and for pointing out several references relevant to this work.

References

  1. 1.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290–298 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Anta, A.F., Mosteiro, M.A., Muoz, J.R.: Unbounded contention resolution in multiple-access channels. Algorithmica 67(3), 295–314 (2013)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129–135 (1997)CrossRefGoogle Scholar
  4. 4.
    Chlebus, B.S., Kowalski, D.R., Pelc, A., Rokicki, M.A.: Efficient distributed communication in ad-hoc radio networks. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP’11), pp. 613–624. (2011)Google Scholar
  5. 5.
    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)CrossRefMATHGoogle Scholar
  6. 6.
    Christersson, M., Gasieniec, L., Lingas, A.: Gossiping with bounded size messages in ad hoc radio networks. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP), pp. 377–389. (2002)Google Scholar
  7. 7.
    Chrobak, M., Costello, K., Gasieniec, L., Kowalski, D.R.: Information gathering in ad-hoc radio networks with tree topology. In: Proceedings of the 8th International Conference on Combinatorial Optimization and Applications (COCOA), pp. 129–145. (2014)Google Scholar
  8. 8.
    Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2), 177–189 (2002)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Chrobak, M., Gasieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. Networks 43(2), 119–124 (2004)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Proceedings of 17th International Symposium on Algorithms and Computation (ISAAC’06), pp. 339–348. Springer, Berlin (2006)Google Scholar
  11. 11.
    Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709–718. (2001)Google Scholar
  12. 12.
    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)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Czumaj, A., Davies, P.: Almost optimal deterministic broadcast in radio networks. In: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), (2016). To appearGoogle Scholar
  14. 14.
    Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 208–217. (2008)Google Scholar
  16. 16.
    De Marco, G., Kowalski, D.R.: Contention resolution in a non-synchronized multiple access channel. In: Proceedings of the 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 525–533. (2013)Google Scholar
  17. 17.
    De Marco, G., Kowalski, D.R.: Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. SIAM J. Comput. 44(3), 868–888 (2015)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of \(r\) others. Israel J. Math. 51(1–2), 79–89 (1985)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Gasieniec, L.: On efficient gossiping in radio networks. In: Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 2–14. (2009)Google Scholar
  20. 20.
    Gasieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad hoc radio networks. In: Proceedings of the 9th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 397–407. (2004)Google Scholar
  21. 21.
    Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 158–166. (2005)Google Scholar
  22. 22.
    Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Math. 18(2), 332–346 (2004)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Kowalski, D.R., Pelc, A.: Leader election in ad hoc radio networks: a keen ear helps. In: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming (ICALP’09), pp. 521–533. (2009)Google Scholar
  24. 24.
    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)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Proceedings of the 8th International Computing and Combinatorics Conference (COCOON), pp. 340–349. (2002)Google Scholar
  26. 26.
    Strahler, A.N.: Hypsometric (area-altitude) analysis of erosional topology. Geol. Soc. Am. Bull. 63, 1117–1142 (1952)CrossRefGoogle Scholar
  27. 27.
    Viennot, X.G.: A Strahler bijection between Dyck paths and planar trees. Discrete Math. 246, 317–329 (2003)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Ying, Xu: An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks. Algorithmica 36(1), 93–96 (2003)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of California at RiversideRiversideUSA
  2. 2.Department of MathematicsUniversity of California at RiversideRiversideUSA

Personalised recommendations