2022

Постійне посилання на фонд

https://ela.kpi.ua/handle/123456789/50069

Переглянути

Перегляд 2022 за Ключові слова "621.396.4"

Зараз показуємо 1 - 2 з 2
  • Ескіз
    ДокументВідкритий доступ
    Heuristic algorithms for finding the minimum Steiner tree in the problem of optimizing the deployment and motion control of several flying information and telecommunication robots
    (National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2022) Lysenko, Olexandr; Valuiskyi, Stanislav; Novikov, Valeriy; Sushyn, Ihor; Chumachenko, Serhii; Guida, Oleksandr
    Background. The article explores the problem of combining the motion control of existing FITRs and the deployment of new FITRs so that the number of new FITRs deployed to support the communication of terrestrial subscribers can be minimized. This problem is formulated as the Steiner Minimum Tree Problem (SMT) with existing mobile Steiner points with a constraint on the edges length of the network graph. Objective. Improve the mathematical model for ensuring the connectivity of episodic radio networks using FITRs and improve the algorithms for providing the connectivity of episodic radio networks using FITRs. Methods. The two algorithms (deploying new FITRs before moving existing FITRs, and moving existing FITRs before deployment of new FITRs) separate the problem and solve the deployment problem, the movement one after the other. In contrast, the algorithm for deploying new FITRs while moving existing FITRs optimizes the deployment problem and the control of movement across and solves these two problems simultaneously. Results. A proposed method includes three heuristic algorithms for placing new FITRs, taking into account the movement of existing FITRs (that is, considering scenarios for moving existing FITRs: deploying new FITRs before, after, or during the movement of existing FITRs) for the SMT problem with existing mobile Steiner points with a constraint on the edges length of the network graph. Conclusions. Evaluation of the effectiveness of the proposed algorithms in various scenarios shows that algorithms taking into account the movement of existing FITRs are always more efficient (in terms of the number of newly added FITRs) than an algorithm without taking into account the movement of existing FITRs.
  • Ескіз
    ДокументВідкритий доступ
    Method of operational calculation of coordinates of intermediate route points of flying information robot
    (National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, 2022) Lysenko, Olexandr; Valuiskyi, Stanislav; Yavisya, Valerii; Tachinina, Olena; Novikov, Valery; Sushin, Ihor
    Background. The article describes an operational calculation method of the intermediate points' coordinates of the flying information robot (FIR) route, which collects information from mobile sensors of a mobile wireless sensor network. Objective. The purpose of the paper is to develop a method that allows building the movement trajectory of the LIR, minimizing the time for collecting information from mobile sensors. Methods. The quickly calculating method of the route' coordinates of intermediate points involves setting a quasi-mobile mode of sensors movement and the consistent use of algorithms for solving the navigation problem, the clustering problem, and the problem of finding the flying trajectory around information collection points from mobile sensors clusters that formed at the time of the start of collecting information. Results. A method has been developed that uses the procedures of quantitative calculation of the indicators of the structural-information connectivity of wireless sensor networks with mobile sensors. These indicators take into account the presence of not only a structural connection, but also a guaranteed information exchange between a given sender-destination pair. Conclusions. The developed method makes it possible to improve the indicators of the structural-information connectivity of wireless sensor networks with mobile sensors: k-connectivity and network bandwidth.