IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v8y2017i2d10.1007_s13198-016-0457-8.html
   My bibliography  Save this article

An approach to solve the target coverage problem by efficient deployment and scheduling of sensor nodes in WSN

Author

Listed:
  • Devesh Pratap Singh

    (Graphic Era University)

  • Bhaskar Pant

    (Graphic Era University)

Abstract

Network lifetime play a vital role in setting up an energy efficient wireless sensor network. The lifetime of the network can be improved by efficient deployment and scheduling of the sensor nodes inside the network. In this paper, on the basis of mathematically calculated upper bound lifetime of the network, the sensor nodes are efficiently deployed by using Simulated Annealing and Particle Swarm Optimization with pre-specified sensing range of the sensor nodes and on the second fold the sensor nodes are efficiently scheduled by applying the Simulated Annealing and Dempster Shafer Theory. The overall objective of this paper is to find the optimized location and schedule for sensor nodes. The comparative study shows that the simulated annealing and particle swarm optimization algorithms performs better for sensors deployment. Simulated annealing and Dempster Shafer theory achieves the goal to provide the different schedules with high efficiency.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-016-0457-8
    DOI: 10.1007/s13198-016-0457-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-016-0457-8
    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/s13198-016-0457-8?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.

    References listed on IDEAS

    as
    1. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Qi Qian & Liang Shu & Yuxiang Leng & Zhizhou Bao, 2022. "LoRaWAN Network Downlink Routing Control Strategy Based on the SDN Framework and Improved ARIMA Model," Future Internet, MDPI, vol. 14(11), pages 1-21, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:ijsaem:v:8:y:2017:i:2:d:10.1007_s13198-016-0457-8. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.