| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 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 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | 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. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | Mobile agents / Gathering / Byzantine faults / Deterministic algorithm / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 120, no. 13, COMP2020-2, pp. 9-16, May 2020. | |
| Paper # | COMP2020-2 | |
| Date of Issue | 2020-05-02 (COMP) | |
| ISSN | Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | COMP2020-2 |
|
| Conference Information | |
| Committee | COMP IPSJ-AL |
| Conference Date | 2020-05-09 - 2020-05-09 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2020-05-COMP |
| Language | English |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Gathering for mobile agents with a strong team in weakly Byzantine environments |
| Sub Title (in English) | |
| Keyword(1) | Mobile agents |
| Keyword(2) | Gathering |
| Keyword(3) | Byzantine faults |
| Keyword(4) | Deterministic algorithm |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Jion Hirose |
| 1st Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 2nd Author's Name | Masashi Tsuchida |
| 2nd Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 3rd Author's Name | Junya Nakamura |
| 3rd Author's Affiliation | Toyohashi University of Technology (TUT) |
| 4th Author's Name | Fukuhito Ooshita |
| 4th Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 5th Author's Name | Michiko Inoue |
| 5th Author's Affiliation | Nara Institute of Science and Technology (NAIST) |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2020-05-09 16:15:00 |
| Presentation Time | 25 minutes |
| Registration for | COMP |
| Paper # | COMP2020-2 |
| Volume (vol) | vol.120 |
| Number (no) | no.13 |
| Page | pp.9-16 |
| #Pages | 8 |
| Date of Issue | 2020-05-02 (COMP) |
[Return to Top Page]