Brief Announcement: Self-Stabilizing Counting in Mobile Sensor Networks

被引：0

作者：

Beauquier, Joffroy ^{[1
]}

Clement, Julien ^{[1
]}

Messika, Stephane ^{[1
]}

Rosaz, Laurent ^{[1
]}

Rozoy, Brigitte ^{[1
]}

机构：

[1] CNRS, LRI, F-91405 Orsay, France

来源：

PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING | 2007年

关键词：

distributed algorithms; fault-tolerance; self-stabilization; sensor networks; mobile networks;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 at (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.

引用

页码：396 / 397

页数：2