โ Scribed by Magnรบs M. Halldรณrsson (auth.), Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide (eds.)
No coin nor oath required. For personal study only.
This book constitutes the proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2013, held in Sophia Antipolis, France, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.
Front Matter....Pages I-X
Modeling Reality Algorithmically: The Case of Wireless Communication....Pages 1-5
Autonomous Mobile Robots: A Distributed Computing Perspective....Pages 6-21
Token Dissemination in Geometric Dynamic Networks....Pages 22-34
The Wake Up Dominating Set Problem....Pages 35-50
Reconfiguring Massive Particle Swarms with Limited, Global Control....Pages 51-66
Polygon-Constrained Motion Planning Problems....Pages 67-82
Fast Localized Sensor Self-Deployment for Focused Coverage....Pages 83-94
Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration....Pages 95-110
Data Delivery by Energy-Constrained Mobile Agents....Pages 111-122
Counting in Anonymous Dynamic Networks: An Experimental Perspective....Pages 123-138
Station Assignment with Applications to Sensing....Pages 139-154
On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model....Pages 155-169
The Effect of Forgetting on the Performance of a Synchronizer....Pages 170-184
On the Complexity of Barrier Resilience for Fat Regions....Pages 185-200
A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks....Pages 201-216
Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes....Pages 217-227
On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks....Pages 228-243
Optimal Nearest Neighbor Queries in Sensor Networks....Pages 244-259
Conflict Graphs and the Capacity of the Mean Power Scheme....Pages 260-277
Rendezvous of Two Robots with Visible Bits....Pages 278-290
Back Matter....Pages 291-306
....Pages 307-307
Algorithm Analysis and Problem Complexity; Computer Communication Networks; Mathematics of Computing
๐ SIMILAR VOLUMES
<p><p>This book constitutes thoroughly refereed and revised selected papers from the 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, held in Wroclaw, Poland, on September 12, 2014.</p><p>The 10 papers presen
<p><p>This book constitutes revised selected papers from the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, held in Vienna, in September 2017.</p><p>The 17 full papers presented in this volume were carefully reviewed and selected from 30 su
<p><p></p><p>This book constitutes revised selected papers from the 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, held in Munich, Germany, in September 2019.</p><p>The 11 full papers presented in this volume were carefully reviewed and sel
<p><p>This book constitutes revised selected papers from the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, held in Patras, Greece, in September 2015.<br>The 16 full papers presented in this volume were carefully reviewed and selected from
<p>This book constitutes revised selected papers from the 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, held in Helsinki, Finland, in August 2018.The 15 full papers presented in this volume were carefully reviewed and selected from 39 subm