Abstract

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.

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 call

Disclaimer: 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.