Mobile Ad Hoc Network Routing Protocols Research Articles

Comparative Study of Throughput in MANET Routing Protocols with Variable Nodes using NS-2

Mobile Ad-hoc Network (MANET) is a collecting of wireless moveable nodes dynamically forming a temporary mesh without the aid of any constituted store or centralized body. As in MANET, the network anatomy is changing and often changes, so routing protocols should be fashioned to athletics the obligation of the MANET. It is a determinant division in the action valuation of MANET to select suitable mobility model have been proposed for ad hoc wireless networks based on diametrical scenarios. In this theme, we speculated and equated the action of the routing protocols AODV, DSDV, DSR and OLSR with indicator to varying throughput.

An Implementation of Black hole Detection and Prevention Method using AODV Routing Protocol in MANET Environment

security is a pathetic link in wired and wireless network systems. A mobile ad hoc network (MANET) is a compilation of self-sufficient nodes that converse with every further by forming a multi-hop radio network and maintaining associations in a decentralized manner. Security remains a main challenge for these networks owing to their features of open medium, animatedly changing topologies, confidence on accommodating algorithms, absence of federal monitoring points, and lack of clear lines of protection. Mainly of the routing protocols for MANETs are therefore susceptible to dissimilar kind of attacks. Ad hoc on-demand detachment vector routing (AODV) is a much admired routing algorithm. Though, it is susceptible to the recognized black hole attack, where a malevolent node incorrectly advertises good pathway to a purpose node throughout the route discovery process. This attack becomes additional sever while a group of malevolent nodes assist every other. In this paper, a security mechanism is offered against a corresponding attack by multiple black hole nodes in a MANET. The reproduction approved out on the proposed scheme has produced results that establish the efficiency of the mechanism in discovery of the attack as maintaining Constant Network Performance.

IWDRP: An Intelligent Water Drops Inspired Routing Protocol for Mobile Ad Hoc Networks

This paper deals with the problem of routing in Mobile Ad hoc Networks (MANET). A mobile ad hoc network is a collection of mobile devices deployed without any pre-established infrastructure or centralized administration. Routing is a very challenging issue since the appearance of this technology. The main goal of every routing protocol is to find a route between two communicating nodes while optimizing overall performances of the network. This paper introduces a novel routing protocol inspired from the nature and that should deal with the dynamic aspect of MANET. The used approach, called Intelligent Water Drops (IWD), mimics the processes that happen in the natural river systems, particularly, the actions that water drops perform in the rivers to find the shortest path to their destination (sea). In fact, it is observed that water drops of a river often find good paths among lots of possible paths in their ways from a source to a destination. We combined these ideas with a route failure prediction mechanism to develop a new routing protocol for MANETs called IWDRP. This prediction method is based on the received signal strength indicator. Further simulation results show that IWDRP is able to achieve better results in terms of packet delivery, end-to-end delay in comparison with AODV-BFABL. The achievement in this paper has certain reference value to the further study of the routing issue in MANETs.

T2AR: trust-aware ad-hoc routing protocol for MANET.

Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design.

Performance evaluation of various MANET routing protocols for adaptability in VANET environment

Vehicular ad hoc network (VANET) is emerging as one of the challenging research area because of the heavy dependency of human being into vehicles which tends to develop an intelligent transport system. VANET is treated as an extension of mobile ad hoc network (MANET) due to its behavior and its working mode. VANET is emerging as a new powerful tool to provide safety and security to the human beings during the time of traveling from one place to another. Routing is one of the challenging tasks for both MANET and VANET due to the frequent change in the topology. In this paper, we are evaluating the adaptability of existing MANET routing protocols for VANET. This paper analyze that what is the impact the vehicle density and speed on the packet delivery ratio, normalized routing load, average end-to-end delay, average throughput, average path length and average loss rate, which will help to design a new routing protocol or to have some improvement in the existing routing protocols.

Efficient Mechanisms and Performance Analysis of Routing Protocols in VANETs for Realistic Scenarios

Vehicular Ad Hoc Networks (VANETs) are considered as a special case of mobile Ad Hoc Networks (MANETs) and are recently gaining a great attention from the research community. The need for improved road safety, traffic efficiency and direct communication along with the great complexity in routing, makes VANETs a highly challenging field. Routing in VANETs has to adapt to special characteristics such as high speed and road pattern movement as well as high linkage break probability. In this work, the authors show that traditional MANET routing protocols cannot efficiently handle the challenges in a VANET environment and thus need further modifications. For this reason, they propose and implement an enhancement mechanism, applied to the GPSR routing protocol that adapts to the needs of a VANET. The proposed mechanism's performance is evaluated through simulation sets for urban and highway scenarios and compared to the performance of the most common MANET routing protocols adopted in VANETs. The proposed enhancement is shown to be considerably beneficial and it significantly outperforms the rest of the tested routing protocols for almost every topology setting.

