Cantitate/Preț
Produs
Total produse
Vezi coșul
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 de Prosenjit Bose

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: Lecture Notes in Computer Science, cartea 9536

Editat de Prosenjit Bose, Leszek Antoni Gąsieniec, Kay Römer, Roger Wattenhofer
en Limba Engleză Paperback – 3 feb 2016
This bookconstitutes revised selected papers from the 11th International Symposium onAlgorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, heldin Patras, Greece, in September 2015.
The 16 fullpapers presented in this volume were carefully reviewed and selected from 30submissions. The deal with algorithms analysis and problem complexity; computercommunication networks; computation by abstract devices; and mathematics ofcomputing. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31705 lei

Preț vechi: 39631 lei
-20%

Puncte Express: 476
Preț estimativ în valută:
5605€ • 6683$ • 4861£

Carte tipărită la comandă

Livrare economică 16-30 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319284712
ISBN-10: 3319284711
Pagini: 225
Ilustrații: XIV, 225 p. 19 illus. in color.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 kg
Ediția:1st ed. 2015
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Plane and Planarity Thresholds for Random GeometricGraphs.- Connectivity of a dense mesh of randomly oriented directional antennasunder a realistic fading model.- Maintaining Intruder Detection Capability in aRectangular Domain with Sensors.- The Weakest Oracle for Symmetric Consensus inPopulation Protocols.- Exact and Approximation Algorithms for Data MuleScheduling in a Sensor Network.- Limitations of Current Wireless SchedulingAlgorithms.- Deterministic rendezvous with detection using beeps.- Minimizingtotal sensor movement for barrier coverage by non-uniform sensors on a line.- Acomprehensive and lightweight security architecture to secure the IoTthroughout the lifecycle of a device based on HIMMO.- Maximizing Throughput inEnergy-Harvesting Sensor Nodes.- On verifying and maintaining connectivity ofinterval temporal networks.- Beachcombing on Strips and Islands.- RadioAggregation Scheduling.- Gathering of Robots on Meeting-Points.- MutualVisibility with an Optimal Number of Colors.- Mobile Agents Rendezvous in spiteof a Malicious Agent.
 

Caracteristici

Includes supplementary material: sn.pub/extras