In this paper, we consider how proportional fairness in wireless networks is impacted by spatial reuse and the interference it produces. We observe that, in scenarios where spatial reuse is possible (e.g., in high-density WLAN environments), the classic notion of time-based proportional fairness can be severely impacted: some users might experience very large interference penalties while other users might get larger bandwidth proportions than what they would have received with time-based proportional fairness and no spatial reuse. To account for this, we introduce the concept of interference-aware STDMA time-based proportional fairness (i-STPF), and compare it to ordinary STDMA time-based proportional fairness (STPF). We present an εi-STPF scheduling algorithm, and prove that it approximates the time-based fair bandwidth allocation (up to a small positive constant ε), while providing an aggregate throughput that is within a constant factor from optimal. We also present a heuristic i-STPF scheduling algorithm and compare it through simulation to a similar heuristic STPF scheduler, and to an interference-aware, rate-based scheduler. The results show that the i-STPF scheduler: i) achieves excellent aggregate throughput about 35% higher than rate-based throughput; and ii) maintains a close approximation to time-based fairness without interference. © 2014 IEEE.
Interference-aware proportional fairness for multi-rate wireless networks
Resta, G.;Santi, P.
2014
Abstract
In this paper, we consider how proportional fairness in wireless networks is impacted by spatial reuse and the interference it produces. We observe that, in scenarios where spatial reuse is possible (e.g., in high-density WLAN environments), the classic notion of time-based proportional fairness can be severely impacted: some users might experience very large interference penalties while other users might get larger bandwidth proportions than what they would have received with time-based proportional fairness and no spatial reuse. To account for this, we introduce the concept of interference-aware STDMA time-based proportional fairness (i-STPF), and compare it to ordinary STDMA time-based proportional fairness (STPF). We present an εi-STPF scheduling algorithm, and prove that it approximates the time-based fair bandwidth allocation (up to a small positive constant ε), while providing an aggregate throughput that is within a constant factor from optimal. We also present a heuristic i-STPF scheduling algorithm and compare it through simulation to a similar heuristic STPF scheduler, and to an interference-aware, rate-based scheduler. The results show that the i-STPF scheduler: i) achieves excellent aggregate throughput about 35% higher than rate-based throughput; and ii) maintains a close approximation to time-based fairness without interference. © 2014 IEEE.| File | Dimensione | Formato | |
|---|---|---|---|
|
Infocom14.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Nessuna licenza dichiarata (non attribuibile a prodotti successivi al 2023)
Dimensione
803.83 kB
Formato
Adobe PDF
|
803.83 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


