Forming a plurality of disjoint paths in wireless computer networks
DOI:
https://doi.org/10.18372/2073-4751.4.8040Keywords:
беспроводные компьютерные сети, многопутевая маршрутизация, алгоритм Дейкстры, временная сложностьAbstract
Based on Dijkstra's algorithm developed an algorithm for multipath routing, forming a set of disjoint paths and characterized by lower time complexity compared to the baseline algorithm multipath routetionReferences
Mrs Soumyashree Sahoo. Secure Routing in Wireless Sensor Networks / Mrs Soumyashree Sahoo, Mr Pradipta Kumar Mishra, Prof. Dr. Rabi Narayan Satpathy // IJCSI International Journal of Computer Science Issues .- 2012.-Vol.9, №1. – Р.189-191.
Кулаков Ю.А.Безопасная многопутевая маршрутизация в беспроводных сетях большой размерности / Кулаков Ю.А., Лукашенко В.В., Левчук А.В. // Науково-Практичний Журнал «Захист Інформації».- 2011.-T.2, №51. – С.5-10.
Кулаков Ю.А. Разработка и моделирование процесса безопасной многопутевой передачи информации в мобильных сетях / Кулаков Ю.А., Коган А.В., Пирогов А.А. // Вісник НТУУ «КПІ». Інформатика, управління та обчислювальна техніка: збірник наукових праць. – К.: Век+, 2011. – № 54. – C. 145-149.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.




