Relevance. The information age is generating huge amounts of data, creating serious problems for traditional storage methods and media such as hard drives, solid-state drives and cloud storage. Storage densities on such media are slowing down and their service life is not significantly increased. The capital costs associated with traditional data storage and maintenance costs for updating them are increasing.

This makes it urgent to search for alternative options of large data storage technologies. In recent years, the hot spot for global research has been the use of DNA molecules as information carriers.

DNA is a biopolymer with high density, reliability and widespread in nature. Compared to traditional media, DNA storage requires little energy to maintain and can be maintained at room temperature and under controlled conditions for thousands of years.

Given sufficient improvement in DNA recording and scanning techniques, these characteristics point to the potential of DNA as a reliable and inexpensive solution for data storage that does not require periodic technological change.

The aim of this study is to systematize and analyze knowledge about opportunities and challenges associated with the implementation of biomolecular technologies in the information infrastructure of the future. Special attention is given to methods of coding, synthesis, storage, reading and converting data into DNA, as well as mathematical models of DNA archiving. The main objective of the study is to identify the advantages and limitations of the technologies under consideration in the context of high growth rates of digital data volumes.

The scientific novelty of work is the authors' systematization and analysis of methods and mathematical models of DNA archiving, corresponding to each of the stages of the process of organization of data storage in DNA, based on a review of modern scientific studies on the subject under consideration.

The theoretical significance of the study consists in the synthesis of scientific and practical experience on the application of methods and models of biomolecular storage of digital data. The results broaden the scope for understanding the advantages and limitations of DNA archiving, as well as contributing to the development of advanced combined approaches that integrate the capabilities of molecular biology, bioinformatics, nanotechnologies and information systems, to overcome existing limitations and effectively address data management challenges.

Relevance: modern stochastic generative models (GANs, diffusion models) provide high-quality image synthesis; however, their probabilistic nature precludes precise spatial control over composition and detail hierarchy, limiting their application in tasks requiring result reproducibility and predictability. Consequently, there is a need to develop deterministic synthesis algorithms that combine controllability of the structural organization of generated data with potential for practical application in computer graphics and generative design.

Purpose: demonstration of the potential of the deterministic image synthesis algorithm based on the inverse packet discrete wavelet transform (IPDWT) for solving practical tasks in computer graphics and generative design that require reproducibility, interpretability, and controllability of the generation process.

Methods: analytical review, mathematical modeling, modified IPDWT procedure, hierarchical synthesis from an 8×8 pixel binary mask, experimental implementation in gaming environments.

Results: five variants of practical application were developed and analyzed: a structural control tool for generative AI ("wavelet brush"), procedural landscape generation with corrective masks, creation of seamless textures, surface detailing of low-polygon 3D models, and wavetable generation for sound synthesis.

Novelty. For the first time, the applicability of the deterministic image synthesis algorithm as a structural control tool for computer graphics and generative design tasks is investigated, demonstrated through five practical scenarios: generation of conditioning maps for generative neural networks, procedural terrain generation, creation of seamless textures, texturing of low-poly models, and wavetable generation.

Practical Significance. The obtained results allow forming controlled image structures with guaranteed reproducibility, allow creating seamless textures without additional boundary post-processing due to internal periodicity, and allow automating the creation of wavetables with controlled spectral evolution of timbre. The proposed approach opens new opportunities in computer graphics, the gaming industry, and digital design, where interpretability and controllability of the generation process are crucial.

Relevance. The development of V2X systems and the migration of computing toward edge and fog nodes require containerization and orchestration mechanisms; however, the overhead introduced by the orchestration platform itself can reduce the benefit of distributed service placement and is particularly important for resource-constrained infrastructure.

The aim of the study is to estimate the resource cost of using KubeEdge on top of K3s under an identical microservice workload that emulates V2X message processing and to establish a baseline for subsequent evaluation of service placement algorithms.

