Destination Sequenced Distance Vector Protocol Research Articles

Brief Study of Performance of Routing Protocols for Mobile Ad Hoc Networking in Ns-2

Ad hoc networking allows portable devices to establish communication independent of a centralinfrastructure. However, the fact that there is no central Infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this thesis the problem of routing is considered. This paper addresses issues pertaining to two different routing protocols Destination Sequenced Distance vector (DSDV) and Dynamic Source Routing (DSR) protocols, which are used for efficient routing under different scenarios in Mobile Ad-hoc Network (MANET), which plays a critical role in places where wired network are neither available nor economical to deploy. Objective of this paper to show the implementation of two routing protocols using Network Simulators and run it for different number of nodes. Then compared the two routing protocols for different network parameters and studied the efficient protocol under a particular scenario on the basis of two metrics. (1) Packet delivery ratio (2) Routing load DSDV is a Proactive gateway discovery algorithm where the gateway periodically broadcasts a gateway advertisement message which is transmitted after expiration of the gateways timer. DSR is a Reactive gateway discovery algorithm where a mobile device of MANET connects by gateway only when it is needed.

An Improved DSDV Routing Protocol for Wireless Ad Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a kind of wireless ad-hoc network and is a self configuring network of mobile routers connected by wireless links. The wireless links form the union of an arbitrary topology. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines routing protocol for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV) and On –Demand protocol that evaluates both protocols based on the packet delivery fraction and average delay while varying number of sources and pause time. In this paper we consider the new approach an Improved-DSDV Protocol is proposed for Ad Hoc networks. Improved -DSDV overcomes the problem of stale routes, and thereby improves the performance of regular DSDV. The proposed protocol has been implemented in the NS-2 Simulator and performance comparison has been made with regular DSDV and improved DSDV protocols. We compare the performance of our work with DSDV. In our improved DSDV routing protocol, nodes can cooperate together to obtain an objective opinion about another node's trustworthiness. The performance metrics considered are packet-delivery ratio.

Evaluating and Modeling Proactive Routing Protocols with Route Stabilities using 802.11 DCF and 802.11e EDCF

This paper contributes modeling links and route stabilities in three diverse wireless routing protocols. For this purpose, we select three extensively utilized proactive protocols; Destination-Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Fish-eye State Routing (FSR). We also enhance the performance of these protocols by modifying their default parameters. All experiments for evaluating and comparing the performance of protocols are performed in NS-2. Optimization of these routing protocols is done via performance metrics; average Throughput, End to End Delay (E2ED) and Normalized Routing Load (NRL) achieved by them. Default routing protocols DSDV, OLSR and FSR and compared and evaluated with modified versions named as M-DSDV, M-OLSR and M-FSR. Numerical Computations for Route Stabilities of these routing protocols through a mathematical modeled equation is determined and then compared with the results obtained through Simulations in NS-2. Moreover, all-inclusive evaluation and scrutiny of these proactive routing protocols are done under the Mac layer standards 802.11 DCF and 802.11e EDCF. In this way both Network and Mac layer exploration has been done under the performance metrics which gives overall performance and tradeoff with respect to full utilization of the available resources of Ad-hoc network high scalability scenario. Routing latency effects with respect to route stabilities and Mac layer standards 802.11 and 802.11e are compared and scrutinized with the tradeoff observed in throughput and in overhead (NRL) generated.

PERFORMANCE ANALYSIS OF AODV, DSDV AND DSR IN MANETS

Mobile Ad hoc Networks (MANETs) are considered as a new paradigm of infrastructure-less mobile wireless communication systems. MANETs are being widely studied and it is the technology that is attracting a large variety of applications. Routing in MANETs is considered a challenging task due to the unpredictable changes in the network topology, resulting from the random and frequent movement of the nodes and due to the absence of any centralized control [1][2]. In this paper, we evaluate the performance of reactive routing protocols, Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) and proactive routing protocol Destination Sequenced Distance Vector (DSDV). The major goal of this study is to analyze the performance of well known MANETs routing protocol in high mobility case under low, medium and high density scenario. Unlike military applications, most of the other applications of MANETs require moderate to high mobility. Hence it becomes important to study the impact of high mobility on the performance of these routing protocols. The performance is analyzed with respect to Average End-to-End Delay, Normalized Routing Load (NRL), Packet Delivery Fraction (PDF) and Throughput. Simulation results verify that AODV gives better performance as compared to DSR and DSDV.

PERFORMANCE EVALUATION OF DSDV IN HYBRID WIRELESS MESH NETWORK

Wireless Mesh Network (WMN) is a new wireless technology and it has the features of large area network coverage, Internet broadband access, self-healing, self-configuring and self-organizing. Routing is an important research issue in WMN. Many routing protocols are available in WMN. These protocols are divided into two categories proactive (Table Driven) and reactive (On-demand) protocols. This paper discusses the performance of proactive routing protocol Destination Sequenced Distance Vector (DSDV) in WMN by considering the various performance metrics (packet delivery ratio, routing overhead and dropped packets) by varying transmission rate and mesh client speed.

A Driven Backup Routing Table to Find Alternative Disjoint Path in Ad Hoc Wireless

