LEADER 03885nam 22008055 450 001 9910483397403321 005 20251226202436.0 010 $a3-540-92862-6 024 7 $a10.1007/978-3-540-92862-1 035 $a(CKB)1000000000545771 035 $a(SSID)ssj0000316150 035 $a(PQKBManifestationID)11273108 035 $a(PQKBTitleCode)TC0000316150 035 $a(PQKBWorkID)10274967 035 $a(PQKB)11222592 035 $a(DE-He213)978-3-540-92862-1 035 $a(MiAaPQ)EBC3063885 035 $a(MiAaPQ)EBC6806066 035 $a(Au-PeEL)EBL6806066 035 $a(OCoLC)827361597 035 $a(PPN)132861933 035 $a(EXLCZ)991000000000545771 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Aspects of Wireless Sensor Networks $eFourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers /$fedited by Sandor P. Fekete 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XI, 151 p.) 225 1 $aComputer Communication Networks and Telecommunications,$x2945-9184 ;$v5389 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-92861-8 320 $aIncludes bibliographical references and index. 327 $aAlgorithms 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. 330 $aThis 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. 410 0$aComputer Communication Networks and Telecommunications,$x2945-9184 ;$v5389 606 $aComputer networks 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aComputer Communication Networks 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer networks. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aComputer Communication Networks. 615 24$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a681.2 702 $aFekete$b Sandor P. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483397403321 996 $aAlgorithmic Aspects of Wireless Sensor Networks$9772569 997 $aUNINA