001440720 000__ 06477cam\a2200769\a\4500
001440720 001__ 1440720
001440720 003__ OCoLC
001440720 005__ 20230309004657.0
001440720 006__ m\\\\\o\\d\\\\\\\\
001440720 007__ cr\un\nnnunnun
001440720 008__ 211030s2021\\\\sz\\\\\\o\\\\\101\0\eng\d
001440720 019__ $$a1280044951$$a1280102502$$a1280196767$$a1281985641$$a1287774891$$a1292518265
001440720 020__ $$a9783030892401$$q(electronic bk.)
001440720 020__ $$a3030892409$$q(electronic bk.)
001440720 020__ $$z3030892395
001440720 020__ $$z9783030892395
001440720 0247_ $$a10.1007/978-3-030-89240-1$$2doi
001440720 035__ $$aSP(OCoLC)1281968882
001440720 040__ $$aEBLCP$$beng$$epn$$cEBLCP$$dGW5XE$$dYDX$$dDCT$$dOCLCF$$dDKU$$dOCLCO$$dOCLCQ$$dCOM$$dOCLCO$$dOCLCQ
001440720 049__ $$aISEA
001440720 050_4 $$aTK7872.D48$$bA426 2021eb
001440720 08204 $$a005.1$$223
001440720 1112_ $$aALGOSENSORS (Symposium)$$n(17th :$$d2021 :$$cOnline)
001440720 24510 $$aAlgorithms for sensor systems :$$b17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Lisbon, Portugal, September 9-10, 2021, Proceedings /$$cLeszek Ga̜sieniec, Ralf Klasing, Tomasz Radzik (eds.).
001440720 2463_ $$aALGOSENSORS 2021
001440720 260__ $$aCham :$$bSpringer,$$c2021.
001440720 300__ $$a1 online resource (166 pages)
001440720 336__ $$atext$$btxt$$2rdacontent
001440720 337__ $$acomputer$$bc$$2rdamedia
001440720 338__ $$aonline resource$$bcr$$2rdacarrier
001440720 347__ $$atext file
001440720 347__ $$bPDF
001440720 4901_ $$aLecture notes in computer science ;$$v12961
001440720 4901_ $$aLNCS sublibrary, SL 5, Computer communication networks and telecommunications
001440720 500__ $$a"The symposium was run online on the originally set dates of September 9-10, 2021 ..."
001440720 500__ $$aIncludes author index.
001440720 5050_ $$aIntro -- Preface -- Organization -- Universally-Optimal Distributed Algorithms, (Congestion+Dilation)-Competitive Oblivious Routing, and Hop-Constrained Network Design (Abstract of Invited Talk) -- Contents -- Distributed Transformations of Hamiltonian Shapes Based on Line Moves -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Model -- 3 The Distributed Hamiltonian Transformation -- References -- Stand up Indulgent Gathering -- 1 Introduction -- 2 Model -- 3 The SUIG Algorithm -- 4 Concluding Remarks -- References
001440720 5058_ $$aGathering a Euclidean Closed Chain of Robots in Linear Time -- 1 Introduction -- 2 Model and Notation -- 3 Basics -- 3.1 Isogonal Configurations -- 3.2 Sequential Movement with Run-States -- 4 Closed-Chain-Hopper -- 4.1 Intuition About the Asymmetric Algorithm -- 4.2 Asymmetric Algorithm in Detail -- 4.3 Symmetric Algorithm -- 4.4 Combination of the Algorithms -- 4.5 Analysis Sketch -- 5 Concluding Remarks -- References -- Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach -- 1 Introduction -- 2 Contribution -- 3 Model
001440720 5058_ $$a4 Infeasible Transformations and the Time Lower Bound -- 4.1 Time and Seed Lower Bounds for Line Transformations -- 5 Transformation for Nice Shapes -- 5.1 Line to Nice Shape -- 5.2 RaiseNodes -- 5.3 MirrorSeed -- 5.4 DepositNode -- 5.5 Construction of a Subset of Nice Shapes -- 5.6 Construction of Any Nice Shape -- 6 Conclusions -- References -- Distributed Coloring and the Local Structure of Unit-Disk Graphs -- 1 Introduction -- 2 Preliminaries -- 2.1 Distributed Models of Communication -- 2.2 Distributed Coloring -- 2.3 Unit-Disk Graphs -- 3 Location-Aware Coloring
001440720 5058_ $$a4 Coloring Without Coordinates -- 5 Conclusion -- References -- Evacuating from p Unit Disks in the Wireless Model -- 1 Introduction -- 1.1 Related Work -- 1.2 High Level of New Contributions and Motivation -- 2 Problem Definition, Notation and Nomenclature -- 3 Algorithms for Evacuating 2 Robots in p Spaces -- 3.1 Worst Case Analysis of Algorithm Wireless-Searchp() -- 4 Visualization of Key Concepts and Results -- 5 Lower Bounds and the Proof of Theorem 1 -- 6 Discussion -- References -- Beep-And-Sleep: Message and Energy Efficient Set Cover -- 1 Introduction -- 1.1 Related Work
001440720 5058_ $$a1.2 Structure of This Paper -- 2 An Efficient SetCover-Algorithm for the Beeping-Model -- 2.1 Proof of Theorem 1 -- 2.2 Extension to DominatingSet -- 3 A Low-Message KT_0 Algorithm -- 3.1 Proof of Theorem 2 -- 3.2 Lower Bound -- 4 Conclusion and Future Work -- References -- Byzantine Fault Tolerant Symmetric-Persistent Circle Evacuation -- 1 Introduction -- 1.1 Model and Preliminaries -- 1.2 Related Work -- 1.3 Results of the Paper -- 2 Evacuation with One Byzantine Fault -- 2.1 Lower Bound for Symmetric-Persistent Algorithms -- 3 Evacuation with Two Byzantine Faults
001440720 5058_ $$a3.1 Algorithm for (n,2) -- Evacuation
001440720 506__ $$aAccess limited to authorized users.
001440720 520__ $$aThis book constitutes revised selected papers from the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, held in Lisbon, Portugal*, in September 2021. The 10 full papers presented in this volume were carefully reviewed and selected from 28 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. *The conference was held virtually due to the COVID-19 pandemic.
001440720 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 3, 2021).
001440720 650_0 $$aWireless sensor networks$$vCongresses.
001440720 650_0 $$aComputer algorithms$$vCongresses.
001440720 650_0 $$aAd hoc networks (Computer networks)$$vCongresses.
001440720 650_6 $$aRéseaux de capteurs sans fil$$vCongrès.
001440720 650_6 $$aAlgorithmes$$vCongrès.
001440720 650_6 $$aRéseaux ad hoc (Réseaux d'ordinateurs)$$vCongrès.
001440720 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001440720 655_7 $$aConference papers and proceedings.$$2lcgft
001440720 655_7 $$aActes de congrès.$$2rvmgf
001440720 655_0 $$aElectronic books.
001440720 7001_ $$aGąsieniec, Leszek.
001440720 7001_ $$aKlasing, Ralf.
001440720 7001_ $$aRadzik, Tomasz.
001440720 77608 $$iPrint version:$$aGąsieniec, Leszek$$tAlgorithms for Sensor Systems$$dCham : Springer International Publishing AG,c2021$$z9783030892395
001440720 830_0 $$aLecture notes in computer science ;$$v12961.
001440720 830_0 $$aLNCS sublibrary.$$nSL 5,$$pComputer communication networks and telecommunications.
001440720 852__ $$bebk
001440720 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-89240-1$$zOnline Access$$91397441.1
001440720 909CO $$ooai:library.usi.edu:1440720$$pGLOBAL_SET
001440720 980__ $$aBIB
001440720 980__ $$aEBOOK
001440720 982__ $$aEbook
001440720 983__ $$aOnline
001440720 994__ $$a92$$bISE