|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM337529892 |
| 003 |
DE-627 |
| 005 |
20250303022754.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2022 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1007/s11227-022-04320-x
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n1124.xml
|
| 035 |
|
|
|a (DE-627)NLM337529892
|
| 035 |
|
|
|a (NLM)35221523
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Mohar, Satinder Singh
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Localization of sensor nodes in wireless sensor networks using bat optimization algorithm with enhanced exploration and exploitation characteristics
|
| 264 |
|
1 |
|c 2022
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 16.07.2022
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
|
| 520 |
|
|
|a Wireless sensor networks (WSNs) contain sensor nodes in enormous amount to accumulate the information about the nearby surroundings, and this information is insignificant until the exact position from where data have been collected is revealed. Localization of sensor nodes in WSNs plays a significant role in several applications such as detecting the enemy movement in military applications. The major aim of localization problem is to find the coordinates of all target nodes with the help of anchor nodes. In this paper, two variants of bat optimization algorithm (BOA) are proposed to localize the sensor nodes in a more efficient way and to overcome the drawbacks of original BOA, i.e. being trapped in local optimum solution. The exploration and exploitation features of original BOA are modified in the proposed BOA variants 1 and 2 using improved global and local search strategies. To validate the efficiency of the proposed BOA variants 1 and 2, several simulations have been performed for various numbers of target nodes and anchor nodes, and the results are compared with original BOA and other existing optimization algorithms applied to node localization problem. The proposed BOA variants 1 and 2 outperform the other algorithms in terms of mean localization error, number of localized nodes and computing time. Further, the proposed BOA variants 1 and 2 and original BOA are also compared in terms of various errors and localization efficiency for several values of target and anchor nodes. The simulations results signify that the proposed BOA variant 2 is superior to the proposed BOA variant 1 and existing BOA in terms of several errors. The node localization based on the proposed BOA variant 2 is more effective as it takes less time to perform computations and has less mean localization error than the proposed BOA variant 1, BOA and other existing optimization algorithms
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Bat optimization algorithm
|
| 650 |
|
4 |
|a Computation time
|
| 650 |
|
4 |
|a Localization error
|
| 650 |
|
4 |
|a Node localization
|
| 650 |
|
4 |
|a Target nodes
|
| 700 |
1 |
|
|a Goyal, Sonia
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Kaur, Ranjit
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t The Journal of supercomputing
|d 1998
|g 78(2022), 9 vom: 13., Seite 11975-12023
|w (DE-627)NLM098252410
|x 0920-8542
|7 nnas
|
| 773 |
1 |
8 |
|g volume:78
|g year:2022
|g number:9
|g day:13
|g pages:11975-12023
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/s11227-022-04320-x
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 78
|j 2022
|e 9
|b 13
|h 11975-12023
|