Abstract

The localization of mobile nodes in wireless sensor networks has been formulated as a concave optimization problem. The same has been approached through biologically inspired firefly algorithm (FA) and the artificial bee colony (ABC) algorithm. In the proposed method, a mobile node approximates its distance from multiple anchor nodes. The distance and the coordinates of the anchors are the parameters used by FA and ABC algorithms for the accurate estimation of the location by minimizing the suitably defined localization error. The localization method used here is iterative, and it works in a distributed fashion. A comparison of the performances of FA and ABC algorithms in terms of localization accuracy and computation time has been presented. FA exhibits higher accuracy of localization, while ABC is quicker.

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.