DISTANCE BASED DUALPATH AD HOC ON DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILW AD HOC NETWORKS

1. DISTANCE BASED DUAL PATH
ADHOC ON DEMAND DISTANCE
VECTOR ROUTING PROTOCOL
FOR
MOBILE ADHOC NETWORKS
NITHIN
S7 cs
1

2. CONTENTS
•INTRODUCTION
•MOBILE ADHOC NETWORK
•ON DEMAND ROUTING PROTOCOL
•AODV ROUTING PROTOCOL
•DBDP_AODV
•SIMULATION RESULTS AND DISCUSSION
•FUTURE SCOPE
•CONCLUSION
•REFERENCE
2

3. INTRODUCTION
•MOBILE ADHOC NETWORKS (MANET)IS A COLLECTION OF MOBILE NODES
THAT FORM TEMPORARY NETWORK WITHOUT ANY PREDEFINED
INFRASTRUCTURE
•TYPICAL APPLICATION OF MOBILE AD HOC INCLUDE EMERGENCY RESCUE
OPERATION,MILITARY OPERATION,DISASTER RELIEF
•ROUTING IS CHALLENGING TASK IN MANET DUE TO ITS HYBRID TOPOLOGY
•MANY ROUTING PROTOCOL ARE PROPOSED FOR MANET
1.TABLE DRIVEN:- DSDV AND OLSR
2.ON DEMAND OR REACTIVE:-AODV AND DSR
3.HYBRID PROTOCOL:-TORA AND ZRP
3

4. MOBILE ADHOC NETWORK(MANET)
4

5. MANET
•CHARACTERISTICS
COMMUNICATION USING WIRELESS NETWORK
NODES ARE THE HOSTS AND ROUTERS
NO CENTRALIZED CONTROLLER
INFRASTRUCTURELESS
DYNAMIC TOPOLOGY
AUTONOMOUS
5

6. REACTIVE ROUTING PROTOCOL
•REACTIVE ROUTING PROTOCOLS ALSO CALLED ON DEMAND ROUTING
PROTOCOL
•ROUTING IN DYNAMIC TOPOLOGY IS A CHALLENGING TASK
•DISCOVER A PATH WHEN A PACKET NEED TO BE TRANSMITTED AND NO
KNOWN PATH EXISTS
•ATTEMPTING TO ALTER THE PATH WHEN A ROUTING FAILURE OCCURE
•REACTIVE PROTOCOL FIND THE ROUTE BY FLOODING THE ROUTE REQUEST
PACKETS
•EG:AODV,DSR,DYMO
6

7. AODV ROUTING PROTOCOL
•ON DEMAND ROUTING PROTOCOL FOR MOBILE ADHOC NETWORKS
•PHASES
1.ROUTE DISCOVERY
2.ROUTE MAINTANANCE
•THREE TYPES OF ROUTING PACKETS
RREQ(ROUTE REQUEST)
RREP(ROUTE REPLY)
RERR(ROUTE ERROR)
7

8. AODV ROUTING PROTOCOL contd
•ROUTE DISCOVERY PHASE
 SOURCE NODE BROADCAST RREQ PACKET TO THE NEIGHBOURING
NODE
 INTERMEDIATE NODE PROCESS THE FIRST RECEIVED RREQ PACKET BY
RECORDING THE REVERSE ROUTE TO THE SOURCE AND REBROADCAST RREQ
DUPLICATE RREQ PACKETS DISCARDED BY THE INTERMEDIATE NODES
DESTINATION NODE RECIEVES FIRST RREQ PACKET THEN UNICAST RREP
PACKET TO SOURCE ALONG THE REVERSE ROUTE AND NEVER RESPOND TO
THE DUPLICATE RREQ PACKETS
8

9. AODV ROUTING PROTOCOL contd
•ROUTE MAINTANANCE PHASE
LINK FAILURE IS DETECTED BY A NODE IT BROADCAST RERR PACKETS TO
NEIGHBOURS
A NODE THAT RECEIVES RERR PACKETS WILL REMOVES THE ROUTE FROM
ROUTING TABLE
IF THE SOURCE NODE RECEIVES THE RERR PACKETS IT INITIATES THE NEW
ROUTE DISCOVERY PHASE
9

10. Fig. 1. Example of Mobile Ad hoc Network
10

11. DBDP_AODV
•DISTANCE BASED DUAL PATH ADHOC ON DEMAND DISTANCE VECTOR
ROUTING PROTOCOL
•A. ROUTE REQUEST PHASE
DESTINATION NODE RECEIVES THE FIRST RREQ PACKET FROM THE SOURCE
NODE AND THE ROUTE IS RECORDED IN THE ROUTING TABLE
THE DESTINATION NODE ALSO PROCESS THE FIRST RECEIVED DUPLICATE
RREQ RECORDS THE SECOND PATH IN THE ROUTING TABLE
11

12. Fig. 2. Implementation of RREQ phase 12

13. DBDP_AODV contd
•ROUTE REPLY PHASE
THE DESTINATION NODE RECEIVESS THE RREQ PACKET IT RESPONDS WITH
RREP ALONG THE REVERSE PATH
RREP PACKET THE DESTINATION NODE WILL ADDED THREE NEW FEILDS
XCORDINATE(X1),YCORDINATE (Y1) WITH ITS OWN POSITION AND
DISTANCE=0
RREP PACKET IS RECEIVED AT THE INTERMEDIATE NODE LOCATED(X2,Y2)
CALCULATE THE DISTANCE BETWEEN DESTINATION NODE AND INTERMEDIATE
NODE

13