The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-to- end delays will increase thereby reducing throughput and degrading the performance of the network. This paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve the existing proactive protocols such as DSDV (Destination Sequenced Distance Vector) protocol by creating a backup routing table to provide multiple alternative routes. The DBRT algorithm identifies adjacent nodes for each node in the same range and then selects one of these as a backup next hop according to the available path to the destination. The results show that loss of data packets, throughput and end-to-end delay times between source and destination are improved. The results show that the new protocol does not degrade the network’s performance despite sending extra messages to construct and update the new backup routing table. Simulations (using an NS2 simulator) are undertaken to demonstrate the difference between using a DSDV protocol with or without the proposed schema.

QoS Parameter Analysis on AODV and DSDV Protocols in a Wireless Network

Wireless networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. To improve the packet delivery ratio of Destination-Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used. Two protocols AODV and DSDV simulated using NS-2 package and were compared in terms throughput, end to end delay and packet faction delivery varying number of nodes, speed and time. Simulation results show that DSDV compared with AODV, DSDV routing protocol consumes more bandwidth, because of the frequent broadcasting of routing updates. While the AODV is better than DSDV as it doesn’t maintain any routing tables at nodes which results in less overhead and more bandwidth. AODV perform better under high mobility simulations than DSDV. High mobility results in frequent link failures and the overhead involved in updating all the nodes with the new routing information as in DSDV is much more than that involved AODV, where the routes are created as and when required. AODV use on -demand route discovery, but with different routing mechanics. AODV uses routing tables, one route per destination, and destination sequence numbers,

Heightening Security for Data Transmission Through Dynamic Routing

 Abstract—Security has become one of the major issues for data communication over wired and wireless networks. The dynamic routing algorithm is used to randomize delivery paths for data transmission which is compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. This paper proposes the dynamic routing algorithm with cryptography-based system design for more security in data transmission.

Multi-Fractal Characteristics of Mobile Node’s Traffic in Wireless Mesh Network with AODV and DSDV Routing Protocols

The analysis of traffic characteristics can be used for performance evaluation, design and implementation of routing protocols in WMNs (Wireless Mesh Networks). Higher bursty traffic will cause larger queue size, which means more dropping packets, and thus affects other metrics. Because burstiness can be modeled by multi-fractal characteristics effectively, multi-fractal characteristics of mobile node's traffic in WMNs are analyzed with typical proactive and reactive routing protocols, which are DSDV (Destination Sequenced Distance Vector) and AODV (Ad hoc On-demand Distance Vector), respectively. Three types of traffic models are used to generate traffic at application level, which corresponding to open-loop and closed-loop scenarios. With different configurations, the probability distribution of inter-arrival time and multi-fractal characteristics of traffic at mobile node and gateway are analyzed with DSDV and AODV protocols. Results show that inter-arrival time with AODV and DSDV protocols possesses heavy-tailed property. And traffic with DSDV protocol exhibits more multi-fractal characteristics than that with AODV protocol, which can explain the higher routing performance of AODV.

Dynamic Routing with Security Considerations

Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we aim at the proposing of a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as routing information protocol in wired networks and destination-sequenced distance vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜

ABSTRACT In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.Key Words:Wireless mesh network, Multi-path routing, Residual bandwidth

Compatibility of TCP Reno and TCP Vegas in wireless ad hoc networks

Previous work has shown that TCP (transmission control protocol) Vegas outperforms the more widely deployed TCP Reno in both wired and wireless networks. It was also shown that when both TCP variants coexist on the same wired links, Reno dominates because of its more aggressive behaviour. This paper examines for the first time the compatibility between Reno and Vegas in wireless IEEE 802.11 ad hoc networks. It is shown that Vegas generally dominates in the heterogeneous Reno/Vegas network scenario; a startling result that is inconsistent with what is seen in wired networks. It is shown that the wireless ad hoc network environment does not reward the aggressive behaviour of Reno. On the other hand, Vegas, with its more accurate yet more conservative mechanisms, is able to capture most of the bandwidth. This is found to be true when using the on-demand routing protocols of dynamic source routing (DSR) or ad hoc on-demand distance vector (AODV): the failure of a node to reach a next-hop node because of media access control (MAC)-sublayer repeated collisions is reported to the routing protocol, which then declares a route error that impacts Reno in a more serious way than Vegas. When the table-driven routing protocol destination-sequenced distance vector (DSDV) is used, Reno and Vegas share the network bandwidth in a fairer manner. Generally, fairness in this environment can be improved by reducing the TCP maximum window size.

Performance Evaluation of Routing Algorithms for Mobility Models in Ad hoc Network

Mobile Ad hoc Networks (MANET) have been the focus of many recent research and development efforts because of the necessity of decentralized network configuration. An ad hoc network is characterized by multi-hop wireless connectivity and frequently changing network topology. To facilitate communication in this dynamically changing network topology, several routing protocols are proposed such as Dynamic Source Routing protocol, Ad hoc On-demand Distance Vector protocol and Destination Sequenced Distance Vector protocol. Most of research works are carried out by assuming random mobility models for speed and direction of the mobile. Such models can generate an unrealistic behavior such as sudden stopping and turning. Later, researchers used Uniform mobility models for both speed and position of the node. In this work, we define an exponential distribution model for speed and Gaussian distribution model for nodes position with its intuitively appealing natural formulation rather than earlier assumptions. We have applied our model to different routings protocols and have evaluated network performance under different mobility patterns. It is observed that when the mobile's position follows Gaussian distribution and its speed follows an exponential distribution, the performances of the routing protocol are better compared to uniform distribution.

Congestion control performance of R-DSDV protocol in multihop wireless ad hoc networks

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.