Algorithms for Sensor Systems

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.

Includes supplementary material: sn.pub/extras

Inhalt
Modeling Reality Algorithmically: The Case of Wireless Communication.- Autonomous Mobile Robots: A Distributed Computing.- Token Dissemination in Geometric Dynamic Networks.- The Wake Up Dominating Set.- Reconfiguring Massive Particle Swarms with Limited, Global Control.- Polygon-Constrained motion planning problems.- Fast Localized Sensor Self-Deployment for Focused Coverage.- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration.- Data-Delivery by Energy-Constrained Mobile Robots.- Approximation Bounds for the Minimum k-Storage Problem.- Counting in Anonymous Dynamic Networks: An Experimental Perspective.- Station Assignment with Applications to Sensing.- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.- The Effect of Forgetting on the Performance of a Synchronizer.- On the Complexity of Barrier Resilience for Fat Regions.- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes.- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks.- Optimal Nearest Neighbor Queries in Sensor Networks.- Conflict Graphs and the Capacity of the Mean Power Scheme.- Rendezvous of Two Robots with Visible Bits.