Solving coverage problems in wireless sensor networks using cover sets

Zorbas, Dimitrios; Glynos, Dimitris; Kotzanikolaou, Panayiotis; Douligeris, Christos

doi:10.1016/j.adhoc.2009.10.003

Cited by 107 publications

(51 citation statements)

References 17 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Liu et al 13 proposed distributed algorithms for scheduling sensors that negotiate their respective states through communication. Zorbas et al 9 proposed two greedy heuristic algorithms that extend network lifetime by finding and monitoring the key targets first. Lai et al 21 used the genetic algorithm (GA) for solving the NP-complete problem that encodes the candidate solutions as chromosomes, simulates the Darwinian evolution mechanism and facilitates the crossover, mutation and elimination of the coding chromosome to obtain the final solution.…”

Section: Related Workmentioning

confidence: 99%

“…6 Deng et al 7 proposed that the regional coverage problem can be converted into the target coverage problem. Cardei et al 8 and Zorbas et al 9 argued that the target coverage can cover a set of targets under the condition that wireless sensors and targets are randomly and uniformly deployed in the area and that wireless sensors can monitor all targets. For the target coverage problem, wireless sensors must continuously monitor all targets.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A novel multi-objective coverage optimization memetic algorithm for directional sensor networks

Wang

Gao

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

For the target problem of a directional wireless sensor network, the greedy algorithm can easily fall into the local optimal solution, whereas the genetic algorithm must forecast the lifetime of the upper bound of the network. We propose a novel multi-objective coverage optimization memetic algorithm that encodes the solutions as chromosomes and simulates the biological evolution process in search for a favourable solution to address the aforementioned problems. Experimental results show that the proposed algorithm can prolong the network lifetime more effectively than similar heuristic algorithms in other studies.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A novel multi-objective coverage optimization memetic algorithm for directional sensor networks

Wang

Gao

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…In [15], Zorbas et al proposed an effective coverage algorithm (CCF) for target coverage. CCF divides all the sensor nodes into cover sets, each of which can cover all the targets.…”

Section: Target Coveragementioning

confidence: 99%

“…The schemes in the second phase can also be used in the general target coverage problems. To prove the superiority of our schemes for target coverage problems, we firstly compare our schemes International Journal of Distributed Sensor Networks with static-CCF [15]. As shown in Figure 6, t and n are the number of targets and the number of sensor nodes in a 50 m × 50 m region, a = 0.5, b = 0.5 in Algorithm 2, α = β = γ = 1/3 in static-CCF, and w = 5.…”

Section: Simulationsmentioning

confidence: 99%

See 1 more Smart Citation

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Deng

et al. 2012

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Area coverage is one of the key issues for wireless sensor networks. It aims at selecting a minimum number of sensor nodes to cover the whole sensing region and maximizing the lifetime of the network. In this paper, we discuss the energy-efficient area coverage problem considering boundary effects in a new perspective, that is, transforming the area coverage problem to the target coverage problem and then achieving full area coverage by covering all the targets in the converted target coverage problem. Thus, the coverage of every point in the sensing region is transformed to the coverage of a fraction of targets. Two schemes for the converted target coverage are proposed, which can generate cover sets covering all the targets. The network constructed by sensor nodes in the cover set is proved to be connected. Compared with the previous algorithms, simulation results show that the proposed algorithm can prolong the lifetime of the network.

show abstract

Efficient target monitoring withfault‐tolerantconnectivity in wireless sensor networks

Deepa

Revathi

2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Sensing coverage with fault-tolerant connectivity is considered as a recent research challenge, which measures the Quality of Service (QoS) in wireless sensor networks. QoS is determined based on the set of deployed sensor nodes that monitor all available discrete targets lying at the given point of interest and at the same time have to retain reliable connectivity with the base station. In this article, we focus on two phases namely, monitoring targets in the given sensing area by splitting the sensor network into set covers, which is considered as a nondeterministic polynomial-time complete problem and optimal deployment of intelligent nodes. At first, achieving full coverage with deployed sensors by covering all discrete targets to prolong the network lifetime. On the other hand, a novel S 2 (sensors-spine) node approach was used to place an optimal number of intelligent nodes using a nature-inspired algorithm named moth flame optimization to overcome the fault among the disjoints sets such that the entire network was fully connected and ensure that sensed data from each target points are collected by the sink node. To evaluate our proposed design, extensive simulations were conducted to demonstrate the efficacy of our proposed mechanism that outperforms other existing techniques found in the literature in terms of prolonged network lifetime and there is no failure in the transmission path during data transmission to the sink node at every t s, such that the entire network was fully connected.

show abstract

Solving coverage problems in wireless sensor networks using cover sets

Cited by 107 publications

References 17 publications

A novel multi-objective coverage optimization memetic algorithm for directional sensor networks

A novel multi-objective coverage optimization memetic algorithm for directional sensor networks

Transforming Area Coverage to Target Coverage to Maintain Coverage and Connectivity for Wireless Sensor Networks

Efficient target monitoring withfault‐tolerantconnectivity in wireless sensor networks

Contact Info

Product

Resources

About