18 citations · 26 across the 6 of their papers we have counts for
6 papers
How to Meet Asynchronously at Polynomial Cost
Yoann Dieudonné, Andrzej Pelc, Vincent Villain
Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a po…
Deterministic Leader Election Among Disoriented Anonymous Sensors
Yoann dieudonné, Florence Levé, Franck Petit +1
We address the Leader Election (LE) problem in networks of anonymous sensors sharing no kind of common coordinate system. Leader Election is a fundamental symmetry breaking problem…
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies
Alain Cournier, Swan Dubois, Anissa Lamani +2
In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide…
Snap-Stabilizing Linear Message Forwarding
Anissa Lamani, Alain Cournier, Swan Dubois +2
In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being inde- pendent of any global parameter, that is 4 buffe…
Two snap-stabilizing point-to-point communication protocols in message-switched networks
Alain Cournier, Swan Dubois, Vincent Villain
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the mess…
Leader Election Problem Versus Pattern Formation Problem
Yoann Dieudonné, Franck Petit, Vincent Villain
Leader election and arbitrary pattern formation are funda- mental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead…