Data Collection in Population Protocols with Non-uniformly Random Scheduler

DOI10.1007/978-3-319-72751-6_2MaRDI QIDQ5056046zbMATH OpenOpenAlexFDO

Authors Shay Kutten, Thomas Nowak, Chuan Xu, J. Beauquier, J. Burman

Publication date 9 December 2022

Published in Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72751-6_2

zbMATH Keywords

classical coupon collectorexpected convergence timegood time complexityprotocol populationrandom scheduler

Mathematics Subject Classification ID

Network protocols (68M12) Wireless sensor networks as related to computer science (68M18)

Recommendations

• Data collection in population protocols with non-uniformly random scheduler
• Scheduling in data gathering networks with background communications
• A totally distributed fair scheduler for population protocols by randomized handshakes
• Communication scheduling in data gathering networks with limited memory
• Heuristics for scheduling data requests using collective communications in a distributed communication network
• Time-space trade-offs in population protocols
• Dynamic Distributed Scheduling in Random Access Networks
• Random asynchronous iterations in distributed coordination algorithms

Cites work

• A simple population protocol for fast robust approximate majority
• An Interior-Point Method for Semidefinite Programming
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Computation in networks of passively mobile finite-state sensors
• Computation in networks of passively mobile finite-state sensors
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Coupon collector's problem with unlike probabilities
• Data Collection in Population Protocols with Non-uniformly Random Scheduler
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Fast and exact majority in population protocols
• Fast Computation by Population Protocols with a Leader
• Introduction to Distributed Algorithms
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• On utilizing speed in networks of mobile agents
• Semidefinite Programming
• The collector's problem with group drawings
• The coupon subset collection problem
• Time and space optimal counting in population protocols
• Time-space trade-offs in population protocols

Cited in

(2)

• Data collection in population protocols with non-uniformly random scheduler
• Data Collection in Population Protocols with Non-uniformly Random Scheduler

This page was built for publication: Data Collection in Population Protocols with Non-uniformly Random Scheduler

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