Demand Distance Vector Routing Research Articles

Energy Aware Power Save Mode based AODV Routing for IEEE 802.11s Wireless Mesh Networks

Owing to the self organizing, self configuring and self healing capabilities, Wireless Mesh Nwetworks (WMN) have emerged as most powerful architectures in recent times. Wireless Mesh Networks operate with limited battery resources. In 802.11s, a mobile station(STA) can act as router as well as client that results in increased energy consumption during routing process. The degradation of energy at STA can result in low network performance due to relay STA failure. In order to increase network performance there is a need to reduce the energy consumption rate of STA. To save energy, 802.11s has introduced a mechanism called power save mode(PSM) which switches STA mode from active to light sleep or deep sleep mode when STA is not involved in transmission. This ensures saving of energy at each STA during routing process. Several models have been proposed by researchers to improve the energy saving mechanisms in 802.11s. Adhoc On Demand Distance Vector (AODV) routing algorithm is used for routing purpose in WMN. In this routing protocol, regular usage of the same node during routing may lead to battery failure and result in low network lifetime. Hence in this work we propose a novel Energy Aware Power Save Mode-AODV (EAPSM-AODV) routing model that switches among power save modes based on battery status of a node before participating in AODV routing. Our proposed routing model refers to the mechanism that takes available remaining energy and energy draining rate of a node into account to decide on relaying traffic. It consist of four units namely Routing, Path choosing, Mode selector and Energy units. Experiments have been conducted using NS3 simulator by considering various situations such as keeping nodes in static position and moving nodes dynamically in a simulation area. The results shows that our proposed model significantly improves network performance and increase in network lifetime.

Comparison and Analysis Study between AODV and DSR Routing Protocols in VANET with IEEE 802.11

Mobile Ad-Hoc networks (MANET) have become related to several aspects in human life while normal users uses the wireless mobile systems without prior knowledge about how such systems works. In order to support the mobility in MANETs, the routing protocols are needed to handle the data transmission between the wireless nodes from a source to destination. Ad-Hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) is a popular routing protocols used in MANET. Vehicular Ad-Hoc Networks (VANET) is a special type of MANET which is used to support the high mobility between moving cars on the roads. In this paper the AODV and DSR are applied on a VANET over two different scenarios, dense and sparse traffic based on cars density on the road, and then both protocols are evaluated based on different performance metrics

An Efficient Tree-Based Self-Organizing Protocol for Internet of Things

Tree networks are widely applied in sensor networks of Internet of Things (IoTs). This paper proposes an efficient tree-based self-organizing protocol (ETSP) for sensor networks of IoTs. In ETSP, all nodes are divided into two kinds: network nodes and non-network nodes. Network nodes can broadcast packets to their neighboring nodes. Non-network nodes collect the broadcasted packets and determine whether to join the network. During the self-organizing process, we use different metrics, such as number of child nodes, hop, communication distance, and residual energy to reach available sink nodes’ weight; the node with max weight will be selected as a sink node. Non-network nodes can be turned into network nodes when they join the network successfully. Then, a tree-based network can be obtained one layer by one layer. The topology is adjusted dynamically to balance energy consumption and prolong network lifetime. We conduct experiments with NS2 to evaluate ETSP. Simulation results show that our proposed protocol can construct a reliable tree-based network quickly. With the network scale increasing, the self-organization time, average hop, and packet loss ratio will not increase more. Furthermore, the success rate of packet in ETSP is much higher compared with $ad~hoc$ on demand distance vector routing and destination sequenced distance vector routing.

A Novel Approach for Detection of Single and Collaborative Black Hole Attacks in MANET

Ad hoc On Demand Distance Vector Routing is an extensively accepted routing protocol for Mobile Ad hoc Network. The inadequacy of security considerations in the design of AODV makes it vulnerable to black hole attack in which, malicious nodes attract data packets and drop them instead of forwarding. Among the existing black hole detection schemes, just a few strategies detect both single and collaborative attacks and that too with much routing, storage and computational overhead. In this paper, we propose a novel strategy to detect single and collaborative black hole attacks, with reduced routing and computational overhead. The proposed D-MBH algorithm detects single and multiple black hole nodes using an additional route request with nonexistent target address, computes a threshold ADSN, creates a black hole list and invokes the proposed D-CBH algorithm. Using ADSN, black hole list and next hop information extracted from RREP, the D-CBH algorithm creates a list of collaborative black hole nodes.

Improvement In MAODV Protocol Using Location Based Routing Protocol

Energy saving is difficult in wireless sensor network (WSN) due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR) aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV) to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

Mobility and Direction Aware Ad-hoc on Demand Distance Vector Routing Protocol

