Routing Load Research Articles

Performance Analysis of DSR, AODV On-Demand Routing Protocols in Mobile Ad Hoc Networks

The wireless links are frequently broken down due to mobility and dynamic infrastructure. Many routing protocol methods have been proposed in Mobile Ad-Hoc Network but still the challenges are to improve the routing performance and reliability. This paper, focus on investigation the performance analysis of two important reactive routing protocols in mobile Ad hoc networks such as Dynamic Source Routing (DSR) and Ad hoc On-Demand Distance Vector Routing (AODV). The comparison done in terms of the Number of Hops per Route, Route Discovery Time, Routing Overhead, Error Packets Transmitted, Normalized Routing Load and Throughput (bits/Sec). A detailed simulation model including Network layer and physical layer models to study the inter-layer interactions and their performance implications. The simulation results indicate that AODV outperforms DSR and had a high quality of packet delivery when the mobility rate is low but in the constrained situation, DSR outperforms AODV, whereas DSR maintains its low overhead even in the presence of high mobility rate.

NDTAODV: Neighbor Defense Technique for Ad Hoc On-Demand Distance Vector (AODV) to Mitigate Flood Attack in Manets

Mobile Ad Hoc Networks (MANETs) are collections of mobile nodes that can communicate with one another using multihop wireless links. MANETs are often deployed in the environments, where there is no fixed infrastructure and centralized management. The nodes of mobile ad hoc networks are susceptible to compromise. In such a scenario, designing an efficient, reliable and secure routing protocol has been a major challengesue over the last many years. The routing protocol Ad hoc On-demand Distance Vector (AODV) has no security measures in-built in it. It is vulnerable to many types of routing attacks. The flood attack is one of them. In this paper, we propose a simple and effective technique to secure Ad hoc Ondemand Distance Vector (AODV) routing protocol against flood attacks. To deal with a flood attack, we have proposed Neighbor Defense Technique for Ad hoc On-demand Distance Vector (NDTAODV). This makes AODV more robust. The proposed technique has been designed to isolate the flood attacker with the use of timers, peak value and hello alarm technique. We have simulated our work in Network Simulator NS-2.33 (NS-2) with different pause times by way of different number of malicious nodes. We have compared the performance of NDTAODV with the AODV in normal situation as well as in the presence of malicious attacks. We have considered Packet Delivery Fraction (PDF), Average Throughput (AT) and Normalized Routing Load (NRL) for comparing the performance of NDTAODV and AODV.

Power Saving Routing Protocol for Ad hoc Networks based on AODV

An ad hoc network is a wireless and infrastructure less network. It has dynamic and impermanent network topology. Each of nodes contains limited power in ad hoc networks. Power constraint is a major challenge to ad hoc networks. Limited power of nodes breaks link of the networks and reduces life of the networks. This proposed method minimizes the problem of link breakage and reduces the energy use of the network using a threshold (cutoff) based technique. This method takes all the paths whose nodes have energy greater than threshold value. This method selects the shortest path from the various paths based on AODV (Ad hoc on demand Distance Vector) protocol for routing. This proposed method is an extension of AODV protocol on the basis of energy factor and it shows better performance than existing AODV protocol. The performance parameters are throughput, packet delivery fraction and normalized routing load. It reduces network overhead and increases network lifetime. We use NS2 network simulator for performance analysis. General Terms Power, Performance analysis, power aware routing.

Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection against DDOS

Multiple-path routing protocols allow data source node to distribute the total traffic among available paths. We consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory. This centralized optimization problem can be solved using a distributed algorithm based on decomposition in NUM. Along with this Network based attacks have become a serious threat to the critical information infrastructure. There are many security attacks in MANET e.g. DDOS. The effect of DDOS leads to routing load, packet drop rate, end to end delay in network. So considering these parameters we build secure IDS to detect such attack and block it. Identifying the source of the attackers is necessary to correlate the incoming and outgoing flows or connections. To resist attempts at correlation, the attacker may encrypt or otherwise manipulate the connection traffic. Timing based correlation approaches are subject to timing perturbations that may be deliberately introduced by the attacker at stepping stones. So watermark-based correlation scheme is proposed which is designed specifically to be robust against timing perturbations. Unlike most previous timing based correlation approaches, our watermark-.based approach is active in that it embeds a unique watermark into the encrypted flows by slightly adjusting the timing of selected packets.

Performance Analysis of MANET Routing Protocols A Comparative Study

