A beacon-free localisation algorithm in wireless sensor networks Online publication date: Mon, 19-Dec-2016
by Li Jian Chen; Wei Yuan Zhou; Keji Mao; Ming Xia; Ruo Hong Huan
International Journal of Security and Networks (IJSN), Vol. 12, No. 1, 2017
Abstract: This paper presents the clustering-based and distributed anchor-free positioning (CDAP), a beacon-free node localisation algorithm for wireless sensor networks. When there is no beacon node, the improved clustering algorithm based on node density (ICAND) algorithm is used for clustering. The proposed algorithm combines the angle measurement and the distance measurement to calculate the coordinates of all nodes in the regional coordinate system. Experiments show that the CDAP algorithm performs well in network coverage, positioning error and communication overhead rate, compared with the industry-recognised clustering SPA algorithm. The network coverage is increased by at least 51.3%. In addition, when the node density is larger than 0.9, the positioning error rate is reduced to 22.3% on average.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Security and Networks (IJSN):
Login with your Inderscience username and 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