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...
-
December 12, 2011 (v1)Conference paperUploaded on: December 3, 2022
-
September 22, 2011 (v1)Report
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...
Uploaded on: December 4, 2022 -
June 21, 2010 (v1)Conference paper
International audience
Uploaded on: December 3, 2022 -
2011 (v1)Conference paper
Nous étudions le protocole de collecte de données du projet ZebraNet, dans le modèle des protocoles de population. Dans ce projet des capteurs sont attachés à une population de zèbres, en Afrique Centrale, et fournissent des données aux biologistes qui étudient leurs structures migratoires et comportementales. Nous montrons qu'un protocole...
Uploaded on: December 3, 2022 -
July 25, 2010 (v1)Conference paper
Population protocols are a model presented recently for networks with a very large, possibly unknown number of mobile agents having small memory. This model has certain advantages over alternative models (such as DTN) for such networks. However, it was shown that the computational power of this model is limited to semi-linear predicates only....
Uploaded on: December 4, 2022 -
May 2002 (v1)Journal article
This work focuses on self-stabilizing algorithms for mutual exclusion and leader election—two fundamental tasks for distributed systems. Self-stabilizing systems are able to recover by themselves, regaining their consistency from any initial or intermediary faulty configuration. The proposed algorithms are designed for any directed, anonymous...
Uploaded on: December 4, 2022 -
February 2020 (v1)Journal article
Contrary to many previous studies on population protocols using the uniformly random scheduler, we consider a more general non-uniform case. Here, pair-wise interactions between agents (moving and communicating devices) are assumed to be drawn non-uniformly at random. While such a scheduler is known to be relevant for modeling many practical...
Uploaded on: February 25, 2024