Dynamic Source Routing Routing Protocol Research Articles

Energy consumption analysis of DSR reactive routing protocol on mobile ad-hoc network

Mobile ad-hoc network is a connection between mobile devices that uses wireless media. Mobile devices on the network hereinafter referred to a nodes. This network does not have an administrative center so each node on the network in addition to functioning as a sender and receiver of data information also functions as a router that will look for route information from the sender to the receiver. The topology of an ad-hoc network is always changing because the nodes move dynamically. The topology changes resulted in the repetition of route information searches. The process of finding route information requires a routing protocol. The routing protocol-enabled nodes must maintain the energy usage in the route-finding mechanism. Choosing the right routing protocol can be a solution to make energy use by nodes more efficient, especially in ad-hoc networks. In this study, a routing protocol in the reactive category is used, namely DSR (Dynamic Source Routing). This study aims to determine the performance of energy consumption, remaining energy, and PDR with scenarios of increasing node movement speed and network area. Based on the research results, it is known that the DSR routing protocol can handle changes in the speed of node movement and network area related to energy consumption and remaining energy. This is evidenced by the results of research showing that with faster node movements and wider areas, less energy is required. Meanwhile, regarding the success of packet delivery, the DSR routing protocol cannot handle changes in the speed of node movement and network area. This is evidenced by the results of the packet delivery ratio measurement which shows that with faster node movements and wider areas, many packets are not successfully received.

Virtual Local Area Network Performance Improvement Using Ad Hoc Routing Protocols in a Wireless Network

Wireless Communication has become one of the most popular types of communication networks because of the many services it provides; however, it has experienced several challenges in improving network performance. VLAN (Virtual Local Area Network) is a different approach which enables a network administrator to create a logical network from a physical network. By dividing a large network into smaller networks, VLAN technology improves network efficiency, management, and security. This study includes VLAN for wireless networks with mobile nodes integration. The network protection was improved by separating the connections and grouping them in a way that prevents any party from being able to contact unauthorized stations in another party using VLAN. VLAN demonstrated restricted access to private server data by managing traffic, improving security, and reducing levels of congestion. This paper investigates the virtual local area network in a wireless network with three ad hoc routing protocols in a number of different scenarios, using the Riverbed Modeler simulation, which was used as a simulation program in this study. It was found from the investigation process that adopting VLAN technology could reduce delay and data of the network and considerably lower throughput, which is a major drawback of VLAN. Ad hoc routing algorithms, including AODV (Ad Hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and OLSR (Optimized Link State Routing) routing protocols, were used to improve the delay and throughput of the network. Routing methods with VLAN were tested across the WLAN to obtain the best throughput gain performance. The findings also revealed that these ad hoc routing protocols improved the Wireless Sensor Network performance as an additional investigation for the improvement of any network’s delay and throughput.

Implementasi Algoritma Pemilihan Node Tetangga Terbaik Pada Protokol Routing DSR di Jaringan MANET

Mobile Ad Hoc Network (MANET) is a wireless telecommunications technology that consists of a collection of dynamic nodes. Due to these properties resulted in the mobility of nodes in MANET. So that every relationship between nodes will always change and cause the process of finding a vulnerable route to take a long time. Each node also has a role as a host or router in exchanging information. In MANET delivery assurance and the ability to deal with path changes on an ad hoc basis are critical. So that in sending data packets from the source node to the destination node, a Routing protocol is needed. The routing protocol Dynamic Source Routing (DSR) in the route search process broadcasts RREQ to all neighboring nodes (intermediate nodes) without knowing whether the node is the best node or not. So that the possibility of the route being interrupted because it is not composed of the best nodes can occur. A modification of the DSR routing protocol is proposed by finding the best intermediate node based on parameters, namely bandwidth, RTT, packet loss ratio. Then the neighboring nodes (intermediate nodes) that have been selected will arrange the delivery route from the source node to the destination node. The performance of the modified DSR and DSR routing protocols will then be measured using test parameters, namely throughput, packet delivery ratio (PDR) and average end to end delay. Based on the results of research trials, the application of the modified DSR method can improve the performance of the DSR protocol. Which after the application of the method, the average throughput increased by 25%, Packet Delivery Ratio (PDR) was 1.11% and the average end-to-end delay decreased by 17.64 %.

Analysing admission control for AODV and DSR routing protocol in mobile ad-hoc network

The widespread deployment of mobile ad-hoc network (MANET) in the areas of agriculture, military defence, weather forecasting and disaster control has necessitated the implementation of admission control within a network for a guaranteed quality of service (QoS). Admission control organises traffic flows to ensure the network medium is fairly shared among various nodes in the network. Various admission control algorithms have been proposed in the literature, using different metrics and parameters to achieve different admission control quality. In this work, we propose an Admission control in mobile ad-hoc network routing (ACMANR) using both bandwidth capacity and resource estimation to achieve a good QoS. Furthermore, we analyse the behaviour of two well-known routing protocols in wireless network, ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR), in our proposed admission control algorithm. Simulation results obtained from our proposed admission control algorithm using OPNET show that AODV routing protocol had a better throughput while DSR produced a better delay with lower overhead in MANET. Our proposed approach also shows better performance in terms of throughput and delay when compared with the state-of-the-art admission control routing using AODV and DSR.

