![](/user_photo/2706_HbeT2.jpg)
- •Introduction
- •Increasing Demand for Wireless QoS
- •Technical Approach
- •Outline
- •The Indoor Radio Channel
- •Time Variations of Channel Characteristics
- •Orthogonal Frequency Division Multiplexing
- •The 5 GHz Band
- •Interference Calculation
- •Error Probability Analysis
- •Results and Discussion
- •IEEE 802.11
- •IEEE 802.11 Reference Model
- •IEEE 802.11 Architecture and Services
- •Architecture
- •Services
- •802.11a Frame Format
- •Medium Access Control
- •Distributed Coordination Function
- •Collision Avoidance
- •Post-Backoff
- •Recovery Procedure and Retransmissions
- •Fragmentation
- •Hidden Stations and RTS/CTS
- •Synchronization and Beacons
- •Point Coordination Function
- •Contention Free Period and Superframes
- •QoS Support with PCF
- •The 802.11 Standards
- •IEEE 802.11
- •IEEE 802.11a
- •IEEE 802.11b
- •IEEE 802.11c
- •IEEE 802.11d
- •IEEE 802.11e
- •IEEE 802.11f
- •IEEE 802.11g
- •IEEE 802.11h
- •IEEE 802.11i
- •Overview and Introduction
- •Naming Conventions
- •Enhancements of the Legacy 802.11 MAC Protocol
- •Transmission Opportunity
- •Beacon Protection
- •Direct Link
- •Fragmentation
- •Traffic Differentiation, Access Categories, and Priorities
- •EDCF Parameter Sets per AC
- •Minimum Contention Window as Parameter per Access Category
- •Maximum TXOP Duration as Parameter per Access Category
- •Collisions of Frames
- •Other EDCF Parameters per AC that are not Part of 802.11e
- •Retry Counters as Parameter per Access Category
- •Persistence Factor as Parameter per Access Category
- •Traffic Streams
- •Default EDCF Parameter Set per Draft 4.0, Table 20.1
- •Hybrid Coordination Function, Controlled Channel Access
- •Controlled Access Period
- •Improved Efficiency
- •Throughput Improvement: Contention Free Bursts
- •Throughput Improvement: Block Acknowledgement
- •Delay Improvement: Controlled Contention
- •Maximum Achievable Throughput
- •System Saturation Throughput
- •Modifications of Bianchi’s Legacy 802.11 Model
- •Throughput Evaluation for Different EDCF Parameter Sets
- •Lower Priority AC Saturation Throughput
- •Higher Priority AC Saturation Throughput
- •Share of Capacity per Access Category
- •Calculation of Access Priorities from the EDCF Parameters
- •Markov Chain Analysis
- •The Priority Vector
- •Results and Discussion
- •QoS Support with EDCF Contending with Legacy DCF
- •1 EDCF Backoff Entity Against 1 DCF Station
- •Discussion
- •Summary
- •1 EDCF Backoff Entity Against 8 DCF Stations
- •Discussion
- •Summary
- •8 EDCF Backoff Entities Against 8 DCF Stations
- •Discussion
- •Summary
- •Contention Free Bursts
- •Contention Free Bursts and Link Adaptation
- •Simulation Scenario: two Overlapping QBSSs
- •Throughput Results with CFBs
- •Throughput Results with Static PHY mode 1
- •Delay Results with CFBs
- •Conclusion
- •Radio Resource Capture
- •Radio Resource Capture by Hidden Stations
- •Solution
- •Mutual Synchronization across QBSSs and Slotting
- •Evaluation
- •Simulation Results and Discussion
- •Conclusion
- •Prioritized Channel Access in Coexistence Scenarios
- •Saturation Throughput in Coexistence Scenarios
- •MSDU Delivery Delay in Coexistence Scenarios
- •Scenario
- •Simulation Results and Discussion
- •Conclusions about the HCF Controlled Channel Access
- •Summary and Conclusion
- •ETSI BRAN HiperLAN/2
- •Reference Model (Service Model)
- •System Architecture
- •Medium Access Control
- •Interworking Control of ETSI BRAN HiperLAN/2 and IEEE 802.11
- •CCHC Medium Access Control
- •CCHC Scenario
- •CCHC and Legacy 802.11
- •CCHC Working Principle
- •CCHC Frame Structure
- •Requirements for QoS Support
- •Coexistence Control of ETSI BRAN HiperLAN/2 and IEEE 802.11
- •Conventional Solutions to Support Coexistence of WLANs
- •Coexistence as a Game Problem
- •The Game Model
- •Overview
- •The Single Stage Game (SSG) Competition Model
- •The Superframe as SSG
- •Action, Action Space A, Requirements vs. Demands
- •Abstract Representation of QoS
- •Utility
- •Preference and Behavior
- •Payoff, Response and Equilibrium
- •The Multi Stage Game (MSG) Competition Model
- •Estimating the Demands of the Opponent Player
- •Description of the Estimation Method
- •Evaluation
- •Application and Improvements
- •Concluding Remark
- •The Superframe as Single Stage Game
- •The Markov Chain P
- •Illustration and Transition Probabilities
- •Definition of Corresponding States and Transitions
- •Solution of P
- •Collisions of Resource Allocation Attempts
- •Transition Probabilities Expressed with the QoS Demands
- •Average State Durations Expressed with the QoS Demands
- •Result
- •Evaluation
- •Conclusion
- •Definition and Objective of the Nash Equilibrium
- •Bargaining Domain
- •Core Behaviors
- •Available Behaviors
- •Strategies in MSGs
- •Payoff Calculation in the MSGs, Discounting and Patience
- •Static Strategies
- •Definition of Static Resource Allocation Strategies
- •Experimental Results
- •Scenario
- •Discussion
- •Persistent Behavior
- •Rational Behavior
- •Cooperative Behavior
- •Conclusion
- •Dynamic Strategies
- •Cooperation and Punishment
- •Condition for Cooperation
- •Experimental Results
- •Conclusion
- •Conclusions
- •Problem and Selected Method
- •Summary of Results
- •Contributions of this Thesis
- •Further Development and Motivation
- •IEEE 802.11a/e Simulation Tool “WARP2”
- •Model of Offered Traffic and Requirements
- •Table of Symbols
- •List of Figures
- •List of Tables
- •Abbreviations
- •Bibliography
![](/html/2706/245/html_HlVg4FaTax.ofdd/htmlconvd-Ch2Vx_100x1.jpg)
84 |
5. Evaluation of IEEE 802.11e with the IEEE 802.11a Physical Layer |
Equation (5.9) neglects the mutual influences of the ACs to each other the shared operation implies on the individual changes of maximum saturation throughput per AC. This will be discussed in the next section, where the results of the analytical approximations are compared to simulation results for a large number of parameter combinations.
5.1.3.3Results and Discussion
The example with the three ACs and four backoff entities per AC as defined in Table 5.2, p. 68, and illustrated in Figure 5.11 and Figure 5.12, is used to evaluate the approximation of the saturation throughput Thrpshare in a shared scenario. The backoff entities of one of the three ACs are assumed to apply a range of EDCF parameters: the EDCF parameters are changed gradually from the higher to the lower priority such that many different parameter combinations are analyzed. The other two ACs apply always the same EDCF parameters: the backoff entities of the two other ACs are assumed to operate according to the legacy and lower priority EDCF parameter setups. Many different combinations of EDCF parameters and relative priorities can be studied under these assumptions. The definitions of the EDCF parameters of the higher, legacy, and lower priority ACs can be found in Table 5.2. A constant frame body size of 512 byte for all ACs is selected here, RTS/CTS is not used. Note that the parameters CWmax and RetryCnt remain constant for all ACs at any time and are not varied.
The following figures show the resulting throughput per AC as a result of simulation and analytical approximation, where a different numbers of backoff entities per AC have been assumed. Figure 5.15 shows the results for the scenarios with four backoff entities per AC, i.e., 12 backoff entities in total. Figure 5.17 shows results for scenarios with 10 backoff entities with variable EDCF parameter setup, 2 legacy priority backoff entities, and 4 lower priority backoff entities. Therefore, 16 backoff entities in total share a common channel in these scenarios.
legacy priority
low
priority
variable
priority
receiving station
Figure 5.14: Scenario. One backoff entity per station. All stations detect each other. If two or more stations transmit at the same time, a collision occurs.
![](/html/2706/245/html_HlVg4FaTax.ofdd/htmlconvd-Ch2Vx_101x1.jpg)
5.1 HCF Contention-based Channel Access |
85 |
|||
|
0.7 |
← higher priority |
← legacy priority |
lower priority → |
|
0.6 |
|
|
512 bytes frame body, no RTS/CTS |
(norm.) |
|
analyt. |
4+4+4 backoff entities |
|
0.5 |
|
|||
AC |
0.4 |
|
sim. |
|
per |
|
|
||
|
|
variable pr. (high → low) sim. |
||
|
|
|
||
(=thrp.) |
|
|
|
|
|
|
|
legacy pr. apprx. |
|
|
0.3 |
|
|
variable pr. (high → low) apprx. |
|
|
|
legacy pr. sim. |
|
|
|
|
|
|
share |
0.2 |
|
|
lower pr. sim. |
|
|
sim. |
lower pr. apprx. |
|
|
0.1 |
|
analyt. |
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
AIFS: 2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
CWmin: |
7 |
7 |
7 |
7 |
7 |
8 |
9 |
10 |
12 |
13 |
14 |
15 |
15 |
15 |
15 |
15 |
15 |
15 |
15 |
17 |
19 |
21 |
23 |
25 |
27 |
29 |
31 |
31 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
16 × PF: |
24 |
26 |
28 |
30 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
40 |
lines w/o markers: analytical approx.; lines with markers: WARP2 sim. results
Figure 5.15: Saturation throughput per AC with 4 backoff entities per AC.
Finally, Figure 5.19 shows results for scenarios with 2 backoff entities with variable EDCF parameter setup, 10 legacy priority backoff entities, and 4 lower priority backoff entities. Hence, 16 backoff entities in total are again assumed here. Figure 5.15 is discussed in the next Section 5.1.3.3.1, Figure 5.17 is discussed in Section 5.1.3.3.2, and Figure 5.19 is discussed in Section 5.1.3.3.3.
5.1.3.3.14 Variable Priority Backoff Entities against 4 Legacy and 4 Low Priority Backoff Entities
Figure 5.15 shows simulation and analytical results for 28 parameter combinations, where the EDCF parameters of one AC (used by 4 of 12 backoff entities) are varied from higher (left hand side in the figure) to legacy priority, and down to the lower priority (right hand side in the figure), according to Table 5.2. The scenario is depicted in Figure 5.14.
The other 8 backoff entities of the other ACs operate with legacy and lower priority. It can be seen that the analytical results approximate for all the priorities the simulated results with a sufficient accuracy. This result indicates that the Markov model can be used to sufficiently approximate the backoff process from which the saturation throughput has been calculated.
It can be observed from the left hand side of Figure 5.15 that the AC with the variable priority observes the largest throughput (shares of capacity) in scenarios with higher priority EDCF parameters (AIFSN=2, CWmin=7, PF=24/16). However, this share decreases with changed EDCF parameters towards legacy priority. If the 4 backoff entities of the AC with the variable EDCF parameters
![](/html/2706/245/html_HlVg4FaTax.ofdd/htmlconvd-Ch2Vx_102x1.jpg)
86 |
5. Evaluation of IEEE 802.11e with the IEEE 802.11a Physical Layer |
operate according to the legacy priority, then the observed share of capacity is the same as for the 4 legacy backoff entities. This is indicated by the simulation results, and confirmed by the analytical approximations (center of Figure 5.15, AIFSN=2, CWmin=15, PF=32/16). As expected, when changing the EDCF parameters down to the lower priority, the share of capacity of this AC decreases down towards the share that is observed by the backoff entities of the lower priority AC (right hand side of Figure 5.15, AIFSN=9, CWmin=31, PF=40/16). In parallel, the legacy priority backoff entities observe increased shares in theses scenarios. This is an expected result: in these scenarios, the legacy priority AC is parameterized such that the 4 legacy backoff entities access the channel with highest priority relative to the other 8 backoff entities, because those backoff entities all operate with the lower priority EDCF parameters. This again is confirmed by the simulation results as well as the analytical approximations.
5.1.3.3.210 Variable Priority Backoff Entities against 2 Legacy and 4 Low Priority Backoff Entities
In contrast to the previous scenario, a different number of backoff entities per AC is assumed in the following, as shown in Figure 5.16. Figure 5.17 shows simulation and analytical results for parameter combinations with 10 backoff entities with variable EDCF parameter setup, 2 legacy priority backoff entities, and 4 lower priority backoff entities, thus, 16 backoff entities operate in parallel here. The observed shares are the same as in the previous scenario from the last section, illustrated in Figure 5.15. The main difference to the previous scenario is that now the backoff entities that slowly reduce their priority from parameter combination to parameter combination (i.e., from the left to the right in the figure), keep their maximum share a longer time (for more parameter combinations).
After some more parameter combinations (left to right), an immediate reduction of throughput share suddenly happens (indicated in the center of the figure).
legacy priority
low variable priority
priority
receiving station
Figure 5.16: Scenario. One backoff entity per station. All stations detect each other. If two or more stations transmit at the same time, a collision occurs.
![](/html/2706/245/html_HlVg4FaTax.ofdd/htmlconvd-Ch2Vx_103x1.jpg)
5.1 HCF Contention-based Channel Access |
87 |
||||
|
0.7 |
← higher priority |
|
← legacy priority |
lower priority → |
|
0.6 |
|
|
|
512 bytes frame body, no RTS/CTS |
(norm.) |
|
|
|
10+2+4 backoff entities |
|
0.5 |
|
|
|
||
AC |
|
|
analyt. |
|
|
0.4 |
|
sim. |
analyt. |
|
|
per |
|
|
|||
|
|
|
|
variable pr. (high → low) sim. |
|
(=thrp.) |
0.3 |
|
|
sim. |
|
|
|
variable pr. (high → low) apprx. |
|||
|
|
|
|
||
|
|
|
|
|
legacy pr. sim. |
share |
0.2 |
|
|
|
legacy pr. apprx. |
|
|
|
|
lower pr. apprx. |
|
|
|
|
|
|
lower pr. sim. |
|
0.1 |
|
|
|
|
0 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
AIFS: 2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
9 |
CWmin: |
7 |
7 |
7 |
7 |
7 |
8 |
9 |
10 |
12 |
13 |
14 |
15 |
15 |
15 |
15 |
15 |
15 |
15 |
15 |
17 |
19 |
21 |
23 |
25 |
27 |
29 |
31 |
31 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
16 × PF: |
24 |
26 |
28 |
30 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
32 |
40 |
lines w/o markers: analytical approx.; lines with markers: WARP2 sim. results
Figure 5.17: Saturation throughput per AC with 10 backoff entities with varying EDCF parameters, contending with 2 legacy and 4 lower priority backoff entities.
This is an obvious result. The 10 backoff entities are more dominant than the 4 backoff entities of the previous scenario. Note that of course the capacity share per backoff entity in the AC with variable priority is less than before, as 10 instead of 4 backoff entities are operating according to this AC. In contrast, only 2 instead of 4 legacy backoff entities operate in the scenario shown here. Thus, these 2 backoff entities will observe an increased resulting throughput when they operate with higher priority, relative to the other 10+4 backoff entities (towards the right in the figure). As before, the analytical results and the simulation results confirm each other with sufficient accuracy.
5.1.3.3.32 Variable Priority Backoff Entities against 10 Legacy and 4 Low Priority Backoff Entities
Figure 5.19 shows results for a scenario with 2 backoff entities with variable EDCF parameter setup, 10 legacy priority backoff entities, and 4 lower priority backoff entities, as illustrated in Figure 5.18. 16 backoff entities in total are assumed as in the last sections. The results are again obvious. Although the 2 variable priority backoff entities operate with highest priority at the beginning (indicated in the left of the figure), they do not observe a considerable share. However, the share per backoff entity is larger for any of the 2 backoff entities than the share observed by any of the 10 legacy backoff entities. It should be emphasized that the analytical results and the simulation results deviate more from each other with such parameter combinations, although the approximations show qualitatively the same shares.