Ad-hoc On-demand Distance Vector Routing Research Articles

Evaluation of neighbor credit value based AODV routing algorithms for selfish node behavior detection

Mobile ad hoc networks (MANETs) nodes interchange information by means of numerous intermediate nodes without the requirement of infrastructure (Toh, Ad hoc mobile wireless networks: protocols and systems, pp 34–37, 2002). Owing to the exposed arrangement and inadequate energy of the nodes, some nodes may not involve in the routing process properly (Laay et al., IEEE Commun Surv Tutor 10(4):78–93, 2008). This leads to selfish behavior of the nodes and moreover, some nodes do not have the chance to forward the packets, so they still idle in the network. Hence, these genuine idle nodes are also considered as selfish nodes and they are avoided in the routing process. To address this issue, credit-based protocols namely Neighbor credit value based and improved Neighbor credit value based Ad Hoc on demand distance vector (AODV) routing algorithms are proposed. These two protocols are evaluated against AODV for the better detection of selfish node behavior. Earlier works addressed the methods to overwhelm selfish behavior attack but fail in performance. A simple neighbor credit value based AODV (NCV-AODV) routing protocol was proposed to avoid such false detection. Some simple assumption is made on NCV-AODV that the nodes in the network are fundamentally not malicious and only some of the new nodes may be added to behave maliciously. This improved version is called improved Neighbor credit value based AODV (iNCV-AODV) protocol is proposed. The proposed two mechanisms are implemented in AODV routing protocol. An extensive analysis of the performance of the proposed detection mechanisms against the selfish behavior attack.

Secured AODV Routing Protocol for the Detection and Prevention of Black Hole Attack in VANET

Vehicular ad hoc networks (VANETs) are becoming promising and popular technologies in the recent intelligent transportation world. They are used to provide an Intelligent Transportation System (ITS), efficient Traffic Information System (TIS), and Life Safety. The mobility of the vehicles and the volatile nature of the connections in the network have made VANET vulnerable to many security threats. Black hole attack is one of the security threat in which node presents itself in such a way to the other vehicles that it has the freshest and the shortest path to the destination. Hence in this research paper an efficient approach for the detection and prevention of the Black hole attack in the Vehicular Ad Hoc Networks (VANET) is presented. The proposed solution is implemented on AODV (Ad hoc On demand Distance Vector) routing protocol one of the most popular routing protocol for VANET. The proposed strategy can detect both the single and the Cooperative Black hole attacks in the early phase of route discovery. The simulation is carried on NS-2 and the results of the proposed scheme are compared to the fundamental DYMO routing protocol, this results are examined on various network performance metrics such as packet delivery ratio, throughput and end-to-end delay. The found results show the efficiency of the proposed method as the delivery ratio and end to end delay of the network does not deteriorate under a black hole attack.

Dynamic Detection of Secure Routes in Ad hoc Networks

The present paper focused on ad hoc networks with an emphasis on their dynamic nature. After an introduction to ad hoc networks, there are the AODV (Ad hoc On-demand Distance Vector) routing protocol with the node malicious behaviour and consequent damages to ad hoc networks. Then, trust is described as one of the solutions for identifying secure routes when there are malicious nodes in the network. Accordingly, the paper focuses on the proposed solutions that are based on the parameter trust and the prevention of the impact of malicious networks and vulnerable connections to identify a secure route. Then, an equation is presented to calculate trust using packet forwarding rate to select a secure route for sending data packets. The proposed model was implemented on OMNET++ to evaluate the network performance. The feature of the proposed method is better performance than of the methods TVAODV and AODV. Using the proposed method, packet delivery rate increases more significantly when malicious nodes increases than that of the basic method AODV and TVAODV. There is thus a lower packet dropping rate.

Transition rate, trend and signal strength based stable routing protocol for mobile ad hoc networks

In order to have continuous connectivity for data transmission in mobile ad hoc networks (MANETs), it is necessary to establish stable path with long life time. Even though much work has been carried out to maintain the path for a long life time, it is necessary to give more importance to consider stability of the nodes during path discovery phase itself. To increase the stability of the path, this paper proposes Transition Rate, Trend and Signal Strength based Stable Routing Protocol (TTSSRP), considering transition trend of a node along with signal strength for a predetermined period during route discovery process. During a predetermined period, several samples are collected from a node. The total number of transitions and rate of change of signal strength with respect to first position are computed for all sampling time to find stability of a particular node so as to select as one of the nodes in the path. This procedure is followed until the destination is reached. Simulation results confirm the superiority of TTSSRP over the Ad-hoc on-Demand Distance Vector (AODV) routing protocol and Relative Link and Path Stability based Routing Protocol (RLPSR) in terms of packet delivery ratio, average end-to-end delay and route life time.

