DV-hop localisation algorithm with DDICS (Q2224099)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: DV-hop localisation algorithm with DDICS |
scientific article; zbMATH DE number 7305382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DV-hop localisation algorithm with DDICS |
scientific article; zbMATH DE number 7305382 |
Statements
DV-hop localisation algorithm with DDICS (English)
0 references
3 February 2021
0 references
Summary: Dimension by dimension improvement-based cuckoo search algorithm (DDICS) is a recent proposed variant of cuckoo search algorithm. The experimental results illustrate DDICS is superior to several other evolutionary algorithms when solving un-constraint numerical benchmarks. In this paper, we employ it to improve the performance of distance vector-hop method (DV-hop). The simulation results show it achieves the best performance when compared with two other DV-hop algorithms.
0 references
dimension by dimension improvement
0 references
cuckoo search
0 references
DDICS
0 references
DV-hop location
0 references
distance vector
0 references
average position error
0 references
localisation algorithms
0 references
simulation
0 references
0.6808496713638306
0 references
0.680442750453949
0 references
0.6565442681312561
0 references
