A Safe AODV (Ad Hoc On-Demand Distance Vector) Security Routing Protocol

The rapid surge of Mobile Ad Hoc Networks (MANETs) stimulates the need for adaptive, intelligent, and secure routing mechanisms to ensure seamless communication in dynamic environments. Traditional routing protocols are battling with security threats such as wormhole attacks that disrupt routing and degrade network performance. To address these challenges, this study outlines a state-of-the-art technique, the Reinforcement Learning-Based Secure Routing Protocol (RLSRP), which leverages adaptive k-hop clustering and deep Q-Networks (DQN) to fine-tune routing decisions dynamically while mitigating security risks. RLSRP unwaveringly measures network condition by evaluating latency variations and anomalies to spot suspicious nodes, thereby enhancing route stability. The protocol implements zone-related clustering where nodes within each zone collaborate to optimise routing paths based on real-time conditions, ensuring energy-efficient communication. Current research investigated deep reinforcement learning methodologies to improve security in zone-related MANETs and ensure efficient data routing in large-scale environments. A detailed simulation-based evaluation depicts the potency of the proposed RLSRP model when compared with other reinforcement learning-based routing protocols. Using a large-scale setup–scaling up to 10 million nodes–with Dask and TensorFlow, the results show that RLSRP consistently outperforms FSSAM, Cluster-RL, and Reputation-based Q-learning in terms of Packet Delivery Ratio (exceeding 99%), reduced latency, and improved energy efficiency. These findings reported RLSRP as a secure and scalable solution for practical MANET routing.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.

An ad hoc network is a collection of autonomous mobile nodes to forming an instant multihop radio infrastructure-less network in a dynamic topology. Each node in Ad hoc network, functions as host and router at the same time,where maintaining connectivity in a decentralized manner by distributing the network control among the nodes. A large number of routing protocols for mobile ad-hoc networks are presented since last decade. Topology frequently changing,transmission power and asymmetric links are the main challenge that type of protocols is facing. Therefore, both proactive and reactive routing protocols for mobile ad-hoc networks show incapability, and sometimes prove to be inefficient under these circumstances. We have previously developed and presented a new multipath hybrid routing protocol in name of Multipath Distance Vector Zone Routing Protocol and we refer to it as MDVZRP. The protocol is implemented in the well known network simulator (ns2). In MDVZRP we assume that all the routes in the routing table are active and usable at any time, unless the node received or discovered a broken link. Therefore, no need to update the routing tables periodically to reduce the periodic update messages and hence we reduce the control traffic in the entire network. The protocol guarantees loop freedom, disjoint paths,and alternative paths in case of break the active path by none frequently maintaining topological map of a zone centered on each node. In this paper, the MDVZRPpsilas performance is evaluated and compared with DSDV and AODV standard protocols delivering CBR traffic. Simulation results show that it gives better performance than DSDV in all situations, and better than AODV, when mobility is low.

Routing protocol is the primary strategy to design any wireless network. In Mobile AdHoc Network many routing protocols are present for sending packets from source to destination. Routing protocols in Mobile AdHoc Networks (MANETs) are reactive routing protocols, proactive routing protocols, hybrid routing protocols. Performance analysis of different routing protocols is the major step before selecting the routing protocol. Routing protocols perform different under different traffic conditions in different environments. In this paper, the TCP and UDP based performance analysis is carried out in reactive routing protocols and proactive routing protocols with different packet size using NS2 simulator under different traffic conditions. The delay, throughput and packet delivery ratio are common measures parameters used for the comparison of performance of reactive protocols and proactive protocols.

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

Mobile Ad-Hoc Networks (MANETs) are becoming increasingly popular as more and more mobile devices find their way to the public. A crucial problem in Ad-Hoc networks is finding an efficient route between a source and a destination. Due to MANET’s inherent characteristics, secure routing may be one of the most difficult areas to tackle because opponents can add themselves to a MANET using the existing common routing protocols. Hence, this paper proposed a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. Moreover, by dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance. An overview and a qualitative comparison between ARANz and some existing Ad-Hoc routing protocols is presented in this paper.

Vehicular Ad-hoc Network (VANET) is a subclass of Mobile Ad-hoc Network (MANET) which provides the safety measure and other different applications to the drivers of the vehicles. The goal of VANET is to fulfil the requirements of users on roadside area, which improves the safe and comfortable journey. Secure routing is the main issue in VANET. Dynamic topology and wireless networking makes the VANET vulnerable to numerous sorts of attacks. Wormhole is one of the extreme assaults in VANET. This type of attack disturbs the working of routing protocol such as Ad hoc On demand Distance Vector (AODV) routing protocol. The motivation of this research work is that by using proposed detection and prevention approach the VANET can be made more secure. The results show how the performance of AODV routing protocol is affected by wormhole. In this research paper the impact of wormhole attack is analysed in terms of throughput, packer delivery ratio, and end-to-end delay. An approach is also proposed to detect and prevent wormhole attack in VANET over a real map on different vehicle densities based on multipath concept.

Owing to the absence of any static support structure, ad-hoc networks are prone to link failures. The 'shortest path seeking' routing protocols may not lead to stable routes. The consequent route failures that ensue, lead to the degradation of system throughput. This paper suggests a routing protocol wherein the route selection is done on the basis of an intelligent residual lifetime assessment of the candidate routes. Schemes for performance enhancement with TCP and non-TCP traffic in ad-hoc networks are proposed. The protocol is backed by simulations in ns that show excellent adaptation to increasing network mobility. We have also introduced new route cache management and power aware data transmission schemes.