Methods. A review and systematization of current microservice approaches to V2X, edge, and fog computing were carried out. K3s and K3s + KubeEdge configurations were experimentally compared on the same cloud VPS with unchanged hardware resources, software environment, and five workload profiles from idle to stress. Each profile was executed three times and the obtained results were averaged. CPU utilization, RAM consumption, network traffic, request counts, and the 95th and 99th latency percentiles were measured.

Results. Adding KubeEdge increased RAM consumption by approximately 95–105 MB, or 6–8 % relative to K3s. Differences in CPU utilization, network traffic, and latency were minor; the increase in p95/p99 under high load occurred in both configurations and was primarily associated with node saturation.

Novelty. The study separately evaluates the platform overhead of KubeEdge while keeping the V2X-oriented application workload unchanged.

Practical significance. The obtained baseline can be used in further experiments to compare fixed and adaptive microservice placement in a distributed cloud–edge environment and to distinguish the application-level effect of balancing algorithms from orchestration overhead.

The relevance. The development of telepresence systems and metaverses necessitates the creation of suits equipped with multiple tactile sensors, including temperature sensors. A large number of sensors generates high traffic, while the requirements for immersiveness impose constraints on minimal latency. At the same time, the communication channel is a bottleneck: increased traffic load raises latency and packet loss, thereby degrading the quality of haptic feedback. The problem of selecting temperature data encoding methods that account for the physiology of perception and the statistical properties of the signals remains open, which determines the relevance of this study.

The purpose of the study is to reduce the traffic intensity generated by temperature sensors in telepresence suits while preserving the quality of thermal sensation reproduction, through the development of models and methods for data processing and transmission that take into account the spectral properties of the signals and the physiology of perception.

Methods. The study employed mathematical statistics and probability theory to estimate the marginal distribution of sensor reading deviations, as well as queuing theory to analyze channel-induced latency.

Results. An analysis of temperature sensor signals was performed, based on which two groups were identified: "fast" signals (finger sensors, with an upper spectral bound of ~2 Hz) and "slow" signals (sensors on other body parts, ~1 Hz), for which sampling rates of 4 Hz and 2 Hz are substantiated, respectively. A dynamic range compression method for temperature signals based on an S-curve is developed, enabling bit width reduction from 10 to 8 bits. An adaptive data transmission format for a group of sensors is proposed, which employs the mean value and deviations of readings, with optimal selection of the bit width for encoding deviations via integer optimization.

The novelty lies in the fact that, for the first time, a dynamic range compression method for temperature sensor signals based on an S-curve is proposed, which accounts for the nonlinearity of temperature perception in accordance with the Weber – Fechner law. Unlike existing analogs, the developed adaptive format exploits the probabilistic properties of the deviation distribution for dynamic bit width selection, adapting the data volume to the current signal characteristics.

The theoretical significance consists in establishing the relationships between the probabilistic properties of temperature sensor signals, their encoding bit width, and the volume of transmitted data, which enable informed selection of the transmission format parameters depending on the number of sensors and the variance of the measured temperatures.

The practical significance lies in the possibility of using the obtained results in the design of tactile data exchange subsystems for telepresence devices and interfaces for interaction with metaverses.

The relevance of this research stems from the need to improve the efficiency of backscatter signal processing in correlation optical reflectometers.

The purpose of this study is to optimise data acquisition and processing in a correlation optical reflectometer through the development of a new algorithm.

This study employs methods of mathematical modelling, correlation analysis and theoretical calculations. A programme was developed in the Visual Basic 6 environment for the study. Processing is carried out using pseudo-random sequences and new algorithms.

Results. A block diagram and a new processing algorithm are proposed. Simulations of the formation of partial and resulting reflectograms have been carried out. An algorithm for reconstructing the initial section has been developed. A comparison of the characteristics of the traditional and proposed methods has been carried out.

The novelty. The use of a circular register to accumulate measurement results and perform a single calculation of the cross-correlation function of the sum signal eliminates the need for correlation processing of each individual reflectogram. For the first time, an algorithm has been proposed for reconstructing the initial section of the resulting reflectogram whilst the photodetector is blocked for the duration of the probe signal.

