Efficiency-complexity evaluation methods of routing algorithms in mobile ad hoc networks

Routing in multidomain and multilayer networks is the subject of constant theoretical research, with special emphasis on routing optimization algorithms based on several criteria. Such research results in new proposals. The basic task of the algorithm is to perform the given task in a finite and reasonable period of time and with reasonable resource requirements. When new solutions are compared with previous solutions, it is necessary to consider as much information as possible about the characteristics and differences between these algorithms, which ultimately determines the degree of success of the algorithm. Routing algorithms depend on the goals to be achieved and most often solve a certain group of problems with certain simplifications of the overall problem and to the detriment of performance that are not crucial for a given routing optimization problem. Therefore, it is necessary to have acceptable methods for efficiency-complexity evaluation methods of routing algorithms with certain, universally applicable, metrics. Several theoretical approaches, including graph theory, optimization theory, complexity theory, allow approaches to compare the algorithms and the results achieved with the help of these algorithms.