Abstract
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 energy-efficiency 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
