A square-based coverage and connectivity probability model for WSNs
by Xiaofei Xing; Guojun Wang; Jie Li
International Journal of Sensor Networks (IJSNET), Vol. 19, No. 3/4, 2015

Abstract: Sensing coverage and network connectivity are two fundamental issues in wireless sensor networks (WSNs). In this paper, we first propose a square-based coverage and connectivity probability model (SCCP), which reflects the relations among the coverage (connectivity) rate, the number of deployed sensor nodes, the sensing (communication) range of sensor nodes, and the network size. This model can be used to calculate the number of sensor nodes that need to be deployed for maintaining a certain coverage (connectivity) rate. Then, an efficient approximation algorithm for largest cover set (EAA-LCS) is developed to find a largest cover set (LCS). The simulation results have shown that the error rate of node deployment is less than 5%. The proposed model and algorithm are very useful in estimating the coverage and connectivity capacity in a randomly and uniformly deployed sensor network.

Online publication date: Thu, 05-Nov-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com