Mobile Ad hoc Network (MANET) is a rapidly growing wireless technology with wide range of applications. MANET routing faces challenges due to their Ad hoc nature, and many routing algorithms have been proposed. Reactive routing protocols are preferred due to less control overhead and scalability, but they suffer from frequent link breakages due to the high-mobility of the nodes. To reduce the link breakages and get a stable route, a new reactive routing protocol is proposed that is tree-based mobility-aware. The proposed Mobility and Direction Aware Ad-hoc On Demand Distance Vector routing protocol (MDA-AODV) aims to handle the mobility and direction factors in ad-hoc networks. MDA-AODV guides the route discovery and route reply depending on the speed of the participating nodes and their directions. Qualnet simulator version 7.1, using two offered load simulations (packet-rate and CBR connections), was used to investigate the effect and the advantages of MDA-AODV over AODV protocol. The simulation results show that the proposed scheme decreases control overhead by (4.6 ÷ 5.2%). It also accomplishes (37 ÷ 41%) lower route losses compared to AODV. The delivery ratio is increased by (29 ÷ 47%). The consumed energy and end-to-end delay of the proposed protocol is also compared to that of AODV.

Effect of Transmission Range on Ad Hoc on Demand Distance Vector Routing Protocol

The necessary background as well as the details of simulation was presented to simulate and evaluate the performance of the ad hoc on-demand distance vector routing protocol in mobile ad hoc network with the help of the network simulator NS2 using the common transmission range to deliver the data packets at the destination node. The number of participating nodes played an important role to predict the conditions for the best performance of the protocol with respect to throughput, delay, packet delivery ratio, drop packets, consumed and residual energy of the network. Further, the efforts can be put to control the transmission range dynamically and overheads for reducing the energy consumption in the network and improving its lifetime of the nodes and the lifespan of the network.

An ANN Approach in Ensuring CIA Triangle using an Energy based Secured Protocol E-AODV for Enhancing the Performance in MANETS

Evaluating a routing protocol in MANETS is a difficult task due to mobility of nodes and decentralized administration. In Adhoc On demand Distance Vector routing (AODV) protocol the routes are found only on need and the connection setup delay is less. An authenticated secure data communication protocol E-AODV (Energy based AODV) is proposed in this work which ensures the security of Confidentiality, Integrity and Availability triangle. Confidentiality is provided by calculating Intermediate Trust Value (ITV) for all nodes between source and destination and only the nodes which possess highest ITV is used for data transmission. Integrity is attained by an encryption algorithm called digital signature algorithm which is used at the time of data transmission from source to destination node. Availability have been provided by calculating the residual energy of each node so that nodes which possess highest energy are used for data transmission. Simulation results using NS2 also prove that the performance level of throughput, Energy consumption and packet delivery ratio in E-AODV increases with that of AODV routing protocol. The results obtained are trained using Back propagation algorithm and the effectiveness of the proposed system is checked by ANN approach.

A Comprehensive Study on Mobility Issues in AODV

Ad-hoc network plays an important role in wireless networks as they are self-configured and can be operated independently with limited resources. The critical issue is to assess the performance of routing protocols in Mobile Ad hoc Network (MANET) due to the frequent changes in network topology. Here the Ad-hoc On demand Distance Vector (AODV) routing protocol, which is quite susceptible to node mobility is taken into consideration, as it determine the end to end route discovery in dynamic manner; the identified problem is it leads to extra time and energy consuming. Driven by this issue, it is necessary to examine the scalability of AODV protocol by varying the number of Wi-Fi nodes’ and its mobility degree. Performance of AODV is addressed in this study; by calculating aggregated throughput, Packet Loss Ratio (PLR) and end to end delay. Also, extensive simulations are carried out to exactly capture its Quality of Service (QoS) parameters in sparse and dense network scenarios.

Routing Efficiency Evaluation in Wireless Sensor Networks

Today wireless sensor networks (WSNs) have gained grate popularity and are widely used in variety of areas due to their unique features. WSNs are deployed in an ad-hoc manner and consist of a large number of tiny sensor nodes. The sensor nodes communicate with each other through the routes established by the routing algorithms. Routing is considered as a challenging task in WSNs because it can highly affect the overall performance of these networks. This paper focuses on performance evaluation of two popular routing algorithms: Ad-Hoc on Demand Distance Vector (AODV) and Dynamic Source Routing (DSR). Simulations are performed using NS2 to evaluate and compare the efficiency of these routing algorithms under different network conditions.

Extended shortcut tree routing for ZigBee based wireless sensor network

