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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gilbert, Seth (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Hughes, Danny (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Krishnamachari, Bhaskar (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Computer Communication Networks and Telecommunications ; 11410
• Θέματα: Algorithms.; Data structures (Computer science).; Computer science-Mathematics.; Artificial intelligence.; Algorithm Analysis and Problem Complexity.; Data Structures.; Discrete Mathematics in Computer Science.; Artificial Intelligence.

 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. 

 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.