1 / 15

Evaluate IEEE 802.11e EDCA Performance

Evaluate IEEE 802.11e EDCA Performance. Tyler Ngo CMPE 257. EDCA vs. DCF. EDCA classifies traffic flows in different access categories (AC). Modifiable MAC parameters include: Arbitration Interframe Space (AIFS) replaces the DIFS in IEEE 802.11. Minimum Contention Window (CWmin).

neviah
Télécharger la présentation

Evaluate IEEE 802.11e EDCA Performance

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. Evaluate IEEE 802.11e EDCA Performance Tyler Ngo CMPE 257

  2. EDCA vs. DCF • EDCA classifies traffic flows in different access categories (AC). • Modifiable MAC parameters include: • Arbitration Interframe Space (AIFS) replaces the DIFS in IEEE 802.11. • Minimum Contention Window (CWmin). • Maximum Contention Window (CWmax). • Transmission Opportunity (TXOP). • Shorter CW and AIFS for higher-priority traffic.

  3. Analytical Modeling Transmission Probability • Let W = CWmin, then CWmax = W * 2m, where m is the maximum backoff stage. • Let ρc be the probability that a packet of class c encounters a collision on the channel. Let τc be the probability that a station of class c transmit in a random chosen slot. Then:

  4. Analytical Modeling Throughput • Let ρtr be the probability that there is at least one transmission in the considered slot time. Then: • Let ρs,i be the probability that a transmission of a packet of node i occurring on the channel is successful. Let τj be the probability that a node j transmit data (j ≠ i, j = [1, n]). Then:

  5. Analytical Modeling Throughput, Cont. • Let Ts,c be the average time that a node of class c senses the channel busy because of a successful transmission, TC,c be the average time that a node of class c senses the channel busy during a collision. Let E[P] be the expected packet length, H = PHYhdr + MAChdr be the packet header, δ be the propagation delay, and α be the length of a slot time. Then: • The throughput of node i, Si is then:

  6. Simulation Modeling • Controlled Parameters: • Loss Model: Log Distance • Exponent = 3 • Reference Distance = 1 • Reference Loss: 46.67 • Delay Model: Random, Uniform variable; Constant speed. • Nist Error Rate Model • Transmission Range • Energy Detection Threshold: -96.0 • CCA Mode1 Threshold: -99.0 • Tx Power End/Start: 16.0206 • Routing Protocol: OLSR • TCP Protocol: New Reno • Data Rate: 5MB/s • Run time = ~100s • TCP Packet Size = 1024 • UDP Packet Size = 120

  7. Topology 1 • Traffic: 6  7; 9  1; 3  8; 5  2 • Total run duration: 100s

  8. Topology 2 • Traffic: • 6  7; • 9  1; • 3  8; • 5  2; • Total run duration: 100s

  9. Topology 3 • Traffic: • 6  7; • 9  1; • 3  8; • 5  2; • Total run duration: 100s • Mobile environment only • Gaussian Markov Mobility Model

  10. Conclusion • Higher-priority tagging improves throughputs. But… • What are the rules for tagging? • TCP starvation is the main issue.

More Related