Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs - Archive ouverte HAL Access content directly
Conference Papers Year :

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

(1) , (1) , (1) , (2, 3)
1
2
3

Abstract

In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of arbitrary communication graphs. As a result, we investigate the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight.
Fichier principal
Vignette du fichier
LIPIcs-OPODIS-2020-33.pdf (499.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03126591 , version 1 (31-01-2021)

Identifiers

Cite

Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil. Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. 24th International Conference on Principles of Distributed Systems (OPODIS 2020), Dec 2020, Strasbourg, France. pp.33:1--33:16, ⟨10.4230/LIPIcs.OPODIS.2020.33⟩. ⟨hal-03126591⟩
23 View
10 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More