Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
From MaRDI portal
Recommendations
- Self-stabilizing counting in mobile sensor networks
- 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
(15)- Simple and fast approximate counting and leader election in populations
- Uniform bipartition in the population protocol model with arbitrary graphs
- A survey of size counting in population protocols
- Constant-space population protocols for uniform bipartition
- Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
- On space and time complexity of loosely-stabilizing leader election
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example
- Estimation of the number of operating sensors in large-scale sensor networks with mobile access
- Target counting with Presburger constraints and its application in sensor networks
- Self-stabilizing counting in mobile sensor networks
- A self-stabilizing transformer for population protocols with covering
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- Efficient assignment of identities in anonymous populations
- Time-optimal self-stabilizing leader election in population protocols
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
This page was built for publication: Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523199)