Asynchronous Broadcasting with Bivalent Beeps

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9988)

Abstract

In broadcasting, one node of a network has a message that must be learned by all other nodes. We study deterministic algorithms for this fundamental communication task in a very weak model of wireless communication. The only signals sent by nodes are beeps. Moreover, they are delivered to neighbors of the beeping node in an asynchronous way: the time between sending and reception is finite but unpredictable. We first observe that under this scenario, no communication is possible, if beeps are all of the same strength. Hence we study broadcasting in the bivalent beeping model, where every beep can be either soft or loud. At the receiving end, if exactly one soft beep is received by a node in a round, it is heard as soft. Any other combination of beeps received in a round is heard as a loud beep. The cost of a broadcasting algorithm is the total number of beeps sent by all nodes.

We consider four levels of knowledge that nodes may have about the network: anonymity (no knowledge whatsoever), ad-hoc (all nodes have distinct labels and every node knows only its own label), neighborhood awareness (every node knows its label and labels of all neighbors), and full knowledge (every node knows the entire labeled map of the network and the identity of the source). We first show that in the anonymous case, broadcasting is impossible even for very simple networks. For each of the other three knowledge levels we provide upper and lower bounds on the minimum cost of a broadcasting algorithm. Our results show separations between all these scenarios. Perhaps surprisingly, the jump in broadcasting cost between the ad-hoc and neighborhood awareness levels is much larger than between the neighborhood awareness and full knowledge levels, although in the two former levels knowledge of nodes is local, and in the latter it is global.

Keywords

Algorithm Asynchronous Broadcasting Deterministic Graph Network Beep 

References

  1. 1.
    Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 32–50. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A trade-off between information and communication in broadcast protocols. J. ACM 37, 238–256 (1990)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Calamoneri, T., Fusco, E.G., Pelc, A.: Impact of information on the complexity of asynchronous radio broadcasting. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 311–330. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Chlebus, B.S., Rokicki, M.A.: Centralized asynchronous broadcast in radio networks. Theor. Comput. Sci. 383, 5–22 (2007)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Alg. 43, 177–189 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 148–162. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Czumaj, A., Davis, P.: Communicating with beeps [cs.DC] (2015). arXiv:1505.06107
  8. 8.
    Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Struct. Alg. 1, 447–460 (1990)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Förster, K.-T., Seidel, J., Wattenhofer, R.: Deterministic leader election in multi-hop beeping networks. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 212–226. Springer, Heidelberg (2014)Google Scholar
  10. 10.
    Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Disc. Appl. Math. 53, 79–133 (1994)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Ghaffari, M., Haeupler, B.: Near optimal leader election in multi-hop radio networks. In: Proceedings of 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 748–766Google Scholar
  12. 12.
    Gilbert, S., Newport, C.: The computational power of beeps. In: Moses, Y., et al. (eds.) DISC 2015. LNCS, vol. 9363, pp. 31–46. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48653-5_3 CrossRefGoogle Scholar
  13. 13.
    Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319–349 (1988)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Hounkanli, K., Miller, A., Pelc, A.: Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC. CoRR abs/1508.06583 (2015)Google Scholar
  15. 15.
    Kowalski, D.: Algorithmic Foundations of Communication in Radio Networks. Morgan & Claypool Publishers, California (2011)Google Scholar
  16. 16.
    Kowalski, D., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Comput. 33, 870–891 (2004)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Kushilevitz, E., Mansour, Y.: An Omega(D log (N/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702–712 (1998)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Métivier, Y., Robson, J.M., Zemmari, A.: On distributed computing with beeps, CoRR abs/1507.02721 (2015)Google Scholar
  19. 19.
    Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks 28, 143–156 (1996)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Pelc, A.: Activating anonymous ad hoc radio networks. Distrib. Comput. 19, 361–371 (2007)CrossRefMATHGoogle Scholar
  21. 21.
    Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10, 692–701 (1981)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Yu, J., Jia, L., Yu, D., Li, G., Cheng, X.: Minimum connected dominating set construction in wireless networks under the beeping model. In: Proceedings of IEEE Conference on Computer Communications, (INFOCOM 2015), pp. 972–980 (2015)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Département d’informatiqueUniversité du Québec en OutaouaisGatineauCanada

Personalised recommendations