Algorithmic Aspects of Wireless Sensor Networks  Third International Workshop, ALGOSENSORS 2007, Wroclaw, Poland, July 14, 2007, Revised Selected Papers /  [electronic resource] : 
edited by Miroslaw Kutylowski, Jacek Cichon, Przemylsaw Kubiak. 
 - 1st ed. 2008. 
 - X, 166 p.  online resource. 
 - Computer Communication Networks and Telecommunications,  4837  2945-9184 ; .
 - Computer Communication Networks and Telecommunications,  4837 .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783540778714 
<br/><br/><label>Standard No.: </label>10.1007/978-3-540-77871-4  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer networks .<br/>Algorithms.<br/>Artificial intelligence--Data processing.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Computer Communication Networks.<br/>Algorithms.<br/>Data Science.<br/>Discrete Mathematics in Computer Science.
<br/><br/><label>LC Class. No.: </label>TK5105.5-5105.9 
<br/><br/><label>Dewey Class. No.: </label>004.6