Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ALGOSENSORS
2009
Springer

favoriteEmaildiscussreport

153views Sensor Networks» more ALGOSENSORS 2009»

Self-stabilizing Deterministic Gathering

13 years 11 months ago

Self-stabilizing Deterministic Gathering

Download hal.archives-ouvertes.fr

Abstract. In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a deterministic self-stabilizing algorithm solving GP for n robots if, and only if, n is odd.

Yoann Dieudonné, Franck Petit

Real-time Traffic

ALGOSENSORS 2009 | Robots | Strong Multiplicity Detection | Weak Robots | Wireless Sensors |

claim paper

Related Content

» A Space Optimal Deterministic SelfStabilizing Leader Election Algorithm for Unidirectional...

» Memory Space Requirements for SelfStabilizing Leader Election Protocols

» SelfStabilizing Symmetry Breaking in Constant Space

» SelfStabilizing Minimum Spanning Tree Construction on MessagePassing Networks

» Linear Time Byzantine SelfStabilizing Clock Synchronization

» Solving the Robots Gathering Problem

» Data Gathering in Optical Networks with the TL1 Toolkit

» Integrated SourceChannel Decoding for Correlated DataGathering Sensor Networks

» QStream Deterministic Querying of Data Streams

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	ALGOSENSORS
Authors	Yoann Dieudonné, Franck Petit

Comments (0)