Abstract
Background/Objective: In most of the applications of WSN from traffic monitoring to military applications via surveillance location of the node is the prime concern. Various localization algorithms are there for the position estimation but their capabilities are varying from one another in the context of the deployment mode, accuracy in location determination and complexity. Hence this paper focuses on the comparative analysis of various range free localization algorithms under distributed environment. Methods/Statistical Analysis: Algorithms such as APIT, DV-Hop, MDS-MAP, Centroid, Grid Scan, Bounding Box and Amorphous are tested in MATLAB under various parameters and results are then compared. Findings: Main parameter for the comparison is the localization error. Simulation results emphasis on the algorithms suitability with respect to the parameters in hand. From the results it is evident that with the increase of the number of nodes the localization error value decreases and also by increasing the range value the same impact is seen on the error value. MDS-MAP is the best approach of localization in both of the scenarios either by increasing the node amount or by increasing the range value.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
