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

Sun Zeyu, Wang Huanzhao, Wu Weiguo and Xing Xiaofei

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 6, 203502

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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/203502 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:6:p:203502

DOI: 10.1155/2015/203502

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().