14. DBDP_AODV contd
dactual = d + dnew
INTERMEDIATE NODE UPDATES ITS OWN POSITION AND ACTUAL DISTANCE
AND FORWARD THE PACKETS TO THE NEXT NODE
THE SOURCE NODE RECEIVES THE FIRST RREP PACKET IT ADDS THE
FORWARD ROUTE IN ITS ROUTING TABLE
THE NEW ENTRY IS rt_distance AND IT INDICATES THE LENGTH OF THE
PATH
THE SOURCE NODE RECEIVES THE SECOND RREP PACKETS,IT UPDATE THE
ROUTING TABLE WITH THE LENGTH OF THE SECOND PATH
SOURCE NODE SELECT THE OPTIMAL PATH AND TRANSMIT DATA PACKET
14

15. 15

16. DBDP_AODV contd
•OPTIMAL ROUTE SELECTION PHASE
SHORTEST DISTANCE PATH IS SELECTED AS THE OPTIMAL PATH
IT WILL NOT CONSIDER HOPCOUNT OF THE PATH
DISTANCE IS THE ONLY METRIC CONSIDERED TO SELECT THE
SHORTEST OPTIMAL ROUTE FOR THESE PROPOSED TECHNIQUE
16

17. 17

18. DBDP_AODV contd
•ROUTE MAINTANANCE PHASE
SOURCE NODE HAS TWO PATHS FOR THE DESTINATION NODE IN THE
ROUTING TABLE
OPTIMAL PATH WITH SHORTEST DISTANCE IS THE PRIMARY PATH USED FOR
DATA TRANSFER
IF THERE IS ANY LINK FAILURE IN THE OPTIMAL PATH IT AUTOMATICALLY
SELECTS THE SECONDARY PATH FOR TRANSMITTING DATA
THERE IS NO NEED FOR INITIATE A ROUTE DISCOVERY PHASE WHEN A LINK
FAILURE DETECTED
18

19. SIMULATION RESULTS AND
DISCUSSION
•FOR ANALYZING THE PERFORMANCE OF DBDP_AODV NS2 SIMULATION
TOOL IS USED
•PERFORMANCE IS ANALYZED BY COMPARING WITH AODV
•THE FOLLOWING PERFORMANCE MATRICS ARE EVALUTED USING
SIMULATION
PACKET DELEVERY RATIO:-
THE NUMBER OF DATA PACKETS SUCCESFULLY DELIVERED TO THE
DESTINATION TO THE NUMBER OF DATA PACKETS GENERATED BY THE
SOURCE
AVERAGE END TO END DELAY:-
TOTAL TIME BETWEEN THE PACKET GENERATION BY THE SOURCE
AND PACKET RECEPTION BY THE DESTINATION
ROUTING OVERHEAD:-
TOTAL NUMBER OF CONTROL PACKETS TRANSMITTED TO THE TOTAL NO
DATA PACKETS
19

20. SIMULATION RESULTS AND
DISCUSSION contd.
20

21. SIMULATION RESULTS AND
DISCUSSION contd.
•PACKET DELIVERY RATIO OF AODV AND DBDP_AODV
21

22. SIMULATION RESULTS AND
DISCUSSION contd.
•END TO END DELAY OF AODV AND DBDP_AODV
22

23. SIMULATION RESULTS AND
DISCUSSION contd
•COMPARISON OF ROUTING OVERHEAD OF AODV AND DBDP_AODV
23

24. FUTURE SCOPE
•THIS PRORPOSED PROTOCOL CAN BE EXTENDED BY CONSIDERING THE
OTHER METRICS LIKE TRUST,RESIDUAL ENERGY,BANDWIDTH,SIGNAL TO
NOISE RATIO IN SELECTING THE OPTIMAL PATH AMONG MULTIPLE ROUTES
•AFTER DISCOVERING MULTIPLE ROUTES LOAD CAN BE SHARED BETWEEN
THE SELECTED ROUTES BY EFFICIENT RESOURCE UTILIZATION
•TRANSMITTING DATA PACKETS IN MULTIPLE PATH PROVIDE SECURITY BY
DIFFICULTI OF IDENTIFYING ACTUAL DATA
24

25. CONCLUSION
•THIS NOVEL MULTIPATH ROUTING PROTOCOL IS BASED ON AODV
•IT USES DISTANCE AS THE SELECTION METRIC FOR CHOOSING OPTIMAL
PATH AMONG THE MULTIPLE PATH
•THE DBDP AODV PROTOCOL IS SUPERIOR TO AODV PROTOCOL
•OPTIMAL ROUTE SELECTION IN DBDP_AODV RESULTS IN HIGH PACKET
DELIVERY RATIO,LESS END TO END DELAY AND LOW ROUTING OVERHEAD
25

26. REFERENCES
•[1]P.E Irin Dorathy,M Chandrasekaran ,”Distance based dual path adhoc on demand
distance vector routing protocol for mobile ad hoc networks”,IEEE Conference
Publication on Advanced Computing and communication Systems, jan 2017 pp.1-6
•[2] Hongmei Deng, Wei Li, and Dharma P. Agrawal, University of Cincinnati,“Routing
Security in Wireless Ad Hoc Networks”, IEEE Communications Magazine, October 2002,
pp.70-75.
•[3] C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-
Vector Routing (DSDV) for Mobile Computers,” ACM SIGCOMM ’94, 1994.
•[4] P. Jacquet, P. Muhlethaler, and A. Qayyum, “Optimized Link State Routing Protocol,”
RFC 3626, Oct. 2003.
•[5] C. E. Perkins and E. M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc.
2nd IEEE Wksp. Mobile Computer Systems and Applications, 1999, pp. 90–100.
26