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

ECAPM: An Enhanced Coverage Algorithm in Wireless Sensor Network Based on Probability Model

Author

Listed:
  • Sun Zeyu
  • Wang Huanzhao
  • Wu Weiguo
  • Xing Xiaofei

Abstract

How to cover a monitored area with the minimum number of sensor nodes is a fundamental in wireless sensor network (WSN). To address this problem, this paper proposes ECAPM, that is, Enhanced Coverage Algorithm Based on Probability Model. Given an area to monitor, ECAPM can calculate the minimum number of sensor nodes to cover that area. Firstly, ECAPM introduces the method to compute the expectation of probability that a sensor node is covered. Then ECAPM presents the procedure of expected value calculation when target node is covered by one sensor node and N sensor nodes. Finally ECAPM verifies the relation of proportional function when random variables are not independent. The simulation results show that ECAPM can cover the monitored area effectively with less sensor nodes and improve the quality of coverage.

Suggested Citation

  • Sun Zeyu & Wang Huanzhao & Wu Weiguo & Xing Xiaofei, 2015. "ECAPM: An Enhanced Coverage Algorithm in Wireless Sensor Network Based on Probability Model," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 203502-2035, June.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:203502
    DOI: 10.1155/2015/203502
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/203502
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/203502?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:6:p:203502. 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.