1 / 58

P-AODV: Extension of AODV for Partially Connected Ad hoc Networks

13 July 2006. proxy-AODV. 2. . Road-Map. IntroductionProblem Definition P-AODV Simulation SetupResultsConclusion. 13 July 2006. proxy-AODV. 3. Introduction. Ad hoc NetworksWhy Ad hoc Networks Infrastructure is Costly Difficult to Setup Rapid Network DeploymentApplication AreaMilitaryEme

rane
Download Presentation

P-AODV: Extension of AODV for Partially Connected Ad hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. 13 July 2006 proxy-AODV 1 P-AODV: Extension of AODV for Partially Connected Ad hoc Networks Anshuman Tiwari Under Guidance of Prof. Sridhar Iyer

    2. 13 July 2006 proxy-AODV 2 Road-Map Introduction Problem Definition P-AODV Simulation Setup Results Conclusion

    3. 13 July 2006 proxy-AODV 3 Introduction Ad hoc Networks Why Ad hoc Networks Infrastructure is Costly Difficult to Setup Rapid Network Deployment Application Area Military Emergency Operations Routing Protocol : Ad hoc On Demand Distance Vector (AODV)

    4. 13 July 2006 proxy-AODV 4 Demonstration Demo For Working of AODV.

    5. 13 July 2006 proxy-AODV 5 Partially Connected Ad hoc Networks Communication over sparse and partially connected, ad hoc network.

    6. 13 July 2006 proxy-AODV 6 Related Work Epidemic Routing [vah00] Purely depend on Mobility. Assumption and Disadvantages Source and destination never have connectivity. No constraints on resources. Heavy Duplication of packets. Message Ferrying Approach [zha04] Ferry nodes have a fixed route. Assumption and Disadvantages Difficult to fix the default route of ferry nodes. Ferry node is the singe point of failure of the whole design.

    7. 13 July 2006 proxy-AODV 7 Motivation Existing routing schemes not useful. Basic schemes assume Connected Network. Proposed schemes for communication over partially connected networks are inappropriate because of the assumptions made by them.

    8. 13 July 2006 proxy-AODV 8 Road-Map Introduction Problem Definition P-AODV Simulation Setup Results Conclusion

    9. 13 July 2006 proxy-AODV 9 Problem Definition Design a routing protocol to facilitate communication over sparse and partially connected ad hoc networks. Properties: For connected network : Standard Operation For disconnected network: Delivery of data with high probability. Control on duplication of packets.

    10. 13 July 2006 proxy-AODV 10 Road-Map Introduction Problem Definition P-AODV Simulation Setup Results Conclusion

    11. 13 July 2006 proxy-AODV 11 Proxy-AODV Proxy Node takes data from source on behalf of a destination. Node delivers data to destination on behalf of original source of data.

    12. 13 July 2006 proxy-AODV 12 Example of P-AODV P-AODV [ Proxy- AODV ]

    13. 13 July 2006 proxy-AODV 13 Example of P-AODV (contd..) P-AODV [ Proxy- AODV ]

    14. 13 July 2006 proxy-AODV 14 Example of P-AODV (contd..) P-AODV [ Proxy- AODV ]

    15. 13 July 2006 proxy-AODV 15 Example of P-AODV (contd..) P-AODV [ Proxy- AODV ] Proxy or Source moves near to Destination. Proxy or Source move to a new locality.

    16. 13 July 2006 proxy-AODV 16 Example of P-AODV (contd..) Case 1 : Proxy source or Source move to Destination connected component.

    17. 13 July 2006 proxy-AODV 17 Example of P-AODV (contd..) Case 1 : Proxy source or Source move to Destination connected component.

    18. 13 July 2006 proxy-AODV 18 Example of P-AODV (contd..) Case 1 : Proxy source or Source move to Destination connected component.

    19. 13 July 2006 proxy-AODV 19 Example of P-AODV (contd..) Case 1 : Proxy source or Source move to Destination connected component.

    20. 13 July 2006 proxy-AODV 20 Example of P-AODV (contd..) Case 2 : Proxy source or Source move to New connected component.

    21. 13 July 2006 proxy-AODV 21 Example of P-AODV (contd..) Case 2 : Proxy source or Source move to New connected component.

    22. 13 July 2006 proxy-AODV 22 Example of P-AODV (contd..) Case 2 : Proxy source or Source move to New connected component.

    23. 13 July 2006 proxy-AODV 23 Example of P-AODV (contd..) Case 2 : Proxy source or Source move to New connected component.

    24. 13 July 2006 proxy-AODV 24 Flowchart

    25. 13 July 2006 proxy-AODV 25 Flowchart (Contd..)

    26. 13 July 2006 proxy-AODV 26 Proxy Selection in p-AODV Eligibility for Proxy Routing Table entries. ( No. of Entries in the table ) Degree of Mobility. ( No. of neighbors per time unit ) Distance from the source. (No. of Hops from source) Boundary node of connected partition. Is node has already some stored message for this destination. Proxy selection by Source Parameters Restriction on choosing number of proxies. Time remaining to deliver the message. Distance of Proxy Node.

    27. 13 July 2006 proxy-AODV 27 Demonstration Proxy carries data for destination.

    28. 13 July 2006 proxy-AODV 28 Road-Map Introduction Problem Definition P-AODV Simulation Setup Results Conclusion

    29. 13 July 2006 proxy-AODV 29 Simulation Setup

    30. 13 July 2006 proxy-AODV 30 Road-Map Introduction Problem Definition P-AODV Simulation Setup Results Conclusion

    31. 13 July 2006 proxy-AODV 31 Results Percentage of Message Delivered

    32. 13 July 2006 proxy-AODV 32 Results (contd..) Percentage of Duplicate overhead

    33. 13 July 2006 proxy-AODV 33 Results (contd..) Average Delay for a Packet to reach destination.

    34. 13 July 2006 proxy-AODV 34 Results (contd..) Comparison with flooding approach : Message Delivery Percentage.

    35. 13 July 2006 proxy-AODV 35 Results (contd..) Comparison with flooding approach : Percentage of Duplicate Overhead

    36. 13 July 2006 proxy-AODV 36 Road-Map Introduction Problem Definition Why New Protocol (Motivation) P-AODV Simulation Setup Results Conclusion

    37. 13 July 2006 proxy-AODV 37 Conclusion proxy-AODV protocol for communication in partially connected ad hoc network has been proposed. proxy-AODV works !! Performance of proxy-AODV : Comparable to flooding approach in terms of message delivered. Significant improvement in controlling duplication.

    38. 13 July 2006 proxy-AODV 38 References [per99] C. Perkins and E. Royer. Ad-hoc on-demand distance vector routing. pages 90-100, 1999. [vah00] A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks, 2000. [zha04] Zhao W., Ammar M., and Zegura E. A message ferrying approach for data delivery in sparse ad hoc networks. In Proceedings of 5th international symposium on mobile ad hoc networking and computing, 2004. [sam04] Samba S, Zongkai Y, Biao Qi, Jianhua He. Simulation Comparison of Four Wireless Ad hoc Routing Protocols. Information Technology Journal 3 (3): 219-226, 2004.

    39. 13 July 2006 proxy-AODV 39 Thanks !!

    40. 13 July 2006 proxy-AODV 40 Acknowledgement My sincere thanks to

    41. 13 July 2006 proxy-AODV 41 Backup Slides

    42. 13 July 2006 proxy-AODV 42 Issues of p-AODV (Contd.) When a proxy initiate PRREQ Periodically. Detect a new location Using Variation on routing table entries.

    43. 13 July 2006 proxy-AODV 43 Epidemic Routing Algorithm At time T1 source S wants to send data to Destination D.

    44. 13 July 2006 proxy-AODV 44 Epidemic Routing Algorithm At time T2, node M start Moving.

    45. 13 July 2006 proxy-AODV 45 Epidemic Routing Algorithm At time T3 node M will reach region B.

    46. 13 July 2006 proxy-AODV 46 Epidemic Routing Algorithm Node M can now send the message to node D.

    47. 13 July 2006 proxy-AODV 47 Node Initiated Message Ferrying At Time T1

    48. 13 July 2006 proxy-AODV 48 Node Initiated Message Ferrying At Time T2

    49. 13 July 2006 proxy-AODV 49 Node Initiated Message Ferrying At Time T3

    50. 13 July 2006 proxy-AODV 50 Node Initiated Message Ferrying At Time T4

    51. 13 July 2006 proxy-AODV 51 Variation From AODV operations Processing and Forwarding (Proxy) Route Requests. Check if node is eligible to become a proxy. On Receiving Proxy Route Replies. Wait for Reply from Destination before responding to Proxy. Receiving Data Packets. Check if I am the proxy for this data, if yes then store else forward if I am allow to.

    52. 13 July 2006 proxy-AODV 52 Additional Data Structure and Timers Data Structure For Storing Route Request (RREQ) or Proxy RREQ. For Storing Proxy Route Reply (PRREP). Storing Messages. Timers To Check New locality Periodically. To Clear the Message List Periodically.

    53. 13 July 2006 proxy-AODV 53 Configurable Parameters For Proxy eligibility Routing Table Size. Proxy Number. For Data Structures List Count, to define limit on length.

    54. 13 July 2006 proxy-AODV 54 Why AODV ?

    55. 13 July 2006 proxy-AODV 55 AODV Working of AODV

    56. 13 July 2006 proxy-AODV 56 AODV Working of AODV

    57. 13 July 2006 proxy-AODV 57 AODV over Partially Connected Network RREQ do not reach Region B.

    58. 13 July 2006 proxy-AODV 58 Results (contd..) Message Delivery Percentage in 1300 sec.

    59. 13 July 2006 proxy-AODV 59 Results (contd..) Duplicate Packet Comparison

More Related