Algorithms for Sensor Systems 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers / [electronic resource] : edited by Jie Gao, Alon Efrat, S�andor P. Fekete, Yanyong Zhang. - XI, 169 p. 43 illus. online resource. - Lecture Notes in Computer Science, 8847 0302-9743 ; . - Lecture Notes in Computer Science, 8847 .

Robot Planning -- The Multi-source Beachcombers Problem -- Multi-Robot Foremost Coverage of Time-Varying Graphs -- Strategies for Parallel Unaware Cleaners -- Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points -- Algorithms and Data Structures on Graphs Fast Rendezvous with Advice -- Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard -- Improved Spanners in Networks with Symmetric Directional Antennas -- Wireless Networks -- Exploiting Geometry in the SINRk Model -- Interference Minimization in Asymmetric Sensor Networks -- Minimum Latency Aggregation Scheduling in Wireless Sensor Networks.

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.   The 10 papers presented in this volume were carefully reviewed and selected from 20 submissions. They are organized in topical sections named: robot planning; algorithms and data structures on graphs; and wireless networks.

9783662460184

10.1007/978-3-662-46018-4 doi


Computer science.
Computer communication systems.
Algorithms.
Computer science--Mathematics.
Artificial intelligence.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Mathematics of Computing.
Artificial Intelligence (incl. Robotics).

QA76.9.A43

005.1