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

2021 ◽  
Vol 1 (2) ◽  
pp. 24-31
Author(s):  
Belma Memić ◽  
Alem Čolaković ◽  
Adisa Hasković Džubur ◽  
Elma Avdagić-Golub
Keyword(s):  
Ad Hoc ◽  
Optimization Theory ◽  
Evaluation Methods ◽  
Routing Algorithms ◽  
Theoretical Research ◽  
Routing Optimization ◽  
Basic Task ◽  
Theoretical Approaches ◽  
Resource Requirements ◽  
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.

scholarly journals Trust-enhanced secure multipath routing for mobile ad hoc networks

2021 ◽  
Author(s):  
Lubaid Ahmed
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Information Exchange ◽  
Ad Hoc ◽  
Communication Technologies ◽  
Trust Model ◽  
Routing Algorithms ◽  
Brute Force ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Due to recent advances in computing and communication technologies, Mobile Ad hoc Networks (MANETs) are becoming networks of choice for various applications such as emergencies [sic] preparedness and response, military and crisis management, and healthcare, to name a few. The main reason for this is that in MANET, information exchange between nodes can happen dynamically without pre-exisiting fixed network infrastructure with designated centralized access points. However, this privilege also comes with some security drawbacks, especially from a message security viewpoint because the implementation of hard-cryptographic security now becomes a challenging prospect. In this thesis, we improve a recently proposed method of message security in MANET (so called benchmark scheme, also referred to as trust-based multipath DSR routing scheme), by introducing a trust model that makes multi-path routing flexible enough to avoid non-trusted routes that may use brute force attacks to decrypt messages travelling through the network en route to their destinations. Simulation results, coupled with theoretical justification, affirm that the proposed solution is much more secured than the above-mentioned benchmark method and traditional multi-path routing algorithms.

Re-Broadcast AODV(reAODV) Based Routing Protocol Modification Over AODV for VANET In City Scenario

2018 ◽  
Vol 9 (1) ◽  
pp. 51-65
Author(s):  
Soumen Saha ◽  
Utpal Roy ◽  
D.D. Sinha
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Original Algorithm ◽  
Packet Delivery ◽  
Packet Header ◽  
Hoc Networks

Vehicular ad-hoc networks or VANETs are a new method of training an ad-hoc network in traffic. The authors have numbers of routing algorithms on a MANET. But none of them works efficiently in a VANET with respect to being a safe and secure transport system. The authors have proposed a modification on an AODV routing algorithm for VANET with the introduction of the double-ended queue or dqAODV in a request packet header. A comparable good result was found in the throughput. In the present work, the authors introduce a modification of an original AODV by applying a partial re-broadcast of the request packet (RREQ) of an AODV. They found a comparable result in the throughput of the packet delivery aspect for this work with the original algorithm and dqAODV. This is compared to the complexity in the original AODV algorithm.

Sign in / Sign up

Export Citation Format

Share Document