Abstract
Wireless Sensor Networks (WSNs) have a wonderful potential to interconnect with the physical world and collect data. Data estimation, long lifespan, deployment, routing, task scheduling, safety, and localization are the primary performance difficulties for WSNs. WSNs are made up of sensor nodes set up with minimal battery power to monitor and reveal the occurrences in the sensor field. Detecting the location is a difficult task, but it is a crucial characteristic in many WSN applications. Locating all of the sensor nodes efficiently to obtain the precise location of an occurrence is a critical challenge. Surveillance, animal monitoring, tracking of moving objects, and forest fire detection are just a few of the applications that demand precise location determination. To cope with localization challenges in WSNs, there is a variety of localization algorithms accessible in the literature. The goal of this research is to use various optimization strategies to solve the localization problem. In this work, a modified learning enthusiasm-based teaching–learning-based optimization (mLebTLBO) algorithm is used to cope with a 2D localization problem applying the notion of an exclusive anchor node and movable target nodes. A modified LebTLBO algorithm seeks to increase overall efficiency by assessing the exploration and exploitation abilities. The computational results reveal that this technique outperforms others with respect to localization errors in a 2D environment of WSN.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献