Implementation of the Friis Free Space Propagation Model in the Dynamic Source Routing (DSR) Routing Protocol in the Vehicular Ad-hoc Network (VANET) with Variations of Road Models

The use of VANET technology is to create better traffic management. Different road conditions and high mobility of vehicles cause problems in VANET such as efficient search processes, network routes that need to be maintained, and data transmission problems. DSR (Dynamic Source Routing) predefines and generates routes on demand and is designed to work on multihop ad-hoc networks without centralized control. The Friis Free Space propagation model is used to model the Line of Sight (LOS) that occurs in a free space environment. The variation of road models in Indonesia is grouped into four groups, namely express roads, intercity roads, urban roads, and residential roads. In each of these road models, simulation testing is carried out based on different vehicle number scenarios. Network Simulator v3.27 (NS-3.27) and SUMO as a mobility generator were used for the simulation. The parameters of average throughput, packet delivery ratio and MAC/PHY overhead sequentially measure the DSR performance. The results on the express roads with Friis Free Space propagation produce values of 6.52 KBps, 7.71%, 39.59 KBytes. Test results on intercity roads 5.72 KBps, 11.17%, 5.48 KBytes. Test results on urban roads 16.50 KBps, 32.22%, 0.0016 KBytes. While the test results on residential roads were 12.66 KBps, 24.72%, 0.779 KBytes. The test results show that the road model in Indonesia with the performance of the DSR routing protocol with Friis Free Space propagation on the VANET network from the best to the worst, respectively, is the urban road model, residential road model, intercity road model, and express road model.

IMPACT OF BLACK HOLE ATTACK ON THE PERFORMANCE OF DYNAMIC SOURCE ROUTING AND OPTIMIZED LINK STATE ROUTING PROTOCOLS IN MANETS

Mobile Ad-Hoc Networks (MANETs) are a collection of mobile nodes which are free to move from one place to another place without a central control entity. In MANETs the nodes are dependent on each other and the communication among mobile nodes is multi-hop due to which there are security issues in the MANETs protocols. Optimized Link State Routing (OLSR) and Dynamic Source Routing (DSR) protocols are mostly used as proactive and reactive routing protocols in MANETs. This research work analyzed the performance of the OLSR and DSR protocols in the presence and absence of black hole (BH) attack in terms of throughput, end-to-end delay, packet delivery ratio (PDR), and network load in various scenarios using OPNET Modeler 14.5 simulator. The results obtained in this research show that BH attack significantly degrades the performance of both DSR and OLSR protocols but due to the reactive nature of DSR routing protocol the performance is more degraded in DSR routing protocol as compared to OLSR routing protocol in the presence of BH attack.

A Proposed Solution for Route Reply Storm Problem to Improve DSR Protocol Performance in Wireless Sensor Networks

