A stochastic geometric approach to coverage and connectivity in wireless sensor networks: cooperation and mobility
by Qinghai Gao; Huilan Zou
International Journal of Sensor Networks (IJSNET), Vol. 14, No. 3, 2013

Abstract: Depending on the density of a wireless sensor network, it is likely that the field is not completely covered and the network is not fully connected. Assuming that the sensor nodes are randomly deployed in the field, we observe that clumps of sensors could be formulated and cooperation among the sensor nodes can be carried out. With cooperation, the area covered by the sensor nodes increases and the data collected by each sensor could be shared within one clump. Moreover, mobile nodes (Mules) could be employed in the field to further improve the coverage and connectivity. In this paper, we characterise the expected proportion of covered region, the time needed to obtain full connectivity, and the number of nodes connected by the Mules at certain time threshold. Our analysis and simulation results show that significant improvement of coverage and connectivity can be achieved from cooperation and mobility.

Online publication date: Thu, 07-Nov-2013

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