DMCA
Scheduling in Wireless Networks with Rayleigh-Fading Interference
| Citations: | 8 - 3 self |
BibTeX
@MISC{Dams_schedulingin,
author = {Johannes Dams and Martin Hoefer and Thomas Kesselheim},
title = {Scheduling in Wireless Networks with Rayleigh-Fading Interference},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study algorithms for wireless spectrum access of n communication requests when interference conditions are given by the Rayleigh-fading model. This model extends the recently popular deterministic interference model based on the signal-to-interference-plus-noise ratio (SINR) using stochastic propagation to address fading effects observed in reality. We consider worst-case approximation guarantees for the two standard problems of capacity maximization (maximize the expected number of successful transmissions in a single slot) and latency minimization (minimize the expected number of slots until all transmissions were successful). Our main result is a generic reduction of Rayleigh fading to the deterministic SINR model. It allows to apply existing algorithms for the non-fading model in the Rayleigh-fading scenario while losing only a factor of O(log ∗ n) in the approximation guarantee. This way, we obtain the first approximation guarantees for Rayleigh fading and, more fundamentally, show that non-trivial stochastic fading effects can be successfully handled using existing and future techniques for the non-fading model. Using a more detailed argument, a similar result applies even for distributed and game-theoretic capacity maximization approaches. For example, it allows to show that regret learning yields an O(log ∗ n)-approximation with uniform power assignments. Our analytical treatment is supported by simulations illustrating the performance of regret learning and, more generally, the relationship between both models.
Keyphrases
wireless network rayleigh-fading interference expected number non-fading model similar result applies approximation guarantee latency minimization interference condition worst-case approximation guarantee uniform power assignment deterministic sinr model communication request non-trivial stochastic fading effect main result single slot capacity maximization stochastic propagation rayleigh-fading scenario rayleigh-fading model generic reduction detailed argument fading effect signal-to-interference-plus-noise ratio regret learning popular deterministic interference model rayleigh fading standard problem successful transmission analytical treatment future technique first approximation guarantee game-theoretic capacity maximization approach wireless spectrum access