The theoretical significance of this work lies in the derivation of the temporal characteristics of signal recording and processing in correlation optical reflectometers, as well as in a comparative assessment of the effectiveness of various processing algorithms.

The practical significance lies in the possibility of using the new algorithm and software model in the design of correlation optical reflectometers for the diagnosis of fibre-optic communication lines. The proposed solutions make it possible to reduce the time taken to obtain a reflectogram and to improve efficiency.

Relevance. There is a development of new technologies, in particular the transition from 5G/IMT2020 to 6G/IMT–2030 communication networks, implies the use of new scenarios and services. Sixth-generation networks have significantly increased the quality and quantity of services, such as immersive technologies, holographic type communications, etc. Thus, it is necessary to develop new models and methods that support high standards of communication quality.

The purpose of this study is to develop a scenario for maintaining communication quality in user dynamics in conditions of ultra-high dense networks and to determine the route of a repeater coordinator serving as a mobile base station.

The paper uses methods of fuzzy clustering of users, stochastic models of queuing, as well as numerical modeling of service quality indicators.

Results. The dependence of the target function of the quality of service on the trajectory of the repeater coordinator is obtained.

The novelty lies in the development of a method for providing communication in ultra-dense networks based on the use of a swarm of repeater robots and determining their route based on the requirements.

The practical significance lies in the possibility of using the scenario in interaction with a swarm of robots to unload the network or maintain communication quality.

To achieve the specified probabilistic-temporal characteristics of adaptive communication systems, an important task is to choose the optimal signal-code construction. At the same time, for the most flexible control of the code rate and, consequently, the correcting ability of the code, the method of puncturing bits is often used. In this case, some of the encoded bits are not transmitted over the communication channel, and zero bit values are usually put in their places on the receiving side. On average, half of these zero bits will be correct, but their reliability will be minimal.

The paper presents a method for reconstructing perforated bits of a precision code, i.e. their "recovery with some probability". It is shown that if one of the connected bits is punctured, then it can be reconstructed. An assessment of the reliability of the reconstructed bit can also be obtained.

The purpose of the work is to demonstrate the possibility of reconstructing the perforated bits of the convolutional code and obtaining their soft evaluation, as well as the probabilistic characteristics provided by this method. The purpose of the punctured bit reconstruction method is to improve the probabilistic characteristics of adaptive packet data communication systems using perforated convolutional codes.

Research methods: as a research method, a simulation of a communication system using punctured convolutional codes with various perforation masks was carried out.

As a result, expressions for the relationship of encoded bits of a convolutional code with a code rate of 1/2 for any polynomials are obtained. Expressions are used to obtain the reconstructed bit and evaluate its reliability. Theoretical expressions are given for the probability of occurrence of a given number of errors for a channel with an additive white Gaussian noise.

The novelty lies in the theoretical elaboration of a method for reconstructing and evaluating the reliability of punctured bits of convolutional codes.

The practical significance lies in improving the probabilistic characteristics of adaptive communication systems that use perforated convolutional codes, namely, in reducing the bit-error rate and packet error rate.

The relevance of the topic is determined by the need to create highly directional low-profile antennas with a fan-shaped radiation pattern, designed to solve search, monitoring and remote communication tasks in the microwave range.

The aim of the study is to develop a microwave leaky wave antenna with a simple radiating aperture design, a fan-shaped radiation pattern with a narrow main lobe width in one plane and a reduced level of side radiation.

Methods. Analytical review of scientific publications to substantiate the selection of key parameters for the radiating aperture geometry. Numerical and analytical modeling of the antenna based on an original 2D model, full-wave 3D modeling using the Weyland finite integral method, and parametric synthesis of the radiating aperture.

To solve this problem, a low-profile linear microwave antenna (9.3–9.4 GHz) was developed with a fan-shaped radiation pattern. The radiating aperture is implemented using a dielectric transmission line comprising a flat dielectric waveguide shielded by a conductive grating and excited by a horn-lens device. With an aperture area of less than 0.2 m², the antenna boasts an efficiency of approximately 89 % and can guarantee a gain of at least 31.5 dB with a 1.2° E-plane radiation pattern and a sideband radiation level of approximately –19 dB.

