2020
DOI: 10.1080/09720529.2020.1753301
|View full text |Cite
|
Sign up to set email alerts
|

Cuckoo search algorithm for target coverage and sensor scheduling with adjustable sensing range in wireless sensor network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…Unfortunately, this approach is not suitable for homogeneous networks. Authors in [10] suggested an improved cuckoo search algorithm that partitions sensors into a maximum number of NDSC with a sensing range that can be adjustable. Each cover provides k-target coverage to maximize the lifetime of the WSN.…”
Section: Related Workmentioning
confidence: 99%
“…Unfortunately, this approach is not suitable for homogeneous networks. Authors in [10] suggested an improved cuckoo search algorithm that partitions sensors into a maximum number of NDSC with a sensing range that can be adjustable. Each cover provides k-target coverage to maximize the lifetime of the WSN.…”
Section: Related Workmentioning
confidence: 99%
“…Improved CSO algorithm proposed in [73] determines the sensor covers by optimizing the sensing range of the sensors to reduce the redundancy in the network. The proposed algorithm partitions the sensor set into non-disjoint subsets with varying sensing range such that each cover provides kcoverage in the network.…”
Section: Coverage Solutions Based Ai Techniques In Wsnsmentioning
confidence: 99%
“…According to [101], the CS algorithm is based on three idealized rules: 1) Each cuckoo lays one egg at a time and deposits it in a nest that is picked at random; 2) The best nests with the highest quality eggs will be passed down to future generations; 3) The number of possible host nests is predetermined, and the host bird discovers the cuckoo's egg with a probability p a ∈ [0, 1]. The CS algorithm has been used in several works [84], [87], [88]. In [84], the authors proposed a two-stage mobile sensor deployment approach based on the CS algorithm.…”
Section: Evolutionary Algorithmsmentioning
confidence: 99%
“…According to the experimental results, the improved CS algorithm provides a good solution in a short time compared to other metaheuristics. In [88], authors developed an improved CS algorithm to tackle the k-target coverage problem of randomly deployed sensor nodes with adjustable sensing radius. The problem was formulated as a non-linear integer programming problem to optimize both coverage and network lifetime.…”
Section: Evolutionary Algorithmsmentioning
confidence: 99%