Algorithms for Sensor Systems
9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
Erschienen am 7. Januar 2014
Buch
Softcover
X, 307 Seiten
978-3-642-45345-8 (ISBN)
Beschreibung
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.
Weitere Details
Reihe
Auflage
2013 ed.
Sprache
Englisch
Verlagsort
Berlin
Deutschland
Verlagsgruppe
Springer Berlin
Zielgruppe
Für Beruf und Forschung
Research
Illustrationen
91 s/w Abbildungen
X, 307 p. 91 illus.
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 18 mm
Gewicht
487 gr
ISBN-13
978-3-642-45345-8 (9783642453458)
DOI
10.1007/978-3-642-45346-5
Schweitzer Klassifikation
Weitere Ausgaben
Andere Ausgaben
Paola Flocchini | Jie Gao | Evangelos Kranakis
Algorithms for Sensor Systems
9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
E-Book
12/2013
Springer
53,49 €
Als Download verfügbar
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.