Self-stabilizing Counting in Mobile Sensor Networks with a Base Station

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.

• Type: Conference
• Year: 2007
• Where: WDAG
• Authors: Joffroy Beauquier, Julien Clement, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy
• Keywords: Algorithms, Mobile Agents, Self-stabilizing Algorithms, Self-stabilizing Counting Problem, WDAG 2007