Context aware routing management architecture for airborne networks

Military environments require highly dynamic mobile ad hoc networks (MANETs) to meet operational mission requirements. Decision makers rely on the timely delivery of critical battlefield information to make informed determinations quickly and as accurately as possible. However, traditional MANET routing protocols do not provide quality of service (QoS). Furthermore, they do not implement active controls to minimise the impact of network congestion. This study proposes the use of the information embedded in an air tasking order (ATO) during the planning phase of military missions to optimise the network performance. The trajectories of relevant nodes (airborne platforms) participating in the MANET can be forecasted by parsing key information contained in the ATO. Using this idea it is possible to optimise network routes to minimise edge overutilisation and increase network throughput. In one simulated test case, there was a 25% improvement of network throughput, and 23% reduction on dropped packets. Using this technique, the authors can selectively preserve the QoS by establishing network controls that drop low-priority packets when necessary. The algorithm improves the overall MANET throughput while minimising the packets dropped due to network congestion.

Periodicity Based Gateway DiscoveryAlgorithm in Hybrid Multihop Network

Mobile ad hoc networks (MANETs) are autonomous and stand-alone and infrastructure less networks applicable in areas such as disastrous locations or remote geographical areas, where deploying an infrastructure network is neither feasible nor cost effective. In such network, every node is free to move and change its location. The movement of nodes makes the task of routing more complicated and error prone than fixed infrastructure networks. So, in such dynamic environment, a different routing protocol is required. Further, MANET has very limited services and applications running on them, thereby it creates a need to integrate MANET with the Internet. In order to connect with the Internet, mobile nodes need to discover and select an appropriate gateway. A gateway deals with heterogeneous protocols and also provides mapping among them, so it can work with both MANET routing protocol as well as different Internet protocols. Internet gateway sends connectivity parameter in a message to all the nodes in its range periodically and this time period plays a vital role in the performance of the network. There are many approaches to optimize periodicity, but they mostly use statistical method for this purpose. The major drawback of these approaches is using a threshold value to determine the periodicity of advertisement message which provides a limited performance improvement. Therefore, the objective of this paper is to optimize the frequency of MRA (Modified Router Advertisement) message sent by gateway so that it prevents the saturation of MANET with MRA messages as well as preventing obsolete links to a gateway. For this purpose, we use a fuzzy logic based optimization scheme which uses Advertisement Solicitation Ratio (ASR), Active Source Change (ASC) and TTL Change as parameters. Our simulation results demonstrate that our approach outperforms many existing approaches.

Triangle-based routing for mobile ad hoc networks

Routing protocols for Mobile ad hoc networks (MANETs) have been studied extensively in the past decade. Routing protocols for MANETs can be broadly classified as reactive (on-demand), proactive, hybrid and position-based. Reactive routing protocols are attractive because a route between a source and a destination is established only when it is needed. Such protocols, unlike proactive protocols, do not have high overhead for route maintenance and are especially suitable for networks in which not all nodes communicate frequently. One problem with existing reactive routing protocols is the propagation of redundant route request messages during route discovery. In this paper, we present a low-overhead reactive routing protocol which reduces propagation of redundant route request messages. We also compare its performance with the well-known reactive routing protocol AODV.

Declarative Framework for Specification, Simulation and Analysis of Distributed Applications

Researchers have recently shown that declarative database query languages, such as Datalog, could naturally be used to specify and implement network protocols and services. In this paper, we present a declarative framework for the specification, execution, simulation, and analysis of distributed applications. Distributed applications, including routing protocols, can be specified using a Declarative Networking language, called D2C, whose semantics capture the notion of a Distributed State Machine (DSM), i.e., a network of computational nodes that communicate with each other through the exchange of data. The D2C specification can be directly executed using the DSM computational infrastructure of our framework. The same specification can be simulated and formally verified. The simulation component integrates the DSM tool within a network simulation environment and allows developers to simulate network dynamics and collect data about the execution in order to evaluate application responses to network changes. The formal analysis component of our framework, instead, complements the empirical testing by supporting the verification of different classes of properties of distributed algorithms, including convergence of network routing protocols. To demonstrate the generality of our framework, we show how it can be used to analyze two classes of network routing protocols, a path vector and a Mobile Ad-Hoc Network (MANET) routing protocol, and execute a distributed algorithm for pattern formation in multi-robot systems.

