Your SlideShare is downloading. ×
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Icfcc conference real
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Icfcc conference real

771

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
771
On Slideshare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
4
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. How bad TCP suffers from packet losses and delays over wireless ad hoc network
    May Zin Oo, Mazliza Othman
    Faculty of Computer Science & Information Technology
    University of Malaya
    Malaysia
    3rd to 5th April
  • 2. Outlines
    • What does Ad hoc network mean?
    • 3. Applying TCP (Transport Layer Protocol) to Ad hoc network
    • 4. TCP Variants for Ad hoc network
    • 5. Ad hoc routing protocols
    • 6. Simulation Methodology
    • 7. Experimental results from simulations
    • 8. Conclusion
  • AD HOC NETWORK
    • Self organizing, self healing, distributed networks
    • 9. The wireless devices can communicate each other without using central access points in peer-to-peer fashion , but these are within range of each other.
    • 10. Decentralized wireless network
    • 11. The determination of which nodes forward data is made dynamically based on the network connectivity.
  • Applying TCP to Ad Hoc Environment
    • TCP (Transmission Control Protocol)
    • 12. To provide flow control, congestion control & avoidance, in-order and reliable end-to-end delivery of data packet in the wired networks.
    • 13. Applying TCP to ad hoc environment,
    • 14. TCP has to face many problems such as packet losses due to congestion and node mobility, wireless high bit errors, and so on.
    • 15. Because of these problems, the following TCP versions were intended for wireless environment:
    • 16. Tahoe, Reno, NewReno, Vegas and Westwood
  • TCP Versions for Ad Hoc Network
    • TCP Tahoe introduced slow start and congestion avoidance.
    • 17. Slow start,
    • 18. Use at the beginning of a transfer or after timeout
    • 19. Start from minimum window size
    • 20. Increase window size exponentially
    • 21. Congestion avoidance,
    • 22. Increase congestion window size by MSS/cwnd bytes for each ACK received.
    • 23. Increase window size linearly
    • 24. In our simulation, I will analysis the following TCP variants.
    • 25. NewReno
    • 26. Vegas
    • 27. Westwood.
  • Comparison of three variants of TCP
  • 28. Ad Hoc Routing Protocols
  • 29. Ad Hoc Routing Protocols
  • 30. Simulation Methodology
    • Network Simulator (NS-2) was used to study the three variants of TCP over three ad hoc routing protocols.
  • 1
    2
    3
    0
    1
    2
    3
    4
    0
    1
    2
    3
    4
    0
    1
    2
    3
    4
    Simulation Methodology (Continued…)
    Static ad hoc environment ( 5 nodes & 15 nodes )

    5
    6
    7
    14
    Fig 1: Source node 0 connects to destination node 4 in static ad hoc network
    Fig 3: Source node 0 connects to destination
    node 14 in static ad hoc network
    2
    7
    12
    Mobile ad hoc environment ( 5 nodes & 15 nodes )




    2
    6
    7
    0
    12
    8
    14
    Fig 2: Source node 0 connects to destination
    node 4 in mobile ad hoc network
    Fig 4:Source node 0 connects to destination
    node 14 in mobile ad hoc network
  • 31. Simulation Results
    • We simulate each variant of TCP over each routing protocol in static ad hoc network and mobile ad hoc network environments and measure how the node mobility affects TCP and routing protocols in 5-node and 15-node chain topologies.
    • 32. We have analyzed
    • 33. Packet loss rates (%)
    • 34. Data transfer rate
    • 35. Throughput of received packets at the destination node.
  • Packet loss rate (%) measurement of DSDV
    Figure 1
    Figure 2
  • 36. Packet loss rate (%) measurement of AODV
    Figure 3
    Figure 4
  • 37. Packet loss rate (%) measurement of DSR
    Figure 5
    Figure 6
  • 38. Comparison of data transfer rate in static environment
    • Vegas is the fastest data transfer rate under various conditions.
    Figure 7
    Figure 8
  • 39. Comparison of data transfer rate in mobile environment
    Figure 9
    Figure 10
  • 40. Measurement of the throughput in mobile ad hoc network
    • All TCP variants over DSDV routing protocol can still receive packets although nodes move out of each other’s transmission range.
    • 41. This is because DSDV maintains all possible routes to the destination.
    • 42. Although DSR routing protocol suffer from most packet losses, the number of received packets at destination nodes are the most.
  • Conclusion
    In the overview of performance comparison , according to the packet loss rate (%) ,
    • NewReno over AODV routing in mobile environment but in less nodes,
    • 43. Vegas over DSDV and AODV routing in both environment and
    • 44. Westwood over DSR routing in both environment are the best and least packet loss rate.

×