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

DOI10.1007/978-3-540-75142-7_8zbMath1145.68343OpenAlexW1507600867MaRDI QIDQ3523199

Laurent Rosaz, Stephane Messika, Brigitte Rozoy, Julien Clément, Joffroy Beauquier

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_8

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Distributed systems (68M14)

Related Items (10)

Simple and fast approximate counting and leader election in populations ⋮ On Space and Time Complexity of Loosely-Stabilizing Leader Election ⋮ Constant-Space Population Protocols for Uniform Bipartition ⋮ Tight complexity analysis of population protocols with cover times -- the ZebraNet example ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ A survey of size counting in population protocols ⋮ How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model ⋮ A self-stabilizing transformer for population protocols with covering ⋮ Space-efficient self-stabilizing counting population protocols on mobile sensor networks ⋮ Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents

This page was built for publication: Self-stabilizing Counting in Mobile Sensor Networks with a Base Station