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

Optimal Mobile Sensor Scheduling for a Guaranteed Coverage Ratio in Hybrid Wireless Sensor Networks

Author

Listed:
  • Zhixin Fu
  • Keyou You

Abstract

This paper proposes an optimal mobile sensor-scheduling algorithm for recovering the failure sensors in hybrid wireless sensor networks (WSNs). To maintain a guaranteed coverage over the area of interest, spare mobile sensors in WSNs will be activated to replace the failure sensors. The optimal scheduling problem is formulated into two optimization problems, one of which precisely determines the minimum value of the largest distance required to travel for mobile sensors, while the other one gives the optimal dispatch for mobile sensors to minimize the total travel distance. Furthermore, a distributed suboptimal scheduling, which only requires the local matching information of mobile sensors, is developed as well. Both regular and random network topologies are provided to illustrate the proposed algorithms in the simulation.

Suggested Citation

  • Zhixin Fu & Keyou You, 2013. "Optimal Mobile Sensor Scheduling for a Guaranteed Coverage Ratio in Hybrid Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(4), pages 740841-7408, April.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:4:p:740841
    DOI: 10.1155/2013/740841
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/740841
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/740841?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:9:y:2013:i:4:p:740841. 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.