Efficient routing has always been a matter of concern for mobile ad-hoc networks (MANETs). While reactive protocols are competing with the performance of proactive protocols, hybrid protocols have attempted to brew the best of the both. This paper reviews some of the selected literature regarding MANET routing protocols and studies the comparative performance of different routing protocols such as (AODV, DSR DSDV FSR, ZRP and etc.) under different scenarios (varying number of nodes, mobility, traffic type and load). The results from these papers are then compiled together and summarized in the form of graphs comparing the QoS parameters including Packet Delivery Ratio, Average End to End Delay, Average Throughput and Normalized Routing Load. The study concludes that no single protocol fit all needs. For a given scenario, a protocol may be chosen depending upon the mobility, size and required QoS.

Investigating quality routing link metrics in Wireless Multi-hop Networks

In this paper, we propose a new Quality Link Metric (QLM), “Inverse Expected Transmission Count (InvETX),” in Optimized Link State Routing (OLSR) protocol. Then, we compare performance of three existing QLMs which are based on loss probability measurements: Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and then to validate this frame work, we select three performance parameters to simulate default and enhanced versions of OLSR. The three chosen performance parameters are throughput, Normalized Routing Load, and End-to-End Delay. From the simulation results, we conclude that adjusting the frequencies of topological information exchange results in high efficiency.

Ant Colony Optimization based modified AOMDV for Multipath Routing in MANET

In this paper, modified ad-hoc on-demand multipath distance vector (AOMDV) for multipath routing using ant colony for mobile ad hoc networks (MANETs) is presented. For this purpose, Ant-AODV is used for comparison with AntAOMDV. The idea behind the working of Ant-AODV and Ant-AOMDV is that the RREQ message packets are sent to single path in case of Ant-AODV based routing and to multiple paths in case of Ant-AOMDV based routing. RREQ message packets can be termed as pheromone in terms of standard algorithm of ACO used by the ants. Selecting the transmission path dynamically through regular updating of pheromone of transmission path expects to improve routing performance. Simulation results show that Ant-AOMDV algorithm outperforms Ant-AODV effectively in terms of packet delivery fraction, normal routing load and packet drop compared with AODV and AOMDV. The main goal is to reduce the routing overhead, congestion and increase the performance. General Terms Security, Algorithms, Quality of Service, Routing, Load Balancing, Congestion control.

A General Study on the Transfer of Multimedia Messages over Mobile Adhoc Networks

Mobile Adhoc Networks are created and organized by a collection of nodes. Sending Multimedia data through these networks is a challenging process. In this paper some of the routing protocols namely AODV, DSDV, OLSR and FSR are taken to perform a general study. The QOS Parameters like Packet Delivery Ratio, Routing Control Overhead, Normalized Routing Load, Average End to End Delay, Throughput, and Jitter are analyzed for these protocols. General Terms Mobile Adhoc Networks.

A Novel Defense IPS Scheme against Wormhole Attack in MANET

The security is one of the major issue in Mobile Ad hoc Network (MANET). Each node in the Ad hoc network has work as router to take part in route establishment and data delivery in between sender and destination, thus highly cooperative nodes are required to ensure that the initiated data transmission process does not fail. Worm hole attack is a type of attack that are work as to established path in between sender and receiver but if the sender has start data transmission then in that case the worm hole attacker has create a direct link, referred to as a wormhole tunnel between them, it means more of the number of trusted nodes it means higher successful data communication process rates may well expected. In this paper we proposed Intrusion detection as well as prevention technique (IPS) against wormhole attack, for detection we use routing entry base detection technique and get attacker node information like node number, number of attack packet, attack time etc. after that we prevent wormhole attack using neighbor trust worthy base technique and secure the mobile ad-hoc network communication, through our proposal we provide secure as well as reliable communication and simulate through network simulator-2 and analyze the network behavior in attack and prevention case. After that we measure the performance of network on the bases of network parameter like throughput, packet delivery ratio, overall analysis, routing load etc.

Performance Evaluation of AODV under Blackhole Attack

Mobile Adhoc NETwork (MANET) consists of mobile nodes that can move freely and route packets without aid of centralized infrastructure. Dynamic changing topology, limited battery power and lack of centralized trusted authority make it vulnerable to several attacks and lot of research is being carried out in the field of security by discovering attacks, evaluating the damage caused to the network and developing solutions to combat such attacks. This paper simulates one of the most malicious behaviors known as blackhole attack. The blackhole node creates forged reply, advertising valid and fresh route to destination and thereafter drops data packets maliciously. The analysis guides us to the various performance parameters such as throughput, packet delivery fraction, normalized routing load and number of dropped packets evaluated over different scenarios.

PERFORMANCE EVALUATION OF PROACTIVE, REACTIVE AND HYBRID ROUTING PROTOCOLS WITH MOBILITY MODEL IN MANETS

