Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing
Artykuł w czasopiśmie
MNiSW
140
Lista 2021
| Status: | |
| Autorzy: | Przystupa Krzysztof, Pyrih Julia, Beshley Mykola, Klymash Mykhsilo, Branytskyy Andriy, Beshley Halyna, Pieniak Daniel, Gauda Konrad |
| Dyscypliny: | |
| Aby zobaczyć szczegóły należy się zalogować. | |
| Rok wydania: | 2021 |
| Wersja dokumentu: | Drukowana | Elektroniczna |
| Język: | angielski |
| Numer czasopisma: | 8 |
| Wolumen/Tom: | 14 |
| Strony: | 1 - 24 |
| Impact Factor: | 3,252 |
| Web of Science® Times Cited: | 1 |
| Scopus® Cytowania: | 4 |
| Bazy: | Web of Science | Scopus |
| Efekt badań statutowych | NIE |
| Finansowanie: | This work was financed in the framework of the project Lublin University of Technology, Regional Excellence Initiative, funded by the Polish Ministry of Science and Higher Education (contract no. 030/RID/2018/19). This research was supported by the project No. 0120U102201 “Development the methods and unified software-hardware means for the deployment of the energy efficient intent-based multi-purpose information and communication networks” and by the project No 0120U100674 “Development of the novel decentralized mobile network based on blockchain- architecture and artificial intelligence for 5G/6G development in Ukraine”. |
| Materiał konferencyjny: | NIE |
| Publikacja OA: | TAK |
| Licencja: | |
| Sposób udostępnienia: | Witryna wydawcy |
| Wersja tekstu: | Ostateczna wersja opublikowana |
| Czas opublikowania: | W momencie opublikowania |
| Data opublikowania w OA: | 17 kwietnia 2021 |
| Abstrakty: | angielski |
| With the constant growth of requirements to the quality of infocommunication services, special attention is paid to the management of information transfer in wireless self-organizing networks. The clustering algorithm based on the Motley signal propagation model has been improved, resulting in cluster formation based on the criterion of shortest distance and maximum signal power value. It is shown that the use of the improved clustering algorithm compared to its classical version is more efficient for the route search process. Ant and simulated annealing algorithms are presented to perform route search in a wireless sensor network based on the value of the quality of service parameter. A comprehensive routing method based on finding the global extremum of an ordered random search with node addition/removal is proposed by using the presented ant and simulated annealing algorithms. It is shown that the integration of the proposed clustering and routing solutions can reduce the route search duration up to two times. |
