On-demand Routing Protocol Research Articles

AN IMPROVED MAINTENANCE STRATEGY IN AD HOC ON-DEMAND ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS

In high mobility and high traffic load network situations, the delay time is affected with high end-to-end delay in reactive routing protocols such as AODV. In this paper we proposed an enhanced receiver-based AODV (ERB-AODV) routing protocol by improving the maintenance phase in AODV. ERB-AODV protocol focuses on decreasing the end-to-end delay and the control overhead in high mobility and traffic load. The receiver node uses a controller agent to update the sender node of the current available path. The agent works depend on the history of receiving data packets. Using glomosim, the ERB-ADOV protocol outperforms the AODV protocol in high mobility and traffic load. Results show that, in high mobility, the delay is decreased by 81% and the control overhead is decreased by 77%. The delay is decreased by 91% in high traffic load, and decreases the control overhead by -77% compared with AODV protocol. These results show the improvement of network delay using the new maintenance strategy on on-demand routing protocols for MANETs.

A Topology-Hiding Secure On-Demand Routing Protocol for Wireless Ad Hoc Network

Secure routing in wireless ad hoc network has been an active area of research and in recent years, a number of secure routing protocols have been introduced. These solutions may be classified as proactive, reactive, and hybrid based on the routing information update mechanism deployed. Studies reveal that the reactive (on-demand) ones often outperform the others due to their ability to adjust the amount of network overhead created to track the mobility in the network. However, the existing secure on-demand routing protocols have also some limitations. In this paper, the weakness of existing popular secure reactive routing protocols is analyzed on the ground of topology exposure. Then a new topologyhiding secure on-demand routing protocol, called TSOR is proposed based on timestamp approach and asymmetric cryptography. Security analysis of TSOR shows that it efficiently defeats all possible threats imposed by external or internal adversaries. Simulation results demonstrate that our protocol has a better capability of finding reliable and shortest routes in the presence of malicious nodes at the cost of low routing overhead.

Study and Performance Comparison of AODV and USOR

Privacy protection is important for some ad hoc networks in order to achieve privacy preserving routing. In this paper we emphasize and do comparison of two schemes Unobservable Secure On-Demand Routing Protocol(USOR) and AODV to provide and preserve privacy in adhoc networks. USOR is an unobservable, secure routing scheme which provides unlinkability and content unobservability for all the different type of packets. For this it uses a combination of group signature and id based encryption. USOR protects user privacy against both inside and outside attackers by defining stronger privacy requirements. After analysis it is found that the USOR results are improved as compared to AODV.

Optimization of Multicast Ad Hoc On-demand Routing Protocol Based on Genetic Algorithm with Backup Paths in MANET

An MAODV is an extension of AODV protocol. It's one of the efficient multicast tree structures. So many techniques are used to improve the performance of MAODV protocol such that performance like PDR, latency, energy. In minimum load adhoc networks the multicast route to recovery is effective. Merely, in maximum load network condition large number of packets discarded and poor robustness of the tree based protocols appears. This paper represents a way to improve the packet deliver ratio, latency and energy consumption of the system by using backup paths and to choose the best path among backup paths using genetic algorithm (GA) by using best fitness value for further transmission during route repair occurs. The validity of the tree based multicast protocols is improved by holding a network structure using backup paths. The efficiency of the tree structure is improved by using GA in the mesh structure created by backup paths. It not merely improves the reliability it also reduces the control and data overhead in the multicast tree. The operation of the system is measured by applying the simulation tool NS-2. Ultimately the performance is compared with MAODV protocol and current methods.

An optimized node-disjoint multipath routing scheme in mobile ad hoc

In mobile ad hoc networks (MANETs), link failures are caused frequently because of node’s mobility and use of unreliable wireless channels for data transmission. Multipath routing strategy can cope with the problem of the traffic overloads while balancing the network resource consumption. In the paper, an optimized node-disjoint multipath routing (ONMR) protocol based on ad hoc on-demand vector (AODV) is proposed to establish effective multipath to enhance the network reliability and robustness. The scheme combines the characteristics of reverse AODV (R-AODV) strategy and on-demand node-disjoint multipath routing protocol to determine available node-disjoint routes with minimum routing control overhead. Meanwhile, it adds the backup routing strategy to make the process of data salvation more efficient in case of link failure. The results obtained through various simulations show the effectiveness of the proposed scheme in terms of route availability, control overhead and packet delivery ratio.

