Providing Safe Routing in Wireless Self-Organizing Networks

Purpose of the study: development of a distributed routing algorithm to ensure security in wireless self-organizing networks from intruder attacks on the network. Methods: application of algorithms, graph theory, discrete optimization and heuristic approaches based on the results of numerical experiments. Results: the paper proposes a modified distributed routing algorithm for self-organizing networks. The algorithm, presented in this paper, is based on a distributed version of Dijkstra’s algorithm, designed to detect the shortest paths without loops on a graph under conditions of changing the weight of its edges. The loop freedom in this case is achieved by storing at each node an additional table containing the penultimate nodes on the shortest routes to all nodes, which allows the node to build a tree of shortest routes with itself as a root. In the modification of the algorithm, these tables are used by the nodes to check the correspondence of the declared route and the return route, which makes it possible to recognize and exclude from the network an intruder who carries out attacks to disrupt the correct routing mechanism. The effectiveness of the proposed algorithm for protection against routing attacks, in particular, black hole attacks, is confirmed by the results of testing on a program model.