
doi: 10.1049/sil2.12091
Abstract In this study, we propose an underwater localization method based on an improved invasive weed optimization algorithm to accurately locate moving sources in underwater sensor networks. First, the Lévy flight model is introduced into the invasive weed optimization algorithm to enhance its global search ability and avoid falling into local optima. At the same time, under the condition that the observed noise of each observation is Gaussian noise and does not consider the influence of other error factors, the localization error is adopted as the objective function to obtain an initial estimate for the unknown source parameter. Then, the obtained initial estimates of the target position and velocity as well as the target parameter error are utilized to construct a new localization model. Finally, the precise position of the source and its velocity are obtained according to the weighted least square method. The performance of the algorithm is verified by comparing it with the Cramér–Rao Lower Bound (CRLB). Results from simulations indicate that the algorithm proposed in this paper has excellent localization accuracy compared to existing methods and achieves results close to the CRLB.
Telecommunication, TK5101-6720
Telecommunication, TK5101-6720
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