Optimal Time Bound Ad-Hoc On-demand Distance Vector Routing Protocol (OpTiB-AODV)

Ad-Hoc On demand Distance (AODV) routing protocol is one of the reactive on-demand routing protocol. It is one of the multicast routing protocol. The basic AODV protocol does not have and mechanism to reduce the end to end time delay. The proposed algorithm Optimal Time Bound (OpTiB)AODV routing protocol introduce five different way to reduce the end to end time taken. This proposed OpTiB AODV implemented and tested by the use of OmNet++.

Security upgrade against RREQ flooding attack by using balance index on vehicular ad hoc network

VANET is an ad hoc network that formed between vehicles. Security in VANET plays vital role. AODV routing protocol is a reactive or on-demand routing protocol which means if there is data to be sen...

A Fuzzy Logic-Based Fault Tolerance New Routing Protocol in Mobile Ad Hoc Networks

Ad hoc networks are self-organizing and self-configuring networks that do not have fixed infrastructures. Mobile stations in wireless ad hoc networks move around in the network, thus requiring routing to dynamically handle the constant changing of network topologies. In this paper, we propose a fuzzy logic-based on-demand routing protocol (FBRP) for mobile ad hoc networks. The FBRP selects routes based on power of battery and speed of mobile nodes. The results of simulation and a comparison of the proposed method with the well-known ad hoc on-demand distance vector protocol revealed better performance and a higher fault tolerance for our approach, particularly in terms of node failures.

Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks

Most of the existing routing protocols for heterogeneous multi-hop wireless networks (HWMNs) use on-demand routing protocols owing to their suitability for dynamic topology environments, but it causes wastes of network resources with large number of data packets being broadcast. Furthermore, some nodes in heterogeneous wireless multi-hop networksmay be malicious or selfish nodes which can easily lead to link attacks. A novel routing protocol called trust-based secure routing protocol with auxiliary of nodes' location information (TSRAL) is proposed for the establishment of a secure routing protocol with a lower overhead for HWMNs which combines the location information and trust value of nodes to select the next forwarding nodes. The destination node selects an optimal path from multiple paths according to the total trust value and the hop number of routes. Simulation results demonstrate that TSRAL can not only reduce the number of hops and data packets being broadcast in the process of routing but also ensure the safety of the route.

Congestion-aware and traffic load balancing scheme for routing in WSNs

Congestion in a Wireless Sensor Network (WSN) is one of the causes of performance degradation due to severe packet loss that leads to excessive energy consumption. Solutions in WSNs try to avoid and overcome congestion by selecting sensor nodes with sufficient buffer space and adjusting the traffic rate at the source node over the shortest discovered route that usually decreases the End-to-End (ETE) throughput. On-demand routing protocols have the potential to discover the least congested route when it is required. In a WSN, most of the on-demand routing protocols replace the routing metric of the prevalent routing protocol with their proposed routing metric and keep the route discovery mechanism intact, which is not sufficient to increase the performance of the WSN. To address these problems, a novel Congestion-aware and Traffic Load balancing Scheme (CTLS) for routing has been proposed. The CTLS proactively avoids congestion through a novel route discovery mechanism to select the optimum node based on a composite metric. If congestion occurs, CTLS tries to detect it in a timely manner and alleviates it reactively using a novel ripple-based search approach. The simulation results show that the CTLS performs better as compared to the congestion avoidance, detection and alleviation and no congestion control schemes in terms of packet delivery ratio, ETE delay, throughput, and energy consumption per data packet in a resource constraint wireless network.

Ad hoc on-demand Distance Vector Routing Protocol Based on Load Balance

The ad hoc on-demand distance vector routing protocol based on load balance (AODVLB) is proposed aiming at the jitter problem. The turbulence phenomena in on-demand route protocol is presented, the delay forwarding technology is introduced to control the route building, a load calculation function have been designed. The results of simulation using ns2 show that the method decreases 20% than AODV in jitter time, improves the networks performance significantly.

Privacy-Preserving Secure On-Demand MANET Routing Protocol for Adversarial Environments

In military tactical environment communication to function effectively, military command and control depends on a communication network of equipment, personnel, and communication protocols to relay information among forces. An important and essential issue in military tactical environment is the privacy and security during communication. A number of routing techniques have been proposed for communication for military tactical environment, but those techniques are compromised in many ways by the attackers. This paper facilitates two features which is mostly required for hostile environment; privacy and security. The first one preserves the privacy (identity of the military personnel is anonymous) of the soldiers and the later provides security (attackers cannot extract the information) in military tactical communication. In this paper, a privacy-preserving secure on-demand MANET routing (PSMOR) protocol has been proposed to provide privacy and security for data communication. The PSMOR protocol is designed based on identity-based group signature scheme and cryptographic onion to achieve privacy and security. The simulation results ensure the necessity and importance of the proposed PSMOR protocol in achieving such privacy and security under hostile environment.