Energy efficiency and network lifetime are main concerns in WSN. In order to improve these factors ZigBee plays an important role. Low cost, low data rate features of ZigBee results in low power consumption and makes it useful in wireless sensor networks, increasing life of small batteries of nodes in the network. Since tree routing in ZigBee does not require any routing tables to send the packet to the destination, it can be used in ZigBee end devices that have limited resources. Routing protocols such as AODV (Ad-hoc on demand distance vector routing), ZTR (ZigBee tree routing), and STR (Shortcut tree routing) are compared on the basis of different performance metrics (End to end delay, routing overload, throughput, packet delivery ratio). An extensive simulation in NS2 is carried out. The performance evaluation shows that STR achieves better performance as compared to other two routing protocols. But there are some limitations of the STR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Hence ESTR is proposed. The main aim of proposed ESTR [Extended STR] is to present new ZigBee network routing protocol with goal of improving the performance of ESTR in terms of PDR and delay against STR and AODV.

An Energy Aware Congestion Controlled Cross Layered Approach in MANETS

In the proposed Energy Aware Congestion Controlled Cross Layered protocol, a cross layered approach is handled using adhoc on demand distance vector routing protocol for attaining a congestion controlled network. At the Medium Access Control layer, the nodes which possess signal to noise interference ratio requirements are only selected in the network and Shannon's capacity is found for those selected nodes. Hence at the Medium Access Control layer, only energy constrained nodes are selected. These selected nodes are moved to transport layer using the proposed cross layered approach. At the transport layer, if any congestion is found it can be detected using congestion threshold rate which is calculated using packet loss rate. Based on the congestion threshold rate, a congestion fewer routes can be found out that improves the throughput. Simulation results using NS2 shows improvement in the packet delivery ratio.

Performance Study of AODV and DSDV Routing Protocols for Mobile Ad Hoc Networks Based on Network Simulator NS2

Facebook Mobile Ad hoc Networks (MANET’s) is a self-configuring infrastructure less network of mobile devices connected by wireless . MANETs are a kind of Wireless ad hoc network that usually has a routable networking environment on top of a Link Layer . Route discovery and packet forwarding operations need an efficient routing protocol. Ad-Hoc on Demand Distance Vector Routing Protocol (AODV) and Destination Sequenced Distance Vector Routing protocol (DSDV) are counted as widely used routing protocols in MANET. In this paper we compare and evaluate the functionality of AODV and DSDV routing protocols. Simulation is based on NS2.34 network Simulator on Linux Fedora and the parameters are packet delivery ratio (PDR), Throughput and end-to-end delay. Simulation results show that AODV protocol is always superior as compared to DSDV protocol when using different number of nodes and scenario.

Power Management and Reducing Routing Overhead and Delay in Wireless Sensor Network with Modified Ad-hoc on demand Distance Vector Routing Protocol using Threshold Power

management is necessary in Wireless Sensor Network because the nodes are very small in size having a small battery and that too of limited life. The routing algorithms for WSN should satisfy the features of energy consumption optimization and extension of network lifetime. We choose to modify AODV (Ad hoc On Demand Distance Vector) routing protocol, analyze this algorithm named as modified AODV- TP (Threshold Power) and is highlighted in detail. The theme is that only those nodes are chosen as neighbors of nodes during RREQ (Route Request) phase that are directed towards destination. Also, threshold is set for all the nodes. If the power of the node is less than threshold, it will not acknowledge the Route Reply (RREP) packet. The alternate route with second lowest minimum distance will be selected to forward the packet. The behavioral analysis of the modified protocol is compared to AODV-TP and from the simulation this protocol turns out to be better in terms of power conservation. Keywordssensor network; power management; nodes; AODV

Detection of Black Hole Attack in Mobile Ad-hoc Networks using Ant Colony Optimization – simulation Analysis

Background: Security in Mobile Ad hoc Networks (MANETs) is an essential component for basic network function. Black hole attack may cause packet dropping, misrouting the information from source to destination. Methods: Biology-inspired techniques like as Ant Colony Optimization (ACO) is used to modify the Ad-hoc On Demand Distance Vector (AODV) routing protocol. The ant place of at each node calculates its pheromone value by using the forwarding ratio at node. This modified protocol is compared with existing protocol by using various parameters i.e. packet delivery ratio, end-to-end delay and throughput. Results: The results shows to increase in packet delivery ratio, throughput and decrease in end-to end delay show better performance of proposed work as compared existing. Keywords: ACO, Black Hole Attack, Challenges, MANETs, Security

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

A mobile ad-hoc network (MANETs) is a wireless network of mobile nodes without any fixed base-station or any centralized administration. When a node sends a data packet to more than one node at a time, it is called multicasting, multicast often used to utilize the network resources like channel bandwidth and node energy to improve the network efficiency. Multicast in MANETs have several challenges due to frequent changes in the network such as node mobility, reliability, limited resources, etc. The MANETs is widely used in several fields like emergency searches, rescues operation, and military battlefields where sharing of information is mandatory. These operations often require a rapid deployable and quick reconfigurable routing protocols. Since mobile nodes in wireless ad-hoc network have limited resources so an efficient multicast routing protocol is needed to reduce the wastage of resources. This paper proposes a traffic load balanced multicast routing protocol (LBMRP) in order to reduce the network overhead and increases the network life. In this scheme all mobile nodes are randomly classified into multi group (three groups) and create a tree for each group in order to achieve efficient data transmission. Simulation results shows that the proposed LBMRP scheme outperforms with some existing multicast routing protocols as multicast ad-hoc on-demand distance vector routing protocol, reliability of the multicast ad-hoc on demand distance vector and Parallel multiple nearly-disjoint trees multicast routing schemes.