QoS Enabled Cross-Layer Multicast Routing over Mobile Ad Hoc Networks

Quality of group communication using mobile ad-hoc networks depends on various factors like channel fading, signal quality, path loss, transmission and reception power of mobile nodes, mobility, link life and battery backup. Different layers are involved in communication, but the behavior of these layers is isolated with each other and overall network performance may effect from their operations. A cross-layer approach can extract the critical information from multiple layers which can be further utilized to enhance the overall network performance and Quality of Service (QoS). In this paper, Cross-layer Multicast Routing (CLMR) is introduced to enhance the QoS using a tree-based multicast routing protocol. In order to achieve QoS, optimization of the tree operations and tree management cost has been done. CLMR exploits the functionality of PHY layer, Application layer and Routing Layer for QoS oriented communication. Performance of CLMR is analyzed using Multicast Ad-Hoc On-Demand Distance Vector (MAODV) routing protocol under various parameters, i.e. Throughput, Delay, Packet Delivery Ratio, Link Cost and Energy Consumption.

Transition rate, trend and signal strength based stable routing protocol for mobile ad hoc networks

In order to have continuous connectivity for data transmission in mobile ad hoc networks (MANETs), it is necessary to establish stable path with long life time. Even though much work has been carried out to maintain the path for a long life time, it is necessary to give more importance to consider stability of the nodes during path discovery phase itself. To increase the stability of the path, this paper proposes "Transition Rate, Trend and Signal Strength based Stable Routing Protocol (TTSSRP)", considering transition trend of a node along with signal strength for a predetermined period during route discovery process. During a predetermined period, several samples are collected from a node. The total number of transitions and rate of change of signal strength with respect to first position are computed for all sampling time to find stability of a particular node so as to select as one of the nodes in the path. This procedure is followed until the destination is reached. Simulation results confirm the superiority of TTSSRP over the Ad-hoc on-Demand Distance Vector (AODV) routing protocol and Relative Link and Path Stability based Routing Protocol (RLPSR) in terms of packet delivery ratio, average end-to-end delay and route life time.

An Effective AODV-based Flooding Detection and Prevention for Smart Meter Network

In this paper, we investigate flooding attack detection and prevention for smart meter networks. The default Ad hoc On-Demand Distance Vector (AODV) protocol is vulnerable to flooding attacks because intermediate meters forward packets blindly. To detect and prevent flooding attacks, we propose a new AODV-based routing protocol called FLOoding aWareness AODV (FLOW-AODV) considering both with and without Internet Protocol (IP) spoofing. If no IP spoofing exists, we modify the route request forwarding procedure by adding new features. The main idea is to enable one-hop neighboring meters to detect attackers by counting the received route requests from the same source. Specifically, when a meter receives a request, it first determines whether it is a one-hop neighbor to the source or not. If yes, the one-hop neighboring meter updates its request counter for every received request from that source. When the received requests exceed a predefined number (e.g., 2), it perceives the source as an attacker and just discards the following requests, so the flooding is avoided. In this way, the receiver can prevent flooding attacks when there is no IP spoofing from flooding attacker. If IP spoofing exists, the flooding attacker will hide its real IP address. In this case, we have extended our algorithm and included trustworthiness of each neighbor in the neighbor routing table. Extensive simulations are conducted in NS3 to evaluate the performance of FLOW-AODV. Results show that FLOW-AODV obtains considerably higher performance in terms of packet delivery ratio, and average delay compared with the default AODV routing protocol. In addition, the FLOW-AODV significantly improves network performance and eliminates congestion when multiple attackers are involved.

An Adaptive Approach for AODV Routing Protocol in MANET

