Self-stabilization
Agents, Distributed Algorithms, and Stabilization
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
Move-optimal gossiping among mobile agents
Theoretical Computer Science
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
| Hi-index | 0.00 |
This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where agents may start from arbitrary locations in arbitrary states. Self-stabilization requires (some of the) participating agents to keep moving forever, hinting at maximizing the number of agents that could be allowed to stop moving eventually.This paper formalizes the self-stabilizing agent gossip problem, introduces the quiescence number(i.e., the maximum number of eventually stopping agents) of self-stabilizing solutions and investigates the quiescence number with respect to several assumptions related to agent anonymity, synchrony, link duplex capacity, and whiteboard capacity.