Self-stabilizing counting in mobile sensor networks with a base station

Authors:
Joffroy Beauquier;Julien Clement;Stephane Messika;Laurent Rosaz;Brigitte Rozoy
Affiliations:
Univ. Paris Sud, LRI, UMR, CNRS, Orsay;Univ. Paris Sud, LRI, UMR, CNRS, Orsay;Univ. Paris Sud, LRI, UMR, CNRS, Orsay;Univ. Paris Sud, LRI, UMR, CNRS, Orsay;Univ. Paris Sud, LRI, UMR, CNRS, Orsay
Venue:
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Year:
2007

Citing 7
Cited 8

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
Environmental Sensor Networks

Computer
A wireless sensor network For structural monitoring

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
When birds die: making population protocols fault-tolerant

DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Fast computation by population protocols with a leader

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Self-stabilizing population protocols

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

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
Improving space complexity of self-stabilizing counting on mobile sensor networks

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Computing time complexity of population protocols with cover times: the zebranet example

SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing synchronization in mobile sensor networks with covering

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Tight complexity analysis of population protocols with cover times - The ZebraNet example

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computational power. In this paper, we extend the results of Angluin et al (see [4,3,2,1]) by finding self-stabilizing algorithms to count the number of agents in the network. We focus on two different models of communication, with a fixed base station or with pairwise interactions. In both models we decide if there exist algorithms (probabilistic, deterministic, with k-fair adversary) to solve the self-stabilizing counting problem.