Adaptive Cross-Layer Multipath Routing Protocol for Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) are generally created for temporary scenarios. In such scenarios, where nodes are in mobility, efficient routing is a challenging task. In this paper, we propose an adaptive and cross-layer multipath routing protocol for such changing scenarios. Our routing mechanisms operate keeping in view the type of applications. For simple applications, the proposed protocol is inspired from traditional on-demand routing protocols by searching shortest routes from source to destination using default parameters. In case of multimedia applications, the proposed mechanism considers such routes which are capable of providing more data rates having less packet loss ratio. For those applications which need security, the proposed mechanism searches such routes which are more secure in nature as compared to others. Cross-layer methodology is used in proposed routing scheme so as to exchange different parameters across the protocol stack for better decision-making at network layer. Our approach is efficient and fault tolerant in a variety of scenarios that we simulated and tested.

Improving QoS of Mobile Ad-hoc Network Using Cache Update Scheme in Dynamic Source Routing Protocol

The route caching plays significant role in on-demand routing protocol to improve the Quality of Service (QoS). QoS is very essential for various applications of MANET. Route discovery phase is used in on-demand protocol. To avoid route discovery scheme route caching strategy is used. Frequently use of route discovery is very cost effective solution in terms of QoS parameters. Hence, in this paper we have proposed new approach for cache updating using distributed route cache update algorithm. In conventional approach only the nodes involved in the routing path knows about the route error and those node only update their cache. But in U-DSR, by following distributed cache replacement algorithm, source node broadcasts the route error information of size 60 bytes to all its neighbours. Hence all neighbours replace the stale route in their cache. Experimental evaluation is done using network simulator (NS2) of monarch group. The proposed approach improves the performance up to 30%-40% using different QoS parameters like Packet Delivery Ratio (PDR), end to end delay, packet drop and energy consumption.

A Novel Broadcast Scheme DSR-based Mobile Adhoc Networks

Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS). Despite many studies that have placed a lot of emphasis on broadcast communication, broadcasting in MANETs is still a problematic issue. Due to the absence of the fixed infrastructure in MANETs, broadcast is an essential operation for all network nodes. Although the blind flooding is the simplest broadcasting technique, it is inefficient and lacks resource utilization efficiency. One of the proposed schemes to mitigate the blind flooding deficiency is the counter based broadcast scheme that depends on the number of received duplicate packets between the node and its neighbors, where the node compares the duplicate packet itself and each neighbor node that previously re-broadcasted a packet. Due to the fact that existing counter-based schemes are mainly based on the fixed counter based approach, these schemes are not efficient in different operating conditions. Thus, unlike existing studies, this paper proposes a dynamic counter based threshold value and examines its effectiveness under the Dynamic Source Routing Protocol (DSR) which is one of the well-known on-demand routing protocols. Specifically, we develop in this paper a new counter based broadcast algorithm under the umbrella of the DSR, namely, Inspired Counter Based Broadcasting (DSR-ICB). Using various simulation experiments, DSR-ICB has shown good performance especially in terms of delay and the number of redundant packets.

Modified Fidelity Based On-Demand Secure (MFBOD) Routing Protocol in Mobile Ad-Hoc Network

Abstract With advent of technology MANET is becoming more and more ubiquitous, and so is the vulnerability of such networks to attacks. In this paper, we propose a secure, lightweight, on-demand routing protocol for MANETs. It uses the concept of fidelity to allocate trust to a neighbor, thereby taking the decision whether to send data via that neighbor or not. To combat attacks efficiently new packets like report and recommendation are used. After receiving a few of these packets a node can conclude about the behavior of a node, thereby identifying and blacklisting the malicious nodes. We try to impose bounds for the fidelity with reference to the battery of the node, which restricts a node to increase its fidelity to infinity and become dominant in the network. This protocol not only finds a secure route to transmit data, but also identifies the malicious nodes in the network. Our protocol exhibits high packet delivery fraction, with low normalized routing load and low end to end delay; which has been observed while simulating in GloMoSim platform. We have observed that our protocol performs not only better than other existing secure routing protocol in a malicious environment, but also combats, many attacks which have not been dealt with these protocols.

