12-10-2016, 03:07 PM
Implementing and improving the performance of AODV by receive
reply method and securing it from Black hole attack
[attachment=72936]
Abstract
We attempt to analyze the MANET’s routing protocol and improve the security of viz. the Ad hoc On Demand Distance Vector
(AODV) routing protocol. We propose modifications to the AODV protocol used in MANET an algorithm to reduce the Black
hole attack on the routing protocols in MANETs. Wait time and Request Reply Tab table created to counter the Black hole attacks
and the AODV protocol
Introduction
Routing in ad hoc networks faces a number of problems like decentralized system, mobile nodes, low infrastructure,
more power required, medium and limited channel capacity, malicious nodes, causing a significant degradation of
routing performance. Based on information broadcasted by other nodes routing tables are updated. AODV is a source
initiated on-demand routing protocol1
. In AODV routing data is collected on request, and route is decided depending
upon queries in the network
AODV Routing Protocol
(AODV creates and uses two phases (1) Discovery of route and (2) Maintenance of route. Protocol uses Request
(RREQ)of route, Reply (RREP) of route, Discovery of route and Error of route (RERR) control message in
Maintenance of route .The beginning node initiates a connection to ending node, first it checks in the existing route
table, as to whether a fresh route to that destination is available or not .
2. Proposed Algorithm
The solution that we propose here is designed to prevent any alterations in the default operations of either the
intermediate nodes or that of the destination nodes. The approach we follow, basically only modifies the working of
the source node, using an additional function pre_ Request Receive Reply (Packet P).Apart from this, we also added
a new table _RREP _Tab, a timer M_WAIT_TIME that is the total RREP time or half of it and a variable Mali_ node
to the data structures in the default AODV protocol, as explained further. In the original AODV protocol, by default,
the source node accepts the first fresh enough RREP request coming to it. As compared, in our approach we store all
the RREPs in the newly created table viz. RREP _Tab until the time, M_WAIT_TIME. that is the total RREP time or
half of it. Based on the heuristics.
We initialize M_WAIT_TIME to be half the value of RREP_WAIT_TIME the time for which source node waits
solution, the source node after receiving first RREP control message waits for M_WAIT_TIME that is the total RREP
time or half of it. For this time, the RREP control messages before regenerating RREQ. In our solution, the source
node after receiving first RREP control message waits for M_WAIT_TIME that is the total RREP time or half of it.
For this time, the source node will save all the coming RREP control messages in RREP_ Tab table.
6. Conclusion
As compared to the other approaches, we believe the proposed algorithm is simple and efficient and has very less
delay and congestion in implementation . We successfully analyze that with trivial additional overhead in terms of a
new MOS _WAIT _TIME variable and a new C mg_ RREP_ Tab table, we are able to counter the Black hole
attacks on the AODV protocol
reply method and securing it from Black hole attack
[attachment=72936]
Abstract
We attempt to analyze the MANET’s routing protocol and improve the security of viz. the Ad hoc On Demand Distance Vector
(AODV) routing protocol. We propose modifications to the AODV protocol used in MANET an algorithm to reduce the Black
hole attack on the routing protocols in MANETs. Wait time and Request Reply Tab table created to counter the Black hole attacks
and the AODV protocol
Introduction
Routing in ad hoc networks faces a number of problems like decentralized system, mobile nodes, low infrastructure,
more power required, medium and limited channel capacity, malicious nodes, causing a significant degradation of
routing performance. Based on information broadcasted by other nodes routing tables are updated. AODV is a source
initiated on-demand routing protocol1
. In AODV routing data is collected on request, and route is decided depending
upon queries in the network
AODV Routing Protocol
(AODV creates and uses two phases (1) Discovery of route and (2) Maintenance of route. Protocol uses Request
(RREQ)of route, Reply (RREP) of route, Discovery of route and Error of route (RERR) control message in
Maintenance of route .The beginning node initiates a connection to ending node, first it checks in the existing route
table, as to whether a fresh route to that destination is available or not .
2. Proposed Algorithm
The solution that we propose here is designed to prevent any alterations in the default operations of either the
intermediate nodes or that of the destination nodes. The approach we follow, basically only modifies the working of
the source node, using an additional function pre_ Request Receive Reply (Packet P).Apart from this, we also added
a new table _RREP _Tab, a timer M_WAIT_TIME that is the total RREP time or half of it and a variable Mali_ node
to the data structures in the default AODV protocol, as explained further. In the original AODV protocol, by default,
the source node accepts the first fresh enough RREP request coming to it. As compared, in our approach we store all
the RREPs in the newly created table viz. RREP _Tab until the time, M_WAIT_TIME. that is the total RREP time or
half of it. Based on the heuristics.
We initialize M_WAIT_TIME to be half the value of RREP_WAIT_TIME the time for which source node waits
solution, the source node after receiving first RREP control message waits for M_WAIT_TIME that is the total RREP
time or half of it. For this time, the RREP control messages before regenerating RREQ. In our solution, the source
node after receiving first RREP control message waits for M_WAIT_TIME that is the total RREP time or half of it.
For this time, the source node will save all the coming RREP control messages in RREP_ Tab table.
6. Conclusion
As compared to the other approaches, we believe the proposed algorithm is simple and efficient and has very less
delay and congestion in implementation . We successfully analyze that with trivial additional overhead in terms of a
new MOS _WAIT _TIME variable and a new C mg_ RREP_ Tab table, we are able to counter the Black hole
attacks on the AODV protocol