Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers

Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers

ISBN-10:
3030344045
ISBN-13:
9783030344047
Pub. Date:
11/19/2019
Publisher:
Springer International Publishing
ISBN-10:
3030344045
ISBN-13:
9783030344047
Pub. Date:
11/19/2019
Publisher:
Springer International Publishing
Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers

Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

This book constitutes revised selected papers from the 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, held in Munich, Germany, in September 2019.

The 11 full papers presented in this volume were carefully reviewed and selected from 16 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks.


Product Details

ISBN-13: 9783030344047
Publisher: Springer International Publishing
Publication date: 11/19/2019
Series: Lecture Notes in Computer Science , #11931
Edition description: 1st ed. 2019
Pages: 207
Product dimensions: 6.10(w) x 9.25(h) x (d)

Table of Contents

Mobility Management.- Evacuation of equilateral triangles by mobile agents of limited communication range.- Fast Dispersion of Mobile Robots on Arbitrary Graphs.- Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter.- Foundations.- Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property.- Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography.- Reception Capacity: Definitions, Game Theory and Hardness.- Wireless Communication.- Collaborative Broadcast in O(log log n) Rounds.- Multi-Channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications.- Throughput and Packet Displacements of Dynamic Broadcasting Algorithms.- Faulty Robots.- Chauffeuring a Crashed Robot from a Disk.- Optimal Cycle Search Despite the Presence of Faulty Robots.

From the B&N Reads Blog

Customer Reviews