Due to the limited transmission range of the wireless sensor network interface, a node may need multiple network hops to exchange data with another node over networks and other issues cause an overhead and bad utilization on the network. As a consequently, if some nodes reply route request at the same time to the same destination, then these simultaneous replies from different nodes will cause collision at the destination which it can cause a problem named route reply storm. The dynamic source routing (DSR) protocol is a reactive source routing protocol for mobile IP network where nodes should sense and discover with nearby nodes. Each node acts as a router for sending and receiving the packets to/from other node. In this work, we present a new proposal as a solution for storm route reply problem in DSR; the objective of the new proposed solution is to present a way to reduce unnecessary packet flooding between source and destination nodes in order to enhance DSR protocol. Afterthought, this work proposed some case studies to verify our proposed solution for solving the problem route reply storm, our verifications proves our robustness and correctness of the proposed solution against two main WSN problems that may face any wireless sensor network including coverage problem and link failure problem. The simulation results achieved here for two routing protocols DSR protocol and proposed improved DSR protocol for energy efficiency parameters. Simulation results showed that the energy consumption of proposed approach is minimized by 25 % approximately as compared to previous standard DSR protocol while the network lifetime performance is increased by approximately 35 % as compared to standard DSR protocol. In summary, the proposed solution of DSR protocol can be energy efficient for wireless sensor networks resource management.

Performance Analysis of DSR and TORA Model Routing Protocols In Vehicular Ad Hoc Network

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.

Load Based Key Generation for MANETs: A Comparative Study with DSR and AODV

Automatic key establishment schemes are the root of secure communication in Mobile adhoc networks(MANETs). These schemes are not universal, their performance depends on many factors like routing protocols, type of attackers aimed at, the parameter used for key generation, etc. Among the routing protocols used in MANETs the most popular ones are reactive routing protocols DSR and AODV. In this paper, an efficient secret key establishment technique using traffic matrix is simulated in the two reactive routing protocol scenarios: DSR (Dynamic Source Routing) and AODV (Ad hoc On-demand Distance Vector routing). The simulation results are compared and analyzed in terms of the key generation complexity, packet loss ratio and active attacker detection. Finally the paper concludes the fact that traffic load based key generation scheme is preferable for reactive routing protocol based systems.

RGIM: An Integrated Approach to Improve QoS in AODV, DSR and DSDV Routing Protocols for FANETS Using the Chain Mobility Model

Abstract Flying ad hoc networks (FANETs) are a collection of unmanned aerial vehicles that communicate without any predefined infrastructure. FANET, being one of the most researched topics nowadays, finds its scope in many complex applications like drones used for military applications, border surveillance systems and other systems like civil applications in traffic monitoring and disaster management. Quality of service (QoS) performance parameters for routing e.g. delay, packet delivery ratio, jitter and throughput in FANETs are quite difficult to improve. Mobility models play an important role in evaluating the performance of the routing protocols. In this paper, the integration of two selected mobility models, i.e. random waypoint and Gauss–Markov model, is implemented. As a result, the random Gauss integrated model is proposed for evaluating the performance of AODV (ad hoc on-demand distance vector), DSR (dynamic source routing) and DSDV (destination-Sequenced distance vector) routing protocols. The simulation is done with an NS2 simulator for various scenarios by varying the number of nodes and taking low- and high-node speeds of 50 and 500, respectively. The experimental results show that the proposed model improves the QoS performance parameters of AODV, DSR and DSDV protocol.

Pengaruh Penerapan Algoritma Clustering COEEC Terhadap Kinerja Protokol Routing DSR di Jaringan MANET

MANET can be used as an alternative communication solution because it is mobile, meaning that it does not have a fixed infrastructure. MANET implementation can use routing protocols, one example of which is Dynamic Source Routing (DSR). DSR routing protocol works when there is a request for sending packets from the source node to the destination node using two main mechanisms namely, route discovery and route maintenance. Route discovery occurs when the process of sending data from the source node to the destination node by performing a flooding mechanism to the neighboring node. If there is an excessive flooding mechanism, it can cause an increase in routing overhead on the DSR routing protocol. So to overcome these problems clustering is done by utilizing the Overhead Energy Efficient Cluster (COEEC) algorithm on the DSR routing protocol. The results of the addition of clusters in the DSR routing protocol with the COEEC algorithm can increase throughput performance by 43% and 31%, then an increase in the average end to end delay of 0.005% and 0.01%, then the packet delivery ratio parameter increases

