Minimizing the Number of Mobile Chargers to Keep Large-Scale WRSNs Working Perpetually
Cheng Hu and
Yun Wang
International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 6, 782952
Abstract:
Wireless Rechargeable Sensor Networks, in which mobile chargers ( M C s) are employed to recharge the sensor nodes, have attracted wide attention in recent years. Under proper charging schedules, the M C s could keep all the sensor nodes working perpetually. Since M C s can be very expensive, this paper tackles the problem of deciding the minimum number of M C s and their charging schedules to keep every sensor node working continuously. This problem is NP-hard; we divide it into two subproblems and propose a GCHA ( Greedily Construct , Heuristically Assign ) scheme to solve them. First, the GCHA greedily addresses a Tour Construction Problem to construct a set of tours to 1-cover the WRSN. Energy of the sensor nodes in each of these tours can be timely replenished by one M C according to the decision condition derived from a Greedy Charging Scheme (GCS). Second, the GCHA heuristically solves a Tour Assignment Problem to assign these tours to minimum number of M C s. Then each of the M C s can apply the GCS to charge along its assigned tours. Simulation results show that, on average, the number of M C s obtained by the GCHA scheme is less than 1.1 over a derived lower bound and less than 0.5 over related work.
Date: 2015
References: Add references at CitEc
Citations:
Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/782952 (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:6:p:782952
DOI: 10.1155/2015/782952
Access Statistics for this article
More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().