Destination Sequenced – Distance Vector Algorithm 

Journal Title: International Journal on Computer Science and Engineering - Year 2015, Vol 7, Issue 11

Abstract

Mobile Ad Hoc Network (MANET) is an infrastructure where nodes communicate without any central administration. Nodes are connected through wireless channels and can use multiple hops to exchange data. Routing protocols are needed for communication in such networks. Each node acts both as a router and host concurrently, which can move out or join the network freely. The instantly created network does not have any base infrastructure as used in conventional networks, but it is compatible with conventional networks. This paper discusses about the Destination – Sequenced Distance Vector (DSDV) which is a modification of the conventional Bellman-Ford routing algorithm. It addresses the drawbacks related to the poor looping properties of Routing Information Protocol (RIP) in the face of broken links. The modification adapted in DSDV makes it more suitable routing protocol for MANETs. This paper iscusses about the DSDV protocol and analyses the properties of DSDV when it is used for MANET routing.

Authors and Affiliations

Anto Ramya. S. I

Keywords

Related Articles

Prediction and Analysis of students Behavior using BARC Algorithm

Educational Data mining is a recent trends where data mining methods are experimented for the improvement of student performance in academics. The work describes the mining of higher education students’ related attribute...

Mobile Wireless Enhanced Routing Protocol in Adhoc Networks

Adhoc network consists of peer-to-peer communicating nodes that are highly mobile. As such, an ad-hoc network lacks nfrastructure and the topology of the network changes ynamically. The task of routing data from a source...

Class hierarchy method to find Change-Proneness

Finding Proneness of software is necessary to identify fault rone and change prone classes at earlier stages of development, so that those classes can be given special ttention. Also to improves the quality and reliabili...

Comparison of Parsing Techniques For Formal Languages

A parser is one of the components in an interpreter or compiler, which checks for correct syntax and builds a data structure (often some kind of parse tree, abstract syntax tree or other hierarchical structure) implicit...

DCF Improvement for Satisfactory Throughput of 802.11 WLAN

As demand for deployment and usage is increased in WLAN environment, achieving satisfactory throughput is one of the challenging issues. Initially as WLAN environment is data centric, the best effort delivery based proto...

Download PDF file
  • EP ID EP90337
  • DOI -
  • Views 116
  • Downloads 0

How To Cite

Anto Ramya. S. I (2015). Destination Sequenced – Distance Vector Algorithm . International Journal on Computer Science and Engineering, 7(11), 129-136. https://europub.co.uk/articles/-A-90337