Optimal coverage in wireless sensor networks
From MaRDI portal
Recommendations
Cited in
(36)- Challenges and opportunities of connected k-covered wireless sensor networks. From sensor deployment to data gathering
- Coverage control in sensor networks
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Theoretical design of decentralized auction framework under mobile crowdsourcing environment
- Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
- Approximation algorithm for prize-collecting sweep cover with base stations
- Optimal coverage of an infrastructure network using sensors with distance-decaying sensing quality
- Coverage and exposure paths in wireless sensor networks
- An approximation algorithm for general energy restricted sweep coverage problem
- Construction of minimum edge-fault tolerant connected dominating set in a general graph
- Optimal Coverage in Automotive Configuration
- Coverage problems in sensor networks: a survey
- scientific article; zbMATH DE number 6719626 (Why is no real title available?)
- Investigating Coverage and Connectivity Trade-offs in Wireless Sensor Networks: The Benefits of MOEAs
- Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
- Coverage Properties of the Target Area in Wireless Sensor Networks
- Mathematical theories of distributed sensor networks
- Limit laws for coverage in backbone-sensor networks
- scientific article; zbMATH DE number 5040104 (Why is no real title available?)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- Approximation algorithms for maximum weighted target cover problem with distance limitations
- The heterogeneous rooted tree cover problem
- PTASs for secure dominating set in planar graphs and growth-bounded graphs
- Algorithm for partial sweep coverage on a line
- The K-prize-collecting coverage problem by aligned disks
- The online power cover problem on a line
- Barrier coverage construction without barrier-breach using virtual lines
- Bicriteria approximation algorithms for the unit disk coverage problem
- Approximation algorithm for min sweep-period sweep cover with distance constraint
- Approximation algorithms for solving the heterogeneous rooted tree/path cover problems
- Approximation algorithm for the minimum interval partial multi-cover problem
- An improved PTAS for covering targets with mobile sensors
- Dynamic time window based full-view coverage maximization in CSNs
- A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
- Algorithms for the online power cover problem on a line
- Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage
This page was built for publication: Optimal coverage in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119165)
