The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Complexity of network synchronization
Journal of the ACM (JACM)
Information Processing Letters
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Solution of a problem in concurrent programming control
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Asynchronous group mutual exclusion
Distributed Computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Making Population Protocols Self-stabilizing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Meteorology and hydrology in Yosemite national park: a sensor network application
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing counting in mobile sensor networks with a base station
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
| Hi-index | 0.00 |
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides a form of a logical time. This paper presents a self-stabilizing (a tolerating state-corrupting transient faults) phase clock algorithm suited to the model of population protocols with covering. This model has been proposed recently for sensor networks with a very large, possibly unknown number of anonymous mobile agents having small memory. Agents interact in pairs in an asynchronous way subject to the constraints expressed in terms of the cover times of agents. The cover time expresses the “frequency” of an agent to communicate with all the others and abstracts agent’s communication characteristics (e.g. moving speed/patterns, transmitting/receiving capabilities). We show that a phase clock is impossible in the model with only constant-state agents. Hence, we assume an existence of resource-unlimited agent - the base station. The clock size and duration of each phase of the proposed phase clock tool are adjustable by the user. We provide application examples of this tool and demonstrate how it can simplify the design of protocols. In particular, it yields a solution to Group Mutual Exclusion problem.