Abstract
Sweep coverage provides solution for the applications in wireless sensor networks, where periodic monitoring is sufficient instead of continuous monitoring. For a given set of points in the plane, the objective of the sweep coverage problem is to minimize number of sensors required in order to guarantee sweep coverage for a given set of points of interest. Instead of using only mobile sensors for sweep coverage, use of both static and mobile sensors can be more effective in terms of energy utilization. In this paper we introduce the EEGSweep coverage problem, where objective is to minimize energy consumption by a set of sensors (mobile and/or static) with guaranteed sweep coverage for a given set of points. We prove that the EEGSweep coverage problem is NP-hard and cannot be approximated within a factor of 2. We propose an 8-approximation algorithm to solve the problem. A 2-approximation algorithm is also proposed for a special case of this problem.
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.
