1 Introduction
2 Related work
3 Preliminaries
3.1 Multi-destination aggregated frames form a binary symmetric broadcast channel
3.2 Running example: two-class WLAN
3.3 Coding for binary symmetric broadcast channels
3.3.1 Superposition coding
3.3.2 Time-sharing coding
4 Unicast throughput modelling
4.1 802.11 MAC model
4.2 Network throuhgput
4.3 Fairness
4.4 Expected payload
4.4.1 Uncoded
4.4.2 Time-sharing coding
4.4.3 Superposition coding
4.5 Expected MAC slot time
4.6 MAC overheads
5 Multicast throughput modelling
6 Theoretical performance
6.1 Unicast
\(T_{sifs}\)
\((\mu \hbox {s})\)
| 16 | \(L_{subhdr}\) (bytes) | 16 |
\(T_{ack}\)
\((\mu \hbox {s})\)
| 24 |
\(T_{phyhdr}\)
\((\mu \hbox {s})\)
| 20 | \(L_{FCS}\) (bytes) | 4 |
\(T_{difs}\)
\((\mu \hbox {s})\)
| 34 |
\(T_{phyhdr1}\)
\((\mu \hbox {s})\)
| 36 | \(L_{machdr}\) (bytes) | 24 | Retry limit | 7 |
Idle slot \(\sigma \)\((\mu \hbox {s})\) | 9 |
\(CW_{max}\)
| 1024 |
\(CW_{min}\)
| 16 |