Utilization of Energy Consumption Metric to Detect Black Hole Attacker in DSR Routing Protocol

A Mobile Adhoc Network (MANET) is a self-organized system comprised of multiple mobile wireless nodes. They do not require the existing network infrastructure. Autonomous telescopes can change freely and inadvertently in a network that can establish a dynamic network temporarily, and these networks can often change their appearance. Due to the openness in network topology and the absence of centralized administration in management, MANET is vulnerable to attacks from malicious nodes. Therefore, security is a major issue in MANET, which drastically reduces network performance. Several trust parameters such as packet delivery ratio, packet dropping ratio, etc are used for detecting the malicious node attack in MANET. Among these, this paper uses the energy as the trust parameter for detecting the malicious node. The energy reduction ratio differs from the normal node and attacker node in MANET. Hence, the main aim of this paper is to find the Normal Energy Reduction Ratio (NERR) and Attacker Energy Reduction Ratio (AERR). These two values are used for differentiating the normal node and attacker node in MANET. For routing, this paper uses the Dynamic Source Routing (DSR) Protocol.

ENERGY EFFICIENT DIRECTION BASED ROUTING PROTOCOL FOR WSN

Energy consumption is one of the limitations in Wireless Sensor Networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues viz. Energy consumption, network lifetime, network scalability and packet overhead. The key issue in WSN is that these networks suffer from the packet overhead, which is the core cause of more energy consumption and damage the QoS in sensor networks. In WSN, there are several routing protocols which are used to improve the performance of the network. Out of those protocols, Dynamic Source Routing (DSR) protocol is more appropriate in terms of small energy density, but sometimes when the mode of a node changes from active to sleep, the effectiveness decreases as the data packets needs to wait at the initial point where the packet has been sent and this increases the waiting time and end to end interruption of the packets which leads to increase in energy consumption. Our problem is to recognize the dead nodes and to choose another suitable path so that the data transmission becomes smoother and less energy gets preserved. In order to resolve these issues, we propose directional transmission-based energy aware routing protocol named as PDORP. The proposed protocol PDORP has the characteristics of both Power Efficient Gathering Sensor Information System (PEGASIS) and DSR routing protocols. In addition, hybridization of Genetic Algorithm (GA) and Bacterial Foraging Optimization (BFO) is applied to proposed routing protocol to identify energy efficient optimal paths. The performance analysis, comparison through a hybridization approach of the proposed routing protocol gives better result comprising less bit error rate, less delay, less energy ingesting and better throughput which leads to better QoS and prolong the lifetime of the network. Moreover, the Computation Model is adopted to evaluate and compare the performance of the both routing protocols using soft calculating techniques.

A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR) PROTOCOL IN MOBILE AD-HOC NETWORKS

Mobile Ad-hoc networks (MANETs) involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing) routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general. Keywords: MANET; DSR Protocol; Threshold, Broadcasting

AN EVALUATION OF IMPROVED CLUSTER-BASED ROUTING PROTOCOL IN ADHOC WIRELESS NETWORK

In this paper we presents a performance comparison of Dynamic Source Routing (DSR), Ad hoc On Demand Vector (AODV), Cluster Based Routing Protocol (CBRP) and Improved Cluster Based Routing Protocol (i-CBRP) routing protocols which builds upon a cluster based wireless network infrastructure. This evaluation is necessary due to unique enhancement made to traditional CBRP by way of implementing congestion control scheme as part of the structure establishing i-CBRP. First, we introduce the network infrastructure on which the routing protocols are to send packets. We simulates Mobile Ad-Hoc Network (MANET) network infrastructure using NS2 network simulator. DSR, AODV, CBRP and i-CBRP routing protocols are implemented to generate various simulation results. The results shows that i-CBRP performs better in terms of average packet delay, throughput, volume of traffic controls and average packet delivery ratio when compared with CBRP, while DSR performs better in terms of total volume of control traffic. AODV is the overall best in terms of average packet delay. Key words: Node Density, Evaluation, MANET, Cluster, Routing

