An Optimized AODV Protocol in Mobile Ad Hoc Network

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

The objective of this study is to enhance the Ad hoc On-demand Distance Vector (AODV) routing protocol, a representative mobile ad hoc network environment routing protocol. In the existing AODV protocol, dynamic topology changes due to node mobility cause frequent route failures and network instability. We herein propose a local repair scheme to re-establish routes when links are broken and a dual-path routing scheme to improve network stability by employing alternate routes. After comparing the total data processing volumes, average packet end-to-end delays, numbers of connection pairs, energy consumptions, and numbers of generated packets of the enhanced AODV protocols, we discuss the optimal operating conditions for each scheme. We also investigated the performance variations resulting from changing the number of nodes and node mobility, using an NS-2 simulator. The results revealed that the dual-path protocol generally performs the best and improves the packet end-to-end delay by up to 45 %.

Mobile Ad Hoc Networks (MANETs) require special management when compared to wired networks because of their hardware and energy limitations. A key concept that could help provide this management is Self-organization. Here the concentration is on typical MANET scenarios that depend heavily on the reliability of the network. Reliability is a direct cost of the overall network lifetime, i.e., energy of the nodes. In this paper a Self-Organizing AODV protocol (SO_AODV) has been developed by integrating self-organizing concepts found in Efficient Self-Organization Algorithm (EESOA) and Ad hoc On-demand Distance Vector (AODV) algorithm. SO_AODV has been compared with Traditional AODV and basic EESOA using the following metrics: network lifetime, average end to end delay, delivery ratio and convergence time. In order to appreciate the performance of the proposed SO_AODV algorithm, an implementation in the NS2 simulator is done. The observations from the simulation are: SO_AODV has better network lifetime and end to end delay than Traditional AODV and has better values of convergence time when compared to EESOA.

The use of dominating-set neighbor elimination as an integral part of the distribution of route requests using the ad hoc on-demand distance vector (AODV) protocol as an example of on-demand routing protocols is investigated. We use detailed simulations to show that simply applying dominant pruning (DP) to the distribution of route requests in AODV results in pruning too many route requests in the presence of mobility and cross-traffic. Accordingly, we introduce several heuristics to compensate the effects of DP and show that the resulting AODV with dominating set heuristics (AODV-DS) has comparable or better delivery ratio, network load, and packet latency than the conventional AODV. AODV-DS exhibits over 70% savings on RREQ traffic than conventional AODV, and in some situations, AODV-DS may have a lower control overhead using Hello packets than conventional AODV without Helios.

Mobile Ad Hoc Networks (MANETs) pose challenges in terms of power control, due to their fixed transmission power, the mobility of nodes and a constantly changing topology. High levels of power are needed in wireless networks, particularly for routing. In order to address this problem, power aware routing protocols have been proposed, with the aim of maximising the lifetime of the network. This paper presents an enhancement to the Ad Hoc On Demand Distance Vector (AODV) protocol, by reducing transmission power, when a large number of other radios are within range. This protocol, called DP-AODV (Dynamic Power AODV) combines the hello packet mechanism and the power control mechanism in order to reduce interference between nodes and increase the throughput in the network, thus reducing the overall power consumption. A performance evaluation of this enhanced protocol is carried out in comparison with three standard routing protocols, Ad Hoc On Demand Distance Vector (AODV), Ad Hoc On Demand Multipath Distance Vector (AOMDV) and Dynamic Source Routing (DSR), using network simulator 2 (NS2). Keywords-MANET; Dynamic Power; Density; Mobility; Interference.

Routing protocols are fundamental in establishing linkages and communication amongst nodes in Mobile Ad-hoc Networks (MANET). Since Ad-hoc On-demand Distance Vector (AODV) protocol shuns loops and minimizes route broadcasts its predominantly utilized in MANET. This systematic review sought to uncover approaches employed in extending AODV for performance improvement in MANET, their limitations, and AODV characteristics that are extendable. Barbara Kitchenham's original guidelines (2007) guided the research, while studies were retrieved from IEEE, Science Direct, Wiley, Semantic Scholar, ACM Digital Library, EBSCOhost, and Google Scholar databases. The common approaches employed are consideration of parameters to improve quality of service, artificial intelligence and machine learning, and use of the signal strength. The limitations of the approaches can be optimized for improved performance in terms of reduced control traffic and packet loss, efficient bandwidth and memory utilization, reduced processing costs, and energy consumption. The AODV characteristics commonly extended are route discovery, selection, and maintenance. Future work could investigate clustering and zoning, and caching mechanisms approaches to enrich the reliability, performance, and efficiency of AODV protocol.

Hybrid Wireless Mesh Networks (HWMNs) based on the IEEE 802.11 are being increasingly deployed as a varied network of Mobile Ad-hoc Network (MANET) to provide users with extended coverage for wireless Internet access. HWAN, however, has a problem of too wide broadcasting of the Route Request (RREQ) in the route discovery of the Ad hoc Ondemand Distance Vector (AODV) protocol. In this paper, to enhance the performance of the AODV protocol, we have transformed it into a multipath protocol and proposed a new protocol that overcomes disadvantage of AODV by composing the neighbor table for overloaded RREQ. The neighbor table is provided in the form of metric using several items including the bandwidth. This can bring the localization effect of the nodes and we can expect a performance improvement by preventing an overloaded RREQ. Through the simulation, we could confirm better performance in packet loss rate, throughput, packet delivery ratio and routing overhead than the DSR protocol and AODV protocol.

