The thesis demonstrates the operation of the routing algorithm that is the protocol responsible for data transmission in wireless Mesh networks. This protocol is responsible for data transmission. These algorithms fundamentally have impact on the self-organizing network capabilities, especially when a large area is covered with wireless technology. The thesis compares three different routing protocol, their common features are stability, flexibility and speed. The operation of the three algorithms is compared through real data obtained in various environments. Setting different options during the experiments make the simulation of real network events possible, because the speed and reliability of these algorithms may be critical for the availability of the self-organizing network. In that case the speed and reliability of algorithms are crucial importance in self-organizing network availability. The results not only rank the routing protocols, but provide a basis for selecting the proper one when deploying a network.