Routing Load Research Articles

Research on Query Gain Routing Algorithms and Load Balancing Mechanism in Wireless Sensor

It is necessary to reduce the consumption of network node energy and the network load for solving the query design for routing algorithm in wireless sensor network, thus this article presents query gain routing algorithms and load balancing mechanism. This algorithm selects routing node by querying the routing information of gain matrix according to the successful record of historical query. The load balancing mechanism queries the energy information, which records node in the routing process and transfers load to balance the energy consumption of each node in the query path. This algorithm is able to effectively aware routing load to reduce the network energy consumption and avoid the data collision. The experimental result shows that compared with other query routing strategy, the query gain routing can increase the success rate of query under the condition of reducing the node energy consumption, but the load balancing mechanism can reduce the energy consumption of query gain routing further and prolong the network life cycle more effectively.

The Impact of TCP Congestion Window Size on the Performance Evaluation of Mobile Ad Hoc (Manet) Routing Protocols

A mobile ad hoc network (MANET) is a temporary collection of mobile nodes randomly moved within a limited terrain area. The nodes are connected to form a wireless network without use any communication infrastructure. Because of the limiting resources of MANET nodes, multiple hopsscheme is proposed for data exchange across the network. Varieties of mobile ad hoc routing protocols have been developed to support the multi-hop scheme of ad hoc networks. A popular Transmission Control Protocol (TCP) provides a reliable connection in a computer network environment; it sets its congestion window size in response to the behavior of the network to achieve the best performance. This work aims to investigate and compare the MANET protocolperformance, such as DSDV, AODV and DSR in terms of network throughput, average routing load, the packet delivery ratio (PDR), and average end-to-end delay by varying the maximum congestion window size. Our simulation has been implemented using a well-known NS-2.35 network simulator. The simulated results show that the demonstrates of the concepts of MANET routing protocols with respect to TCP congestion window size in MANET environment.

Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks

Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.

Performance Analysis of AODV, CBRP, AOMDV, DSR MANET Routing Protocol using NS2 Simulation

Mobile ad hoc network is a self-directed structure of mobile nodes connected by wireless links. All nodes operate not only as an end system, but also as work as a router to forward the packets. Ad hoc wireless networks are characterized by multihop wireless connectivity, infrastructure less and habitually changing topology. It may be necessary for one mobile node to schedule other hosts for forwarding a packet from source to destination node due to the constrained transmission range of wireless network interfaces. Therefore a self-motivated routing protocol is required for these networks to work properly. A number of Routing protocols have been created to achieve this task. In this paper, a comparative analysis of four reactive routing protocols namely AODV, AOMDV, DSR and CBRP is done. Here CBRP is also a hierarchical routing protocol. This paper is aimed to analyze the adequacy of considered routing protocols in an energy constrained environment under varying mobility and pause time. These protocols have been analyzed extensively for various performance parameters (energy consumption, delay, throughput, Packet Delivery Ratio etc.) over different network scenarios. Simulation results show that none of the protocol surpasses other for all considered scenarios. However, CBRP has produced better results in terms of throughput, normalized routing load and delay while AOMDV is a better choice for energy related parameters. Simulation results of the paper are very helpful for the wise selection of the energy efficient base routing approach to scale MANETs.

SIMULATION AND PERFORMANCE ANALYSIS EVALUATION FOR MULTIPATH EXTENSION OF AODV TO IMPROVE END TO END DELAY, ROUTE ERROR SENT, ROUTING LOAD AND PACKET DROP RATIO

This paper describes improvement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism setups multiple optimal paths based on bandwidth and delay. It allows to store multiple optimal paths based on Bandwidth and delay. At time of link failure, it will switch to next available path. To set up multiple paths, we have used the information that we get in the RREQ packet and also send RREP packet to more than one path. It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is that it is simple, efficient. We evaluate through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (hot link split multi-path routing algorithm) Algorithm. Indeed, our scheme reduces routing load, End to End Delay, route error sent, and Packet drop ratio. The simulations have been performed using network simulator OPNET-14.0. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events such as sending, receiving, forwarding and dropping packets.

