Abstract: The subject of this research is the frequency planning algorithm for networks with an arbitrary topology of links over radio channels. The algorithm determines the total number of non-overlapping frequency ranges for the entire network and provides the distribution of each frequency range between communication nodes. The algorithm consists of two stages: at the first stage, there is a search and simultaneous distribution of frequency channels, the so-called main frequency range, as a result, only one frequency range is allocated to each node; at the second stage, additional frequency channels are searched for, which can be used by a separate subset of nodes, thus , some nodes can use more than one frequency range, but several at once. The novelty of this research lies in the developed frequency planning algorithm for wireless communication systems with an arbitrary topology of communications over radio channels. The result of the operation of the algorithm for a wireless communication system is the allocation of radio frequencies for communication nodes from the common frequency band allocated for the wireless communication system, in terms of reuse, eliminating the effect of interference. The result for communication nodes is the allocation of a baseband and an additional frequency band, taking into account the topology of the radio network, which can be used by a separate subset that makes wireless communication systems resistant to narrowband random interference.

Abstract: The subject of the study is to obtain spanning trees for propagating traffic over broadcast channels using the known network topology and known routes. To solve this problem, a mathematical model is constructed in which the network topology is regarded as an undirected graph, but the described solution is also suitable for an oriented graph, where a separate direction is represented by a separate edge. The proposed solution does not require flexible scalability of the network, therefore, when changing the initial input parameters, it is necessary to repeatedly execute the sequence of algorithms described in the article. The development of the algorithm was carried out by an experimental-theoretical method using the mathematical model of a graph constructed from the known topology of the network and the compilation of spanning trees on its basis. The result of the presented work is in determining the necessary number of spanning trees for the optimal solution of the network routing problem. The novelty of this research is the possibility of applying the developed solution in the link-layer networks according to the OSI reference model, exclusively for broadcasting traffic of a given network topology.

Abstract: The object of study involves radio frequency planning when designing a radio network.  The frequency allocation within the provided range is one of the key problems in radio networks, since when the frequency is incorrectly provided for the radio station, there may be the radio wave interference effect, and the information transfer becomes distorted.  The article provides an algorithm for frequency planning, which may be used for providing  frequency for the radio stations within radio networks, the algorithm involves circular pattern, known radio station coordinates and the emitted radio power. The development of the algorithm involved experimental theoretical method based upon the known facts regarding radio broadcast and result modeling, as well as use of software. The novelty of the study is due to the development of an algorithm for frequency planning when designing a radio network for a provided frequency resource for a radio station with the circular pattern, known coordinates and emitted radio power. The result of its application involves distribution of radio frequency with their dual use, while excluding interference effect.