Self-stabilizing counting in mobile sensor networks

DOI10.1145/1281100.1281191MaRDI QIDQ5401486zbMATH OpenOpenAlexFDO

Authors Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy, J. Beauquier

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281191

zbMATH Keywords

distributed algorithmsfault toleranceself-stabilizationsensor networksmobile networks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks
• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Distributed Computing - IWDC 2003

Cited in

(9)

• Target counting with Presburger constraints and its application in sensor networks
• Passively mobile communicating machines that use restricted space
• Mediated population protocols
• Space-efficient self-stabilizing counting population protocols on mobile sensor networks
• Recent Advances in Population Protocols
• On space complexity of self-stabilizing leader election in mediated population protocol
• Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
• A self-stabilizing algorithm for edge monitoring in wireless sensor networks
• Estimation of the number of operating sensors in large-scale sensor networks with mobile access

This page was built for publication: Self-stabilizing counting in mobile sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401486)