Algorithmics of Wireless Networks
18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings
Published on 13. December 2022
Book
Paperback/Softback
IX, 153 pages
978-3-031-22049-4 (ISBN)
Description
This book constitutes the refereed proceedings of the 18th International Symposium on Algorithmics of Wireless Network, ALGOSENSORS 2022, which took place in Potsdam, Germany in September 2022.
The 10 full papers presented in this volume were carefully reviewed and selected from 21 submissions. ALGOSENSORS is an international symposium dedicated to algorithmic aspects of wireless networks.
The 10 full papers presented in this volume were carefully reviewed and selected from 21 submissions. ALGOSENSORS is an international symposium dedicated to algorithmic aspects of wireless networks.
More details
Series
Edition
1st ed. 2022
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
16 farbige Abbildungen, 18 s/w Abbildungen
IX, 153 p. 34 illus., 16 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 10 mm
Weight
260 gr
ISBN-13
978-3-031-22049-4 (9783031220494)
DOI
10.1007/978-3-031-22050-0
Schweitzer Classification
Other editions
Additional editions
Thomas Erlebach | Michael Segal
Algorithmics of Wireless Networks
18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings
E-Book
12/2022
Springer
€58.84
Available for download
Content
On Geometric Shape Construction via Growth Operations.- Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.- Blackout-tolerant Temporal Spanners.- Molecular robots with chirality on grids.- Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes.- Triangle Evacuation of 2 Agents in the Wireless Model.- Resource time-sharing for IoT applications with deadlines.- Fault-Tolerant Graph Realizations in the Congested Clique.- The Complexity of Growing a Graph.- Dispersing Facilities on Planar Segment and Circle Amidst Repulsion.