Traffic Pattern based Performance Comparison of Two Proactive MANET Routing Protocols using Manhattan Grid Mobility Model

ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Mobile Ad-hoc networks are self-organizing and self configuring multihop wireless networks where, the structure of the network changes dynamically. This is mainly due to the mobility of the nodes. In the current study we have compared the performance of three MANET routing protocols AODV as reactive, DSDV and OLSR as proactive by using Manhattan Grid mobility model. These share some similar behavior, but the protocols internal mechanism leads to significant performance difference. We have analyzed the performance of protocols by varying network load, mobility and type of traffic (CBR and TCP). Manhattan Grid Mobility model has been generated by IMPORTANT (Impact of Mobility Patterns on Routing in Ad-hoc NeTwork) tool. A detailed simulation has been carried out in NS2. The metrics used for performance analysis are Packet Delivery Fraction, Average end-toend Delay, Packet Loss, Routing Overhead, Normalized Routing Load and throughput. It has been observed that AODV (reactive) protocol performs better in CBR traffic and in case of real time delivery of packets but at cost of higher routing overhead. But in TCP traffic, proactive routing protocol OLSR gives better result. Overall performance of routing protocols in TCP traffic is much better than CBR traffic.

Varying Pause Time Effect on AODV, DSR and DSDV Performance

A mobile ad hoc network is a collection of wireless nodes without any fixed structure and connected with each other through wireless links. MANETs have self-organized topology in which mobile nodes are free to move, as a result establishing a stable and reliable network is a difficult and critical task. Nodes in Nobile Ad-hoc network acts as sender, receiver and router for communicating data and control packets. Using NS-2 simulator Performance of AODV, DSDV and DSR is analyzed under varying pause time in this paper. Performance of these routing protocols are analyzed on the base of following performance metrics: packet delivery ratio, average end to end delay, throughput, no of sent packets, no of receive packets, no of routing packets, normalized routing load and no of dropped packets under variant Pause time. Results of Comparison analysis of Routing Protocols are generated with the help of Simulation in the form of graphs. The simulation result shows the significance of each protocol in different situations. We believe that this study will provide comprehensive comparative study of AODV, DSR and DSDV based on varying pause time at one place, which will help the researcher to further investigate any particular metrics value of particular protocol.

A Novel Approach for Reliable Route Discovery in Mobile Ad-Hoc Network

AODV and DSR are normally taken as a standard in reactive routing protocols for Mobile Ad-Hoc Network (MANETs). Both of these protocols are widely used in different applications of MANET because of their simple design and better performance. AODV does not provide optimal results in the scenarios where we have heavy traffic with large number of connections and higher routing load. In this paper, we have introduced a novel idea of to determine reliable links between the intermediate nodes; based on this factor a reactive routing protocol is proposed, the simulation results of Reliability Factor Based Routing Protocol show that it outperforms AODV and SP-AODV in terms of better packet delivery fraction, routing load and end-to-end delay.

Countering Node Misbehavior Attacks using Trust Based Secure Routing Protocol

Wireless sensor networks have gained remarkable appreciation over the last few years. Despite significant advantages and tremendous applications, WSN is vulnerable to variety of attacks. Due to resource constraint nature of WSN, applicability of traditional security solutions is debatable. Although cryptography, authentication and confidentiality measures help in preventing specific types of attacks but they cannot safeguard against node misbehavior attacks and come at significant cost. To address this problem, we propose a Trust Based Secure Routing Protocol (TBSRP) which relies on distributed trust model for the detection and isolation of misbehaving nodes. The TBSRP aims to establish shortest path that contain all trusted nodes, identify packet forwarding misbehavior caused by malicious and faulty nodes and reroute the traffic to other reliable paths. The performance of TBSRP is evaluated in terms of packet delivery ratio, average end-to-end delay and normalized routing load. Simulations results show that TBSRP can achieve both high delivery ratio and throughput in presence of various numbers of misbehaving and faulty nodes.

Intelligent Inter-domain Connection Provisioning for Multi-domain Multi-vendor Optical Networks

We propose a semicentralized semidistributed network architecture based on active stateful path computation elements (PCEs) to intelligently provide end-to-end inter-domain connections in multi-domain optical transport networks supplied by different equipment vendors. A novel control entity, called an inter-domain communication control and management element (ICCME), is introduced into the architecture to achieve flexible distributed inter-domain control and centralized intra-domain management by integrating with “proactive” and “reactive” stateful capabilities. Inter-domain routing and signaling are completed with the collaboration of multiple ICCMEs in a peer-to-peer manner, which decentralizes highly intensive computation and signaling to multiple ICCMEs. In addition, we put forward a unified inter-domain communication protocol to eliminate the differences in private signaling message formats of various vendors’ domains. We report a successful field trial of providing inter-domain connections across a commercial three-domain three-vendor optical transport network. Also, experimental results indicate that ICCME-based architecture performs better than previous schemes in terms of scalability, i.e., low average routing load of control entities and low average delay in establishing inter-domain connections, but results in higher message overhead and blocking probability.

