Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Tytuł pozycji:

Dragonfly-based swarm system model for node identification in ultra-reliable low-latency communication.

Tytuł:
Dragonfly-based swarm system model for node identification in ultra-reliable low-latency communication.
Autorzy:
Bhardwaj, Sanjay
Kim, Dong-Seong
Temat:
TELECOMMUNICATION systems
EVOLUTIONARY computation
LEGACY systems
MATHEMATICAL optimization
DRAGONFLIES
BIOLOGICALLY inspired computing
ODONATA
Źródło:
Neural Computing & Applications; Mar2021, Vol. 33 Issue 6, p1837-1880, 44p
Czasopismo naukowe
Latency and reliability are essential parameters for enabling ultra-reliable low-latency communication (URLLC). Therefore, an approach for node identification that satisfies the requirements of latency and reliability for URLLC based on the formation of swarms by dragonflies, called dragonfly node identification algorithm (DNIA), is proposed. This method maps bio-natural systems and legacy communication into metrics of URLLC, i.e., latency and reliability, for node identification. A performance analysis demonstrates that the new paradigm for mapping the metrics, i.e., latency and reliability, in terms of nodes (food source) and noise (predators) provides another dimension for URLLC. A comparative analysis proves that DNIA demonstrates significant impact on the improvement of latency, reliability, packet loss rate, as well as throughput. The robustness and efficiency of the proposed DNIA are evaluated using statistical analysis, convergence rate analysis, Wilcoxon test, Friedman rank test, and analysis of variance on classical as well as modern IEEE Congress on Evolutionary Computation 2014 benchmark functions. Moreover, simulation results show that DNIA outperforms other bioinspired optimization algorithms in terms of cumulative distributive function and average node identification errors. The conflicting objectives in the tradeoff between low latency and high reliability in URLLC are discussed on a Pareto front, which shows the improved and accurate approximation for DNIA on a true Pareto front. Further, DNIA is benchmarked against standard functions on the Pareto front, providing significantly superior results in terms of coverage as well as convergence. [ABSTRACT FROM AUTHOR]
Copyright of Neural Computing & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Zaloguj się, aby uzyskać dostęp do pełnego tekstu.

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies