Deterministic Rendezvous with Detection Using Beeps

  • Samir ElouasbiEmail author
  • Andrzej Pelc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9536)


Two mobile agents, starting at possibly different times from arbitrary nodes of an unknown network, have to meet at some node. Agents move in synchronous rounds. They have different positive integer labels. Each agent knows its own label but not the label of the other agent. In traditional formulations of the rendezvous problem, meeting is accomplished when agents get to the same node in the same round. We seek a more demanding goal, called rendezvous with detection: agents must become aware that the meeting is accomplished, simultaneously declare this and stop. This awareness depends on how agents communicate. We use two variations of a very weak communication model, called the beeping model, introduced in [8]. In each round an agent either listens or beeps. In the local beeping model, an agent hears a beep if it listens in this round and if the other agent is at the same node and beeps. In the global beeping model, an agent hears a loud (resp. a soft) beep if it listens in this round and if the other agent is at the same node (resp. at another node) and beeps.

We first present a deterministic algorithm of rendezvous with detection working, even for the local beeping model, in an arbitrary unknown network in time polynomial in the size of the network and in the length of the smaller label (i.e., in the logarithm of this label). However, in this algorithm, agents spend a lot of energy: the number of moves that an agent must make, is proportional to the time of rendezvous. It is thus natural to ask if bounded-energy agents, i.e., agents that can make at most c moves, for some integer c, can always achieve rendezvous with detection as well, in bounded size networks. We prove that the answer to this question is positive, even in the local beeping model but, perhaps surprisingly, this ability comes at a steep price of time: the meeting time of bounded-energy agents is exponentially larger than that of unrestricted agents. By contrast, we show an algorithm for rendezvous with detection in the global beeping model that works for bounded-energy agents (in bounded-size networks) as fast as for unrestricted agents.


Algorithm Rendezvous Detection Synchronous Deterministic Network Graph Beep 


  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.
    Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. International Series in Operations Research and Management Science. Kluwer Academic Publisher, Dordrecht (2002)Google Scholar
  3. 3.
    Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Oper. Res. 49, 107–118 (2001)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Baba, D., Izumi, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Space-optimal rendezvous of mobile agents in asynchronous trees. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol. 6058, pp. 86–100. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Bampas, E., Czyzowicz, J., Gąsieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 297–311. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 119–134. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41, 829–879 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    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
  9. 9.
    Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165–178 (2012)zbMATHCrossRefGoogle Scholar
  10. 10.
    Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69–96 (2006)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92–99 (2013)Google Scholar
  12. 12.
    Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337, 147–168 (2005)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189–200. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  14. 14.
    Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms, 9 (2013). Article 17Google Scholar
  15. 15.
    Koucký, M.: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65, 717–726 (2002)zbMATHCrossRefGoogle Scholar
  16. 16.
    Kranakis, E., Krizanc, D., Morin, P.: Randomized Rendez-Vous with limited memory. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 605–616. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  17. 17.
    Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592–599 (2003)Google Scholar
  18. 18.
    Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. In: Proceedings of 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2014), pp. 282–290 (2014)Google Scholar
  19. 19.
    Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331–347 (2012)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1–24 (2008)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599–608 (2007)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

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

Personalised recommendations