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

Scheduling with Collaborative Mobile Chargers Inter-WSNs

Author

Listed:
  • Jidong Zhao
  • Xili Dai
  • Xiaomin Wang

Abstract

Mobile charge problem describes a fleet of mobile chargers delivers energy to the sensor nodes periodically in wireless sensor networks (WSNs). In it, every sensor node has an asynchronous rest working time during a charging round. We consider the asynchronous rest working time and give the lower and upper bounds of the recharging cycle by the suitable total serving rate, to give the definition of time windows for the sensor nodes. In this paper, we model this problem in 2-dimensional WSNs as a vehicle routing problem with time windows (VRPTW). For solving the problem of multiple mobile chargers with different routing paths, we propose to transform the multiple routing problems into a single routing problem, by duplicating the sink into multiple virtual sinks. To optimize the routing path, we propose a local optimization algorithm by considering the collaborative charging among the mobile chargers. Through the simulations, we compare our proposed algorithm with the H η C l u s t e r C h a r g i n g ( β ) algorithm. We demonstrate the advantages of our collaborative scheduling algorithm in this problem.

Suggested Citation

  • Jidong Zhao & Xili Dai & Xiaomin Wang, 2015. "Scheduling with Collaborative Mobile Chargers Inter-WSNs," International Journal of Distributed Sensor Networks, , vol. 11(5), pages 921397-9213, May.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:5:p:921397
    DOI: 10.1155/2015/921397
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/921397
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/921397?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:5:p:921397. 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.