Advertisement

Efficient Distributed Communication in Ad-Hoc Radio Networks

  • Bogdan S. Chlebus
  • Dariusz R. Kowalski
  • Andrzej Pelc
  • Mariusz A. Rokicki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)

Abstract

We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering and multi-broadcast. In these problems, some or all nodes of the network initially contain input data called rumors, which have to be learned by other nodes. In rumor gathering, there are k rumors initially distributed arbitrarily among the nodes, and the goal is to collect all the rumors at one node. Our rumor gathering algorithm works in \({\mathcal O}((k+n)\log n)\) time and our multi-broadcast algorithm works in \({\mathcal O}(k\log^3 n+n\log^4 n)\) time, for any n-node networks and k rumors (with arbitrary k), which is a substantial improvement over the best previously known deterministic solutions to these problems.

As a consequence, we exponentially decrease the gap between upper and lower bounds on the deterministic time complexity of four communication problems: rumor gathering, multi-broadcast, gossiping and routing, in the important case when every node has initially at most one rumor (this is the scenario for gossiping and for the usual formulation of routing). Indeed, for \(k={\mathcal O}(n)\), our results simultaneously decrease the complexity gaps for these four problems from polynomial to polylogarithmic in the size of the graph. Moreover, our deterministic gathering algorithm applied for \(k={\mathcal O}(n)\) rumors, improves over the best previously known randomized algorithm of time \({\mathcal O}(k\log n+ n\log^2 n)\).

Keywords

radio network distributed algorithm gossiping gathering multi-broadcast routing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43, 290–298 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences 45, 104–126 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multi-hop radio networks. SIAM Journal on Computing 22, 875–887 (1993)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Chlebus, B.S., Gąsieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15, 27–38 (2002)CrossRefzbMATHGoogle Scholar
  5. 5.
    Chlebus, B.S., Kowalski, D.R., Radzik, T.: Many-to-many communication in radio networks. Algorithmica 54(1), 118–139 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Christersson, M., Gąsieniec, L., Lingas, A.: Gossiping with bounded size messages in ad-hoc radio networks. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 377–389. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Chrobak, M., Gąsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43, 177–189 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcasting in radio networks of unknown topology. Theoretical Computer Science 302, 337–364 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Gąsieniec, L., An, H.-C., Pelc, A., Xin, Q.: Deterministic M2M multicast in radio networks. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 670–682. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Gąsieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proc. of the 2nd International Conference on Theoretical Computer Science (TCS), pp. 193–205 (2002)Google Scholar
  11. 11.
    Gąsieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks, in. In: Proc. of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 397–407 (2004)Google Scholar
  12. 12.
    Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad-hoc radio networks. Distributed Computing 18, 43–57 (2005)CrossRefzbMATHGoogle Scholar
  13. 13.
    Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26, 362–391 (1983)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Bogdan S. Chlebus
    • 1
  • Dariusz R. Kowalski
    • 2
  • Andrzej Pelc
    • 3
  • Mariusz A. Rokicki
    • 2
  1. 1.Department of Computer Science and EngineeringU. of Colorado DenverUSA
  2. 2.Department of Computer ScienceUniversity of LiverpoolUK
  3. 3.Département d’informatiqueUniversité du Québec en OutaouaisCanada

Personalised recommendations