- •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
Table of Symbols
symbol |
meaning |
context |
|
|
|
h(t,x) |
time domain channel response at receiver location x |
PHY model |
H(f,x) |
frequency domain channel response at receiver location x |
PHY model |
t |
time |
PHY model |
f |
frequency |
PHY model |
BD |
Doppler spread |
PHY model |
fc |
center frequency |
PHY model |
v |
velocity |
PHY model |
Tc |
coherence time |
PHY model |
Tb' |
OFDM symbol duration |
PHY model |
Tg |
OFDM guard time (or: guard interval) |
PHY model |
Tb |
OFDM block time (or: block interval) |
PHY model |
αg |
power loss |
PHY model |
Eav |
energy per symbol |
PHY model |
ΣI |
cumulated interference from multiple interferers |
PHY model |
N |
background noise |
PHY model |
N0 |
noise at receiver from interference and background noise |
PHY model |
T |
1/(sampling rate) |
PHY model |
Ntotal |
total number of OFDM sub-carriers |
PHY model |
Df |
OFDM sub-carrier spacing |
PHY model |
B |
emission bandwidth |
PHY model |
C |
power of a received signal |
PHY model |
d |
distance between radio stations |
PHY model |
PTx |
transmission power |
PHY model |
gTx |
antenna gain at transmitter |
PHY model |
gRx |
antenna gain at receiver |
PHY model |
γ |
attenuation parameter |
PHY model |
G1/G2 |
the generator polynomials of the mother code |
PHY model |
N |
number of backoff entities (stations) |
Bianchi model |
m |
maximum number of backoff stages |
Bianchi model |
i |
number of backoff stages |
Bianchi model |
Thrpsat |
normalized saturation throughput |
Bianchi model |
Tsuccess |
time of on successful frame exchange |
Bianchi model |
240 |
Table of Symbols |
symbol |
meaning |
context |
|
|
|
Psuccess |
probability that frame exchange is successfully completed |
Bianchi model |
PCCAbusy |
probability of ongoing transmission in saturation |
Bianchi model |
PCCAidle |
probability that the channel is idle in saturation |
Bianchi model |
TCCAbusy |
duration of transmission, frame exchange or colliding |
Bianchi model |
|
frames |
|
TCCAidle |
random variable, duration of idle periods in saturation |
Bianchi model |
Tcoll |
duration of collision, depends on frame body size |
Bianchi model |
Pcoll |
probability, that a transmission attempts fails |
Bianchi model |
p |
probability of collision at a particular slot |
Bianchi model |
τ |
probability that a backoff entity transmits at a slot |
Bianchi model |
s(t ) |
stochastic process for the backoff stage |
Bianchi model |
b(t ) |
stochastic process for the contention window size |
Bianchi model |
bi ,k |
stationary distribution of Markov chain |
Bianchi model |
Wi |
contention window size in backoff stage i |
Bianchi model |
ξslot |
slot access probability of the backoff entities |
Bianchi model |
n |
stage of a game |
game model |
N |
number of players that participate in the game |
game model |
Ν |
the set of N players |
game model |
N MSG |
number of stages in a multi stage game |
game model |
i |
identifier of a player |
game model |
−i |
identifier of all players but not player i |
game model |
A i |
infinite set of actions of player i |
game model |
Α |
Euclidean space of actions |
game model |
Θ |
share of capacity, related to the throughput |
game model |
∆ |
resource allocation interval, related to the delay |
game model |
Ξ |
variation of resource allocation interval |
game model |
a |
action |
game model |
U |
utility |
game model |
V |
payoff |
game model |
u,v |
shaping parameters of utility functions |
game model |
d |
duration of a resource allocation, in ms |
game model |
D |
time between two consecutive resource allocations, in ms |
game model |
L |
number of resource allocations of one player per stage |
game model |
VMSGi |
multi stage game payoff for player i |
game model |
δi |
discounting factor for player i |
game model |
s |
discrete sequence of resource allocation attempts |
predictor |
ϕ |
autocorrelation function |
predictor |
Table of Symbols |
241 |
symbol |
meaning |
context |
|
|
|
W |
window size of calculation of autocorrelation function |
predictor |
K |
ratio of SFDUR to aTimeUnit |
predictor |
aTimeUnit |
defines precision of autocorrelation function |
predictor |