Self-stabilizing counting in mobile sensor networks

Authors:
Joffroy Beauquier;Julien Clement;Stephane Messika;Laurent Rosaz;Brigitte Rozoy
Affiliations:
LRI Universite Paris Sud and CNRS, Orsay, France;LRI Universite Paris Sud and CNRS, Orsay, France;LRI Universite Paris Sud and CNRS, Orsay, France;LRI Universite Paris Sud and CNRS, Orsay, France;LRI Universite Paris Sud and CNRS, Orsay, France
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 5
Cited 5

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
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

Mediated population protocols

Theoretical Computer Science
Passively mobile communicating machines that use restricted space

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Passively mobile communicating machines that use restricted space

Theoretical Computer Science
Self-stabilizing consensus average algorithm in distributed sensor networks

Transactions on Large-Scale Data- and Knowledge-centered systems IX
Efficient distributed lifetime optimization algorithm for sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed computing has to adapt its techniques to mobile sensor networks and cope with constraints like small memory size or lack of computation power. In this paper we extend the results of Angluin et al (see [1,2,3,4]) 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 antenna 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.