Our work mainly focused on the performance and effe cts of different mobility models like Random Waypoi nt, Reference Point Group, and Manhattan mobility models in different aspects to improve and analyze the behavior of Optimized Li nk-State Routing (OLSR), Temporally-Ordered Routing Algorithm (TORA) and Zon e Routing Protocol (ZRP) routing protocols. These t hree routing protocols can be classified into the following three general categories, based on the timing when the routes are discovered and updatedproactive (OLSR), reactive (TORA) and hybrid (ZRP). In literature various researchers have discussed t he performance issues in AODV, DSDV and DSR routing protocols in Random Wayp oint mobility model on Mobile Ad hoc Networks (MANE Ts) is not satisfactory due to link failure and late acknowled gement. To resolve the specified issue, we have com e up with other alternatives like Reference Point Group, and Manhattan mobility model and also other routing protocols like OSLR, TORA aA simulation was carried out in NS2 and Bonnmotion for above said pr otocols and mobility models in Constant Bit Rate (C BR) traffic to analyzed using various metrics like packet delivery fraction, end to end delay and normalized routing load. In our si mulation it was shown that few mobility model performed better in different routin g protocols. In our simulation results, we got a hi gh Normalized Routing Load for Random Waypoint compared to Reference Point Group, and Manhattan mobility model in both DRP and OSLR p rotocols.

Energy, Traffic Load, and Link Quality Aware Ad Hoc Routing Protocol for Wireless Sensor Network Based Smart Metering Infrastructure

Electricity industry is in the midst of revolutionary transition from outdated ageing power infrastructure to an intelligent sophisticated smart grid network utilizing modern communication technologies to enhance power generation, transmission, distribution, and consumption. Smart metering infrastructure is an integral part of the smart power grid revolution. Smart meters, in addition to their primary billing functions, serve as distributed Wireless Sensor Network (WSN) nodes for enhancing grid reliability. Existing ad hoc routing protocols are based on single routing criterion such as hop count. This single routing metric approach can overload and deplete resource constrained smart meters along preferred paths. A protocol is needed which is aware of energy level and traffic congestion of smart metering nodes. In addition, protocol should select route based on link quality for optimal routing. In this paper, a novel WSN ad hoc routing protocol ETL-AODV is proposed for reliable and energy efficient communication of smart metering nodes. Three simulation based case studies are conducted to analyze the performance of the proposed protocol, and relative comparison is provided based on four metrics: (i) packet delivery ratio (PDR), (ii) normalized routing load (NRL) (iii) average energy consumption and (iv) average end-to-end delay.

Experimental Analysis of AODV and DSR with Varying Vehicle Mobility and Density in Vanet Scenario

In last three decade ,tremendous improvement is made in research area of wireless adhoc network and now a days ,one of the most attractive research topi c is inter vehicle communication i.e. realization of mobile adhoc network . A rich literatureis available in vehicular networksto explore the special characteristics of VANET but all the protocols are majorly geography based. It has some unique characte ristics which make it different from other adhoc routing protocols as well as difficult to define any exact mobility model and routing protocol because of their changing mobility patterns. In this research paper , the performance of two on-demand routing protocols AODV and DSR has been analysed by means of packet delivery ratio,end-to-end delay,packet loss ratio and normalised routing load with varying speed and node density under TCP connections.

Performance Evaluation of Reactive and Proactive Routing Protocols over MANET

Mobile devices are the fundamental requirement of communication network where user wants to freely move without breaking the signal. The Mobile devices today are capable enough to communicate independently. A Mobile Ad Hoc Network (MANET) is a group of wireless mobile nodes which can communicate without any pre-existing infrastructure by creating dynamic network. This paper discuss Mobile Ad-Hoc Network (MANET) environment with the varying number of nodes. The research presents the three reactive routing protocols i.e. Dynamic Source Routing (DSR), Destination Sequence Distance Vector and Ad hoc On Demand Distance Vector (AODV) with their results to the MANET in terms of packet delivery ratio, delay, routing load and throughput. Simulation is carried out by NS2 (Network Simulation). The experiment results reflect that AODV performance it better than DSR DSDV.

The Effect of Velocity of Nodes on the Performance of Routing Protocols in Mobile Ad-hoc Networks

is an autonomous system in which mobile hosts connected by wireless links (3) are free to move randomly (4) and often act as routers at the same time. Node failures and arbitrary movement of nodes break the routes and lead the frequent operation of rebuilding routes that consume lots of the network resources and the energy of nodes. This means we need a routing protocol that can enhance the network stability. There are three main categories of routing protocols: Proactive, Reactive and Hybrid. In this paper the performance of one proactive protocol (DSDV) and two reactive protocols (DSR and AODV) (5) has been evaluated. This evaluation is done by network Simulator 2(NS2). The performance is measured by means of following metrics: Packet Delivery Ratio, Average End to End Delay, and Normalized Routing Load.

A Path loss Sensitive Stable Routing Protocol for MANET

A Mobile Ad Hoc Network is a collection of portable devices that establish communication without the help of any infrastructure such as base stations or access points. As the MANET is infrastructure less, it is having dynamic nature of random network topology. Due to movement of nodes, the link between nodes breaks. The network needs to find a new route from source to destination. In order to find a route network initiate a route discovery procedure by broadcasting route request packets. The frequent invention of route increases the routing load and end to end delay. The existing ad hoc routing protocols based on hop count metric which doesn’t take in its consideration the stability of the link. The requirement is to discover a routing protocol that considers link stability during discovery of route, so resulting route is more stable than existing routing protocol. In this paper we compare performance of AODV and Path loss sensitive AODV which finds a stable path using received signal strength.

Performance Analysis of AODV Routing Protocol for Wireless Sensor Network based Smart Metering

Today no one can deny the need for Smart Grid and it is being considered as of utmost importance to upgrade outdated electric infrastructure to cope with the ever increasing electric load demand. Wireless Sensor Network (WSN) is considered a promising candidate for internetworking of smart meters with the gateway using mesh topology. This paper investigates the performance of AODV routing protocol for WSN based smart metering deployment. Three case studies are presented to analyze its performance based on four metrics of (i) Packet Delivery Ratio, (ii) Average Energy Consumption of Nodes (iii) Average End-End Delay and (iv) Normalized Routing Load.

A Novel Source Based Min-Max Battery Cost Routing Protocol for Mobile Ad Hoc Networks

In the existing energy efficient routing protocols for mobile ad hoc networks such as minimum battery cost routing (MBCR) and min-max battery cost routing (MMBCR) the cost functions are calculated in the route request phase and the decision of selecting a route is taken by the destination node. It is more cost effective and energy efficient if the cost functions are calculated in the route reply phase and the decision of selecting a route for data transmission is taken by the source node. In this paper I propose a novel routing algorithm for mobile ad hoc networks called Source based min-max battery cost routing (SBMMBCR) protocol wherein the routing decision is taken by the source node considering the changes in energy levels during the route reply phase. The performance of the proposed protocol is compared with the existing MMBCR protocol based on application oriented metrics such as throughput, packet delivery ratio, end-to-end delay, normalized routing load and residual energy. Simulation is carried out using NS2. From the simulation results it is observed that the proposed protocol SBMMBCR outperforms MMBCR by giving more network lifetime as well as better throughput, packet delivery ration. Average end-to-end delay is less and the residual energy is also more for SBMMBCR as compared to MMBCR protocol.

Secure Data Transmission Model in MANET

MANET is mobile ad-hoc network. It is simply a collection of nodes where each node acts as independent router or host. Mobility is the main characteristics of MANET. Therefore routing protocol is required that adapts whenever topology changes. Secure data transmission is the main issue in MANET. The enhancement in the secure data transmission in MANET using both reactive and proactive routing protocols. Expecting the performance enhancement in Packet delivery ratio, Normalized routing load, End to end packet delay, Throughput, Energy Consumption, Residual Energy of secure data transmission in comparison with existing similar routing protocols for MANET. General Terms Routing Protocols, Security Algorithms. Keywordssecure data transmission, fast and secure data transmission.

Improved Ex-LEACH Protocol based on Energy Efficient Clustering Approach

Wireless sensor network is a wireless network consisting of autonomous sensors, communicating with each other in dispersed manner to observe the environment. Sensors are commonly fond of to microcontroller and are power-driven by battery. Routing methods are the main issue for networks where resources are restricted. Major challenge of this type of network is to overcome the short life span due to high energy utilization of the batteries in the sensor nodes. So we are providing a routing methodology that improves that network life span and efficiency of wireless sensor network by reducing energy consumption with the proposed cluster based power saving algorithm is called as Ex-LEACH (Extended LEACH).The key idea of this paper is to decrease information transmission distance of sensor nodes in wireless sensor networks by using the homogeneous cluster Method. We calculate the average distance between the sensor nodes and take into consideration the residual energy for selecting the suitable cluster head nodes. So that the energy consumption can be equally distributed between all the sensors node by taking into consideration mainly six factors: Packet delivery ratio, Normalized routing load, End to end packet delay, Throughput, Energy Consumption, Residual Energy. The performance is compared with other similar existing protocols such as LEACH and LEACH-C routing protocols