Routing Scheme For Mobile Ad Hoc Networks Research Articles

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization

ABSTRACT Mobile ad hoc networks (MANETs) facilitate rapid deployment due to independence from established infrastructure, relying instead on wireless technology where each node functions as a source, destination, or intermediary router. However, existing techniques fail to adequately address security and privacy concerns inherent in MANETs, rendering them impractical for real-world deployment. To tackle these challenges, this paper proposes the Blockchain Based Trusted Distributed Routing Scheme for MANET using Latent Encoder Coupled Generative Adversarial Network Optimized with Binary Emperor Penguin Optimizer (LEGAN-BEPO-BCMANET). This scheme leverages blockchain technology to establish a fair proof-of-reputation system, ensuring trusted and decentralized routing based on authenticated blockchain token transactions. By integrating Latent Encoder Coupled Generative Adversarial Network (LEGAN) optimized with Binary Emperor Penguin optimizer (BEPO), the scheme enhances routing efficiency and security. A comprehensive security analysis is performed focusing on aspects such as double-spending prevention, transaction distinguishability, routing information integrity, and self-modification resilience. The proposed approach is implemented in NS3 software, with evaluation metrics including throughput of blockchain token transactions and average energy consumption recorded. Overall, the LEGAN-BEPO-BCMANET scheme offers a robust solution to the security and efficiency challenges faced by MANETs, paving the way for practical deployment in real-world scenarios. The performance of the proposed LEGAN-BEPO-BCMANET technique attains 29.786%, 19.25%, 22.93%, 27.21%, 31.02%, 26.91%, and 25.61% greater throughput, compared to existing methods like Blockchain-based BATMAN protocol utilizing MANET with an ensemble algorithm (BATMAN-MANET), Block chain-based trusted distributed routing scheme with optimized dropout ensemble extreme learning neural network in MANET (DEELNN-MANET), A secured trusted routing utilizing structure of a new directed acyclic graph-blockchain in MANET internet of things environment (DAG-MANET), An Optimized Link State Routing Protocol with Blockchain Framework for Efficient Video-Packet Transmission and Security over MANET (OLSRP-MANET), Auto-metric Graph Neural Network based Blockchain Technology for Protected Dynamic Optimum Routing in MANET (AGNN-MANET) and Data security-based routing in MANETs under key management process (DSR-MANET) respectively.

Enhanced-AODV Routing Protocol to Improve Route Stability of MANETs

Establishing and maintaining link stability in Mobile Ad hoc Networks (MANETs) is one of the key challenging issues. Topology changes in MANET because overhead traffic that leads to consuming extra energy of nodes as well as decreasing the performance of routing protocols. Thus, a comprise approach should be considered during the design of a routing scheme in MANETs to deal with challenges incurred by the mobility of the nodes. In this study, a simple efficient routing scheme called Enhanced_AODV (E-AODV) is proposed, aiming to enhance Ad Hoc On-Demand Distance Vector (AODV) routing protocol performance by constructing the most stable and reliable route from source to the destination node. In this routing scheme, the remaining lifetime of links and hop count are the metrics considered for calculating the Route Stability Factor (RSF) that can be utilized as a cost metric to establish the best route between source and destination node. The simulation results reveal that the proposed E-AODV routing scheme effectively outperforms the conventional AODV routing protocol and Stable and Bandwidth Aware Dynamic Routing Protocol (SBADR) in terms of packet delivery ratio, average network throughput, average end-to-end delay, and normalized routing overhead.

Energy and mobility conscious multipath routing scheme for route stability and load balancing in MANETs

Mobility and limited energy resources of nodes are the most critical attributes of Mobile Ad hoc Networks (MANETs). The mobility of the nodes changes the network's topology in an unpredictable manner, which in turn, affects the stability of connected paths. In addition, it causes an excessive overhead traffic that leads to a higher energy consumption and degrades the performance of routing protocols. Therefore, a routing scheme in MANETs should comprise techniques that cope with challenges incurred by both the energy failures and node's mobility. In this paper, we proposed Multipath Battery and Mobility-Aware routing scheme (MBMA-OLSR) based on MP-OLSRv2. Specifically, the study exploits a Multi-Criteria Node Rank (MCNR) metric that comprises the residual battery energy and the speed of nodes. It aims to rank the stability of the links using a link assessment function and to select the most efficient and stable paths to the destination. Moreover, an Energy and Mobility Aware Multi-Point Relay (EMA-MPR) selection mechanism is introduced and utilized by the MBMA-OLSR to set the willingness of nodes to contribute as MPRs, for flooding topological information. We implemented the proposed scheme as an extension to the EXata network simulator. Benefits of the innovative scheme have been demonstrated and validated under various simulation scenarios based on different mobility parameters. The simulation results provided evidence of the effectiveness of our scheme, especially during the high mobility scenarios with heavy traffic load where it outperformed the conventional MP-OLSRv2 routing protocol in terms of QoS and energy related metrics.

