Development of an algorithm for information interaction in sensor systems and a model for estimating computational complexity
Abstract
This article focuses on the development of an algorithm for information interaction in sensor systems. In the context of this paper, a sensor system will be understood as a set of informationally, energetically and physically connected sensor devices. The object of the study is wireless sensor systems. The subject of the study is information interaction algorithms and computational complexity model. The purpose of the work is to develop an algorithm of information interaction and a model for evaluating computational complexity in sensor systems. In the course of analyzing the most common algorithms for finding the shortest path, it was found that these algorithms involve a large number of calculations, to reduce them can be narrowing the search area. The proposed algorithm is based on the corollary of the cosine theorem proved in previous works. To compare the number of calculations, the computational complexity of the algorithm was evaluated and compared with existing algorithms for shortest path search.
Full Text:
PDF (Russian)References
A. E. Kucheryavy, A. I. Paramonov, M. A. Makolkina, A. Muthanna. S. A., Vybornova A. I., Dunaytsev R. A., Zakharov M. V., Gorbacheva L. S., Chan Z. T., Marochkina A. V. Three-dimensional multilayer heterogeneous superdense networks // Information technologies and telecommunications. 2022. Vol. 10. No. 3. С. 1-12. DOI 10.31854/2307-1303-2021-10-3-1-12.
Romanova A. A. A. Simulation model of information interaction in the Internet of Things // Izv. SPbGETU “LETI”. 2022. Т. 15, № 8. С. 69-76. doi: 10.32603/2071-8985-2022-15-8-69-76.
Verzun, N. A. Efficiency indicators of the information interaction process in the Internet of Things / N. A. Verzun, M. O. Kolbanev, A. A. Romanova // Izvestiya SPbGETU LETI. - 2022. - № 3. - С. 5-14. – doi:10.32603/2071-8985-2022-15-3-5-14.
Kormen T., Leiserson C., Rivest R., Stein K. Algorithms: construction and analysis. 2nd ed. Moscow: Williams Publishing House, 2011. 1296 с.
Kravchenko K. I., Mineeva T. A. Dijkstra's algorithm for determining the shortest route // Trends in science and education. - 2021. - №. 72-1. - С. 61-65. doi: 10.18411/lj-04-2021-12.
Manakova, V. A. Analysis of methods for solving the traveling salesman problem using Dijkstra and A* algorithms / V. A. Manakova, A. S. Kostin // System analysis and logistics. - 2023. - № 3(37). - с. 136 - 142. DOI: 10.31799/2077-5687-2023-3-136-142.
V. N. Kudashov, E. Selina. G. Fundamentals of linear programming //SPb, RF: ITMO University. - 2020.
Kirilova, D. A. Criterion for selecting the optimal message transmission route in wireless sensor networks / T. N. Astakhova, D. A. Kirilova, M. O. Kolbanev [et al.] // Telecommunications. - 2020. - № 7. - С. 6-12.
Isa, M. G. Classification of route optimization algorithms / M. G. Isa, R. J. Satybaldieva // Internauka. - 2020. - № 21-1(150). - С. 26-28.
Sokolinsky, L. B. Investigation of scalability of the apex method for solving super large linear programming problems on cluster computing systems / L. B. Sokolinsky, I. M. Sokolinskaya // Supercomputer Days in Russia: Proceedings of the International Conference, Moscow, September 21-22, 2020 / Edited by V. V. Voevodin. - Moscow: MAKS Press LLC, 2020
Refbacks
- There are currently no refbacks.
Abava Кибербезопасность IT Congress 2024
ISSN: 2307-8162