- •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
188 |
8. The Superframe as Single Stage Game |
However, this behavior cannot guarantee that player i itself may achieve a satisfying payoff. If one or all players behave according to BEH-D, the resulting payoffs are low due to the very long and many resource allocations.
8.3.2.5Available Behaviors
In Figure 8.6, the action space of a player and the resulting consequences on the opponent players are indicated. The two illustrated cases at the left and right border of the action space, (a) deferring from resource access completely and (b) occupying all resources for the complete duration of the SSG, are not defined in the game model. Further, as part of the game model, ∆ ≤ 0.1. Indicated in the figure are areas where a player may meet its requirement by playing the best response, where a player may cooperate, and where it behaves selfish by blocking the opponent. The collision probability depends on the number of resource allocation attempts and increases with decreasing ∆dem of all players.
1 |
(a) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
channel |
|
|
allocation |
U∆ |
1 |
|
process |
|
|
|
|
process |
|
|
|
allocation |
|
|
|
|
|
|
|
|
|
∆dem |
communicationother |
area is useless for |
|
|
|
|
||
CCHC and time |
“reduced |
|
|
|||||
|
|
|
|
|||||
|
|
bounded services |
|
|
||||
|
|
probability |
|
|
||||
|
|
|
|
|
|
|
||
|
|
|
|
|
of collision“ |
|
|
|
|
for |
UΘ |
0 |
(requirement) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
search |
|
|
|
“desirable |
|
“selfish |
|
|
|
|
|
|
|
|||
|
|
|
|
|
area“ |
|
behavior“ |
|
|
access, |
|
|
“support |
|
“best |
|
|
|
|
|
of EDCF“ |
|
response“ |
allocation |
||
|
|
|
|
allocation |
|
|
|
process |
|
from |
|
|
“cooperation“ |
|
|
||
|
|
|
process |
|
|
|||
|
|
|
UΘ |
0 |
collisions“ |
|
||
|
defer |
|
|
|
||||
|
|
|
|
|
|
“many |
|
|
0 |
|
0 |
|
|
Θdem |
|
|
|
|
|
|
|
|
|
|
||
|
|
|
|
|
|
|
|
(b)
busy tone
1
Figure 8.6: Portfolio of available actions, the corresponding utilities and the resulting consequences on the opponents. The extreme cases of (a) deferring from resource access as part of DFS and (b) occupying all resources all the time, are not part of the game model, and therefore not part of the action space.
Chapter 9
COEXISTING WIRELESS LANS AS MULTI STAGE
GAME
9.1 |
Strategies in MSGs............................................................. |
190 |
9.2 |
Static Strategies .................................................................. |
192 |
9.3 |
Dynamic Strategies ........................................................... |
206 |
WITH THE UNDERSTANDING of the SSG and the definition of behaviors that allow interacting players to dynamically take actions in order to achieve certain payoffs as the instantaneous outcome of an
SSG, it is now possible to investigate realistic CCHC coexistence scenarios with the help of a Multi Stage Game (MSG). In an MSG, an SSG is played repeatedly with behaviors selected per SSG. All players take actions individually at the beginning of each stage. Players in an MSG follow a certain strategy. Strategies define what behavior to select in which SSG. Strategies can be understood as state machines where behaviors are selected from SSG to SSG based on the history of resulting payoffs. In general, an uncountable number of strategies and behaviors can be defined for an MSG; here the investigation is restricted to elementary strategies that will be defined in the following, and the behaviors defined in the previous chapter. These strategies and behaviors allow analyzing the concept of cooperation in this chapter, motivated by the analysis of Axelrod (1984). This chapter evaluates the advantages and drawbacks of the game approach developed in this thesis. The CCHC coexistence problem will be evaluated with and without the game approach that has been introduced in the previous chapters.
A strategy is a description of how a player intends to play by selecting behaviors throughout the MSG. The behaviors that are used by the strategies are BEH-P,