2020
DOI: 10.1007/s12652-020-02195-5
|View full text |Cite
|
Sign up to set email alerts
|

A sensor deployment approach for target coverage problem in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 36 publications
(20 citation statements)
references
References 36 publications
0
17
0
Order By: Relevance
“…Zakariayi and Babaie [12] proposed a clustering algorithm for maximizing region coverage in WSNs. The coverage is performed in a hexagonal structure of connecting nodes by differentiating static and mobile nodes.…”
Section: Related Workmentioning
confidence: 99%
“…Zakariayi and Babaie [12] proposed a clustering algorithm for maximizing region coverage in WSNs. The coverage is performed in a hexagonal structure of connecting nodes by differentiating static and mobile nodes.…”
Section: Related Workmentioning
confidence: 99%
“…Their simulation results demonstrated that the proposed approaches can solve the target coverage problem. Furthermore, their network lifetimes were longer than other existing methods [ 38 ]. In [ 39 ], Arivudainambi and Pavithra developed a sensor deployment scheme based on vertex coloring.…”
Section: Background and Related Workmentioning
confidence: 99%
“…The network sensor nodes' unbalanced usage of energy or high utilization of power isa major factor in the network lifetime's reduction. The reason being that every sensor node's power supply is a battery which, because of the coverage [1] area's conditions, maybe neither replaceable nor rechargeable. Due to this, prolongation of network lifespan can be achieved through the control and balancing of the network's energy usage.…”
Section: Introductionmentioning
confidence: 99%