Distributed algorithms for dynamic coverage in sensor networks

DOI10.1145/1281100.1281189MaRDI QIDQ5401484zbMATH OpenOpenAlexFDO

Authors Lan Lin, Hyunyoung Lee

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281189

zbMATH Keywords

distributed algorithmssensor networkssensor coverage

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• On the use of limited autonomous mobility for dynamic coverage maintenance in sensor networks
• Coverage problems in sensor networks: a survey
• scientific article; zbMATH DE number 5040104
• A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
• DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS

Cited in

(20)

• A distributed algorithmic framework for coverage problems in wireless sensor networks
• Continuous monitoring in the dynamic sensor field model
• Distributed sweep coverage algorithm of multi-agent systems using workload memory
• LiMoSense: live monitoring in dynamic sensor networks
• On the use of limited autonomous mobility for dynamic coverage maintenance in sensor networks
• Exposure in wireless sensor networks: Theory and practical solutions
• Computational Science – ICCS 2005
• The implementation of dynamic rate allocation in sensor networks
• The critical speeds and radii for coverage in sensor networks
• Distributed Coverage Control and Data Collection With Mobile Sensor Networks
• Impacts of sensor node distributions on coverage in sensor networks
• Mayer-Vietoris sequences and coverage problems in sensor networks
• Maintaining differentiated coverage in heterogeneous sensor networks
• A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks
• Online hole healing for sensor coverage
• Coordinate-free coverage in sensor networks with controlled boundaries via homology
• Distributed coverage games for energy-aware mobile sensor networks
• Dynamic coverage and clustering: a maximum entropy approach
• A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
• An approximation algorithm for general energy restricted sweep coverage problem

This page was built for publication: Distributed algorithms for dynamic coverage in sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401484)