The best- known approximation algorithm has performance ratio 1 + ln n where n is the number of sensors in the network, which was given by Berman et. al [1]. In ...
This is a well-known problem, called Maximum Lifetime Coverage Problem (MLCP), which has been studied extensively in the literature. It is a long-standing open ...
A polynomial-time (4 + ∈)-approximation algorithm is presented for MWSCP which is to find the minimum total weight of sensors to cover a given area or ...
It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ...
It is a long-standing open problem whether MLCP has a polynomial-time constant-approximation. The best-known approximation algorithm has performance ratio 1 + ...
Dec 1, 2016 · In this section, we first define the target coverage problem of finding the maximum number of non-disjoint sensor covers in WSNs. Moreover, then ...
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility.
A 1/2-Approximation Algorithm for Target Coverage Problem in Mobile Air Quality Monitoring Systems ; To reduce MCP to SOBP, we create a bus map on a 3×|U ; grid ( ...
People also ask
What is the coverage problem in wireless sensor networks?
What are the limitations of wireless sensor networks?
What are the major constraints of wireless sensor networks?
What is topology control protocol for wireless sensor networks?
The scope of this paper is to present a low-overhead localized algorithm for the target coverage problem in wireless sensor networks.
Feb 24, 2020 · We obtain a constant factor approximation algorithm, assuming that the ratio between the sensor radius and communication radius is bounded.