講演抄録/キーワード |
講演名 |
2020-05-09 16:15
Gathering for mobile agents with a strong team in weakly Byzantine environments ○Jion Hirose・Masashi Tsuchida(NAIST)・Junya Nakamura(TUT)・Fukuhito Ooshita・Michiko Inoue(NAIST) COMP2020-2 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of $k$ agents with unique identifiers (IDs), and $f$ of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agents move in synchronous rounds and cannot leave any information on nodes. If the number of nodes $n$ is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in $O(n^4cdot|Lambda_{good}|cdot X(n))$ rounds, where $|Lambda_{good}|$ is the length of the maximum ID of non-Byzantine agents and $X(n)$ is the number of rounds required to explore any network composed of $n$ nodes. In this paper, we ask the question of whether we can reduce the time complexity if we have a strong team, i.e., a team with a few Byzantine agents, because not so many agents are subject to faults in practice. We give a positive answer to this question by proposing two algorithms in the case of $4f^2+9f+4leq k$. The first algorithm achieves gathering with non-simultaneous termination in $O((f+|Lambda_{good}|)cdot X(N))$ rounds, where $N$ is the given upper bound of $n$. The second algorithm achieves gathering with simultaneous termination in $O((f+|Lambda_{all}|)cdot X(N))$ rounds, where $|Lambda_{all}|$ is the length of the maximum ID of all agents. This algorithm significantly reduces the time complexity compared to the existing one if $|Lambda_{all}|=O(|Lambda_{good}|)$ holds. |
キーワード |
(和) |
/ / / / / / / |
(英) |
Mobile agents / Gathering / Byzantine faults / Deterministic algorithm / / / / |
文献情報 |
信学技報, vol. 120, no. 13, COMP2020-2, pp. 9-16, 2020年5月. |
資料番号 |
COMP2020-2 |
発行日 |
2020-05-02 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2020-2 |
|