A Distributed Heuristics of Localization in Wireless Sensor Network

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