WEKO3
アイテム
Weakly Byzantine Gathering with a Strong Team
http://hdl.handle.net/10061/0002000210
http://hdl.handle.net/10061/0002000210c45f1ba0-fbb7-4150-804b-39acb6a316ec
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
fulltext (572 KB)
|
|
| アイテムタイプ | 学術雑誌論文 / Journal Article(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-04-30 | |||||||||
| タイトル | ||||||||||
| タイトル | Weakly Byzantine Gathering with a Strong Team | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | distributed algorithm | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | deterministic algorithm | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | mobile agents | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | gathering | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | Byzantine faults | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ | journal article | |||||||||
| アクセス権 | ||||||||||
| アクセス権 | open access | |||||||||
| 著者 |
HIROSE, Jion
× HIROSE, Jion
× NAKAMURA, Junya
× 大下, 福仁× 井上, 美智子 |
|||||||||
| 抄録 | ||||||||||
| 内容記述タイプ | Abstract | |||||||||
| 内容記述 | 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(n4$00B7|Λgood|$00B7X(n)) rounds, where |Λ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 where at least 4f2+9f+4 agents exist. Both the algorithms assume that the upper bound N of n is given to agents. The first algorithm achieves gathering with non-simultaneous termination in O((f+|&Lambdagood|)$00B7X(N)) rounds. The second algorithm achieves gathering with simultaneous termination in O((f+|&Lambdaall|)$00B7X(N)) rounds, where |&Lambdaall| is the length of the maximum ID of all agents. The second algorithm significantly reduces the time complexity compared to the existing one if n is given to agents and |&Lambdaall|=O(|&Lambdagood|) holds. | |||||||||
| 書誌情報 |
en : IEICE Transactions on Information and Systems 巻 E105.D, 号 3, p. 541, ページ数 555, 発行日 2022-03-01 |
|||||||||
| 出版者 | ||||||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | EISSN | |||||||||
| 収録物識別子 | 1745-1361 | |||||||||
| 出版者版DOI | ||||||||||
| 関連タイプ | isIdenticalTo | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | https://doi.org/10.1587/transinf.2021FCP0011 | |||||||||
| 出版者版URI | ||||||||||
| 関連タイプ | isIdenticalTo | |||||||||
| 識別子タイプ | URI | |||||||||
| 関連識別子 | https://search.ieice.org/bin/summary.php?id=e105-d_3_541 | |||||||||
| 権利 | ||||||||||
| 権利情報 | Copyright c 2022 The Institute of Electronics, Information and Communication Engineers | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | VoR | |||||||||
