Algorithmic Aspects of Wireless Sensor Networks Third International Workshop, ALGOSENSORS 2007, Wroclaw, Poland, July 14, 2007, Revised Selected Papers / [electronic resource] :
edited by Mirosław Kutyłowski, Jacek Cichoń, Przemysław Kubiak.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
- X, 166 p. online resource.
- Lecture Notes in Computer Science, 4837 0302-9743 ; .
- Lecture Notes in Computer Science, 4837 .
Algorithmic Challenges for Sensor Networks – Foreword to ALGOSENSORS 2007 -- Topology and Routing in Sensor Networks -- Codes for Sensors: An Algorithmic Perspective -- Efficient Sensor Network Design for Continuous Monitoring of Moving Objects -- Counting Targets with Mobile Sensors in an Unknown Environment -- Asynchronous Training in Wireless Sensor Networks -- Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol -- Analysis of the Bounded-Hops Converge-Cast Distributed Protocol in Ad-Hoc Networks -- Correlation, Coding, and Cooperation in Wireless Sensor Networks -- Local Approximation Algorithms for Scheduling Problems in Sensor Networks -- Assigning Sensors to Missions with Demands -- Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms -- Counting-Sort and Routing in a Single Hop Radio Network -- Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks.
9783540778714
10.1007/978-3-540-77871-4 doi
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Computational complexity.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Data Structures.
Discrete Mathematics in Computer Science.
QA76.9.A43
005.1
Algorithmic Challenges for Sensor Networks – Foreword to ALGOSENSORS 2007 -- Topology and Routing in Sensor Networks -- Codes for Sensors: An Algorithmic Perspective -- Efficient Sensor Network Design for Continuous Monitoring of Moving Objects -- Counting Targets with Mobile Sensors in an Unknown Environment -- Asynchronous Training in Wireless Sensor Networks -- Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol -- Analysis of the Bounded-Hops Converge-Cast Distributed Protocol in Ad-Hoc Networks -- Correlation, Coding, and Cooperation in Wireless Sensor Networks -- Local Approximation Algorithms for Scheduling Problems in Sensor Networks -- Assigning Sensors to Missions with Demands -- Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms -- Counting-Sort and Routing in a Single Hop Radio Network -- Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks.
9783540778714
10.1007/978-3-540-77871-4 doi
Computer science.
Computer Communication Networks.
Data structures (Computer science).
Computer software.
Computational complexity.
Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Communication Networks.
Data Structures.
Discrete Mathematics in Computer Science.
QA76.9.A43
005.1