1 option
Algorithms for Sensor Systems : 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers / edited by Seth Gilbert, Danny Hughes, Bhaskar Krishnamachari.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Computer communication networks and telecommunications 2945-9184 ; SL 5, 11410
- Computer Communication Networks and Telecommunications, 2945-9184 ; 11410
- Language:
- English
- Subjects (All):
- Algorithms.
- Artificial intelligence-Data processing.
- Computer science-Mathematics.
- Discrete mathematics.
- Artificial intelligence.
- Data Science.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Local Subjects:
- Algorithms.
- Data Science.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (X, 235 pages) : 66 illustrations, 47 illustrations in color.
- Edition:
- 1st ed. 2019.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2019.
- System Details:
- text file PDF
- Summary:
- This book constitutes revised selected papers from the 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, held in Helsinki, Finland, in August 2018. The 15 full papers presented in this volume were carefully reviewed and selected from 39 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis.
- Contents:
- Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks
- Competitive Routing in Hybrid Communication Networks
- On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint
- On the Maximum Connectivity Improvement problem
- Average Case - Worst Case Tradeoffs for Evacuating 2 Robots from the Disk in the Face-to-Face Model
- Mutual Visibility by Asynchronous Robots on Infinite Grid
- Optimal Gathering by Asynchronous Oblivious Robots in Hypercubes
- Barrier Coverage Problem in 2D
- Time- and Energy-aware Task Scheduling in Environmentally-powered Sensor Networks
- Mobility-Aware, Adaptive Algorithms for Wireless Power Transfer in Ad Hoc Networks
- Distributed leader election and computation of local identifiers for programmable matter
- Reaching Consensus in Ad-Hoc Diffusion Networks
- Filling Arbitrary Connected Areas by Silent Robots with Minimum Visibility Range
- BSLoc: Base Station ID-based Telco Outdoor Localization
- Orientation Estimation using Filter-Based Inertial Data Fusion for Posture Recognition.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-14094-6
- 9783030140946
- 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.