The Effect of Node Speed on Mobile Ad Hoc Network Performance

Announcement between mobile nodes is a challenging network especially via Mobile Ad hoc Network (MANET), where mobile nodes are capable of moving on a continual basis, which is changeable and challenging to analyse the performance of its routing protocols and application. In this paper, we evaluate the performance of routing protocols over MANET for Ad Hoc on demand Distance Vector (AODV), Destination-Sequenced Distance Vector (DSDV), as well as Dynamic Source Routing (DSR). We use Network Simulator NS-allinone-2.31 tool for the practical testing and evaluation. We have tested the routing protocols AODV, DSDV, and DSR. So, different performance features are investigated including , Packet loss, Packet Delivery Fraction (PDF), End-to-End Delay. The results indicate that performance of routing protocols where the number of nodes start from 5 to 100 nodes during the entire scenario for node speeds equivalents to 10m/s, besides the delivery of packet size equivalents to 512kb.

Overhead Reduction and Performance Enhancement of AODV and DSR Routing Protocols

Mobile Ad hoc Network is an infrastructure less multi hop wireless network. In this network a node communicates directly with other mobile nodes within the network range. Transmission power of the nodes plays an important role here. The objective of this work is to study the behavior and performance of the three frequently used MANET routing protocols with respect to different transmission power of individual nodes of the network, these are Dynamic source routing (DSR), ad hoc on demand distance vector (AODV with HELLO message) and AODV (without HELLO message). Analysis shows the positive and negative impact of increase in transmission power of individual nodes on the performance of these routing protocols. The outcomes of the study are more significant and can be used in the design of new power aware routing protocols. General Terms Transmission power, network range

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

Energy Efficient Direction-Based PDORP Routing Protocol for WSN

Energy consumption is one of the constraints in wireless sensor networks (WSNs). The routing protocols are the hot areas to address quality-of-service (QoS) related issues, viz., energy consumption, network lifetime, network scalability, and packet overhead. The key issue in WSN is that these networks suffer from the packet overhead, which is the root cause of more energy consumption and degrade the QoS in sensor networks. In WSN, there are several routing protocols, which are used to enhance the performance of the network. Out of those protocols, dynamic source routing (DSR) protocol is more suitable in terms of small energy density, but sometimes when the mode of a node changes from active to sleep, the efficiency decreases as the data packets need to wait at the initial point, where the packet has been sent and this increases the waiting time and end-to-end delay of the packets, which leads to increase in energy consumption. Our problem is to identify the dead nodes and to choose another suitable path so that the data transmission becomes smoother and less energy gets conserved. In order to resolve these issues, we propose directional transmission-based energy aware routing protocol named PDORP. The proposed protocol PDORP has the characteristics of both power efficient gathering sensor information system and DSR routing protocols. In addition, hybridization of genetic algorithm and bacterial foraging optimization is applied to proposed routing protocol to identify energy efficient optimal paths. The performance analysis, comparison through a hybridization approach of the proposed routing protocol, gives better result comprising less bit error rate, less delay, less energy consumption, and better throughput, which leads to better QoS and prolong the lifetime of the network. Moreover, the computation model is adopted to evaluate and compare the performance of the both routing protocols using soft computing techniques.

Performance Analysis of Routing Protocols for CBR Traffic in Mobile Ad-Hoc Networks

This paper presents the comparative performance analysis of Ad-Hoc routing protocols: Destination-sequenced distance vector (DSDV), Dynamic source routing (DSR) and Ad hoc on-demand distance vector (AODV) based on constant bit rate (CBR) traffic patterns. Simulation results show that firstly, the UDP throughput for DSR routing protocol is largest among the others. Secondly, the routing overload of DSDV and AODV is higher than DSR. Finally, DSDV shows the lowest end-to-end delay for UDP transmission than AODV and DSR.