Reducing Flooding of Zone Routing Protocol in Mobile Ad-Hoc Networks

Mobile ad-hoc networks (MANETs) are temporary networks without any pre-existing infrastructure in which nodes are connected through wireless channels. There is no centralized administration in this network because nodes are not fixed at their locations, they are continuously moving to different locations. Each node in MANETs has dynamic capabilities because at one point acts as a host while in some other time becomes a router which can forward messages on the network to other nodes. One of the complicated issues in MANETs is routing due to their dynamic topology which is frequently changes due to the mobility of nodes. In order to forward packets in this complex topology using optimal routes, there is a need for efficient routing protocols. There are three categories of routing protocols in MANETs named as reactive, proactive and hybrid respectively. We have used a hybrid type protocol named Zone Routing Protocol (ZRP) for routing in our research. In order to control unwanted flooding in the overlapping zones of ZRP, we have proposed a selective broadcasting technique for route discovery. In this technique route discovery exchange messages are highly reduced in the outer zone of the ZRP.

Anonymous Routing Protocols for Mobile Ad-Hoc Networks

Nowadays, with the development of mobile ad hoc networks (MANETs), it attracts more attention by researchers. MANETs not only can be used for military application, but also can be used for citizens. For military, MANETs works in hostile environments with lacking of infrastructure. And for civil application, MANETs show their power in many way like communication between cars or self-construct temporary network consist of laptops. Meanwhile, more research focus on the anonymity and security of MANETs. To meet those requirements, many routing protocols were proposed to ensure the goal of anonymity and security. This paper introduce several anonymous routing protocols for MANETs, and classify those protocols into two parts: On-Demand Anonymous routing protocols and None On-Demand Anonymous routing protocols. Besides, this paper compares the differences between those protocols.

Ant colony-based energy control routing protocol for mobile ad hoc networks under different node mobility models

The energy of nodes is limited in mobile ad hoc networks(MANETs). In order to extend the network lifetime, how to select the best route is a critical issue for routing protocols in MANETs. In this work, we propose the ant colony-based energy control routing (ACECR) protocol to find an optimal route by using the positive feedback character of ant colony optimization (ACO). In our ACECR protocol, the routing choice depends on not only the number of hops between nodes and the node energy, but also the average and the minimum energy of the routes. The performance of our ACECR routing protocols is evaluated in different mobility models. In addition, we do extensive simulations to study the movement characteristics of different mobility models and their effect on routing protocols. Simulation results show that ACECR has a better performance in balanced energy consumption and a longer network lifetime compared with existing protocols.

A comparative QoS survey of mobile ad hoc network routing protocols

A mobile ad hoc network (MANET) is a wireless, dynamic, infrastructure-less, self-organized, multi-hop, and decentralized network. Each node in MANET can act as a router as well as a work station. Many routing protocols have been developed to increase the efficiency of MANET. The primary objective of this paper is a detailed QoS comparison of reactive (AODV), proactive (DSDV), and hybrid (ZRP) routing protocols of MANET in order to find which routing protocol works best in a particular network scenario. The analysis was made for TCP-based traffic patterns. The performance differentials were analyzed on the basis of normalized routing overhead, packet loss, packet delivery ratio, control packets, end-to-end delay, packet received, and packet sent with a variation of nodes density and mobility. The results were obtained using the NS-2 simulator.

Quantitative Comparative Study of Selected Routing Protocols in MANET based on Security

Mobile ad-hoc network (MANET) is a sub class of ad-hoc network and it dynamically forms a temporary network without any support of central administration. Ad hoc network is a collection of wireless mobile nodes without any fixed infrastructure. The network is ad hoc because it does not rely on any pre-existing network infrastructure like routers in wired networks. Such networks have no fixed topology due to the high degree of node mobility. Node mobility may cause the routes change. Hence, routing in MANET is a critical task due to its highly dynamic environment. To accomplish this task, a variety of routing algorithms have been proposed and also the number remains increasing day by day. These protocols fall in to mainly three categories---Proactive, Reactive and Hybrid. But, it is difficult to determine which protocol performs best under a number of different scenarios. This paper presents the qualitative comparison of selected proactive routing protocols DSDV, OLSR and CGSR based on security. General Terms MANET Protocols, Comparative Study

