Ad Hoc Networks : Technologies and Protocols - University of ...
Ad Hoc Networks : Technologies and Protocols - University of ...
Ad Hoc Networks : Technologies and Protocols - University of ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
TCP <strong>and</strong> <strong>Ad</strong>-hoc <strong>Networks</strong> 127<br />
mechanisms to the specific characteristics <strong>of</strong> ad-hoc networks. For all the<br />
simulations, FTP is used as the application generating traffic. The Newreno<br />
version <strong>of</strong> TCP is used with Dynamic Source Routing (DSR) as the routing<br />
protocol. Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)<br />
in the Distributed Co-ordination Function (DCF) mode is used as the medium<br />
access control protocol. The two ray ground reflection model is used as the<br />
propagation model with a cross-over distance <strong>of</strong> 100m. The cross-over distance<br />
denotes the radius within which the path loss coefficient is two <strong>and</strong> beyond which<br />
the path loss coefficient is four. Inside the cross-over distance a line <strong>of</strong> sight<br />
model is assumed.<br />
5.2.2 Window-based Transmissions<br />
One <strong>of</strong> the motivating factors for TCP being window based is the avoidance<br />
<strong>of</strong> the maintenance <strong>of</strong> any fine-grained transmission timers on a per-flow basis.<br />
Instead, TCP uses the principle <strong>of</strong> self-clocking (ACKs triggering further data<br />
transmissions) for connection progression. For wireline environments, where<br />
per-flow b<strong>and</strong>widths can scale up to several megabits per second, such a design<br />
choice is clearly essential. However, the use <strong>of</strong> a window based transmission<br />
mechanism in ad-hoc networks may result in the critical problem <strong>of</strong> burstiness<br />
in packet transmissions.<br />
Thus, if several ACKs arrive back-to-back at the sender, a burst <strong>of</strong> data<br />
packets will be transmitted by the sender even if it were in the congestion<br />
avoidance phase (where one packet will be transmitted for every incoming<br />
ACK). Unfortunately, ACK bunching or several ACKs arriving at the same<br />
time is a norm in ad-hoc networks because <strong>of</strong> the short-term unfairness <strong>of</strong> the<br />
CSMA/CA MAC protocol typically used in such networks. [5] provides a good<br />
exposition on the short term unfairness properties <strong>of</strong> CSMA/CA. Such shortterm<br />
unfairness results in the data stream <strong>of</strong> a TCP connection assuming control<br />
<strong>of</strong> the channel for a short period, followed by the ACK stream assuming control<br />
<strong>of</strong> the channel for a short period. Interestingly, such a phenomenon will occur<br />
even when the ACK stream does not traverse the exact same path as the data<br />
stream. This is because even if the paths were completely disjoint, the vicinity<br />
(2-hop region in the case <strong>of</strong> CSMA/CA) <strong>of</strong> the TCP sender <strong>and</strong> the vicinity <strong>of</strong> the<br />
TCP receiver still are common contention areas for the data <strong>and</strong> ACK streams.<br />
Figure 5.2(a) shows the TCP sequence number progression (at the sender) in<br />
a single TCP connection scenario. It can be seen that the transmissions occur<br />
in periods <strong>of</strong> bursts <strong>and</strong> are interspersed with periods <strong>of</strong> inactivity due to the<br />
arrival <strong>of</strong> ACKs. The impact <strong>of</strong> such burstiness <strong>of</strong> traffic has two undesirable<br />
effects:<br />
Varying round-trip time estimates: TCP relies on an accurate round-trip<br />
time (rtt) calculation to appropriately set the timer for its retransmission