2011
DOI: 10.3844/jcssp.2011.678.682
|View full text |Cite
|
Sign up to set email alerts
|

Varying Overhead Ad Hoc on Demand Vector Routing in Highly Mobile Ad Hoc Network

Abstract: Problem statement: An inherent feature of mobile ad hoc networks is the frequent change of network topology leading to stability and reliability problems of the network. Highly dynamic and dense network have to maintain acceptable level of service to data packets and limit the network control overheads. This capability is closely related as how quickly the network protocol control overhead is managed as a function of increased link changes. Dynamically limiting the routing control overheads based on the networ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…In Jiang, (2004), calculates L (T P ) by considering all possible changes in velocities occurring during period T P . The method was proposed by (Balaji and Duraisamy, 2011), identifies how the network topology changes based on a node and its next one hop nodes. Computation of power of each node within one hop distance of the destination node is computed periodically and used to identify whether nodes are converging or diverging.…”
Section: Related Workmentioning
confidence: 99%
“…In Jiang, (2004), calculates L (T P ) by considering all possible changes in velocities occurring during period T P . The method was proposed by (Balaji and Duraisamy, 2011), identifies how the network topology changes based on a node and its next one hop nodes. Computation of power of each node within one hop distance of the destination node is computed periodically and used to identify whether nodes are converging or diverging.…”
Section: Related Workmentioning
confidence: 99%