| Autor: |
Mohar, Satinder Singh, Goyal, Sonia, Kaur, Ranjit |
| Předmět: |
|
| Zdroj: |
Wireless Personal Communications; Jul2024, Vol. 137 Issue 1, p287-324, 38p |
| Abstrakt: |
The process of discovering the location of occurring event is critical task in wireless sensor network but it is foremost necessity of various applications of WSN such as detection of fires in the forests and monitoring the enemy movement in military applications etc. In all above stated applications of WSN the exact positions of nodes are required otherwise data accumulated by nodes is irrelevant. Therefore node localization has important role in such applications of WSN. In this paper Jaya algorithm is proposed to localize the sensor nodes with greater accuracy in WSN. The benefits of Jaya algorithm is that it has limited parameters, converges faster and specific tuning of parameters is not required to achieve optimum performance. To validate the effectiveness of Jaya algorithm various factors for instance iterations, range and anchor nodes are varied and results show that node localization using Jaya algorithm is more accurate, has taken less time to localize nodes and converges earlier than other existing algorithms. In addition to this to authenticate the efficiency of Jaya algorithm the various scenarios of target nodes and anchor nodes are considered and the performance of proposed Jaya algorithm is compared with several existing algorithms in terms of computation time, mean localization error and localized nodes. The results revealed that Jaya algorithm has reduced mean localization error almost 64–80% and has taken almost 85–96% less computation time than these existing algorithms for 150 target nodes and 35 anchor node scenario respectively. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink