Routing Algorithm For Mobile Ad-hoc Networks Research Articles

Evaluating the quality of service of Opportunistic Mobile Ad Hoc Network routing algorithms on real devices: A software-driven approach

Opportunistic Mobile Ad Hoc Networks (MANETs) offer versatile solutions in contexts where the Internet is unavailable. These networks facilitate the transmission between endpoints using a store-carry-forward strategy, thereby allowing information to be stored during periods of disconnection. Consequently, selecting the next hop in the routing process becomes a significant challenge for nodes, particularly because of its impact on Quality of Service (QoS). Therefore, routing strategies are crucial in opportunistic MANETs; however, their deployment and evaluation in real scenarios can be challenging. In response to this context, this paper introduces a monitoring software-driven tool designed to evaluate the QoS of routing algorithms in physical opportunistic MANETs. The implementation and its components are detailed, along with a case study and the outcomes provided by an implementation of the proposed solution. The results demonstrate the effectiveness of the implementation in enabling the analysis of routing protocols in real scenarios, highlighting significant differences with simulation results: mobility patterns in simulations tend to be inaccurate and overly optimistic, leading to a higher delivery probability and lower latency than what is observed in the real testbed.

Performance evaluation with scalability varying on energy consumption in S-DYMO, M-DYMO and FB-B-DYMO routing algorithm in MANETs

Mobile Ad Hoc Networks (MANETs) are dynamic and self-configuring networks characterized by node mobility and decentralized operations. Efficient routing protocols play a crucial role in ensuring reliable communication while optimizing resource usage, particularly energy consumption. This paper presents a comparative performance evaluation of three prominent routing algorithms, such as S-DYMO, M-DYMO, and FB-B-DYMO, focusing on their scalability and energy efficiency in MANET environments. This study utilizes simulation-based experiments to assess the performance metrics of S-DYMO, M-DYMO, and FB-B-DYMO. Key parameters evaluated include packet delivery ratio (PDR), end-to-end delay, routing overhead, and energy consumption under varying network sizes and mobility scenarios. Each algorithm's ability to scale with network size and maintain performance under dynamic conditions is analyzed to understand its suitability for real-world MANET deployments. The results indicate that S-DYMO exhibits robust scalability and efficient energy utilization in small to medium-sized networks, leveraging its proactive route discovery approach. Conversely, M-DYMO demonstrates competitive performance in larger networks due to its reactive route maintenance strategy, which balances energy efficiency with scalability challenges. FB-DYMO, integrating feedbackbased mechanisms, shows promising results in mitigating routing overhead and energy consumption but exhibits sensitivity to network dynamics. The findings provide insights into the trade-offs between scalability and energy consumption inherent in S-DYMO, M-DYMO, and FB-B-DYMO routing algorithms, offering guidance for selecting appropriate protocols based on specific MANET deployment scenarios. Future research directions include enhancing protocol adaptability to dynamic network conditions and optimizing energy-efficient routing strategies tailored for evolving MANET environments.

Deep reinforcement learning-based collaborative routing algorithm for clustered MANETs

Flexible adaptation to differentiated quality of service (QoS) is quite important for future 6G network with a variety of services. Mobile ad hoc networks (MANETs) are able to provide flexible communication services to users through self-configuration and rapid deployment. However, the dynamic wireless environment, the limited resources, and complex QoS requirements have presented great challenges for network routing problems. Motivated by the development of artificial intelligence, a deep reinforcement learning-based collaborative routing (DRLCR) algorithm is proposed. Both routing policy and subchannel allocation are considered jointly, aiming at minimizing the end-to-end (E2E) delay and improving the network capacity. After sufficient training by the cluster head node, the Q-network can be synchronized to each member node to select the next hop based on local observation. Moreover, we improve the performance of training by considering historical observations, which can improve the adaptability of routing policies to dynamic environments. Simulation results show that the proposed DRLCR algorithm outperforms other algorithms in terms of resource utilization and E2E delay by optimizing network load to avoid congestion. In addition, the effectiveness of the routing policy in a dynamic environment is verified.

Formulation and Implementation of Energy Efficient Routing Algorithm for MANET along with Performance Analysis

