CP-NR Distributed Range Free Localization Algorithm in WSN

Deepak Prashar, Kiran Jyoti, Dilip Kumar


Advancements in wireless communication technology have empowered the researchers to develop large scale wireless networks with huge number of sensor nodes. In these networks localization is very active field of research. Localization is a way to determine the physical position of sensor nodes which is useful in many aspects such as to find the origin of events, routing and network coverage.  Locating nodes with GPS systems is expensive, power consuming and not applicable to indoor environments. Localization in three dimensional space and accuracy of the estimated location are two factors of major concern. In this paper, a new three dimensional Distributed range-free algorithm which is known as CP-NR is proposed. This algorithm has high localization accuracy and resolved the problem of existing NR algorithm. CP-NR (Coplanar and Projected Node Reproduction) algorithm makes use of co-planarity and projection of point on plane concepts to reduce the localization error. Results have shown that CP-NR algorithm is superior to NR algorithm and comparison is done for the localization accuracy with respect to variations in range, anchor density and node density.

Full Text:


DOI: http://doi.org/10.11591/ijaas.v7.i3.pp212-219


  • There are currently no refbacks.

International Journal of Advances in Applied Sciences (IJAAS)
p-ISSN 2252-8814, e-ISSN 2722-2594
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Web Analytics View IJAAS Stats