Algorithms for Sensor Systems

1. Front Matter

   Pages I-X

   PDF

2. Modeling Reality Algorithmically: The Case of Wireless Communication

   • Magnús M. Halldórsson

   Pages 1-5

3. Autonomous Mobile Robots: A Distributed Computing Perspective

   • Giuseppe Prencipe

   Pages 6-21

4. Token Dissemination in Geometric Dynamic Networks

   • Sebastian Abshoff, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, Friedhelm Meyer auf der Heide

   Pages 22-34

5. The Wake Up Dominating Set Problem

   • Amir Bannoura, Christian Ortolf, Christian Schindelhauer, Leonhard Reindl

   Pages 35-50

6. Reconfiguring Massive Particle Swarms with Limited, Global Control

   • Aaron Becker, Erik D. Demaine, Sándor P. Fekete, Golnaz Habibi, James McLurkin

   Pages 51-66

7. Polygon-Constrained Motion Planning Problems

   • Davide Bilò, Yann Disser, Luciano Gualà, Matúš Mihal’ák, Guido Proietti, Peter Widmayer

   Pages 67-82

8. Fast Localized Sensor Self-Deployment for Focused Coverage

   • László Blázovics, Tamás Lukovszki

   Pages 83-94

9. Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration

   • Simon Burgess, Yubin Kuang, Johannes Wendeberg, Kalle Åström, Christian Schindelhauer

   Pages 95-110

10. Data Delivery by Energy-Constrained Mobile Agents

    • Jérémie Chalopin, Shantanu Das, Matúš Mihal’ák, Paolo Penna, Peter Widmayer

    Pages 111-122

11. Approximation Bounds for the Minimum \(k\)-Storage Problem

    • Gianlorenzo D’Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti

    Pages 123-138

12. Counting in Anonymous Dynamic Networks: An Experimental Perspective

    • Giuseppe Antonio Di Luna, Silvia Bonomi, Ioannis Chatzigiannakis, Roberto Baldoni

    Pages 139-154

13. Station Assignment with Applications to Sensing

    • Antonio Fernández Anta, Dariusz R. Kowalski, Miguel A. Mosteiro, Prudence W. H. Wong

    Pages 155-169

14. On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model

    • Fabian Fuchs, Dorothea Wagner

    Pages 170-184

15. The Effect of Forgetting on the Performance of a Synchronizer

    • Matthias Függer, Alexander Kößler, Thomas Nowak, Ulrich Schmid, Martin Zeiner

    Pages 185-200

16. On the Complexity of Barrier Resilience for Fat Regions

    • Matias Korman, Maarten Löffler, Rodrigo I. Silveira, Darren Strash

    Pages 201-216

17. A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks

    • Christine Markarian, Friedhelm Meyer auf der Heide, Michael Schubert

    Pages 217-227

18. Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes

    • Eduardo Mesa Barrameda, Shantanu Das, Nicola Santoro

    Pages 228-243

19. On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks

    • Avery Miller

    Pages 244-259

20. Optimal Nearest Neighbor Queries in Sensor Networks

    • Gokarna Sharma, Costas Busch

    Pages 260-277

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.

• approximation algorithms
• dynamic networks
• mobile robots
• sensor calibration
• wireless ad-hoc networks
• algorithm analysis and problem complexity

• University of Ottawa, Ottawa, Canada

  Paola Flocchini

• Stony Brook University, Stonybrook, USA

  Jie Gao

• School of Computer Science, Carleton University, Ottawa, Canada

  Evangelos Kranakis

• University of Paderborn, Paderborn, Germany

  Friedhelm Meyer auf der Heide

Policies and ethics