IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v15y2008i2d10.1007_s10878-007-9072-6.html
   My bibliography  Save this article

Designing k-coverage schedules in wireless sensor networks

Author

Listed:
  • Yingshu Li

    (Georgia State University)

  • Shan Gao

    (Georgia State University)

Abstract

Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored area can be k-covered throughout the whole network lifetime with the purpose of maximizing network lifetime. The SSC problem is NP-hard and we propose two heuristic algorithms under different scenarios. In addition, we develop a guideline for users to better design a sensor deployment plan to save energy by employing a density control scheme. Simulation results are presented to evaluate our proposed algorithms.

Suggested Citation

  • Yingshu Li & Shan Gao, 2008. "Designing k-coverage schedules in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 15(2), pages 127-146, February.
    • Handle: RePEc:spr:jcomop:v:15:y:2008:i:2:d:10.1007_s10878-007-9072-6
    DOI: 10.1007/s10878-007-9072-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-007-9072-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-007-9072-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Devesh Pratap Singh & Bhaskar Pant, 2017. "An approach to solve the target coverage problem by efficient deployment and scheduling of sensor nodes in WSN," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 493-514, June.

    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:spr:jcomop:v:15:y:2008:i:2:d:10.1007_s10878-007-9072-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.