Algorithmic Aspects of Wireless Sensor Networks

This book constitutes the reviewed proceedings of the Fourth International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2008, held in Reykjavik, Iceland, Wroclaw, Poland, July 12, 2008. The workshops aimed at bringing together research contributions related to diverse algorithmic and complexity-theoretic aspects of wireless sensor networks. The topics include but are not limited to optimization problems, noise and probability, robots and tours.

Inhalt
Algorithms for Sensor Networks: What Is It Good for?.- Tight Local Approximation Results for Max-Min Linear Programs.- Minimizing Average Flow Time in Sensor Data Gathering.- Target Counting under Minimal Sensing: Complexity and Approximations.- Efficient Scheduling of Data-Harvesting Trees.- Link Scheduling in Local Interference Models.- Algorithms for Location Estimation Based on RSSI Sampling.- Random Fault Attack against Shrinking Generator.- Probabilistic Protocols for Fair Communication in Wireless Sensor Networks.- Simple Robots in Polygonal Environments: A Hierarchy.- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments.- Optimal Backlog in the Plane.