2015 International Conference on Networking Systems and Security (NSysS) 2015
DOI: 10.1109/nsyss.2015.7043521
|View full text |Cite
|
Sign up to set email alerts
|

Pro-AODV (Proactive AODV): Simple modifications to AODV for proactively minimizing congestion in VANETs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 32 publications
(15 citation statements)
references
References 14 publications
0
14
0
Order By: Relevance
“…Then the algorithm can ensure the channel load will not exceed the target value. Some important proactive approaches include D-FPAV [27], linear message rate control algorithm (LIMERIC) [11], error model based adaptive rate control (EMBARC) [23], proactive ad hoc on-demand distance vector routing (Pro-AODV) [73], additive increase and mutliplicative decrease based decentralized congestion control (AIMD-Based DCC) [74], D-NUM [31] and RTPC [30].…”
Section: Reactive Vs Proactivementioning
confidence: 99%
“…Then the algorithm can ensure the channel load will not exceed the target value. Some important proactive approaches include D-FPAV [27], linear message rate control algorithm (LIMERIC) [11], error model based adaptive rate control (EMBARC) [23], proactive ad hoc on-demand distance vector routing (Pro-AODV) [73], additive increase and mutliplicative decrease based decentralized congestion control (AIMD-Based DCC) [74], D-NUM [31] and RTPC [30].…”
Section: Reactive Vs Proactivementioning
confidence: 99%
“…Again Intelligent-AODV (I -AODV) [20] to exploit neighbor discovery and reduce the overhead of neighbor discovery processes. Pro-AODV- [25]…”
Section: Related Workmentioning
confidence: 99%
“…BaniYassein et al [10] suggested a new adjusted dynamic probabilistic approach that improves the probability-based scheme through adapting a dynamic broadcast probability Р that depends on the neighbors number and is considered as an indicator of the density of the node. In order to get information about one-hop neighbor numbers, this approach propagated a periodic short "Hello" packets.…”
Section: Related Workmentioning
confidence: 99%