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

Journal Title: SCIENCE, ENGINEERING AND TECHNOLOGY - Year 2021, Vol 1, Issue 2

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-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.

Authors and Affiliations

Belma Memić, Alem Čolaković, Adisa Hasković Džubur, Elma Avdagić-Golub

Keywords

Related Articles

Modelling of Pollutants Dispersion from Open Burning of Solid Waste Using AERMOD

This study evaluates the air quality impact of open burning of solid waste activities in Ilorin, Nigeria. An emission inventory was carried out to quantify the emitted CO, NOx and SOx from 2016- 2020 into the study area....

Rough estimation of cell numbers in 5G networks using simple mathematical calculations

This paper focuses on the problem of 5G network cell planning. In addition, it presents an example of a rough estimation of the required number of cells or base stations in a certain area for arbitrary number of users wh...

Microservice development using RabbitMQ message broker

Nowadays, when applications are being developed faster with the introduction of agile methodologies and new technologies, microservices are emerging. The microservices make applications easier to create and maintain when...

Traffic Signal Controller Optimization Through VISSIM to Minimize Traffic Congestion, CO and NOx Emissions, and Fuel Consumption

In developing countries with heterogeneous traffic, such as Sri Lanka, it is possible to observe severe traffic congestion at intersections and traffic corridors. The main objective of this study was to demonstrate the o...

Recycling of Waste Cartons and Musanga cecropioides Heartwood into Composite Panels for Structural Application

In this research, the suitability of composite panels developed from waste carton paste (WCP) and Musanga cecropioides heartwood particles (MHP) was assessed for structural applications. Proportions of the MHP adopted we...

Download PDF file
  • EP ID EP698373
  • DOI https://doi.org/10.54327/set2021/v1.i2.12
  • Views 133
  • Downloads 0

How To Cite

Belma Memić, Alem Čolaković, Adisa Hasković Džubur, Elma Avdagić-Golub (2021). Efficiency-complexity evaluation methods of routing algorithms in mobile ad hoc networks. SCIENCE, ENGINEERING AND TECHNOLOGY, 1(2), -. https://europub.co.uk/articles/-A-698373