Algorithmic Aspects of Wireless Sensor Networks [electronic resource] : Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers / edited by Sándor P. Fekete.

Contributor(s): Fekete, Sándor P [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 5389Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Description: online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540928621Subject(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Computational complexity | Information systems | Computer Science | Computer Communication Networks | Information Systems and Communication Service | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Data StructuresAdditional physical formats: Printed edition:: No titleDDC classification: 004.6 LOC classification: TK5105.5-5105.9Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK8377

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.

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha