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

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Computer Communication Networks and Telecommunications ; 11410 | SpringerLink BücherVerlag: Cham : Springer International Publishing, 2019Beschreibung: Online-Ressource (X, 235 p. 66 illus., 47 illus. in color, online resource)ISBN:

9783030140946

Schlagwörter:

Andere physische Formen: 9783030140939 | 9783030140953 | Erscheint auch als: 978-3-030-14093-9 Druck-Ausgabe | Printed edition: 9783030140939 | Printed edition: 9783030140953 DDC-Klassifikation:

005.1
518.1 23

MSC: MSC: *68-06 | 68Mxx | 68T40 | 00B25LOC-Klassifikation:

QA76.9.A43

DOI: DOI: 10.1007/978-3-030-14094-6Online-Ressourcen:

Zusammenfassung: 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 analysisZusammenfassung: 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 RecognitionPPN: PPN: 1067368019Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB

Exemplare ( 0 )
Titelinformationen ( 1 )

Dieser Titel hat keine Exemplare

Reproduktion. (Springer eBook Collection. Computer Science)