Smooth Mobility and Link Reliability-Based Optimized Link State Routing Scheme for MANETs

Link reliability metrics are of great significance in routing design for mobile ad hoc networks (MANETs). In this letter, we propose a novel optimized link state routing (OLSR) scheme named smooth mobility and link reliability-based OLSR (SMLR_OLSR). It is implemented on the basis of a prudentially designed semi-Markov smooth and complexity restricted mobility model, which complies sufficiently with realistic node behaviors and is typically used for reliability-enhanced multi-point relay (MPR) selection in SMLR_OLSR. Simulation results show that the proposed scheme ensures an accurate performance analysis, and can achieve longer MPR lifetime and less control overhead.

Load balanced routing scheme for MANETs with power and delay optimisation

Innovative research on mobile ad hoc networks (MANETs) and their wide applications have created a revolution of today's wireless communication. Efficient routing for dynamically changing network and unstable wireless medium is a challenging task. The conventional AODV routing protocol works on selecting the hop count-based shortest path while delivering the packet towards the destination. This often creates uneven load distribution among network nodes. As a result, any central node hopelessly carries heavier loads that significantly deplete node energy with higher packet loss and delay in processing. In this work, a protocol based on power and delay named as power and delay optimised AODV (PDO-AODV) has been presented which is based on load balanced routing strategy in AODV that improves the quality of service for MANETs. The proposed approach takes neighbouring node's power and delay into consideration for selecting load balanced path. Simulation results manifest that the proposed PDO-AODV achieves improved performance as compared to existing AODV routing protocol in terms of packet drop, network delay, throughput, and retransmission attempts.

Mobility and QoS aware anycast routing in Mobile ad hoc Networks

Anycast is an important way of communication for Mobile Ad hoc Networks (MANETs) in terms of resources, robustness and efficiency for replicated service applications. Most of the anycast routing protocols select unstable and congested intermediate nodes, thereby causing frequent path failures and packet losses. We propose a mobility and quality of service aware anycast routing scheme in MANETs (MQAR) that employs three models: (1) node movement stability, (2) channel congestion, and (3) link/route expiry time. These models coupled with Dynamic Source Routing (DSR) protocol are used in the route discovery process to select nearest k-servers. A server among k-servers is selected based on less congestion, route expiry time, number of hops, and better stability. The simulation results indicate that proposed MQAR demonstrates, reduction in control overheads, path delays and improved packet delivery ratio compared to existing methods such as flooding, DSR and load balanced service discovery.

PARS: Position based Anonymous Routing Scheme in MANETs

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Agent Driven Delay and Power Constrained Multicast Routing in Mobile Ad Hoc Networks by Using ANFIS

Group communication applications in Mobile Ad hoc NETworks (MANETs) require stringent bounds on Quality of Service (QoS) parameters. In this paper, we propose an agent driven QoS mesh based multicast routing scheme in MANET that satisfies the user requirements with good reasoning by using adaptive neuro-fuzzy inference system (ANFIS). Four types of agents are used in the scheme: Multicast administer, ANFIS, Route inventing and Guard agents. The proposed scheme operates in following steps. (1) ANFIS agent at the source node optimizes membership functions of QoS parameters according to the user QoS requirement. It also computes QoS factor for different combinations of parameter values from optimized membership functions. (2) Route inventing mobile agent carries the QoS requirement, set of parameter values and their corresponding QoS factors to reach multicast receivers through intermediate nodes by using selective flooding and agent cloning. Multicast administer agent (MAA) at the intermediate node decides its QoS satisfiability. (3) Route inventing mobile agents trace back the traversed path by marking QoS nodes. They facilitate MAA at the source node to construct QoS mesh between source and destinations. (4) MAA at the source node selects a shortest path to reach each of the multicast receivers from the constructed QoS mesh, and (5) Guard mobile agent is employed for the link/node failures and management of the group. Our proposed scheme performs better than fuzzy based, and autonomic QoS multicast routing schemes.

Ring Mesh Based Multicast Routing Scheme in MANET Using Bandwidth Delay Product

Quality of Service (QoS) support in Mobile Ad Hoc Networks (MANETs) for group communication necessitates design of reliable networks with multicast support mechanisms. Reliable network connectivity among MANET nodes require high quality links that have much less packet drops and reliable nodes considering node mobility and failures. Reliability of a network can be enhanced by designing an end-to-end network pipe that satisfies the required QoS in terms of in-flight packets from source to a destination as well as by using a path comprising of reliable nodes. In-flight packets may be computed by using bandwidth delay product (BDP) of a network pipe. To meet the QoS requirements of an application, BDP should be maintained stable irrespective of vibrant network conditions. In this paper, we propose a BDP based multicast routing scheme in MANET using reliable ring mesh backbone. The scheme operates in the following sequence. (1) Reliable node pairs are computed based on mobility, remaining battery power and differential signal strength. The node pairs also compute BDP between them. BDP of a reliability pair is assessed using available bandwidth and delay experienced by a packet between them. (2) Backbone ring mesh is constructed using reliable pair nodes and convex hull algorithm. Reliable ring mesh is constructed at an arbitrary distance from the centroid of the MANET area. (3) Multicast paths are found by discovering a path from source to each destination of the group with concatenated set of reliability pairs that satisfy the BDP requirement. (4) The ring mesh maintains high BDP on ring links and can recover in case of node mobility and failures. Results show that there is an improvement in terms of end-to-end delay, packet delivery ratio, control overhead, memory overhead and application rejection ratio as compared to the Enhanced On Demand Multicast Routing Protocol.

