2016
DOI: 10.17148/ijarcce.2016.5114
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of DSDV

Abstract: Abstract:In ad hoc network where nodes both act as router and host, some protocols are implemented like DSDV (Destination Sequence Distance Vector). It is an extension of bellman-ford routing algorithms, which helps in communication between nodes in ad hoc networks. But the challenge lies with reliable communication between nodes. In this paper the DSDV performance analysis is done which also nullifies the looping problem faced by its previous version, that is, distance vector routing algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Utpal Barman et al explained that in DSDV routing protocol throughput is better with the increase of number of node again a delay is less. But it is not possible in case of node mobility [11].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Utpal Barman et al explained that in DSDV routing protocol throughput is better with the increase of number of node again a delay is less. But it is not possible in case of node mobility [11].…”
Section: Literature Reviewmentioning
confidence: 99%
“…On the off chance that blunder remedy offices are required at the system interface level, an application may utilize the Transmission Control Protocol (TCP) or Stream Control Transmission Protocol (SCTP) which are intended for this reason [11].…”
Section: Transmission Control Protocol (Tcp) and User Datagram Protocmentioning
confidence: 99%