Coverage problems in sensor networks

DOI10.1145/1978802.1978811zbMath1293.68042OpenAlexW2044195080MaRDI QIDQ2875072

Bang Wang

Publication date: 13 August 2014

Published in: ACM Computing Surveys (Search for Journal in Brave)

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

zbMATH Keywords

coveragesensor networksnetwork coverage controlnetwork protocol designsensor coverage model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (14)

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination ⋮ A unified solving approach for two and three dimensional coverage problems in sensor networks ⋮ Minimum shared‐power edge cut ⋮ Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane ⋮ A Multi-level Optimization Approach for the Planning of Heterogeneous Sensor Networks ⋮ An efficient genetic algorithm for maximizing area coverage in wireless sensor networks ⋮ Circles of equal radii randomly placed on a plane: some rigorous results, asymptotic behavior, and application to transparent electrodes ⋮ Improved budgeted connected domination and budgeted edge-vertex domination ⋮ Initializing sensor networks of non-uniform density in the weak sensor model ⋮ Sensor network sensing coverage optimization with improved artificial bee colony algorithm using teaching strategy ⋮ Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments ⋮ On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains ⋮ An exact approach to extend network lifetime in a general class of wireless sensor networks ⋮ Lattice coverage of cuboid with minimum number of hemispheres

This page was built for publication: Coverage problems in sensor networks