Fast Structuring of Radio Networks Large for Multi-message Communications

  • Mohsen Ghaffari
  • Bernhard Haeupler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8205)

Abstract

We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives.

Designing efficient communication primitives for radio networks has a rich history that began 25 years ago when Bar-Yehuda et al. introduced fast randomized algorithms for broadcasting and for constructing BFS-trees. Their BFS-tree construction time was O(D log2n) rounds, where D is the network diameter and n is the number of nodes. Since then, the complexity of a broadcast has been resolved to be \(T_{BC} = \Theta(D \log \frac{n}{D} + \log^2 n)\) rounds. On the other hand, BFS-trees have been used as a crucial building block for many communication primitives and their construction time remained a bottleneck for these primitives.

We introduce collision free layerings that can be used in place of BFS-trees and we give a randomized construction of these layerings that runs in nearly broadcast time, that is, w.h.p. in \(T_{Lay} = O(D \log \frac{n}{D} + \log^{2+\epsilon} n)\) rounds for any constant ε > 0. We then use these layerings to obtain: (1) A randomized algorithm for gathering k messages running w.h.p. in O(TLay + k) rounds. (2) A randomized k-message broadcast algorithm running w.h.p. in O(TLay + k logn) rounds. These algorithms are optimal up to the small difference in the additive poly-logarithmic term between TBC and TLay. Moreover, they imply the first optimal O(n logn) round randomized gossip algorithm.

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. J. of Computer and System Sc. 43(2), 290–298 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Computer and System Sc. 45(1), 104–126 (1992)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multi-hop radio networks. SIAM Journal on Computing 22(4), 875–887 (1993)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Chlamtac, I., Kutten, S.: On broadcasting in radio networks: Problem analysis and protocol design. IEEE Transactions on Communications 33(12), 1240–1246 (1985)CrossRefMATHGoogle Scholar
  5. 5.
    Chlebus, B., Kowalski, D., Radzik, T.: Many-to-many communication in radio networks. Algorithmica 54(1), 118–139 (2009)MathSciNetCrossRefMATHGoogle 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.
    Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. IEEE Symp. on Foundations of Computer Science, pp. 492–501 (2003)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 129–137 (2005)Google Scholar
  10. 10.
    Gasieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Baeza-Yates, R., Montanari, U., Santoro, N. (eds.) TCS 2002. IFIP, vol. 96, pp. 193–205. Springer, Boston (2002)Google Scholar
  11. 11.
    Ghaffari, M., Haeupler, B.: Near-optimal leader election in multi-hop radio networks. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 748–766 (2013)Google Scholar
  12. 12.
    Ghaffari, M., Haeupler, B., Khabbazian, M.: A bound on the throughput of radio networks. ArXiv Preprint abs/1302.0264 (2013)Google Scholar
  13. 13.
    Ghaffari, M., Haeupler, B., Khabbazian, M.: Broadcast in radio networks with collision detection. In: Proc. ACM Symp. on Principles of Distributed Computing (2013)Google Scholar
  14. 14.
    Haeupler, B.: Analyzing network coding gossip made easy. In: Proc. ACM Symp. on Theory of Computing, pp. 293–302 (2011)Google Scholar
  15. 15.
    Khabbazian, M., Kowalski, D.: Time-efficient randomized multiple-message broadcast in radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 373–380 (2011)Google Scholar
  16. 16.
    Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. ACM Symp. on Principles of Distributed Computing, pp. 73–82 (2003)Google Scholar
  17. 17.
    Kushilevitz, E., Mansour, Y.: An Ω(D log(N/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing 27(3), 702–712 (1998)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known topology radio networks. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol. 4235, pp. 125–134. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Xin, Q.: Personal communication (May 2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mohsen Ghaffari
    • 1
  • Bernhard Haeupler
    • 1
  1. 1.MITUSA

Personalised recommendations