The scientific novelty of this work is determined by the author's approach to combining methods for analyzing and synthesizing a linear leaky-wave antenna based on 2D and 3D models. For the first time in Russian practice, the feasibility of implementing a highly directional leaky-wave antenna with a simple aperture design and reduced lateral radiation in the operating plane has been demonstrated.

Practical significance. The developed methodology enables the design of low-profile leaky-wave antennas with standard and specialized radiation patterns based on mathematical methods. The results obtained in this study can be used to solve search, monitoring, and remote communications problems, where a narrow antenna radiation pattern combined with reduced sideband radiation is an important requirement.

The relevance. In telecommunication systems, distributed storage subsystems directly affect service availability and quality of service, which is particularly important in the context of the development of highly available 5G and beyond communication networks and systems, where the execution of operations depends not only on the state of the network subsystem, but also on the storage nodes and their parameters.

The purpose of the study: to develop a method for assessing the availability of a Fog-level distributed storage subsystem for servicing operations in a telecommunication network, taking into account replication parameters, the write acknowledgment mode, and the condition of infrastructure elements.

Methods of reliability and availability theory, probabilistic analysis, and a comparative study of distributed storage subsystem configurations were used.

Results. Analytical relationships were obtained for determining the availability coefficient for servicing write operations, taking into account the level of redundancy, the write acknowledgment threshold, and the condition of critical-path elements. A classification of traffic and data oriented toward the selection of replication parameters and write acknowledgment modes was proposed.

The novelty of the study is determined by the transition from assessing the availability of individual nodes and the cluster as a whole to assessing the availability of operation execution in a Fog-level distributed storage subsystem.

The theoretical significance lies in the development of the methodological framework for assessing the availability of distributed storage subsystems in telecommunication systems.

The practical significance consists in the possibility of using the proposed method when selecting replication parameters and the write acknowledgment mode for Fog-level storage subsystems. 

The relevance of the work is determined by the fact that with the significantly increased volumes of data transmitted in communication systems, developers of communication tools have developed a need for high-order Hadamard matrices. For example, the principle of attenuation of the amplitude of Noise acting in a data transmission channel is reviewed when they are transformed by orthogonal matrices. The quality of choosing a large-order matrix for the corresponding task depends on the variety of their possible designs that affect the transformation parameters.

The aim of the study is to find possible simple ways to obtain Hadamard matrices with structures other than the well-known Sylvester structures.

The methods for calculating orthogonal Hadamard matrices proposed in this paper are based on the features of structural invariants, such as cyclic blocks, as well as a bicyclic core with fringing.

The novelty lies in the revealed interrelationships of quasi-orthogonal matrix constructions, which make it possible to obtain Hadamard matrices of Sylvester and non-Sylvester sequences with the constructions core with a border and core with a double border.

The practical significance lies in expanding the diversity of orthogonal Hadamard matrices by design types and ensuring the selection of the necessary matrix for a specific telecommunications system task.

The scientific significance lies in the development of the theory of orthogonal matrices in terms of establishing fundamental relationships between the orders of matrices and their structures. The description of high-order Hadamard family matrices in the form of invariants of lower-order matrices embedded in their structure, including those with bordering and double bordering, leads to the emergence of a universal basis for their joint finding (construction), which becomes an orthogonal hyperobject.

The determination of the impulse response of a communication channel is necessary for organizing optimal processing of received signals, which indicates the relevance of studying OFDM systems and their modifications for channels with intersymbol interference. Taking these circumstances into account, the purpose of the study is formulated as estimation of the impulse response of the communication channel with minimization of the estimation error.

In this work, methods of least squares and regularization are used to compute the impulse response, while the estimation is performed with the selection of optimal OFDM test signals. At the initial stage, estimation of the impulse response is carried out by the least squares method for known OFDM test signals. An important aspect of the computational process is the proper choice of the regularization parameter value to minimize the systematic bias of the regularized estimates.