Path length prediction in MANET under AODV routing: Comparative analysis of ARIMA and MLP model

Mobile Ad-hoc network (MANET) is infra-structure less collection of mobile nodes which can communicate with each other through single hop or multi-hop technique. The hop count also known as path length plays a crucial role in packet delivery, routing load, delay, etc. The path length between source destination pair nodes depends upon factors such as the mobility patterns of nodes, routing algorithm, transmission range, etc. In this article, we have tried to predict the path length between a source destination pair in MANET using Autoregressive Integrated Moving Average (ARIMA) and multilayer perceptron (MLP) models. The path length data are collected from MANETs using three different mobility models namely (i) Manhattan Grid Mobility Model (MHG), (ii) Random Way Point mobility model (RWP) and (iii) Reference Point Group Mobility Model (RPGM). This paper evaluates the predictive accuracy in forecasting the path length between source and destination nodes for Ad hoc On-Demand Distance Vector AODV routing in MANET using ARIMA model and MLP. It is found that neural networks can be effectively used in forecasting path length between mobile nodes better than statistical model and the MLP based neural network models are found to be better forecaster than ARIMA model.

A Modified AODV Routing Protocol to Avoid Black Hole Attack in MANETs

ad hoc networks (MANETs) are composed of a set of stations (nodes) communicating through wireless channels, without any fixed backbone support in which nodes are allowed to join and leave the network at any point of time. MANETs are generally more vulnerable to information and physical security threats than wired networks, so security is an essential requirement in MANETs to provide secured communication between mobile nodes. One of the most common attacks against routing in MANETs is the Black Hole attack. A black hole is a malicious node uses the routing protocol to advertise itself as having the shortest path to the node whose packets it wants to intercept. In this paper, we attempt to focus on improving the security of one of the popular routing protocol for MANETS, namely the Ad hoc On Demand Distance Vector (AODV) routing protocol to avoid black hole attacks. The proposed Intrusion Avoidance System (IASAODV) can be considered as modification of the AODV protocol and can be used to detect and avoid the black hole attack. The conducted experimental results using Network Simulator NS-2.35 show an improvement in Packet Delivery Ratio (PDR), Normalized Routing Load (NRL) and throughput using the proposed protocol compared with AODV routing Protocol in the case of existing black hole attack.

Optimization of Value of Parameters in Ad-hoc on Demand Multipath Distance Vector Routing Using Teaching-Learning Based Optimization

Abstract The performance of Vehicular ad-hoc network (VANET) depends on many factors. One of the factors is routing protocol and the performance of routing protocol in given scenario depends on the value of parameters used in. The combinations of such values are very large. Therefore, we have used Teaching-Learning Based Optimization (TLBO) technique to find optimal value of parameters for Ad-hoc On Demand Multipath Distance Vector (AOMDV) in given real scenario. The Experimental results show drastic improvements in Average End-to-End delay (90.50% drop), Network Routing Load (41.68% drop) and Packet Delivery Ratio (0.39% rise) using value of parameters obtained through TLBO.

Parameter Value Optimization of Ad-hoc on Demand Multipath Distance Vector Routing Using Particle Swarm Optimization

The performance of routing protocol in Vehicular ad-hoc network (VANET) depends on value of parameters used in. Being very large combination of these values, it is difficult to find an optimal combination for better QoS in VANET. Therefore, we have proposed an algorithm based on Particle Swarm Optimization (PSO) to find an optimal combination in Ad-hoc on demand multipath distance vector routing (AOMDV) in real scenario. The experimental results show 80.65% drop in Average End-to-End delay (AE2ED), 37.07% drop in Network Routing Load (NRL) and slight drop (1.96%) in Packet Delivery Ratio (PDR) using optimal combination of value of parameters.

Comparative Analysis of AODV & AOMDV under Varying Number of Nodes &at Different Pause Time

An ad hoc wireless networkcan be described as a collection of nodes which have to interact among themselves without any centralized authority. In an ad hoc network node movement results in dynamic topology and link failure and thus routing become a challenging task. Many routing protocols have been proposed to overcome various challenges of routing in ad hoc networks. This paper presents performance comparison of mobile ad hoc network routing protocols; Ad hoc On demand Distance Vector (AODV) and Ad hoc On demand Multipath Distance Vector (AOMDV). Here investigation has been done on the effect of change in number of nodes and varying pause time on MANET routing protocols. The performance of AODV & AOMDV based on TCP based traffic pattern has been analyzed and compared. The NS2 simulator is used for performing various simulations. The performance analysis is based on different network metrics such as end to end delay, Packet Delivery Ratio (PDR), Throughput, Normalized Routing Load, Packet loss and Routing Overhead.

