2011 IEEE Conference on Open Systems 2011
DOI: 10.1109/icos.2011.6079254
|View full text |Cite
|
Sign up to set email alerts
|

Securing routing table update in AODV routing protocol

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…In [16] proposes a solution to employ minimum modification to existing AODV algorithm. Three new elements introduced to improve the existing AODV in recvReply() function namely are; a) the rrep_table to store incoming RREP packet, b) mali_list to keep the detected black hole nodes identity and c) the rt_upd, parameter to control the routing table update.…”
Section: Enhanced Route Discover Aodv (Erda)mentioning
confidence: 99%
“…In [16] proposes a solution to employ minimum modification to existing AODV algorithm. Three new elements introduced to improve the existing AODV in recvReply() function namely are; a) the rrep_table to store incoming RREP packet, b) mali_list to keep the detected black hole nodes identity and c) the rt_upd, parameter to control the routing table update.…”
Section: Enhanced Route Discover Aodv (Erda)mentioning
confidence: 99%
“…Each node in AODV needs to maintain their own routing [41]. Figure 2.5 shows the route discovery process, where S is the source node and D is the destination node, the red lines denote the reverse routes to the source.…”
Section: Aodv Routing Protocol Introductionmentioning
confidence: 99%