2019
DOI: 10.1007/s11277-019-06935-5
|View full text |Cite
|
Sign up to set email alerts
|

Maximum Lifetime Target Coverage in Wireless Sensor Networks

Abstract: The challenge in the deployment of wireless sensor networks is to ensure the coverage of targets with high energy efficiency, particularly when coverage constraint and energy constraint must be taken into account. Many algorithms have been suggested over the years to enhance network lifetime as sensor nodes are powered by batteries. These algorithms divide a set of sensor nodes into a number of subsets which can monitor all targets. The subsets are either joint or disjoint. In this paper, we propose an efficie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 23 publications
(33 reference statements)
0
8
0
Order By: Relevance
“…It is essential to consider a better network performance while designing the network deployment strategy with optimal coverage and connectivity [7]. The problem of the optimal coverage is formulated either as a greedy algorithm [8] or an integer optimization problem [9], which resembles the localization or placement problem of the facilities [10]. The sensor nodes' optimal numbers are computed using various methods like disk model, sector model, and geometry pattern model [11].…”
Section: Intelligent Systemmentioning
confidence: 99%
“…It is essential to consider a better network performance while designing the network deployment strategy with optimal coverage and connectivity [7]. The problem of the optimal coverage is formulated either as a greedy algorithm [8] or an integer optimization problem [9], which resembles the localization or placement problem of the facilities [10]. The sensor nodes' optimal numbers are computed using various methods like disk model, sector model, and geometry pattern model [11].…”
Section: Intelligent Systemmentioning
confidence: 99%
“…The same strategy was followed in [31], where a meta-heuristic was proposed to form a cover set for the target coverage problem. Saadi et al [32] proposed a maximum lifetime target coverage (MLTC) heuristic, which depends on minimally covered target (covered by least sensors). The proposed algorithm calculates the upper bound by observing such least covered targets and design subsets to monitor targets iteratively.…”
Section: A Target Full Coveragementioning
confidence: 99%
“…To enhance QoSensing in terms of coverage factor, many research works such as Coverage Contribution Area (CCA) [3], Centralized Lloyd-Like Algorithm (CLLA) [4], and the method to calculate the maximum lifetime target coverage MLTC [5] are presented in WSN. CCA resolves k-coverage problem in which at least k-nodes are required to cover the particular target.…”
Section: Introductionmentioning
confidence: 99%