Geographical awareness hybrid routing protocol in Mobile Ad Hoc Networks

This paper proposes a geographical awareness routing protocol based on a hybrid routing protocol, the Zone Routing Protocol (ZRP), in Mobile Ad Hoc Networks (MANETs). ZRP is created from combining proactive routing protocol and on-demand routing protocol; therefore, it inherits the advantages of both these routing protocols. The long delay time of the on-demand routing protocol and the huge routing overhead of the proactive routing approach are reduced in ZRP. However, ZRP still produces a large amount of redundant routing overhead in the route discovery process, which not only wastes energy but also increases the workload of the network, while limited bandwidth is a challenge for MANETs. To mitigate routing overhead, a geographical awareness approach that is applied to limit the discovered route area in ZRP is proposed and is called the Geographical awareness ZRP (GeoZRP). Simulation results confirm that the proposed algorithm alleviates routing overhead and end-to-end delay with only a slightly decrease in the packet delivery ratio.

On-Demand Routing Protocol with Tabu Search Based Local Route Repair in Mobile Ad Hoc Networks

This paper tackles the routing issue in mobile ad hoc networks by introducing a novel approach. The most challenging issue, when designing a routing protocol in this context, is the mobility of nodes, which engenders frequent links breakage. Therefore, most of research effort in this field should be conducted in this sense so that routing protocol will not be affected by route failures caused by link disconnections. The proposed routing protocol, called on-demand routing protocol with tabu search based local route repair, uses an intelligent technique to locally repair the failed routes. The idea is to connect the two parts of the failed route using minimum overhead and without generating loops. Hence, when a route is failed, a special packet containing a tabu list of upstream nodes (nodes of the first part the route) is launched with a minimum time-to-leave value. The motivation on using a local route repair approach rather than a new route discovery process is to save delay and to reduce control packet overhead, which leads to less network contention and less packets drop. However, this technique can lead longer routes between nodes, consequently, network performances will be worsened. To avoid this kind of situation, destination node invalidates the route when the number of repairs overtakes a given limit. Simulation results demonstrate that our proposed protocol achieves better in terms of communication delay, packet delivery ratio and control packet overhead than existing AODV-BFABL, DSR and AOMDV.

An Empirical Critique of On-Demand Routing Protocols against Rushing Attack in MANET

<div><table cellspacing="0" cellpadding="0" align="left"><tbody><tr><td align="left" valign="top"><p>Over the last decade, researchers had proposed numerous mobile ad hoc routing protocols for which are operate in an on-demand way, as standard on-demand routing protocols such as AODV, DSR and TORA, etc., have been shown to often have faster reaction time and lower overhead than proactive protocols. However, the openness of the routing environment and the absence of centralized system and infrastructure make them exposed to security attacks in large extent. In particular, one such kind of attacks is rushing attack, which is mostly hard to detect due to their inherited properties, that alters the network statistics radically. In this paper, we modeled a rushing attack which is a powerful attack that exploits the weaknesses of the secure routing protocols. Moreover, to know the weakness and strength of these protocols, it is necessary to test their performance in hostile environments. Subsequently, the performance is measured with the various metrics, some ot them are average throughput, packet delivery ratio, average end-to-end delay and etc., to compare and evaluate their performance.</p></td></tr></tbody></table></div>

Impact of noise and interference on probabilistic broadcast schemes in mobile ad-hoc networks

Broadcasting is a vital part of on-demand routing protocols to discover new routes in mobile ad-hoc networks (MANET). Pure flooding is the earliest and still widely used mechanism of broadcasting for route discovery in on-demand routing protocol. In pure flooding, a source node broadcasts a route request to its neighbors. These neighbors then rebroadcast the received route request to their neighbors until the route request arrives at the destination node. Pure flooding may generate excessive redundant traffic leading to increased contention and collisions deteriorating the performance. To limit the redundant traffic, a number of probabilistic broadcast schemes have been proposed in the literature. However, the performance of those probabilistic broadcasting schemes is questionable under real life MANETs which are noisy in nature. Environmental factors like thermal noise and co-channel interference may have adverse effects on the system performance. This paper investigates the effects of thermal noise and co-channel interference on the performance of probabilistic schemes employed in the route discovery mechanism in MANETs. Based on extensive ns-2 simulations, this paper discovers that, contrary to the findings of previous studies, these schemes do not outperform pure flooding scheme when thermal noise and co-channel interference are taken into account.