Connecting priority algorithm for node deployment in directional sensor networks
by Li Tan; Yucheng Chen; Minghua Yang; Jipeng Hu; Jingjing Lian
International Journal of Grid and Utility Computing (IJGUC), Vol. 8, No. 1, 2017

Abstract: According to the existing directional sensor networks, the centroid point of node model mostly rotate around the sector vertex. As in this model, the node rotation area is a full circle, therefore multiply the network energy consumption and deployment time. This paper is based on the new directional model in which the sector nodes rotate around the centroid, then we present a potential field based connecting priority algorithm for node deployment, and finally make simulation for this algorithm to explore the parameters which will affect the coverage ratio. The simulation results show the effectiveness of the model and algorithm.

Online publication date: Wed, 08-Feb-2017

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 Grid and Utility Computing (IJGUC):
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