Target K-coverage problem in wireless sensor networks

doi:10.1080/09720529.2020.1729511

Target K-coverage problem in wireless sensor networks

2020-05-14

14

PRE

AI

DOI：10.1080/09720529.2020.1729511

原文链接

原文求助

摘要

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.

Keyword:

Target coverage

Wireless sensor network

Energy-efficiency

K-Coverage

Critical target

Target K-coverage problem in wireless sensor networks

摘要

AI总结

期刊

机构

引用论文