1 / 18

Performance issues & improvement on 802.11 MAC

Performance issues & improvement on 802.11 MAC. review of 802.11 MAC performance issues improvements idle sense an overlay approach more …. DIFS. data. SIFS. ACK. 802.11 CSMA/CA. 802.11 sender 1 if sense channel idle for DIFS (distributed inter-frame spacing) then

edric
Download Presentation

Performance issues & improvement on 802.11 MAC

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. Performance issues & improvement on 802.11 MAC • review of 802.11 MAC • performance issues • improvements • idle sense • an overlay approach • more …

  2. DIFS data SIFS ACK 802.11 CSMA/CA 802.11 sender 1 if sense channel idle for DIFS (distributed inter-frame spacing) then transmit entire frame (no CD) 2 ifsense channel busy then start random backoff time timer counts down while channel idle transmit when timer expires if no ACK, increase random backoff interval, repeat 2 802.11 receiver - if frame received OK return ACK after SIFS (short inter-frame spacing) sender receiver

  3. Discussion • why collision avoidance instead of detection? • why using ACK? • why random backoff? • why backoff after transmission failure? • why exponential backoff?

  4. Performance Anomaly of 802.11b Martin Heusse, Frank Rousseau, Gilles-Berger Sabbatel, Andrzej Duda LSR-IMAG Laboratory Grenoble, France

  5. Transmission time of a frame in 802.11b

  6. Heterogeneous transmission rates • rate adaptation • 802.11b: 11, 5.5, 2, 1Mbps • assumptions: N hosts: N-1 fast, 1 slow R : transmission rate of fast host (11Mbps) r : transmission rate of slow host (5.5, 2 or 1 Mbps)

  7. Transmission time • Fast Host: Slow Host: T: overall transmission time, Tf: fast host, Ts: slow host tov : overhead time, tRov : fast host, trov: slow host tcont : contention time, sd: frame size

  8. Fast host Equal probability of access for all hosts Uf: channel utilization by a fast host Pc(N): for a successful packet, probability of collision tjam : average time spent in collisions

  9. Fast host (cont’d) Xf: throughput at the MAC layer of a fast host , proportion of useful throughput

  10. Slow host Us: channel utilization by slow host Xs: throughput at the MAC layer of slow host

  11. Performance anomaly of 802.11b • Fast hosts transmitting at a higher rate R obtain the same throughput as slow hosts transmitting at a lower rate r, i.e.,

  12. Simulation studies

  13. Idle Sense:An Optimal Access Method forHigh Throughput and Fairnessin Rate Diverse Wireless LANs Martin Heusse, Frank Rousseau, Gilles-Berger Sabbatel, Andrzej Duda • LSR-IMAG Laboratory • Grenoble, France

  14. Known problems with DCF • performance anomaly in rate diverse cells • slow host limits the throughput of faster hosts • exponential backoff • good short term fairness for N=2, degrades for larger N • contention control (not differentiate collision & frame error) • “bad day” effect • a host loses frames due to bad transmission conditions -> frequent exponential backoffs -> increased CW (even lower transmission probability) • physical capture effect

  15. Towards a better access method • keep good aspects of DCF • no explicit information exchange • random backoff • modifications • no exponential backoff • make hosts use similar values of CW ⇒ fairness • adapt CW to varying traffic conditions • more hosts, bigger CW; less hosts, smaller CW • do not change CW upon frame loss • what is optimal CW?

  16. Renewal Time Renewal Time Back-off Success Back-off Collision Back-off Tt Tc Analysis of channel contention • transmission attempt probability: β • Prob. that there is no channel activity: Pi = (1 – β)N • Prob. that there is a successful transmission: Pt = n β(1 – β)N-1 • Prob. that there is a collision: Pc = 1- Pt - Pi • network throughput:

  17. minimize Insight Given Tc/Tslot (e.g. 68.17 for 802.11b), numerically solve βopt niopt N Expected number of consecutive idle slots:

  18. Insight = 0.1622 for 802.11b 802.11b:= 5.68

More Related