Presently a day, Ad-hoc arrange has turned into a resolute part for correspondence for cell phones. A mobile adhoc network (MANET) is a collection of wireless mobile nodes dynamically forming a network topology without the use of any existing network infrastructure or centralized administration. Routing is the procedure which transmitting the information bundles from a source node to a given destination or goal. The primary classes of steering conventions are Proactive (table driven), Reactive (on request) and Hybrid. A Reactive (on-request) directing technique is a famous routing classification for remote specially appointed steering. The most productive receptive convention is Ad-hoc on demand distance vector (AODV) routing convention. This paper gives an outline of AODV conventions by displaying their attributes, usefulness, different convention property parameters, for example, Route Discovery, Flooding, Route Maintenance and Advantages and constraints. The NS-2 is utilized for the re-enactment reason. In this paper we exhibit the AODV convention and review different security improvements that have been proposed for AODV by various researcher.

Energy efficient teaching-learning-based optimization for the discrete routing problem in wireless sensor networks

Wireless sensor networks (WSNs) are composed of sensor nodes, having limited energy resources and low processing capability. Accordingly, major challenges are involved in WSNs Routing. Thus, in many use cases, routing is considered as an NP-hard optimization problem. Many routing protocols are based on metaheuristics, such as Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). Despite the fact that metaheuristics have provided elegant solutions, they still suffer from complexity concerns and difficulty of parameter tuning. In this paper, we propose a new routing approach based on Teaching Learning Based Optimization (TLBO) which is a recent and robust method, consisting on two essential phases: Teacher and Learner. As TLBO was proposed for continuous optimization problems, this work presents the first use of TLBO for the discrete problem of WSN routing. The approach is well founded theoretically as well as detailed algorithmically. Experimental results show that our approach allows obtaining lower energy consumption which leads to a better WSN lifetime. Our method is also compared to some typical routing methods; PSO approach, advanced ACO approach, Improved Harmony based approach (IHSBEER) and Ad-hoc On-demand Distance Vector (AODV) routing protocol, to illustrate TLBO's routing efficiency.

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR) technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources.
 
 We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT) routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV) and the weighted cumulative expected transmission time (WCETT) routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

Performance analysis of collision avoidance routing protocol for inter-vehicular communication

In recent days vehicular ad-hoc networks find its extensive applications by broadcast transmissions. Vehicle to vehicle communication provide better results by avoiding the major problems in the road such as the collision of vehicles, better route selection during congestion, fuel consumption etc. In this paper we present a collision avoidance based protocol. The collision of transmitting data can be avoided using medium access control (MAC) protocol. We have assessed and analyzed the performance of the proposed routing protocol Vehicular Ad-hoc on-demand Distance Vector (VAODV), which is a modification of Ad-hoc On-demand Distance Vector (AODV) routing protocol. We have analysed the performance of the proposed VAODV protocol through simulation results and latter extended for OSPF ensuring high reliability.

A modified AODV protocol for preventing blackhole attack in MANETs

ABSTRACTWireless Mobile Ad-Hoc Networks (MANETs) are infrastructure-less networks commonly used for dynamic connection between nodes. These networks work without any external router for maintaining the connection and the nodes themselves behave like a router. Ad-Hoc On Demand Distance Vector (AODV) routing is a widely used protocol for managing communications between the mobile nodes. A blackhole attack is one in which the nodes create a false route through them and then perform malicious activities on the transmitted packets. This paper presents a modification of the existing AODV routing protocol to prevent blackhole attacks in MANETs in an erratic terrain with a high probability of packet loss. A mathematical proof is given to confirm the effectiveness of the proposed algorithm with respect to the previous solution in the literature.

Performance Evaluation of Improved Directional Ad Hoc on Demand Distance Vector Routing Protocol

Mobile ad hoc networks (MANET’s) popularly uses ad hoc on-demand distance vector (AODV) routing protocol. Past research has identified certain limitations on performance on AODV. This work discusses the results of a new protocol, improved directional AODV (ID-AODV) routing protocol; that has succeeded in improving the performance of MANET’s for energy, delay, packet delivery ratio and overheads as compared with networks using AODV. In ID-AODV, improvements are carried out in both network layer, and data link layer. The directionality is introduced based on hop count of its position from the source. The dual sensing directional media access control protocol is used to eliminate the hidden terminal, exposed terminal, and deafness issue. Participation of nodes in forming route is decided by checking remaining energy level of the node and also checking its load. A modified algorithm is used to reduce the delay. This algorithm reduces the delay by changing the time to live, wait time, and using expanded ring search technique. The simulation results show that the ID-AODV offers improved performance on average Energy consumption in the range of 17–20%, average end to end delay is lower by 61 to 95%, Overheads improved in the range of 10–13%, Jitter 6–21%, link break 43–52%, packet delivery ratio is 6–21% lower as compared to MANETS deploying AODV.

