An accurate distributed rage free localization algorithm for WSN

Since there is no priorly knowledge about the locations of most of the sensors which scattered randomly in an area, wireless sensor network localization methods try to find out where sensors are located. A new distributed range-free localization algorithm is proposed in this paper. The method first uses convex optimization techniques to find bounding boxes that contain target nodes locations estimation, and then nodes cooperate with each other in finite number of iterations to enhance the accuracy of whole network location estimation. As well as, results of the algorithm have been compared with five range-free based methods like DV-hop, APIT and Amorphous and the proposed method provides more accurate results in mean error metric.