Abstract
High accuracy, low computational cost and infrequent information exchange are three basic requirements for distributed localization algorithm in sensor networks. In this paper, we first propose an optimized triangulation heuristics to locate neighbor nodes in an optimal sequence such that the probability of wrong location selection can be minimized and localization accuracy can be improved to certain extent. Next, the available distributed localization algorithm is improved by introducing confidence index, a metric which helps set up the best shortest path for locating remote sensor nodes. Simulation results show that the method can give satisfactory performance without excessive computational and communication costs
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.