This paper presents a resilient routing algorithm that is more suitable for a Mobile Ad Hoc Network (MANET) with node quick moving or node sparse, than traditional routing algorithms such as Ad-hoc On-demand Distance Vector (AODV) routing. Since AODV routing in MANETs is known for its advantageous properties, the proposed routing algorithm is based on the AODV, and called RAODV (Resilient AODV). In the route discovery phase, it differs from AODV, which only establishes one routing path from a source node to the destination node, whereas RAODV establishes as many routes as possible. Thus, when the primary route breaks, the node can immediately adopt an alternative route without further route research effort. If no possible alternative route exists, the node will transmit the route break information backward to instruct the previous node on the reverse route to select an alternative one, and so on. The proposed RAODV can reduce the number of route rediscovery procedures, and thus improve the packet loss rate and transmission delay, especially in sparse MANETs. Simulator ns2 was used to evaluate the performance of RAODV. In some cases, the proposed RAODV was able to reduce the packet loss rate by 72.61% compared to traditional AODV.

Mobile ad hoc network (MANET) is lacking infrastructure support, so nodes of MANET are vulnerable to attacks. Denial of Service attacks (DOS) makes network inaccessible to users. Black hole attack is a type of DOS attack, in which mischievous node claims that it has a route towards the destination node. Ad Hoc on Demand Distance Vector (AODV) routing protocol is affected by Black hole attack. The proposed solution is based on first Route Reply (RREP) caching mechanism in AODV protocol. Simulation results show performance improvement in routing protocol.

Ad Hoc Routing with Distributed Ordered Sequences

Mobile Ad hoc Network (MANET) is the cornerstone for the Internet of Things (IoT) and Vehicle to Everything (V2X) networks, its devices are remarkable of lightweight to be portable and free to join or disjoined the network. Therefore, one of the MANET routing types is reactive routing protocols. Reactive routing protocols set up the connection between devices either on-demand such as Ad Hoc On-demand Distance Vector (AODV) protocol or source routing such as Dynamic Source Routing (DSR) protocol. Reactive routing protocols increase routing overhead on discovering new routes. Thus routing overhead, and delay will increase. In this paper, the method of generating a fuzzy model is presented. Also, a tuned fuzzy stability model is introduced to handle the imprecision of routing decisions by the Fuzzy Stability model for Ad Hoc On-demand Distance Vector (FSAODV) and Fuzzy Stability model for Dynamic Source Routing (FSDSR). The results showed that FSAODV and FSDSR have outperformed the state of art protocols AODV and DSR respectively.

Advances in electronic systems, wireless communication protocols, and intelligent devices allowed the development of networks of mobile devices such as cars, drones, and robots. The field of mobile ad hoc networks (MANETs) comprises networks where the mobility of the devices is one of the fundamental elements that characterise these networks. However, the node’s mobility leads to constant changes in the network’s topology, representing a challenge to routing protocols designed for MANETs. Although there is effort from researchers to tackle the intricacies of routing protocols in MANETs, there is still room for improvement as new applications with challenging specifications continue to arise. This research enriches the existing theoretical perspective by presenting an innovative method for optimising the routing performance of the ad hoc on-demand distance vector (AODV) protocol. Grounded on multi-objective metaheuristics, we aim to improve AODV’s routing recovery performance concerning routing delay, energy consumption, packet loss ratio, and route load metrics. To gauge the quality of our contribution, we compare its performance to the standard AODV, a mono-objective optimised AODV, and four other well-known routing protocols with different routing approaches. The results indicate that the proposed solution was superior to the original AODV with average improvements of 56.0%, 59.3%, 48.1% and 0.7% on route load, routing delay, packet loss ratio and energy consumption, respectively. It also presented competitive results compared to other routing protocols.

Route recovery process of Ad-hoc On-demand Distance Vector (AODV) protocol has been extensively studied. However, the recovery process still requires long delays and overheads. In this paper, we proposed a link quality aware local recovery protocol for AODV based Ad hoc networks. In the proposed method, when a link is broken, a node detecting a link-break asks to neighbor nodes who can be a substitute for a node causing the link- break. If there is such a node, then the recovery is quickly and locally completed. The proposed method does not increase overhead to find the substitute link comparing to the conventional AODV protocol. The results show that proposed protocol performs better than source repair and local repair in term of throughput. The simulation is done through Network Simulator (NS-2).

A Mobile Ad Hoc Network (MANET) is one of the up-to-date technologies supporting communication of mobile devices. It consists of an open environment that comprises a set of mobile, decentralized, and self-organized nodes. MANET is harder to be secured than the other types of static networks. There are many types of attacks that could paralyze the life of the mobile nodes in MANET. One of the most dangerous attacks is the Denial of Service attack (DoS), which in turn could be performed through the Resource Consumption Attack (RCA) over Ad-hoc On demand Distance Vector (AODV) routing protocol. This paper analyzes and studies the RCA effecting factors on AODV performance metrics namely throughput and end-to-end delay under varying the number of connections between the source and the destination and number of RCA attackers number.Keywords: MANET, Resource Consumption Attack, Denial of Service attack, AODV routing protocol.

The security of wireless networks has been a constant topic in the recent years. With the advance of wireless networks, building reliable and secured communication is becoming extremely important. Wireless security is a mechanism of preventing unauthorized access or damage to computers using wireless networks. A mobile ad-hoc network (MANET) is a self-organizing system of mobile nodes that communicate with each other through wireless links with no fixed infrastructure or centralized administration. This paper presents potential security attacks on Ad-hoc On-demand Distance Vector (AODV) routing protocol and their countermeasure. IETF standardized AODV and considered as one of the most popular and promising on-demand routing protocols because of its lower network overhead and algorithm complexity. AODV protocol does not store all the routing information in its routing table and this causes potential security threat to the wireless networks. In this paper, we consider various known security attacks and in- specific blackhole attack on AODV and propose a countermeasure to thwart blackhole attack.