A. Rana, Virender Khurana, A. Shrivastava, Durgaprasad Gangodkar, Deepika Arora, Anil Kumar Dixit
{"title":"A ZEBRA Optimization Algorithm Search for Improving Localization in Wireless Sensor Network","authors":"A. Rana, Virender Khurana, A. Shrivastava, Durgaprasad Gangodkar, Deepika Arora, Anil Kumar Dixit","doi":"10.1109/ICTACS56270.2022.9988278","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks (WSNs) make use of an abundance of sensor nodes in order to gain a deeper understanding of the world around them. If the data were not gathered in an open and honest fashion, then no one would be interested in them. In military applications, for instance, the detection of opponent movement relies substantially on the placement of sensor nodes in wireless sensor networks (WSNs). Discovering the locations of all target nodes while utilizing anchor nodes is the major purpose of the localization challenge. This research suggests two adjustments that could be made to the zebra optimization algorithm (ZOA) in order to improve upon its deficiencies, one of which being its tendency to get trapped in the local optimal solution. In versions 1 and 2 of the ZOA, the exploration and exploitation components have been modified to make use of improved global and local search algorithms. In order to assess how effective, the proposed ZOA versions 1 and 2 are, a large number of simulations have been run, each with a different combination of target nodes and anchor nodes and a different number of each. In order to solve the problem of node localization, ZOA, along with a number of other attempted optimization strategies, are employed, and the outcomes obtained by each strategy are compared. Versions 1 and 2 of ZOA perform far better than its competitors in terms of the mean localization error, the number of nodes that are successfully localized, and the computation time. ZOA versions 1 and 2 are proposed, and the initial ZOA is evaluated in terms of how accurately it localizes nodes and the number of errors it generates when provided with a range of possible values for the target node and the anchor node. The simulations prove without a reasonable doubt that the suggested ZOA variation 2 performs better than both the existing ZOA and the original proposal in a variety of ways. The proposed ZOA variation 2 is superior to the proposed ZOA variation 1, ZOA, and other existing optimization methods for determining the location of a node because it performs calculations at a faster rate and has a lower mean localization error. This is due to the fact that the proposed ZOA variation 2 is based on a more accurate probability distribution.","PeriodicalId":385163,"journal":{"name":"2022 2nd International Conference on Technological Advancements in Computational Sciences (ICTACS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Conference on Technological Advancements in Computational Sciences (ICTACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTACS56270.2022.9988278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Wireless sensor networks (WSNs) make use of an abundance of sensor nodes in order to gain a deeper understanding of the world around them. If the data were not gathered in an open and honest fashion, then no one would be interested in them. In military applications, for instance, the detection of opponent movement relies substantially on the placement of sensor nodes in wireless sensor networks (WSNs). Discovering the locations of all target nodes while utilizing anchor nodes is the major purpose of the localization challenge. This research suggests two adjustments that could be made to the zebra optimization algorithm (ZOA) in order to improve upon its deficiencies, one of which being its tendency to get trapped in the local optimal solution. In versions 1 and 2 of the ZOA, the exploration and exploitation components have been modified to make use of improved global and local search algorithms. In order to assess how effective, the proposed ZOA versions 1 and 2 are, a large number of simulations have been run, each with a different combination of target nodes and anchor nodes and a different number of each. In order to solve the problem of node localization, ZOA, along with a number of other attempted optimization strategies, are employed, and the outcomes obtained by each strategy are compared. Versions 1 and 2 of ZOA perform far better than its competitors in terms of the mean localization error, the number of nodes that are successfully localized, and the computation time. ZOA versions 1 and 2 are proposed, and the initial ZOA is evaluated in terms of how accurately it localizes nodes and the number of errors it generates when provided with a range of possible values for the target node and the anchor node. The simulations prove without a reasonable doubt that the suggested ZOA variation 2 performs better than both the existing ZOA and the original proposal in a variety of ways. The proposed ZOA variation 2 is superior to the proposed ZOA variation 1, ZOA, and other existing optimization methods for determining the location of a node because it performs calculations at a faster rate and has a lower mean localization error. This is due to the fact that the proposed ZOA variation 2 is based on a more accurate probability distribution.