Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots

被引:2
作者
Ashkenazi, Yotam [1 ]
Dolev, Shlomi [1 ]
Kamei, Sayaka [2 ]
Ooshita, Fukuhito [3 ]
Wada, Koichi [4 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
[2] Hiroshima Univ, Grad Sch Adv Sci & Engn, Hiroshima, Japan
[3] Nara Inst Sci & Technol, Grad Sch Sci & Technol, Nara, Japan
[4] Hosei Univ, Fac Sci & Engn, Dept Appl Informat, Tokyo, Japan
基金
日本学术振兴会;
关键词
Byzantine robots; distributed algorithms; self‐ stabilizing algorithms;
D O I
10.1002/cpe.6123
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this article, we consider the case in which a swarm of robots collaborates in a mission, where a few of the robots behave maliciously. These malicious Byzantine robots may be temporally or constantly controlled by an adversary. The scope is synchronized full information robot operations, where a robot that does not follow the program/policy of the swarm is immediately identified and can be remembered as Byzantine. As robots may be suspected of being Byzantine due to benign temporal malfunctions, it is imperative to forgive and forget, otherwise, a robot cannot assume collaborative actions with any other robot in the swarm. Still, remembering for a while may facilitate a policy of surrounding, isolating and freezing the movement of the misbehaving robots, by several robots, allowing the rest to perform the swarm task with no intervention. We demonstrate the need to periodically forgive and forget to realize swarm several tasks including patrolling/cleaning in the presence of possible Byzantine robots. The policy for achieving the task consists of blocking the movement of the Byzantine robot(s) by some of the robots, while the rest patrol/clean the plane.
引用
收藏
页数:15
相关论文
共 50 条
[31]   Re-Chord: A Self-stabilizing Chord Overlay Network [J].
Sebastian Kniesburges ;
Andreas Koutsopoulos ;
Christian Scheideler .
Theory of Computing Systems, 2014, 55 :591-612
[32]   Building self-stabilizing overlay networks with the transitive closure framework [J].
Berns, Andrew ;
Ghosh, Sukumar ;
Pemmaraju, Sriram V. .
THEORETICAL COMPUTER SCIENCE, 2013, 512 :2-14
[33]   Brief Announcement: Self-Stabilizing Counting in Mobile Sensor Networks [J].
Beauquier, Joffroy ;
Clement, Julien ;
Messika, Stephane ;
Rosaz, Laurent ;
Rozoy, Brigitte .
PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, :396-397
[34]   Re-Chord: A Self-stabilizing Chord Overlay Network [J].
Kniesburges, Sebastian ;
Koutsopoulos, Andreas ;
Scheideler, Christian .
THEORY OF COMPUTING SYSTEMS, 2014, 55 (03) :591-612
[35]   Exploiting Synchronicity for Immediate Feedback in Self-Stabilizing PIF Algorithms [J].
Jubran, Oday ;
Theel, Oliver .
2014 20TH IEEE PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC 2014), 2014, :106-115
[36]   A Self-stabilizing Approximation Algorithm for Vertex Cover in Anonymous Networks [J].
Turau, Volker ;
Hauck, Bernd .
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5873 :341-353
[37]   Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks [J].
Bernard, Samuel ;
Devismes, Stephane ;
Paroux, Katy ;
Potop-Butucaru, Maria ;
Tixeuil, Sebastien .
DISTRIBUTED COMPUTING AND NETWORKING, PROCEEDINGS, 2010, 5935 :167-+
[39]   2-STATE SELF-STABILIZING ALGORITHMS FOR TOKEN RINGS [J].
FLATEBO, M ;
DATTA, AK .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (06) :500-504
[40]   Quiescence of self-stabilizing gossiping among mobile agents in graphs [J].
Masuzawa, Toshimitsu ;
Tixeuil, Sebastien .
THEORETICAL COMPUTER SCIENCE, 2010, 411 (14-15) :1567-1582