METHOD OF MANAGING ROUTING OF DATA FLOWS IN HETEROGENEOUS NETWORKS UNDER CONFLICT, UNCERTAINTY AND DISTURBANCE

This paper proposes a method of synthesis of data transmission routes in conflicting heterogeneous self-organized wireless data networks under external and internal influences. In this case, routing is understood as the process of determining in a data transmission network one or a set of routes (pathspaths) , that are optimal within the selected criteria between a given pair or set of network nodes. Thus, a route is a sequence of network nodes and data transmission paths that connect a pair of network nodes for communication. The method is based on a mathematical model of the data network operation in a virtual multidimensional parameter space. The model of operation is based on a graph-model of information interaction of network nodes in the process of data transmission between receptor nodes and acceptors in the transmission of data streams. Based on the problem statement, the price function is formally defined as the value of the virtual distance between the nodes of a heterogeneous data network. In contrast to the Floyd-Warshall and Dijkstra algorithms, the synthesis of the data transmission route takes into account both the load of the computing environment of network nodes a