Abstract
Sweep coverage is an important problem in Wireless Sensor Networks (WSNs). Technically, sweep coverage makes use of mobile sensor nodes that move around to collect sensing data from Points of Interest (POIs) at a low cost. Since POIs can often be sensed remotely, mobile sensor nodes do not have to arrive at the location of POIs to gather sensing data. Sweep radius, the maximum distance between a mobile sensor node and a POI that enables sensing, is an important factor in sweep coverage planning. In addition, because mobile sensor nodes are typically powered by batteries, they tend to have a limited lifetime. To continue the coverage, mobile sensor nodes have to periodically return to the base station to replenish their energy. In this paper, sweep coverage based on sweep radius and energy limitation is formulated as the ( $t, T, R$ )-SCBR problem. To tackle the ( $t, T, R$ )-SCBR problem, a centralized algorithm (i.e. CPS) and a distributed algorithm (i.e. DPP) are proposed. Through extensive simulations, we found that the proposed algorithms significantly outperform the existing schemes.
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.