Mobile adhoc network (MANET) is composed of wireless mobile nodes/devices which are moving randomly in infrastructure-less adhoc environments. Topology among mobile nodes is dynamic in nature and keeps on changing regularly. The adhoc environment is open to all the genuine users as well as intruders/attackers. Moreover, the wireless connection between mobile nodes can break at any time on account of mobility of nodes. Also, the mobile notes depend on their battery power, which may go down because of exhaust of battery power. Hence, it is a very complex task to implement energy efficient routing over MANET. While handling energy efficient routing, the optimum utilization of batter power is required. In this research paper, efforts have been carried out to formulate an algorithm for energy efficient routing over MANET. Its performance has been studied through network simulator. The simulations have been carried out by writing self created network scenarios with 20, 60 and 100 mobile nodes. Moreover, analysis of the proposed energy efficient routing protocol has been done with AODV routing protocol by using various performance evaluation metrics viz. packet delivery ratio, normalized routing load, average end to end delay, packet loss, throughput, average energy consumed and average energy left. It was derived from the performance analysis that proposed protocol provides energy efficient routing over MANET and also gives better or almost same performance in comparison to AODV.

A cryptographic approach to prevent network incursion for enhancement of QoS in sustainable smart city using MANET

A city-wide communication network capable of supporting a range of applica- tions should be established through the use of wireless sensor networks that collect, analyze, and act on data in order to provide solutions for smart city im- plementation. A smart city network confronts a number of obstacles, including changing the network's coverage area to accommodate different applications, non-uniform node distribution, an increase in message volume, the use of multi- ple communication technologies, and node and message heterogeneity. Numer- ous aspects of smart cities are being investigated, with a few applications being developed in each. This article conducts a survey to describe various sensor network choices for smart cities. The research explores message transmission challenges via the lens of applications such as taxi sharing, ambulance services, and other emergency services that rely on real-time traffic data provided by the smart traffic domain to work successfully. Mobile Ad Hoc Networks (MANETs) are employed in a range of areas due to its advantage in rapidly establishing networks. The network will perform ideally if mobile nodes collaborate and trust one another; hence, message transmission for this service, as well as the utility of MANET routing algorithms, are examined.

Performance Analysis of Routing Protocols in Mobile Ad Hoc Networks (MANETs)

Mobile devices are able to build their own networks, which are referred to as mobile ad hoc networks. These networks do not require any kind of permanent wiring or other infrastructure (MANETs). The success of MANETs and their adaptability to a variety of tasks is, to a considerable extent, based on the routing protocols that they use. Using metrics such as routing overhead, end-to-end delay, and packet delivery ratio, we compare and contrast the various routing protocols that can be employed in MANETs, including proactive, reactive, and hybrid protocols. This comparison and contrast is carried out in this study. In addition to this, we discuss the simulation tools that are utilized to evaluate the efficacy of MANET routing algorithms and define the several performance indicators that may be utilizedin the course of this endeavor. This paper makes a contribution to an ongoing body of research into the analysis of routing protocols in MANETs by offering guidance to network engineers and researchers on how to select the most appropriate routing protocol and simulation tool for a particular MANET scenario. In doing so, the paper maximizes the potential for effective and efficient communication between mobile nodes, which is one of the main goals of the research.

Bio-inspired routing algorithm for MANETs based on fungi networks

The major trends today show that mobile ad hoc networks (MANETs) are increasingly taking up space in the domestic and corporate market with the growth of numbers of users and new applications. Just as various systems were inspired by the behavior of social insects (ants, bees, among others), fungal colonies also demonstrate potential for bio-inspiration of new protocols for MANETs because they exhibit behavior and capacity for self-organization of adaptive, resilient and efficient natural networks in transporting nutrients. In this work, HyphaNet proposes a new bio-inspired approach in the fungi dynamics to develop an algorithm for the creation, optimization and selection of routes for MANETs. In HyphaNet, the routes are built similarly to the fungal mycelium, in which several parallel paths are initially established, but over time, only the hyphae of the best routes receive biomass for reinforcement and thickening of their walls, thus remaining and presenting greater flow attractiveness. Otherwise, less interesting routes remain rare or disappear completely. In this new algorithm, the routing process follows the idea of attractiveness, in which the data flow tends to travel through regions (nodes and links) with a higher concentration of immobile biomass, which indicates lower cost and greater availability of resources. In this model, the routes are reinforced with each data package delivered successfully and the distribution of immobile biomass is a function of the quality of the path between source and destination. The most attractive paths are more likely to be chosen by the route selection heuristic. HyphaNet is reactive, multipath, and the results of the simulations on the NS-2 show good performance compared to the classic AODV and SARA based on ant colony.