On the improved distance vector routing protocol for UDP traffic

The idea of Mobile Ad-Hoc Networks is to support communication where readily available infrastructure is missing. Nodes are expected to forward each other messages to the final destination within a decentralized environment. In mobile communication, finding the best routing path is always been a problem. DSDV protocol is well-known for its packet dropping problem in the event of link breakages. Whereas, IDSDV protocol as its popular enhancement, assigned to address this specific issue. But, this also gives rise to a question whether IDSDV does not degrade other performance parameters of DSDV. In this paper, we investigate the performance of IDSDV against DSDV specific for UDP traffics, for parameters such as average end-to-end delay, routing overhead and normalized routing load. Simulation result reaffirms that IDSDV has to some degree resolved the stale route problem within DSDV. Moreover, IDSDV outclasses DSDV in most aspects notably within highly density and dynamic environment.

Cooperative Optimization QoS Cloud Routing Protocol Based on Bacterial Opportunistic Foraging and Chemotaxis Perception for Mobile Internet

In order to strengthen the mobile Internet mobility management and cloud platform resources utilization, optimizing the cloud routing efficiency is established, based on opportunistic bacterial foraging bionics, and puts forward a chemotaxis perception of collaborative optimization QoS (Quality of Services) cloud routing mechanism. The cloud routing mechanism is based on bacterial opportunity to feed and bacterial motility and to establish the data transmission and forwarding of the bacterial population behavior characteristics. This mechanism is based on the characteristics of drug resistance of bacteria and the structure of the field, and through many iterations of the individual behavior and population behavior the bacteria can be spread to the food gathering area with a certain probability. Finally, QoS cloud routing path would be selected and optimized based on bacterial bionic optimization and hedge mapping relationship between mobile Internet node and bacterial population evolution iterations. Experimental results show that, compared with the standard dynamic routing schemes, the proposed scheme has shorter transmission delay, lower packet error ratio, QoS cloud routing loading, and QoS cloud route request overhead.

Issues of Implementing Random Walk and Gossip Based Resource Discovery Protocols in P2P MANETs & Suggestions for Improvement

Wireless multi-hop networks attracted much attention in recent years. Mobile Ad-hoc Network (MANET) being one of such networks has its own limitations in terms of resource discovery with unstable topology and paths through the networks. So eventually traditional searching techniques are still widely used. Peer-to-Peer (P2P) model is the major candidate for the internet traffic mainly due to its decentralized nature. This article evaluates classic flooding, random walk and gossip based resource discovery algorithms under mobile peer-to-peer (MP2P) networks and studied their performance. Further we suggest way to improve these algorithms to suit and work better under MANET. We compare the performance in terms of success rate, query response time, network overhead, battery power consumed, overall dropped packets, MAC load, network bandwidth, packet delivery ratio, network routing load and end to end delay. The experiments are validated through NS-2 simulations.

Implementation and Performance Evaluation of Three Routing Protocols for Mobile Ad Hoc Network Using Network Simulator

 Abstract—Mobile ad hoc network (MANET) is a self-configuring infrastructure less network of mobile nodes connected by wireless links - the union of which form a random topology. There are several IP routing protocols, with competing features, developed for wireless ad hoc networks. These protocols have varying qualities for different wireless routing aspects. It is due to this reason that choice of a correct routing protocol is critical. In this paper, two main questions are addressed. The first is 'Which routing protocol provides a better performance in mobile ad hoc Networks?' This question addresses the overall performance of each routing protocol investigated in this paper. The second question addresses the factors that influence the performance of these routing protocols. In this paper, Three protocols ad hoc on-Demand Distance Vector Routing (AODV) , Dynamic Source Routing (DSR), and Destination-Sequenced Distance Vector (DSDV) were compared in terms of Average End-to-End Delay, Average Throughput, Packet Delivery Ratio, Total Dropped Packets, and Normalized Routing Load in different environment; varying number of nodes and simulation Time. All simulation result implement at network simulator-2 (NS-2.35).

Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness oIXVHUV∂� SUHIHUHQFHV� regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.