Deterministic Rendezvous with Detection Using Beeps
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 . 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.
KeywordsAlgorithm Rendezvous Detection Synchronous Deterministic Network Graph Beep
- 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
- 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
- 14.Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms, 9 (2013). Article 17Google Scholar
- 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.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
- 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