Evaluation of VoIP QoS Performance in Wireless Mesh Networks

The main focus of this research article is the evaluation of selected voice over Internet protocol (VoIP) solutions in wireless mesh network (WMN) scenarios. While WMNs have self-healing, self-forming, and dynamic topology features, they still pose challenges for the implementation of multimedia applications such as voice in various scenarios. Therefore, various solutions to make WMN more suitable for VoIP application have been proposed in the scientific literature. In this work, we have extensively explored a set of applicable scenarios by conducting experiments by means of a network simulator. The following scenarios were selected as the most representatives for performance evaluation: first responders, flooded village, remote village, and platoon deployment. Each selected scenario has been studied under six sub-scenarios corresponding to various combinations of the IEEE 802.11g, 802.11n, 802.11s, and 802.11e standards; the G.711 and G.729 codecs; and the ad hoc on demand distance vector (AODV) and hybrid wireless mesh protocol (HWMP) routing protocols. The results in terms of quality of service (measured with the mean opinion score rating scale), supported by the analysis of delay, jitter and packet loss, show that 802.11g integration with both VoIP codecs and AODV routing protocol results in better VoIP performance as compared to most other scenarios. In case of 802.11g integration with 802.11s, VoIP performance decreases as compared to the other sub-scenarios without 802.11s. The results also show that 802.11n integration with 802.11e decreases VoIP performance in larger deployments. We conclude the paper with some recommendations in terms of combinations of those standards and protocols with a view to achieve a higher quality of service for the given scenarios.

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET.

Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV’s research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV.

A Kind of Improved Congestion-Adaptive Ad-Hoc On-demand Distance Vector Routing Protocol

The Ad Hoc networks are more likely to be congested and paths are easy to fail because of the dynamic change of network topology and limited processing capability of the nodes. In order to solve these problems, this paper proposes the Improved Congestion-Adaptive Ad-Hoc On-demand Distance Vector routing protocol(ICAAODV). It presents a new method to calculate the node stability and establish a stable route by considering the calculation results. And it also uses congestion trend to calculate the congestion value of one node by cross-layer design. When judging out some nodes have congested by the cross-layer module, it establishes a bypass and split the data for achieving congestion adaptability. The simulation results show that the new ICA-AODV can improve the reliability and robustness of an Ad Hoc network

Trusted and Secured Routing Protocol for Vehicular Ad-Hoc Networks

Objectives: To establish a trust based secured routing protocol to accurately distinguish malicious nodes that are dropping the important information and modifying the routes. Efforts are made to identify malicious nodes such as route modifiers and packet droppers. Methods/Statistical Analysis: Vehicular Ad-hoc NETworks (VANETs) is a modern technology which help a vehicle and a driver in several ways. The main characteristics of VANETs are nodes i.e. vehicles with relatively high mobility and constantly changing topology. In case of data communication in VANETs, a source node must depend on the intermediate nodes to send its data packets to the destination node on multi-hop routes. VANETs can give better performance if all its nodes work properly with full cooperation during the communication. In VANETs, a node can generate and broadcast important and essential messages to other nodes in the network for safety reason. However, the generated message by a vehicle may not be reliable every time. In this paper we have proposed a trusted and secured routing protocol that evaluates the trust of a vehicle and also checks the message reliability. The proposed protocol is named as Trusted Vehicular Ad-hoc On-demand Distance Vector (TVAODV) routing protocol which is the modification of Ad-hoc On-demand Distance Vector routing protocol. Since VANETs are mostly attacked by the malicious nodes; therefore better security solution is needed to stop such attacks. The proposed protocol introduces a trust model to establish a malicious node free route for source node to send its data packets to the destination node on multi-hop routes. Findings: The TVAODV protocol is simulated in Network Simulator (NS2) to check the performance and accuracy and also compared to AODV routing protocol. It is found that TVAODV is comparatively better in performance when VANET is in high mobility and versatile topology. The performance of the proposed protocol is evaluated using performance measurement metrics: average end-to-end delay, throughput, routing load and packet delivery ratio. The proposed protocol performance is evaluated in the presence of malicious (route modifiers and packet droppers) vehicles and the results shows that the proposed protocol is achieved better accuracy and it shows better performance compared to AODV routing protocol. Application/Improvements: The proposed protocol may be useful in the process of developing a better traffic management and transportation system. In this paper we have proposed a TVAODV routing protocol which includes trust model to evaluate the trust of vehicles as well as to establish a malicious free route.