An Exploration into Energy Efficient Algorithms Based on the Techniques of Particle Swarm Optimization in MANET

This paper throws understanding into nature inspired meta-heuristic algorithm; Particle Swarm Optimization based technique in designing various energy efficient MANET routing algorithms. Mobile ad hoc network (MANET) is a framework-less system of self-directed mobile nodes. Owing to the dynamic topological property of MANET, it’s very rigid task to calculate the performance of routing protocol under unpredictable network conditions and the performance of the network will degrade. The performance of Mobile Ad-hoc network is measured by metrics such as packet delivery ratio, battery power and total delay in delivery. Regular variation in topology affect route selection and lifespan of network, hence it is essential to optimize these metrics parameters. There are various protocols developed for routing. These routing paths are established to send data packets through the shortest path without a satisfying multi-objective approach. The purpose of the research is to discuss different approaches of swarm based intelligence routing algorithms used in MANET under dynamic conditions by comparing the measured metrics and to design a novel effective PSO based routing procedure for MANET.

Performance Evaluation of DSR for MANETs with Channel Fading

Due to the fact that it does not rely on any infrastructure to operate, Mobile Ad Hoc Networks (MANETs) have been experiencing an exponential period of interest and potential application. In these networks, no central entity controls its operation, and rather the devices cooperatively control and coordinate the network. The aim of the current work is to study the performance of Dynamic Source Routing (DSR) algorithm for MANETs. Extensive experiments in different scenarios with several parameters under free space, two-ray ground and shadowing propagation models were performed. The study presented here indicates distinct network performance results depending on the propagation model used. For instance, it shows that the algorithm has difficulties to maintain routes in environments with severe fading. In addition, management of radio power so that the packet transmissions are tailored to reach only the desired nodes seems to be a good compromise between interference and coverage.

Hybrid on-demand greedy routing protocol with backtracking for mobile ad-hoc networks

PurposeThe purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking.Design/methodology/approachIt uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol.FindingsA new routing algorithm for MANETs which performs better than some of the existing algorithms.Research limitations/implicationsA major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks.Practical implicationsThe authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature.Originality/valueTo the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

Dual-Channel-Based Mobile Ad Hoc Network Routing Technique for Indoor Disaster Environment

The existing network infrastructure may not work well in a disaster environment caused by a fire or an earthquake. Instead of relying on the existing infrastructure, communicating through a mobile ad hoc network (MANET) is recommended because MANET can configure a network without an infrastructured communication system. In addition, firefighters conducting emergency activities in harsh environments surrounded by flames and smoke need a communication system to assist their rapid firefighting operations. Existing work is not suitable for indoor firefighter communications because they did not consider the indoor disaster environment well. In this proposed scheme, dual channels (i.e., 2.4 GHz and sub-GHz bands) are used for an efficient routing table configuration. Data frame and HELLO message are exchanged through the 2.4 GHz band, while the neighbor list of each node is exchanged through the sub-GHz band. Each node can configure the routing table based on the exchanged neighbor list. A performance evaluation is conducted to compare the proposed technique with enhanced versions of optimized link state routing (OLSR) and destination-sequenced distance vector routing (DSDV). The results show that the proposed scheme outperforms the other two MANET routing algorithms (i.e., OLSR-mod and DSDV-mod) in terms of the packet delivery ratio (PDR), end-to-end delay, and initial routing table configuration time approximately 27.8%, 4.7%, and 166.7%, respectively.

Hybrid PSO-DE algorithm-based trust and congestion aware cluster routing algorithm for MANET

