Algorithms for Sensor Systems
Springer International Publishing (Verlag)
978-3-319-28471-2 (ISBN)
This bookconstitutes revised selected papers from the 11th International Symposium onAlgorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2015, heldin Patras, Greece, in September 2015.
The 16 fullpapers presented in this volume were carefully reviewed and selected from 30submissions. The deal with algorithms analysis and problem complexity; computercommunication networks; computation by abstract devices; and mathematics ofcomputing.
Plane and Planarity Thresholds for Random GeometricGraphs.- Connectivity of a dense mesh of randomly oriented directional antennasunder a realistic fading model.- Maintaining Intruder Detection Capability in aRectangular Domain with Sensors.- The Weakest Oracle for Symmetric Consensus inPopulation Protocols.- Exact and Approximation Algorithms for Data MuleScheduling in a Sensor Network.- Limitations of Current Wireless SchedulingAlgorithms.- Deterministic rendezvous with detection using beeps.- Minimizingtotal sensor movement for barrier coverage by non-uniform sensors on a line.- Acomprehensive and lightweight security architecture to secure the IoTthroughout the lifecycle of a device based on HIMMO.- Maximizing Throughput inEnergy-Harvesting Sensor Nodes.- On verifying and maintaining connectivity ofinterval temporal networks.- Beachcombing on Strips and Islands.- RadioAggregation Scheduling.- Gathering of Robots on Meeting-Points.- MutualVisibility with an Optimal Number of Colors.- Mobile Agents Rendezvous in spiteof a Malicious Agent.
| Erscheinungsdatum | 09.02.2016 |
|---|---|
| Reihe/Serie | Computer Communication Networks and Telecommunications | Lecture Notes in Computer Science |
| Zusatzinfo | XIV, 225 p. 19 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Applications • Approximation • asynchronous system • competitive analysis • computation by abstract devices • Computer Communication Networks • Computer Science • conference proceedings • design and analysis of algorithms • Deterministic distributed algorithm • distributed algorithms • Distributed Computing • Informatics • Mathematics of Computing • Mobile Agents • Mobile Robots • network algorithms • oblivious robots • Randomized • Research • robot • Searching • sensor networks • wireless networks |
| ISBN-10 | 3-319-28471-1 / 3319284711 |
| ISBN-13 | 978-3-319-28471-2 / 9783319284712 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
