A structured methodology for designing distributed algorithms for mobile entities

Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algorithms and the writing of the required correctness...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 574; s. 111 - 132
Hlavní autoři: Cicerone, Serafino, Di Stefano, Gabriele, Navarra, Alfredo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.10.2021
Témata:
Asynchrony
Distributed algorithms
Mobile entities
Pattern formation
Pattern formation
68Q25
Mobile entities
Asynchrony
68W15
Distributed algorithms
68Q10
ISSN:0020-0255, 1872-6291
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algorithms and the writing of the required correctness proofs. We would encourage the usage of a common framework in order to help both algorithm designers and reviewers in the intricate work of delivering and analyzing the proposed resolution strategies. We demonstrate the effectiveness and usefulness of the new methodology by highlighting various peculiarities arising in different scenarios. In particular, we consider two different tasks for asynchronous entities moving in the Euclidean plane and in graphs, respectively. We show how two resolution strategies have been designed by following the accurate guide dictated by the methodology. Furthermore, we also show how the corresponding correctness proofs are obtained.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2021.05.043