Agent-driven backbone ring-based reliable multicast routing in mobile ad hoc networks

Routing in mobile ad hoc networks (MANETs) for groups should aim at providing reliable and robust multicast routes to the group members against link failures, node failures and mobility conditions. The authors propose an agent-based multicast routing scheme in MANET that builds a backbone in the form of a reliable ring and finds multicast routes. The authors use the convex hull algorithm to find the outer boundary of the network area that helps in creating a reliable ring at an optimum distance between the centroid and outer boundary. The reliability of such a backbone is modelled by using reliable links based on the probabilistic measure of link failures. Later, a mesh of multicast routes are found by connecting: (i) source to source's nearest ring node and (ii) destination to destination's nearest ring node. The scheme consists of a set of static and mobile agents, which coordinate through knowledge base and identify links to form a reliable ring at an optimal distance from the centre of MANET area. Agents are also used to recover routes against link failures, node failures and mobility of nodes with local patching of failed links/nodes. The results show that there is an improvement in control overheads, packet delivery ratio, group reliability and packet delivery latency as compared to two protocols: (i) on demand multicast routing protocol and (ii) agent-based multicast routing scheme in MANETs.

ISSUES OF LONG-HOP AND SHORT-HOP ROUTING IN MOBILE AD HOC NETWORKS: A COMPREHENSIVE STUDY

One of the fundamental problems of Mobile Ad hoc Networks (MANETs) is to determine whether it is advantageous to route packet over many short-hops or a few long-hops. Short-hop and long-hop routing issues have been investigated in the literatures since the early days of MANETs. Maximization of network throughput was the main focus of these works. But the maximization of network throughput is not the only issue of MANETs. There are other important issues of concern including overhead control packets, energy consumption, connectivity, shadowing effects and packet delay. All these issues have been investigated in this paper. Network Simulator (NS-2) has been used to create and simulate MANETs to investigate these issues. The main objectives of this paper are as follows (1) to find the merits and de-merits of short-hop and long-hop routing schemes, (2) to come up with a guideline so that one can choose an appropriate routing scheme for MANETs, and (3) to open up new area of researches for further investigations on the issues discussed in this paper.

Link stability based multicast routing scheme in MANET

The group-oriented services are one of the primary application classes that are addressed by Mobile Ad hoc Networks (MANETs) in recent years. To support such services, multicast routing is used. Thus, there is a need to design stable and reliable multicast routing protocols for MANETs to ensure better packet delivery ratio, lower delays and reduced overheads. In this paper, we propose a mesh based multicast routing scheme that finds stable multicast path from source to receivers. The multicast mesh is constructed by using route request and route reply packets with the help of multicast routing information cache and link stability database maintained at every node. The stable paths are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is computed by using the parameters such as received power, distance between neighboring nodes and the link quality that is assessed using bit errors in a packet. The proposed scheme is simulated over a large number of MANET nodes with wide range of mobility and the performance is evaluated. Performance of the proposed scheme is compared with two well known mesh-based multicast routing protocols, i.e., on-demand multicast routing protocol (ODMRP) and enhanced on-demand multicast routing protocol (EODMRP). It is observed that the proposed scheme produces better packet delivery ratio, reduced packet delay and reduced overheads (such as control, memory, computation, and message overheads).

On Efficient Network Planning and Routing in Large-Scale MANETs

In mobile ad hoc networks (MANETs), hierarchical architecture and distributed approaches are more practical than flat architecture and centralized approaches. In this paper, we propose a suite of protocols that achieve a distributed planning and routing scheme for MANETs. The proposed suite, which is composed of three protocols, offers scalability and extends network lifetime. The first protocol, i.e., the fast distributed connected dominating set (FDDS), constructs the virtual backbone by designing a fast distributed hierarchical algorithm that finds a connected dominating set (CDS) in the network graph. The constructed virtual backbone takes into account the node's limited energy, mobility, and traffic pattern. The second protocol, i.e., FDDS-M, proposes a distributed maintenance protocol that preserves the integrity of the hierarchical structure constructed by FDDS. The third protocol, i.e., FDDS-R, uses an intelligent path-selection fuzzy logic controller that can easily be incorporated in any existing link state routing protocol to select energy-efficient routes. We conducted extensive simulations that compare the operational properties (energy efficiency and network lifetime) of our schemes with others. The results show that our proposed schemes can achieve scalability and energy efficiency and outperform some of well-known approaches in the literature.