Distributed Computing by Mobile Entities
Title | Distributed Computing by Mobile Entities PDF eBook |
Author | Paola Flocchini |
Publisher | Springer |
Pages | 686 |
Release | 2019-01-12 |
Genre | Computers |
ISBN | 3030110729 |
Distributed Computing by Mobile Entities is concerned with the study of the computational and complexity issues arising in systems of decentralized computational entities operating in a spatial universe Encompassing and modeling a large variety of application environments and systems, from robotic swarms to networks of mobile sensors, from software mobile agents in communication networks to crawlers and viruses on the web, the theoretical research in this area intersects distributed computing with the fields of computational geometry (especially for continuous spaces), control theory, graph theory and combinatorics (especially for discrete spaces). The research focus is on determining what tasks can be performed by the entities, under what conditions, and at what cost. In particular, the central question is to determine what minimal hypotheses allow a given problem to be solved. This book is based on the lectures and tutorial presented at the research meeting on “Moving and Computing" (mac) held at La Maddalena Island in June 2017. Greatly expanded, revised and updated, each of the lectures forms an individual Chapter. Together, they provide a map of the current knowledge about the boundaries of distributed computing by mobile entities.
Distributed Computing by Oblivious Mobile Robots
Title | Distributed Computing by Oblivious Mobile Robots PDF eBook |
Author | Paola Flocchini |
Publisher | Morgan & Claypool Publishers |
Pages | 188 |
Release | 2012 |
Genre | Computers |
ISBN | 1608456862 |
The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions
Distributed Computing by Oblivious Mobile Robots
Title | Distributed Computing by Oblivious Mobile Robots PDF eBook |
Author | Paola Flocchini |
Publisher | Springer Nature |
Pages | 179 |
Release | 2022-06-01 |
Genre | Computers |
ISBN | 3031020081 |
The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities located and able to move in a spatial universe; they operate without explicit communication and are usually unable to remember the past; they are extremely simple, with limited resources, and individually quite weak. However, collectively the robots are capable of performing complex tasks, and form a system with desirable fault-tolerant and self-stabilizing properties. The research has been concerned with the computational aspects of such systems. In particular, the focus has been on the minimal capabilities that the robots should have in order to solve a problem. This book focuses on the recent algorithmic results in the field of distributed computing by oblivious mobile robots (unable to remember the past). After introducing the computational model with its nuances, we focus on basic coordination problems: pattern formation, gathering, scattering, leader election, as well as on dynamic tasks such as flocking. For each of these problems, we provide a snapshot of the state of the art, reviewing the existing algorithmic results. In doing so, we outline solution techniques, and we analyze the impact of the different assumptions on the robots' computability power. Table of Contents: Introduction / Computational Models / Gathering and Convergence / Pattern Formation / Scatterings and Coverings / Flocking / Other Directions
Mobile Agents in Networking and Distributed Computing
Title | Mobile Agents in Networking and Distributed Computing PDF eBook |
Author | Jiannong Cao |
Publisher | John Wiley & Sons |
Pages | 352 |
Release | 2012-07-11 |
Genre | Technology & Engineering |
ISBN | 1118135601 |
The book focuses on mobile agents, which are computer programs that can autonomously migrate between network sites. This text introduces the concepts and principles of mobile agents, provides an overview of mobile agent technology, and focuses on applications in networking and distributed computing.
Algorithms for Sensor Systems
Title | Algorithms for Sensor Systems PDF eBook |
Author | Cristina M. Pinotti |
Publisher | Springer Nature |
Pages | 195 |
Release | 2020-10-27 |
Genre | Computers |
ISBN | 3030624013 |
This book constitutes revised selected papers from the 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, held in Pisa, Italy*, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 27 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. *The conference was held virtually due to the COVID-19 pandemic.
Distributed Computing in Sensor Systems
Title | Distributed Computing in Sensor Systems PDF eBook |
Author | James Aspnes |
Publisher | Springer |
Pages | 430 |
Release | 2007-07-05 |
Genre | Computers |
ISBN | 3540730907 |
This book constitutes the refereed proceedings of the Third International Conference on Distributed Computing in Sensor Systems, DCOSS 2007, held in Sante Fe, NM, USA in June 2007. It covers algorithms, applications, and systems. It bridges the gap between theory and practice and between the broader field of distributed computing and the specific issues arising in sensor networks and related systems.
Combinatorial Algorithms
Title | Combinatorial Algorithms PDF eBook |
Author | Adele Anna Rescigno |
Publisher | Springer Nature |
Pages | 557 |
Release | |
Genre | |
ISBN | 3031630211 |