1 option
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 / edited by Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Computer communication networks and telecommunications ; SL 5, 9536.
- Computer Communication Networks and Telecommunications ; 9536
- Language:
- English
- Subjects (All):
- Algorithms.
- Computers.
- Computer networks.
- Computer science--Mathematics.
- Computer science.
- Artificial intelligence.
- Application software.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Computer Communication Networks.
- Mathematics of Computing.
- Artificial Intelligence.
- Information Systems Applications (incl. Internet).
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Computer Communication Networks.
- Mathematics of Computing.
- Artificial Intelligence.
- Information Systems Applications (incl. Internet).
- Physical Description:
- 1 online resource (XIV, 225 pages) : 19 illustrations in color.
- Edition:
- First edition 2015.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- 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. .
- Contents:
- Plane and Planarity Thresholds for Random Geometric Graphs
- Connectivity of a dense mesh of randomly oriented directional antennas under a realistic fading model
- Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors
- The Weakest Oracle for Symmetric Consensus in Population Protocols
- Exact and Approximation Algorithms for Data Mule Scheduling in a Sensor Network
- Limitations of Current Wireless Scheduling Algorithms
- Deterministic rendezvous with detection using beeps
- Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line
- A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO
- Maximizing Throughput in Energy-Harvesting Sensor Nodes
- On verifying and maintaining connectivity of interval temporal networks
- Beachcombing on Strips and Islands
- Radio Aggregation Scheduling
- Gathering of Robots on Meeting-Points
- Mutual Visibility with an Optimal Number of Colors
- Mobile Agents Rendezvous in spite of a Malicious Agent. .
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-28472-9
- 9783319284729
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.