Distributed Systems and Mobile Computing

• Other Authors: Viglietta, Giovanni (Editor)
• Format: Electronic Book Chapter
• Language: English
• Published: Basel MDPI - Multidisciplinary Digital Publishing Institute 2022
• Subjects: History of engineering & technology; evacuation; disk; face-to-face model; average-case analysis; arrival time; bike; line; robots; search; speed; optimal trajectory; Internet of Things; dense networks; LPWAN; LoRa; clustering; throughput; capacity; QoS; population protocol; distributed network construction; polylogarithmic time protocol; spanning tree; regular network; partial characterisation; distributed algorithms; mobile robots; classic oblivious robot model; gathering; time complexity; visibility; connectivity
• Online Access: DOAB: download the publication; DOAB: description of the publication

The book is about Distributed Systems and Mobile Computing. This is a branch of Computer Science devoted to the study of systems whose components are in different physical locations and have limited communication capabilities. Such components may be static, often organized in a network, or may be able to move in a discrete or continuous environment. The theoretical study of such systems has applications ranging from swarms of mobile robots (e.g., drones) to sensor networks, autonomous intelligent vehicles, the Internet of Things, and crawlers on the Web. The book includes five articles. Two of them are about networks: the first one studies the formation of networks by agents that interact randomly and have the ability to form connections; the second one is a study of clustering models and algorithms. The three remaining articles are concerned with autonomous mobile robots operating in continuous space. One article studies the classical gathering problem, where all robots have to reach a common location, and proposes a fast algorithm for robots that are endowed with a compass but have limited visibility. The last two articles deal with the evacuations problem, where two robots have to locate an exit point and evacuate a region in the shortest possible time.