Abstract
This paper presents analysis of a geometrical computation based localization mechanism for wireless sensor networks. Authors analyze its accuracy for parameters like number of reference nodes, number of communications and different power level. Multiple anchors are used to analyze the performance of algorithm in terms of mean square error (m.s.e) of localization and no. of communications required. An unknown node determines its feasibility region of location from all communicable anchors with the help of available inaccurate distance and angle measurements. The advertisement of feasibility region of this node helps other nodes to further reduce their own feasibility region. The overall effect is reduction in the mean square error of localization. The number of iteration to achieve acceptable level of precision and accuracy is also taken into consideration. The results indicate that an increase in no of anchors or transmission range has a limited effect on localization error.
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.
