Data collection in population protocols with non-uniformly random scheduler

DOI10.1016/j.tcs.2019.08.029zbMath1436.68040OpenAlexW2970404638MaRDI QIDQ2285150

Janna Burman, Thomas Nowak, Shay Kutten, Chuan Xu, Joffroy Beauquier

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.08.029

zbMATH Keywords

energy consumptionpopulation protocolsdata collectionnon-uniformly random scheduler

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple population protocol for fast robust approximate majority
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Space-optimal counting in population protocols
• Probability 1 computation with chemical reaction networks
• Computation in networks of passively mobile finite-state sensors
• The coupon subset collection problem
• Fast and Exact Majority in Population Protocols
• Deterministic Population Protocols for Exact Majority and Plurality.
• Gossip Algorithms
• Polylogarithmic-Time Leader Election in Population Protocols
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• The collector's problem with group drawings
• Fast Computation by Population Protocols with a Leader
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Time-Space Trade-offs in Population Protocols
• Introduction to Distributed Algorithms
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Space-Optimal Proportion Consensus with Population Protocols
• Data Collection in Population Protocols with Non-uniformly Random Scheduler
• A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States
• On utilizing speed in networks of mobile agents
• Coupon collector's problem with unlike probabilities
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Computation in networks of passively mobile finite-state sensors
• Stable leader election in population protocols requires linear time

This page was built for publication: Data collection in population protocols with non-uniformly random scheduler