Operating system concepts (2nd ed.)
Operating system concepts (2nd ed.)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Adaptivity through distributed convergence
Adaptivity through distributed convergence
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A note on group mutual exclusion
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Asynchronous group mutual exclusion
Distributed Computing
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Self-stabilizing tiny interaction protocols
Proceedings of the Third International Workshop on Reliability, Availability, and Security
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 synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing counting in mobile sensor networks with a base station
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
This paper presents and proves correct two self-stabilizing deterministic algorithms solving the mutual exclusion and the group mutual exclusion problems in the model of population protocols with covering. In this variant of the population protocol model, a local fairness is used and bounded state anonymous mobile agents interact in pairs according to constraints expressed in terms of their cover times. The cover time is an indicator of the "time" for an agent to communicate with all the other agents. This indicator is expressed in the number of the pairwise communications (events) and is unknown to agents. In the model, we also assume the existence of a particular agent, the base station. In contrast with the other agents, it has a memory size proportional to the number of agents. We prove that without this kind of assumption, the mutual exclusion problem has no solution. The algorithms in the paper use a phase clock tool. This is a synchronization tool that was recently proposed in the model we use. For our needs, we extend the functionality of this tool to support also phases with unbounded (but finite) duration. This extension seems to be useful also in the future works.