In mobile ad hoc networks (MANET) focuses on network life time parameter link with energy problems that nodes faces during the prediction of direction and limited battery. The process changes network topology and network security. The paper concentrate on the life time energy based clustering algorithm using the fitness value incorporated with the hybrid PSO and differential algorithm for evaluation. Here, the algorithm focuses on election of the cluster head and energy relates with selection of cluster heads nodes during the hybrid PSODE for clustering algorithm. The proposed work may be extremely being intensively for the NS-3 network simulator, which incorporates with the other existing algorithms. Some results may be effectiveness for the proposed algorithm might be in terms of network life time, average life time, number of average clusters formation, average number of reclustering required with the energy consumption and the other parameter such as the packet delivery ratio.

Hybrid PSO-DE algorithm-based trust and congestion aware cluster routing algorithm for MANET

In mobile ad hoc networks (MANET) focuses on network life time parameter link with energy problems that nodes faces during the prediction of direction and limited battery. The process changes network topology and network security. The paper concentrate on the life time energy based clustering algorithm using the fitness value incorporated with the hybrid PSO and differential algorithm for evaluation. Here, the algorithm focuses on election of the cluster head and energy relates with selection of cluster heads nodes during the hybrid PSODE for clustering algorithm. The proposed work may be extremely being intensively for the NS-3 network simulator, which incorporates with the other existing algorithms. Some results may be effectiveness for the proposed algorithm might be in terms of network life time, average life time, number of average clusters formation, average number of reclustering required with the energy consumption and the other parameter such as the packet delivery ratio.

Multicast Routing Protocols for Mobile ADHOC Networks

Mobile Ad-hoc Networks (MANETs) is a self-configuring network that doesn’t follows any predetermined infrastructure. In MANETs there are collections of independent nodes which are associated through wireless and at the same instance it is allowed to change its links to other nodes frequently without any fixed infrastructure. Multicast routing is concurrently sending a message from single source to several destinations and it is an efficient approach to establish the communication between groups of nodes in the wireless network. Multicast routing plays very important roles in the fields of video conferencing, co-operative works, distance education, video on demand, cyber database updating and querying, etc. These applications can provide themselves to manage multicast operations. Almost all different type of multicast routing algorithms in MANETs are facing various issues like limited bandwidth, possibility packets loose, delay variance, energy consumption and transmission overhead problem. There are several multicast routing protocol has been proposed to overcome the challenges of multicast routing and play very significant roles in the current scenario. Nowadays, dissimilar multicast routing algorithms with unique characteristic have been introduced. In this paper complete survey on multicast routing algorithm to highlight their advantages, limitation and also show the future direction in multicast routing in MANETs.

Neuro Fuzzy Controllers Based Multipath Routing Technique in Mobile Adhoc Networks (MANETs)

Mobile ad hoc networks (MANETs) comprise a set of wireless mobile nodes that communicates data between them with no infrastructure. The nature of restricted communication range of wireless network nodes leads to the requirement of multi-hops to communicate data in the network. Multipath routing discovers many routes among an individual source and destination. MANET possesses a network that has a tendency to change its structure frequently; hence the task of accomplishing a prescribed number of pathways between a prescribed source and destination nodes appears to be tedious. A new Neuro fuzzy oriented routing algorithm in MANET (NFRA) has been proposed in this work. The ultimate objective of the NFRA algorithm is to suitably create the fuzzy type controllers with the aim of minimizing the quantity of reconstructions in the wireless ad hoc network. The obtained simulation results have been found to portray both the efficiency and effectiveness of the applications incorporated into the Mobile ad hoc networks.

A probabilistic home-based routing scheme for delay tolerant networks

In traditional Mobile Adhoc Networks routing algorithms, the existence of a sustainable path between the source and destination is a crucial issue. These algorithms are shown to be unsuccessful in Delay Tolerant Networks (DTNs) since the network is almost disrupted, and then such a path is not guaranteed. Although Store-and-Forward routing approach has provided an adequate solution for these networks, it suffers from the large end-to-end delay and the additional traffic and communication costs incurring the network. This study presents an efficient single-copy home-based routing scheme for DTNs. Two different scenarios, referred as blind and semi-blind, are considered based on the amount of available knowledge about the destination. Simulation results presented in this paper demonstrate that the performance of the proposed scheme is closely approaching the unrestricted flooding algorithm, the Epidemic. Moreover, the proposed scheme provides a low communication cost, an outstanding end-to-end delay and a high successful delivery ratio as compared to state-of-art algorithms.

