Abstract
Coverage problems are fundamental and crucial in designing a wireless sensor networks. The target coverage problem is finding an optimal scheduling for sensors such that the time (called lifetime) to monitor every target can be as long as possible. Unfortunately, the target coverage problem has been proved to be NP-complete. Most of previous work only considers one or two factors exclusively and thus fails to prolong the lifetime to near the optimum. The main objective of this work is to design efficient scheduling algorithms to maximize the lifetime of a given whole wireless sensor network by considering adjusting sensing range, locations of target and sensors, residue battery power of sensor nodes, and assignment between sensors and targets simultaneously. A maximum weighted matching algorithm is devised by considering full coverage and the maximum total monitored duration for each target-sensor assignments. We also conduct simulations to demonstrate that the proposed algorithms can achieve very high network lifetime closed to the optimum.
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 callDisclaimer: 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.
