IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i6p782952.html
   My bibliography  Save this article

Minimizing the Number of Mobile Chargers to Keep Large-Scale WRSNs Working Perpetually

Author

Listed:
  • Cheng Hu
  • Yun Wang

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.

Suggested Citation

  • Cheng Hu & Yun Wang, 2015. "Minimizing the Number of Mobile Chargers to Keep Large-Scale WRSNs Working Perpetually," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 782952-7829, June.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:782952
    DOI: 10.1155/2015/782952
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/782952
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/782952?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:782952. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.