Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed

Authors:
Joffroy Beauquier;Janna Burman;Julien Clement;Shay Kutten
Affiliations:
University Paris Sud, LRI, UMR 8623, Inria project, Orsay, France;Technion, Haifa, Israel;University Paris Sud, LRI, UMR 8623, Orsay, France;Technion, Haifa, Israel
Venue:
Proceedings of the 28th ACM symposium on Principles of distributed computing
Year:
2009

Citing 2
Cited 3

Self-stabilization

Self-stabilization
Computation in networks of passively mobile finite-state sensors

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Making Population Protocols Self-stabilizing

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
On utilizing speed in networks of mobile agents

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing synchronization in mobile sensor networks with covering

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model for asynchronous mobile agent networks that takes into account the notion of speed of the agents. Then, we study the gathering problem (GP), in which an unknown number of anonymous agents have constant values they must deliver (only once) to a non mobile agent, the base station.