Anti-Black Hole Attack Mechanism for Ad Hoc On-Demand Distance Vector (AODV) Routing Protocol in Manets

Mobile Ad-hoc Networks (MANETs) can be set up dynamically anywhere and anytime without the need of infrastructure. MANETs consists of a set of wireless nodes. These nodes move randomly and communicate with each other via a wireless communication links. MANETs routing protocols are vulnerable to several types of attacks, the most famous and common is Black Hole attack .This research simulate the behavior of Black Hole attack on Ad-hoc OnDemand Distance Vector (AODV) Routing Protocol using Network Simulator (NS2.35). Moreover, the black hole node(s) have been eliminated completely using the mechanism proposed in this research. The proposed approach is named as Anti-Black Hole Attack mechanism for AODV (ABHMAODV) Routing Protocol. The proposed mechanism maintains the performance of the protocol while handling Black Hole attacks.

Adaptive reliable and congestion control routing protocol for MANET

In mobile ad hoc networks (MANETs), the packet loss can be caused either by link failure or by node failure. Moreover, the techniques for selecting the bypass route and avoiding congestion in the bypass route are rarely handled. To overcome these, in this paper, we propose an adaptive reliable and congestion control routing protocol to resolve congestion and route errors using bypass route selection in MANETs. The multiple paths are constructed. Among which, the shortest paths are found for efficient data transmission. The congestion is detected on the basis of utilization and capacity of link and paths. When a source node detects congestion on a link along the path, it distributes traffic over alternative paths by considering the path availability threshold and using a traffic splitting function. If a node cannot resolve the congestion, it signals its neighbors using the congestion indication bit. By using simulation, we show that that the proposed protocol is reliable and achieves more throughput with reduced packet drops and overhead.

Real-time routing algorithm for mobile ad hoc networks using reinforcement learning and heuristic algorithms

Mobile ad hoc networks (MANETs) consist of a set of nodes which can move freely and communicate with each other wirelessly. Due to the movement of nodes and unlike wired networks, the available routes used among the nodes for transmitting data packets are not stable. Hence, proposing real-time routing protocols for MANETs is regarded as one of the major challenges in this research domain. Algorithms compatible with the changes created in the network due to the nodes' movements are of high significance. For reducing data packet transmission time among nodes, not only should route shortness be considered but also route stability should be taken into consideration. Since available factors in different environments have specific behavior patterns especially in human environments, the parameters of link stability and route shortness were taken into consideration and the reinforcement learning was used to propose a method so as to make the best choice among the neighbors at any moment to transmit a packet to the destination. That is, the proposed method was aimed at predicting the behavior pattern of the nodes in relation to the target node through using reinforcement learning. The proposed method used Q-learning algorithm which has more homogeneity to estimate the value of actions. Simulation results in OPNET demonstrate the superiority of the proposed scheme over conventional MANET routing methods.

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.

AODV Routing Protocol Modification With Dqueue(dqAODV) and Optimization With Neural Network For VANET In City Scenario

Vehicular ad hoc network (VANET) is considered as a sub-set of mobile ad hoc network (MANET). VANET can provide road safety by generating collision warning messages before a collision takes place, lane change assistance; can provide efficient traffic system by introducing cooperation among vehicles; and can also improves in infotainment applications like cooperative file accessing, accessing internet, viewing movies etc. It provides smart Transportation System i.e., wireless ad-hoc communication among vehicles and vehicle to roadside equipments. VANET communication broadly distinguished in two types; 1) vehicle to vehicle interaction, 2) vehicle to infrastructure interaction. The main objective of VANET is to provide safe, secure and automated traffic system. For this automated traffic techniques, there are several types of routing protocols has been developed. MANET routing protocols are not equally applicable in VANET. In the recent past Roy and his group has proposed several study in VANET transmission in [1-3]. In this study, we propose a modified AODV routing protocol in the context of VANET with the help of dqueue introduction into the RREQ header. Recently Saha et al [4] has reported the results showing the nature of modified AODV obtained from the rudimentary version of their simulation code. It is mainly based on packet delivery throughput. It shows greater in-throughput information of packet transmission compare to original AODV. Hence our proposal has less overhead and greater performance routing algorithm compared to conventional AODV. In this study, we propose and implement in the NCTUns-6.0 simulator, the neural network based modified dqueue AODV (dqAODV) routing protocol considering Power, TTL, Node distance and Payload parameter to find the optimal route from the source station (vehicle) to the destination station in VANET communications. The detail simulation techniques with result and output will be presented in the conference.