Deterministic rendezvous with detection using beeps
Samir Elouasbi, Andrzej Pelc

TL;DR
This paper presents deterministic algorithms for rendezvous with detection in unknown networks using beeping communication, addressing energy efficiency and extending to different beeping models.
Contribution
It introduces a polynomial-time deterministic rendezvous with detection algorithm for unknown networks using beeping models, including energy-efficient variants.
Findings
Rendezvous with detection is achievable in polynomial time.
The algorithms work even in the weakest beeping communication models.
Energy-efficient solutions are explored for bounded-energy agents.
Abstract
Two mobile agents, starting at arbitrary, possibly different times from arbitrary nodes of an unknown network, have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. Agents have different labels which are positive integers. 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 the agents get to the same node in the same round. We want to achieve 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 an agent can communicate to the other agent its presence at a node. We use two variations of the arguably weakest model of communication, called the beeping model,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Distributed Control Multi-Agent Systems · Distributed systems and fault tolerance
