Blick ins Buch

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

Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide (Herausgeber)

Buch | Softcover

X, 307 Seiten

2014
Springer Berlin (Verlag)
978-3-642-45345-8 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

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.

Erscheint lt. Verlag	7.1.2014
Reihe/Serie	Computer Communication Networks and Telecommunications
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	X, 307 p. 91 illus.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	492 g
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Algorithm analysis and problem complexity • approximation algorithms • Dynamic Networks • Mobile Robots • sensor calibration • wireless ad-hoc networks
ISBN-10	3-642-45345-7 / 3642453457
ISBN-13	978-3-642-45345-8 / 9783642453458
Zustand	Neuware