Impact of Packet Size and Mobility on Heterogeneous Wireless Network

Most of the real life networks are heterogeneous which always combine the best features of two or more networks. An integration of available wireless networks viz: Cellular and Wireless Local Area Network on expandable and flexible platform is called as radio resource management for heterogeneous networks. Along with resource utilization, end to end delay and throughput are also important parameters for analysis of heterogeneous networks. The existing research work has focused on the effect of packet size and mobility management independently on heterogeneous networks. This paper presents algorithms developed using Ad-hoc on Demand Distance Vector routing protocol to analyze the combined effect of packet size along with mobility management for heterogeneous networks. The developed algorithm considers common radio resource management scheme using packet size of 256, 512, 1024 bit. The two mobility pattern pause 5 and pause 60 are created with log movement to nodes. The heterogeneous network created with 21 nodes along with MAC protocol 802.11b and data rate of 11 Mbps. The simulation is done for 50 s. The simulation results show that End-to-End Delay, Throughput and Bandwidth Utilization of the heterogeneous networks are improved by packet size and mobility management as a combined task. Secondly, the developed priority based vertical handoff technique shows improvement in Bandwidth utilization, Packet Delivery Ratio (PDR) and Energy Consumption for heterogeneous networks. The Network Simulator is used to demonstrate the functionality and evaluate the performance of the algorithms developed.

An Optimized Node Selection Routing Protocol for Vehicular Ad-hoc Networks – A Hybrid Model

Vehicular Ad-hoc networks (VANETs) are a subset of Mobile Ad-hoc Networks made by vehicles communicating among themselves on roadways. The Routing protocols implemented for MANETs such as Ad-hoc on Demand Distance Vector Routing Protocol (AODV), Dynamic Source Routing (DSR), and Destination Sequence Distance Vector Routing Protocol (DSDV) are not suitable for VANET due to high Mobility. Trusted routing in VANET is a challenging task due to highly dynamic network topology and openness of wireless architecture. To avoid a frequent communication link failure, to reduce the communication overhead and to provide a trusted routing among the vehicular nodes for achieving high packet transmission, we implemented an Optimized Node Selection Routing protocol (ONSRP) of VANET based on Trust. In our proposed work, we implemented an enhanced routing protocol which prevents the network from communication link failure frequently. The testing results stated that the ONSRP routing have a high performance measures than the above mentioned existing routing protocols.

Comparative Analysis of VANET Routing Protocols: On Road Side Unit Placement Strategies

Vehicular ad hoc network (VANET) is a communication paradigm where vehicles can communicate directly with other vehicles or via intermediate fixed architectures called as road side units (RSU). Generally, the density of vehicles vary from very dense to shallow depending on various factors and different scenarios of the roads. In cities the number of cars is high and on highways and specifically in rural areas the density of vehicles varies. Therefore, direct vehicle to vehicle communication faces many problems in communication due to outages. In such scenarios the intermediate infrastructure needs to play an important role. Various routing protocols are implemented for VANETs with variety of design goals. In this paper we investigate the performance of proactive and reactive routing protocols, namely destination sequence distance vector (DSDV) and ad-hoc on demand distance vector (AODV) routing protocol, for various placement strategies of RSU based relays and in city scenario. The simulations were carried on NS2 which suggest that in various settings AODV perform better than DSDV routing protocol.

Optimized Inter-Landmark Routing by Dtn-Flow Algorithm

2 Abstract: This Paper focus on the well-organized routing of data in the middle of dissimilar areas in delay tolerant networks (DTN).In the current algorithm selects widely held places that nodes visit repeatedly as landmarks and splits the complete DTN area into subareas signified by landmarks. The number of node transfers between two landmarks is computed to represent the forwarding capability between them, relyupon which routing tables are created on each and every landmark to route the packet routing. However, there is more number of landmarks for a single path, throughput depends upon the traffic, the only static path is available, and no mobility nodes can be used. To overcome this problem, we suggest an Ad-hoc On Demand Distance Vector (AODV) routing technique in DTN flow algorithm to enhance node to node communication and for effective throughput is proposed. This technique can be used on all mobility nodes and efficient throughput can be obtained by the utilization of all nodes. The number of landmarks and the total cost is limited. Overall performance will be multiplied by increasing the N range of dynamic methods.