Algorithmic Aspects of Wireless Sensor Networks : Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers / edited by Sandor P. Fekete.

Format:

Book

Contributor:

Fekete, Sandor P., editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Computer communication networks and telecommunications ; SL 5, 5389.

Computer Communication Networks and Telecommunications ; 5389

Language:

English

Subjects (All):

Computer networks.

Computer programming.

Computers.

Algorithms.

Computer science--Mathematics.

Computer science.

Data structures (Computer science).

Computer Communication Networks.

Programming Techniques.

Information Systems and Communication Service.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Local Subjects:

Computer Communication Networks.

Programming Techniques.

Information Systems and Communication Service.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Data Structures.

Physical Description:

1 online resource (XI, 151 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

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.

Contents:

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.

Other Format:

Printed edition:

ISBN:

978-3-540-92862-1

9783540928621

Access Restriction:

Restricted for use by site license.