Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots

Anisur Rahaman Molla, Kaushik Mondal, William K. Moses

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

The problem of dispersion of mobile robots on a graph asks that n robots initially placed arbitrarily on the nodes of an n-node anonymous graph, autonomously move to reach a final configuration where exactly each node has at most one robot on it. This problem has been relatively well-studied when robots are non-faulty. In this paper, we introduce the notion of Byzantine faults to this problem, i.e., we formalize the problem of dispersion in the presence of up to f Byzantine robots. We then study the problem on a ring while simultaneously optimizing the time complexity of algorithms and the memory requirement per robot. Specifically, we design deterministic algorithms that attempt to match the time lower bound (rounds) and memory lower bound (bits per robot). Our main result is a deterministic algorithm that is both time and memory optimal, i.e., O(n) rounds and bits of memory required per robot, subject to certain constraints. We subsequently provide results that require less assumptions but are either only time or memory optimal but not both. We also provide a primitive that takes robots initially gathered at a node of the ring and disperses them in a time and memory optimal manner without additional assumptions required.

Original languageEnglish
Title of host publicationAlgorithms for Sensor Systems - 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Revised Selected Papers
EditorsCristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages154-169
Number of pages16
ISBN (Print)9783030624002
DOIs
StatePublished - 1 Jan 2020
Externally publishedYes
Event16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020 - Pisa, Italy
Duration: 9 Sep 202010 Sep 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12503 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020
Country/TerritoryItaly
CityPisa
Period9/09/2010/09/20

Keywords

  • Byzantine faults
  • Dispersion
  • Distributed algorithm
  • Faulty robots
  • Mobile robots
  • Rings

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots'. Together they form a unique fingerprint.

Cite this