Abstract: The subject of this research is the search algorithm for loopless routes from transmitter to the recipient of network traffic in the conditions of a known network topology. In designing data transmission network, one of the primary problems is the formation of network traffic routing, due to the fact that heavy traffic often cause the occurrence of bottlenecks in form of the overloaded communication node, which results in speed reduction of data transmission. This article provides the search algorithm for loopless routes from transmitter to the recipient of network traffic; the result is presented as a set of loopless  routes in accordance with the specified network topology. The article also provides the software code of the algorithm written in the C# language, as well as the results of test solutions of the specified topologies. The algorithm was developed via experimental and theoretical methods, on the bases of the available route search algorithms, such as Floyd's algorithm and Dijkstra's algorithm, as well as mechanisms of static and dynamic routing, such as RIP, OSPF, and EIGRP. The novelty of this work consists in elaboration of search algorithm for loopless routes from transmitter to the recipient in the conditions of the available network topology; and in comparison of the acquired results with other methods of formation phase variables. This algorithm allows generating a list of all loopless routes within the indicated network topology between the pair of interacting nodes.

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 subject of the study is the formation of a radio network topology with placement of mobile radio stations, in which the total radiated signal power for radio stations will be minimized. The radiation power of signals for all radio stations and the coordinates for mobile radios are determined in the article, it is also assumed that the transmitting antennas of all radio stations have a circular pattern. To solve this problem, a mathematical model is constructed that has a number of assumptions that imply ideal conditions for the propagation of radio waves, as well as the location of radio stations in a Cartesian coordinate system. The development of the algorithm was carried out by an experimental-theoretical method, based on known facts of radio transmission and a mathematical solution of the Steiner problem for four and five vertices. The novelty of the study is the developed algorithm for determining the coordinates of mobile radio stations, as well as the radiation power of signals for stationary and mobile radios with a circular pattern of directionality. The result of the algorithm works is to determine the topology of the network and the range of operation of each radio station, which consumes the lowest radiation power of the transmitting antennas of radio stations.

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.