A novel multi-featured metric for adaptive routing in mobile ad hoc networks

The design of adaptive, scalable, and low cost routing protocols presents one of the most challenging research problems in mobile ad hoc networks (MANETs). Many routing protocols for MANETs have been proposed in the literature, which are based mainly on selecting the shortest path between communication endpoints. In this paper, a new evolution-based routing metric called EVO is proposed. This metric is generated automatically by means of genetic programming. In the evolution process of this metric, mobility- and traffic-related features are employed. In this study, the metric is applied to the Ad hoc On-Demand Distance Vector (AODV) protocol, one of the most popular on-demand routing algorithms for MANETs. The modified version of AODV, called EVO-AODV, ranks and selects routes according to the evolved multi-featured metric between communication endpoints. The performance of the proposed metric has been tested on networks with varying mobility and traffic patterns. The metric is also compared with AODV and two recently proposed routing metrics, the hop change metric (HOC) (Zangabad 2014) and encounter-based routing metric (PER) (Son et al. in Ad Hoc Netw 14:2–14, 2014). The extensive simulation results demonstrate that the proposed approach improves the packet delivery ratio significantly and also decreases the packet drop rate, routing overhead, and end-to-end delay, especially on networks under medium traffic.

A Stable and Energy-Efficient Routing Algorithm Based on Learning Automata Theory for MANET

The mobile Ad Hoc network (MANET) is a self-organizing and self-configuring wireless network, consisting of a set of mobile nodes. The design of efficient routing protocols for MANET has always been an active area of research. In existing routing algorithms, however, the current work does not scale well enough to ensure route stability when the mobility and distribution of nodes vary with time. In addition, each node in MANET has only limited initial energy, so energy conservation and balance must be taken into account. An efficient routing algorithm should not only be stable but also energy saving and balanced, within the dynamic network environment. To address the above problems, we propose a stable and energy-efficient routing algorithm, based on learning automata (LA) theory for MANET. First, we construct a new node stability measurement model and define an effective energy ratio function. On that basis, we give the node a weighted value, which is used as the iteration parameter for LA. Next, we construct an LA theory-based feedback mechanism for the MANET environment to optimize the selection of available routes and to prove the convergence of our algorithm. The experiments show that our proposed LA-based routing algorithm for MANET achieved the best performance in route survival time, energy consumption, energy balance, and acceptable performance in end-to-end delay and packet delivery ratio.

An Intelligent Secured and Energy Efficient Routing Algorithm for MANETs

Energy consumption and security are two important aspects of Mobile Ad Hoc Networks (MANETs). In MANET, application security can be provided using trust management, key management, firewalls and intrusion detection. Moreover, it is often necessary to communicate secret information in military applications where urgent and reliable communication is more important. However, most of the existing routing algorithms do not focus on the energy and security aspects while routing. Since energy and security are important criteria for reliable communication in MANET, it is essential to consider the energy and security aspects in routing algorithms. The prevention of security attacks on routing protocols and cluster based routing automatically reduces the energy consumption. Hence, we propose a new secured routing protocol called Cluster based Energy Efficient Secure Routing Algorithm (CEESRA) in this paper which is energy efficient and uses cluster based routing in which the trust scores on nodes are used to detect the intruders effectively. This routing algorithm reduces the Denial of Service attacks more efficiently by using intelligent agents for effective decision making in routing. From the experiments conducted with this trust based secured routing algorithm, it has been observed that this proposed routing algorithm not only enhances the security but also reduces the energy consumption and routing delay.

On the Repair Time Scaling Wall for MANETs

The inability of mobile ad hoc network (MANET) deployments to scale beyond about 100 nodes, in practice, has traditionally been blamed on insufficient network capacity for supporting routing related control traffic. This letter observes, however, that network capacity remains significantly underutilized by standard MANET routing algorithms at this scale of deployment. Therefore, instead of characterizing the scaling limit for MANET routing in terms of capacity, this letter characterizes it in terms of the interaction between the dynamics of path failure (caused by mobility) and of path repair. This leads to the discovery of the repair time scaling wall, which is used to explain the observed scaling limits in MANETs. The impact of repair time scaling wall on MANETs is identified, and techniques to extend the scaling limits are described.