In this paper we propose a new routing protocol for large scale Mobile Adhoc Networks, named HRAN. The protocol supports large networks, requires few resources from devices and lowers the control message overhead associated with discovering new routes. It works by simulating the paradigm of heat trails in a physical environment through the use of bloom filters. In our protocol each node emits a certain quantity of heat and as the node moves a heat trail is formed. After a node leaves a location the heat from surrounding nodes slowly dissipates. This heat information is then used to guide routing queries from the source to the destination.

In this paper, we develop a Markov Chain model for stochastic routing in wireless mobile ad hoc networks (MANETs). We show that using stochastic routing technique the average energy efficiency of the network improves considerably. Besides, the protocol will also secure the data flow in the network as the random data forwarding paths from source to destination will make it difficult for an intruder to intercept, hijack, and jam the data. The intruder in this case will have to listen to all possible paths from the source to the destination. Simulation studies show that our proposed protocol achieves significant performance gains in terms of energy consumption, throughput, delay, and security of the data transmission in MANETs.

Ad-hoc networking allows users to form temporary wireless networks without existing infrastructure. Each node acts both as host and router and must therefore be willing to forward packets for other nodes. This is done using a mobile ad-hoc network (MANET) routing protocol. Frequent topology changes make such routing challenging. Existing protocols include dynamic source routing (DSR), the cluster-based routing protocol (CBRP), and the ad hoc on-demand distance vector (AODV) protocol, among others. Using existing protocols, however, some nodes may be unduly loaded and end-to-end delay may be high. Further, existing protocols are hard to upgrade once they are in use. To address these problems, a new routing protocol, MARP, using mobile agents is presented. Mobile agents are software entities that can move between network nodes and execute programs they carry with them wherever they are running. Our agent-based algorithm implements a demand-based protocol that provides efficient routing at the application layer. A proof of concept implementation has been developed using Aglets and simulated to evaluate its performance. The details of the protocol and its performance are reported in this paper.

Ad hoc network is sub-domain of network communication in which user communicates with each other by temporarily network without any centralized network administration. Each node acts as node as well as router to forward data packets on the basis of routing protocols. Wireless communication is the most research oriented era now days; most importantly in the field of vehicular ad hoc network. VANET is the sub-ordinate of the Mobile ad hoc Network (MANET). Efficient routing protocols play vital role in ad hoc networks in terms of network reliability and network performance. Routing in VANET is the most important and challenging research issue. Mostly MANET routing protocols used in the VANET, but usually MANET routing protocols are not compatible within VANET's scenario due to its mobility differences. In this research we validate a VANET routing protocol GeoWave for better information dissemination to overcome the traffic blockage and which will reduce the Carbon Dioxide (CO) of the Vehicles in the large congested urban area scenario. We use well-known network simulator Omnet++ and SUMO traffic generator to simulate the network environment.

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration of the mobile networks .Data transmission between two nodes requires multiple hops as nodes transmission range is limited in Mobile Ad hoc networks (MANET's). Mobility of the networks nodes to makes the situation even more complicated in wireless networks. Multiple routing protocols find optimized routes from a source to some destination. This articles presents performance analysis of three different routing protocols AODV, DSR and ZRP. This article mainly focuses on comparing the performance analysis of three routing protocols for Mobile Ad-Hoc networks (MANET's). We have used QualNet Simulator 5.0.3 from Scalable Networks to perform the simulations. Performance analysis of AODV, DSR and ZRP is evaluated based on Average end to end delay(s), TTL based hop count and Average Jitters(s), throughput (bits/s) in Mobile ad hoc networks.

Wireless Sensor Networks (WSN) utilizes more nodes to forward messages and information from source node to destination node and these nodes are battery-powered devices. Thus, Energy saving is always vital role of Routing Protocols which need to maximize the lifetime of WSN. Mobile ad hoc networks (MANET) are self-starting and self-constructing multichip wireless networks in which, the assembly of the system deviates vigorously. This is mainly due to the mobility of the nodes. The nodes in the network not only act as hosts but also as routers that route data from other nodes in network. MANETs require an efficient routing protocol that achieves the quality of service (QoS) mechanism. They are not considering the mobility as one constraint for those problems. Because, mobility of nodes causes frequent link failures and high error rates, so it makes difficult to maintain the desired QoS in the network. To overcome those problems, we propose mobility aware routing protocol for MANET using hybrid optimization (MARP-HO) algorithm, which maximizes the QoS in data transmission. The proposed routing protocol comprises of two phases. The clustering process consists of cluster formation and cluster head (CH) selection. First, the energy efficient clustering is done by improved animal migration optimization (IAMO) algorithm. Then, we gather multiple constraints are energy consumption, received signal strength, mobility and cooperative rate from each cluster member. The gathered constraints used to compute the node cost of each cluster member, here the highest cost node act as CH of cluster. Second, we compute routing path between source–destination using improved ant colony optimization (IACO) algorithm. The proposed MARP-HO routing protocol is compared with existing state-of-art routing protocols in terms of energy consumption, delivery ratio, loss ratio, link stability, delay, network lifetime, number of dead nodes and throughput.

In Recent Years, on demand Multipath routing protocols have been key research area in mobile Adhoc networks. An Adhoc network is comprised of mobile host without any wired infrastructure support. Multiple Adhoc routing allows the establishment of multiple paths between a source and destination. The multipath routing protocol with load balancing provides a solution for the congestion network and increases its capacity. Various multipath routing protocols have been proposed. In this paper we discuss the wireless routing protocols for adhoc networks like DSR, AODV, LBAODV, AOMDV, and LBAOMDV & AODLB. Simulation result shows the performance of AODLB protocol is much better than any other protocol in terms of PDR End to End Delays, ABS, and TOH. Keywords-Mobile Adhoc Networks, AODV: Ad-Hoc on Demand Vector, AOMDV: Adhoc on Demand Multipath Vector, LBAOMDV: Load Balancing Adhoc on Demand Multipath Vector