Deterministic byzantine-resilient robot gathering
| dc.contributor.author | Saha, Ullash | |
| dc.contributor.examiningcommittee | Durocher, Stephane (Computer Science) | en_US |
| dc.contributor.examiningcommittee | Thulasiraman, Parimala (Computer Science) | en_US |
| dc.contributor.supervisor | Miller, Avery (Computer Science) | en_US |
| dc.date.accessioned | 2020-08-28T18:09:06Z | |
| dc.date.available | 2020-08-28T18:09:06Z | |
| dc.date.copyright | 2020-08-20 | |
| dc.date.issued | 2020-08 | en_US |
| dc.date.submitted | 2020-08-21T01:44:13Z | en_US |
| dc.degree.discipline | Computer Science | en_US |
| dc.degree.level | Master of Science (M.Sc.) | en_US |
| dc.description.abstract | Gathering is a fundamental problem in the field of mobile robot algorithms. The goal is to gather the robots at a single point, which can be useful for sharing information or coordinating future actions. In this thesis, we consider models in which m robots are placed at nodes in a graph of size n, and the goal is to gather them at a single node of the graph. Here, each robot has an identifier (ID) and runs its own deterministic algorithm, i.e., there is no centralized coordinator. We consider a particularly challenging scenario: there are f maliciously faulty robots in the team that can behave arbitrarily, and even have the ability to change their IDs to any value at any time. There is no way to distinguish these robots from non-faulty robots, other than perhaps observing strange or unexpected behaviour. In this thesis, we seek to design a deterministic algorithm that is run by each robot to eventually have all the non-faulty robots located at the same node in the same round. It is known that no algorithm can solve this task unless there at least f+1 non-faulty robots in the team. In this thesis, we design an algorithm that runs in polynomial time with respect to n and m that matches this bound, i.e., it works in a team that has exactly f+1 non-faulty robots. In our model, we have equipped the robots with sensors that enable each robot to see the subgraph (including robots) within some distance H of its current node. We also prove that the gathering task is solvable if this visibility range H is at least the radius of the graph, and not solvable if H is any fixed constant. | en_US |
| dc.description.note | October 2020 | en_US |
| dc.identifier.citation | Miller, A., Saha, U. Fast Byzantine Gathering with Visibility in Graphs. In press of the 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, Algosensors 2020. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1993/34904 | |
| dc.language.iso | eng | en_US |
| dc.rights | open access | en_US |
| dc.subject | Robot gathering | en_US |
| dc.subject | Byzantine faults | en_US |
| dc.subject | Visibility | en_US |
| dc.subject | Graphs | en_US |
| dc.subject | Distributed algorithms | en_US |
| dc.title | Deterministic byzantine-resilient robot gathering | en_US |
| dc.type | master thesis | en_US |