Algorithms for Sensor Systems : 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, Algosensors 2015, Patras, Gree
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9783319284712
- ISBN-10: 3319284711
- Publisher: Springer
- Publish Date: February 2016
- Dimensions: 9.21 x 6.14 x 0.51 inches
- Shipping Weight: 0.75 pounds
- Page Count: 225
Related Categories
