13.07.2015 Views

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

Page 2 Lecture Notes in Computer Science 2865 Edited by G. Goos ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

134 J. Deng, Y.S. Han, and Z.J. HaasIn the MAC-2R scheme, when the value of W (say, w) satisfies w +2 ≤δ, the RTS/CTS dialogue succeeds before the end of the current data packettransmission on the data subchannel. Thus, the next data packet transmissioncan start immediately after the current one ends. However, when w +2>δ(asshown <strong>in</strong> Fig. 2), the data subchannel will be left idle for a period of time, whichwe def<strong>in</strong>e as the wait<strong>in</strong>g time on data subchannel (w 2 ). The expected value ofthis wait<strong>in</strong>g time (w 2 ) can be calculated asw 2 =∫ ∞δ−2[w − (δ − 2)] · g(w) dw . (6)Note that the above equation holds even when δ − 2 < 0.Therefore, the throughput of the MAC-2R scheme can be expressed asδ1S 2R (r) = · (1 − r) =. (7)δ + w 211−r + w2krNote that the control subchannel access scheme is ALOHA for RTS packets.To maximize the throughput of the control subchannel, the RTS packet arrivalrate <strong>in</strong> unit time on the control subchannel, G = λγ 2 , should be 0.5. In this case,the delay from when the control subchannel becomes available for reservationuntil a successful RTS/CTS dialogue takes place is m<strong>in</strong>imized [11]. Thus, thisvalue of G m<strong>in</strong>imizes w.Before we proceed to calculate w 2 , it is worthwhile to evaluate the throughputif we only consider the average delay of contention resolution on the controlsubchannel. In this case, the average time of each reservation cycle on the controlsubchannel is E[W ]+2=w + 2 and the time of each transmission cycle on thedata subchannel is δ. The optimal throughput of the MAC-2R scheme occurswhen δ = w + 2; i.e., the data packets are placed back-to-back and there is nowait<strong>in</strong>g time needed on the data subchannel for conclusion of the contentionresolution on the control subchannel. Thus,δ =kr∗1 − r ∗ = w +2 ,and the optimal r, which we label as r ∗ , based on the expected value of contentionresolution delay isr ∗ = w +2k + w +2 . (8)However, <strong>by</strong> substitut<strong>in</strong>g r ∗ <strong>in</strong>to (7), we obta<strong>in</strong> thatS 2R (r ∗ )=kw +2+k(11+ w2w+2which is lower than S 1 for w 2 > 0.In order to calculate w 2 , we need to derive g(w) explicitly. Instead of deriv<strong>in</strong>ga closed-form for g(w), we use a numerical <strong>in</strong>version of Laplace transforms presented<strong>in</strong> [13]. The value of g(w) for a specified value of w can be estimated asfollows. First, g(w) can be represented <strong>by</strong> a sequence of discrete values, s n (w),),

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!