Comparison of Reactive Routing protocols in MANET using IDS system

Mobile Ad-hoc networks (MANETs) is a infrastructure less network. They have so many advantages but disadvantages are security, transmission, energy etc. It has two types of protocols they are- reactive routing protocols and proactive routing protocols. In our paper, we discuss about comparing the security systems between the TORA (Temporally Ordered Routing Algorithm) and AODV (Ad-hoc on-demand distance vector routing) protocols using IDS (Intrusion Detection System) to get better result than proposed system. TORA is an algorithm for a routing data across MANETs, is an on-demand routing protocol. The main objective of TORA is to limit control message propagation in the highly dynamic mobile environment. AODV is an protocol establishes routes to destinations on demand and supports both unicast and multicast routing. The AODV protocol builds routes between nodes only if they are requested by source nodes. AODV creates a series of temporary nodes back to the requesting node. In our proposed system we compared parameters like Packet Delivery Ratio (PDR), Routing Overhead (RO) and Throughput through network simulation 2 (NS2). Keywords- MANETs, IDS, protocols, TORA, AODV, security

A Game Theoretical Approach for Topology Control in Wireless Ad Hoc Networks with Selfish Nodes

In ad hoc networks, a significant amount of energy available to devices is utilized in network management operations. Since devices have limited energy resources, therefore, they drop data packets of other nodes to reduce their energy consumption. This selfish behaviour increases number of retransmissions over the link which increases energy consumption of the source node, introduces time delays, and degrades throughput of the network. Although conventional distributed topology control solutions minimize energy utilization of the nodes by adjustment of transmission power, however, selfish behaviour by devices introduce additional complexity in design which make topology control a challenging task. In this paper, we proposed Energy Efficient Topology Control Algorithm (EETCA) using game theoretical approach, in which, utility of the node depends on selfishness of the neighbors, link traffic rate, and link length. In decision-making step, nodes remove the links with other nodes that have high drop rate under the condition that network remains connected. We show that Nash Equilibrium point of the proposed game results in Pareto optimal network topology. We compare results of EETCA with Optimum (OPT) and Minimum Least Power Path Tree (MLPT) algorithms presented in literature. We carried our simulations under multiple sources scenario which show that EETCA outperforms previous approaches when number of nodes in the network increases. Furthermore, we simulate the performance of Ad-hoc On-demand Distance Vector (AODV) routing protocol under EETCA topology and compare it with MLPT and OPT topologies. The results show that the ad hoc network constructed using proposed solution substantially improves throughput of AODV routing protocol as compared to MLPT and OPT topology control algorithms.

AN EVALUATION OF IMPROVED CLUSTER-BASED ROUTING PROTOCOL IN ADHOC WIRELESS NETWORK

In this paper we presents a performance comparison of Dynamic Source Routing (DSR), Ad hoc On Demand Vector (AODV), Cluster Based Routing Protocol (CBRP) and Improved Cluster Based Routing Protocol (i-CBRP) routing protocols which builds upon a cluster based wireless network infrastructure. This evaluation is necessary due to unique enhancement made to traditional CBRP by way of implementing congestion control scheme as part of the structure establishing i-CBRP. First, we introduce the network infrastructure on which the routing protocols are to send packets. We simulates Mobile Ad-Hoc Network (MANET) network infrastructure using NS2 network simulator. DSR, AODV, CBRP and i-CBRP routing protocols are implemented to generate various simulation results. The results shows that i-CBRP performs better in terms of average packet delay, throughput, volume of traffic controls and average packet delivery ratio when compared with CBRP, while DSR performs better in terms of total volume of control traffic. AODV is the overall best in terms of average packet delay. Key words: Node Density, Evaluation, MANET, Cluster, Routing