Abstract
Using mobile chargers in wireless rechargeable sensor networks is an option for charging all the nodes in the network. In order to achieve some performance requirement such as coverage, it is necessary to effectively schedule the mobile chargers to serve every node of the network. We notice that nearly all previous works on mobile charger scheduling assume that mobile chargers move along predetermined paths which are computed based on perfect priori information. In this paper, we consider the problem of scheduling mobile chargers in an on-demand way to maximize the covering utility. On receiving re-charging requests from the nodes, the mobile charger decides how to move itself. The covering utility is defined to quantify the effectiveness of event monitoring. We formulate the scheduling problem as an optimization one. We propose three heuristics for this problem after proving its NP-Completeness. We further generalize our solutions to accommodate the multiple mobile chargers case. Finally we evaluate our solutions through extensive simulations.
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.
