.png){kind=icon}
.png){kind=icon}
Return
Target K-coverage problem in wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1080/09720529.2020.1729511.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Wireless sensor network (WSN) is collection of various sensors placed according to the application requirement to accomplish quality of service (QOS) that is how fine the sensors are covering or monitoring the set of targets that are within their sensing range. The essential problem and a dynamic exploration area in WSNs is coverage in which energyefficiency is a critical issue. So, it is important to manage the battery utilization of the sensors by arranging and activating these sensors in an energy-efficient and effective way to make the network functional for longer period of time. Minimizing energy consumption and maximizing network lifetime is one of the prime objective of target coverage problem. Here in this work, we suggest an energy-efficient heuristic addressing K-Coverage problem which is an alternative of target coverage problem where every target is shielded by a minimum K- number of sensors to determine a set of different non-disjoint K-Covers. We show that the performance of the proposed heuristic is close to the optimal solution and have shown improvements in lifetime of network.
Keywords:
Target coverage
Wireless sensor network
Energy-efficiency
K-Coverage
Critical target
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
1.1
Papers:
8
Citations:
1.1K
Organization
No organization information available