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

Efficient Sleep Scheduling Algorithm for Target Tracking in Double-Storage Energy Harvesting Sensor Networks

Author

Listed:
  • Hongbin Chen
  • Qian Zeng
  • Feng Zhao

Abstract

Target tracking is a typical application in wireless sensor networks. Both energy efficiency and tracking performance are important issues that need to be considered. They are a pair of contradictions most of the time. Saving energy often sacrifices tracking performance, while enhancing tracking performance needs to consume more energy. In this paper, an efficient sleep scheduling algorithm is put forward to tackle the above problem in energy harvesting sensor networks. At first, we modify the probability-based prediction and sleep scheduling (PPSS) algorithm to track the target and further use another sleep scheduling algorithm we proposed to wake tracking nodes when the target is likely to be missed (i.e., it is unsuccessful to wake next-moment tracking nodes). Secondly, a double-storage energy harvesting architecture is employed to increase residual energy of sensor nodes and to extend network lifetime. Simulation results reveal that the proposed sleep scheduling algorithm can improve tracking performance and prolong network lifetime compared with the PPSS algorithm and the proposed algorithm without energy harvesting.

Suggested Citation

  • Hongbin Chen & Qian Zeng & Feng Zhao, 2016. "Efficient Sleep Scheduling Algorithm for Target Tracking in Double-Storage Energy Harvesting Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 12(5), pages 4134735-413, May.
  • Handle: RePEc:sae:intdis:v:12:y:2016:i:5:p:4134735
    DOI: 10.1155/2016/4134735
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2016/4134735
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/4134735?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:12:y:2016:i:5:p:4134735. 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.