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...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences Vol. 574; pp. 111 - 132
Main Authors: Cicerone, Serafino, Di Stefano, Gabriele, Navarra, Alfredo
Format: Journal Article
Language:English
Published: Elsevier Inc 01.10.2021
Subjects:
Asynchrony
Distributed algorithms
Mobile entities
Pattern formation
Pattern formation
68Q25
Mobile entities
Asynchrony
68W15
Distributed algorithms
68Q10
ISSN:0020-0255, 1872-6291
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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