×
Suggest this Article to:
TOP INDEXERS
Public Article
-
verified
Efficiency-complexity evaluation methods of routing algorithms in mobile ad hoc networks
ISSN: 2744 - 2527
Publisher: author
Efficiency-complexity evaluation methods of routing algorithms in mobile ad hoc networks
Indexed in
Computer Science and Technology Section
ARTICLE-FACTOR
1.3
Article Basics Score: 3
Article Transparency Score: 2
Article Operation Score: 2
Article Articles Score: 2
Article Accessibility Score: 3
SUBMIT PAPER ASK QUESTION
International Category Code (ICC):
ICC-0202
Publisher: "ims" Vogosca
International Journal Address (IAA):
IAA.ZONE/2744395522527
eISSN
:
2744 - 2527
VALID
ISSN Validator
Abstract
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-comple...
