- ホーム
- > 洋書
- > 英文書
- > Computer / General
Full Description
This book
constitutes revised selected papers from the 11th International Symposium on
Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, held
in Patras, Greece, in September 2015.
The 16 full
papers presented in this volume were carefully reviewed and selected from 30
submissions. The deal with algorithms analysis and problem complexity; computer
communication networks; computation by abstract devices; and mathematics of
computing.
Contents
Plane and Planarity Thresholds for Random Geometric
Graphs.- Connectivity of a dense mesh of randomly oriented directional antennas
under a realistic fading model.- Maintaining Intruder Detection Capability in a
Rectangular Domain with Sensors.- The Weakest Oracle for Symmetric Consensus in
Population Protocols.- Exact and Approximation Algorithms for Data Mule
Scheduling in a Sensor Network.- Limitations of Current Wireless Scheduling
Algorithms.- Deterministic rendezvous with detection using beeps.- Minimizing
total sensor movement for barrier coverage by non-uniform sensors on a line.- A
comprehensive and lightweight security architecture to secure the IoT
throughout the lifecycle of a device based on HIMMO.- Maximizing Throughput in
Energy-Harvesting Sensor Nodes.- On verifying and maintaining connectivity of
interval temporal networks.- Beachcombing on Strips and Islands.- Radio
Aggregation Scheduling.- Gathering of Robots on Meeting-Points.- Mutual
Visibility with an Optimal Number of Colors.- Mobile Agents Rendezvous in spite
of a Malicious Agent.
-
- 和書
- いっと 27