Results. In the course of solving the scientific problem experimental studies have been obtained that confirm the effectiveness of the proposed method for estimating the impulse response in combination with optimal test signals, demonstrating a small deviation of the estimated values.

Scientific novelty of the work is determined by the proposed algorithm for dynamically varying communication channels with on-line estimation, which provides continuous refinement of the channel impulse response and improves the quality of signal reception.

The practical significance of the developed algorithm lies in the fact that it can be used to estimate the impulse response in OFDM systems and their modifications: N OFDM, which involves the use of non orthogonal channel allocation techniques; COFDM technology (Coded Orthogonal Frequency Division Multiplexing), which implements additional coding with forward error correction; OFDMA technology (Orthogonal Frequency Division Multiple Access), which ensures joint use of a single frequency simultaneously by several network users in the presence of intersymbol interference in the communication channel.

The obtained experimental results demonstrate a significant improvement in the quality of coherent signal reception when using the proposed algorithms for impulse response estimation in combination with the selected test signal combinations in OFDM systems with intersymbol interference.

Relevance. Telepresence and human-avatar interaction systems impose strict requirements on data transmission latency. Traditional load-balancing algorithms, such as Round-Robin, lack adaptability to changing network conditions and computational loads, resulting in increased latency. With the advent of 6G networks and the growing volume of multimodal data (e. g., video, audio, and haptic information), there is a need for rapid service migration to ensure immersive interaction. The absence of intelligent resource allocation mechanisms hinders the deployment of telepresence applications in fields such as telemedicine, remote robot control, and virtual collaboration.

Purpose of the work. To improve the efficiency of service migration and resource allocation in edge computing networks for human-avatar interaction systems by developing an algorithm based on Multi-Agent Reinforcement Learning (MARL). This study addresses the challenge of reducing total latency when distributing heterogeneous telepresence services across computing resources with limited capacity.

Methods used. Analytical modeling, simulation in MATLAB, and a comparative analysis of the developed ML-MARL algorithm against the baseline Round-Robin algorithm.

The results. The developed ML-MARL algorithm, utilizing Q-learning, reduces total service allocation latency by 60% (from 66 ms to 26 ms) compared to Round-Robin. The algorithm is shown to converge within 500 training episodes.

Scientific Novelty. This study proposes, for the first time, the application of multi-agent Q-learning with a modified strategy to the problem of rapid service migration in telepresence systems.

Theoretical significance. The results obtained expand the theoretical foundations for applying MARL in 6G networks to tasks with strict latency constraints.

Practical significance. The proposed algorithm can be used in the development of systems for remote telemedicine, virtual presence, the Tactile Internet, and industrial robotics, where latency of less than 30 ms is critical.  

Relevance. A steady trend towards an increase in the number of destructive information attacks, the complexity of the methods used, and the use of artificial intelligence by attackers necessitates the use of proactive methods to ensure the security of critical information infrastructure. The implementation of such methods requires the timely detection and neutralization of hidden targeted attacks on protected objects.

Objective. Improving the information security of critical information infrastructure facilities based on the developed method for early detection of hidden information influence.

Methods: comparative analysis within the framework of a systematic approach; synergetics, theory of complex technical systems, probability theory.

Decision. A method for early detection of hidden information impact on critical information infrastructure objects has been developed, based on the dynamics of changes in their internal state under the influence of targeted attacks. An algorithm for implementing the method has been proposed, taking into account the stochastic nature of assessing the indicators of an attack. The method has predictive capabilities and the ability to adapt to changing conditions, taking into account the probabilities of false and undetected failures (false positives and false negatives regarding the presence of destructive influence).

Novelty. An original method is proposed that is invariant to the properties and characteristics of destructive influence, as well as to the type and structure of critical information infrastructure objects, and has elements of adaptation based on the stochastic nature of the impact detection feature.

Practical significance. The presented results can be used to create promising intrusion detection systems, which will improve the security of critical information infrastructure facilities and other important information systems. The technical solutions based on the proposed method can be integrated into existing or future intrusion detection systems and SIEM systems.