Algorithms for Sensor Systems - 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, Patras, Greece, September 17-18, 2015, Revised Selected Papers

This bookconstitutes revised selected papers from the 11th International Symposium onAlgorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, heldin Patras, Greece, in September 2015.
The 16 fullpapers presented in this volume were carefully reviewed and selected from 30submissions. The deal with algorithms analysis and problem complexity; computercommunication networks; computation by abstract devices; and mathematics ofcomputing. 

List of contents

Plane and Planarity Thresholds for Random GeometricGraphs.- Connectivity of a dense mesh of randomly oriented directional antennasunder a realistic fading model.- Maintaining Intruder Detection Capability in aRectangular Domain with Sensors.- The Weakest Oracle for Symmetric Consensus inPopulation Protocols.- Exact and Approximation Algorithms for Data MuleScheduling in a Sensor Network.- Limitations of Current Wireless SchedulingAlgorithms.- Deterministic rendezvous with detection using beeps.- Minimizingtotal sensor movement for barrier coverage by non-uniform sensors on a line.- Acomprehensive and lightweight security architecture to secure the IoTthroughout the lifecycle of a device based on HIMMO.- Maximizing Throughput inEnergy-Harvesting Sensor Nodes.- On verifying and maintaining connectivity ofinterval temporal networks.- Beachcombing on Strips and Islands.- RadioAggregation Scheduling.- Gathering of Robots on Meeting-Points.- MutualVisibility with an Optimal Number of Colors.- Mobile Agents Rendezvous in spiteof a Malicious Agent.
 

Summary

This book
constitutes revised selected papers from the 11th International Symposium on
Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, held
in Patras, Greece, in September 2015.
The 16 full
papers presented in this volume were carefully reviewed and selected from 30
submissions. The deal with algorithms analysis and problem complexity; computer
communication networks; computation by abstract devices; and mathematics of
computing. 

Product details

• Assisted by: Prosenjit Bose (Editor), Leszek Antoni G¿sieniec (Editor), Leszek Antoni Gasieniec (Editor), Leszek Antoni Gąsieniec (Editor), Kay Römer (Editor), Roger Wattenhofer (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 03.02.2016
• EAN: 9783319284712
• ISBN: 978-3-31-928471-2
• No. of pages: 225
• Dimensions: 156 mm x 235 mm x 13 mm
• Weight: 371 g
• Illustrations: XIV, 225 p. 19 illus. in color.
• Series: Lecture Notes in Computer Science; Computer Communication Networks and Telecommunications
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics; C, Künstliche Intelligenz, Algorithms, Artificial Intelligence, angewandte informatik, Netzwerk-Hardware, Theoretische Informatik, Mathematik für Informatiker, computer science, Information Retrieval, Information Systems Applications (incl. Internet), Theory of Computation, Computer and Information Systems Applications, Application software, Computer Communication Networks, Mathematics of Computing, Computers, Mathematical theory of computation, Computer science—Mathematics, Maths for computer scientists, Internet searching, Algorithm Analysis and Problem Complexity, Computer communication systems, Network hardware, Computation by Abstract Devices