000 03929nam a22005415i 4500
001 978-3-642-45346-5
003 DE-He213
005 20200421112038.0
007 cr nn 008mamaa
008 131212s2014 gw | s |||| 0|eng d
020 _a9783642453465
_9978-3-642-45346-5
024 7 _a10.1007/978-3-642-45346-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms for Sensor Systems
_h[electronic resource] :
_b9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /
_cedited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aX, 307 p. 91 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8243
505 0 _aModeling Reality Algorithmically: The Case of Wireless Communication -- Autonomous Mobile Robots: A Distributed Computing -- Token Dissemination in Geometric Dynamic Networks -- The Wake Up Dominating Set -- Reconfiguring Massive Particle Swarms with Limited, Global Control -- Polygon-Constrained motion planning problems -- Fast Localized Sensor Self-Deployment for Focused Coverage -- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration -- Data-Delivery by Energy-Constrained Mobile Robots -- Approximation Bounds for the Minimum k-Storage Problem -- Counting in Anonymous Dynamic Networks: An Experimental Perspective -- Station Assignment with Applications to Sensing -- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model -- The Effect of Forgetting on the Performance of a Synchronizer -- On the Complexity of Barrier Resilience for Fat Regions -- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks -- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes -- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks -- Optimal Nearest Neighbor Queries in Sensor Networks -- Conflict Graphs and the Capacity of the Mean Power Scheme -- Rendezvous of Two Robots with Visible Bits.
520 _aThis book constitutes the proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2013, held in Sophia Antipolis, France, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.
650 0 _aComputer science.
650 0 _aComputer communication systems.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aMathematics of Computing.
700 1 _aFlocchini, Paola.
_eeditor.
700 1 _aGao, Jie.
_eeditor.
700 1 _aKranakis, Evangelos.
_eeditor.
700 1 _aMeyer auf der Heide, Friedhelm.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642453458
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8243
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-45346-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c56473
_d56473