The complexity of Markov decision processes
Mathematics of Operations Research
Vector quantization and signal compression
Vector quantization and signal compression
An introduction to signal detection and estimation (2nd ed.)
An introduction to signal detection and estimation (2nd ed.)
A rate-adaptive MAC protocol for multi-Hop wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Wireless Communications
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
POMDP-Based Coding Rate Adaptation for Type-I Hybrid ARQ Systems over Fading Channels with Memory
IEEE Transactions on Wireless Communications
Channel quality estimation and rate adaptation for cellular mobile radio
IEEE Journal on Selected Areas in Communications
Interference management via rate splitting and HARQ over time-varying fading channels
Proceedings of the 2009 ACM workshop on Cognitive radio networks
Coding versus ARQ in fading channels: how reliable should the PHY be?
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
OFDMA downlink resource allocation via ARQ feedback
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Limited feedback for temporally correlated MIMO channels with other cell interference
IEEE Transactions on Signal Processing
International Journal of Communication Networks and Distributed Systems
Discrete-time Markov Model for Wireless Link Burstiness Simulations
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless channel. In particular, we consider schemes in which transmitter channel state is inferred from degraded causal error-rate feedback, such as packet-level ACK/NAKs in an automatic repeat request (ARQ) system. In such schemes, the choice of transmission rate affects not only the subsequent goodput but also the subsequent feedback, implying that the optimal rate schedule is given by a partially observable Markov decision process (POMDP). Because solution of the POMDP is computationally impractical, we consider simple suboptimal greedy rate assignment and show that the optimal scheme would itself be greedy if the error-rate feedback was non-degraded. Furthermore, we show that greedy rate assignment using non-degraded feedback yields a total goodput that upper bounds that of optimal rate assignment using degraded feedback. We then detail the implementation of the greedy scheme and propose a reduced-complexity greedy scheme that adapts the transmission rate only once per block of packets. We also investigate the performance of the schemes numerically, and show that the proposed greedy scheme achieves steady-state goodputs that are reasonably close to the upper bound on goodput calculated using non-degraded feedback. A similar improvement is obtained in steady-state goodput, drop rate, and average buffer occupancy in the presence of data buffers. We also investigate an upper bound on the performance of optimal rate assignment for a discrete approximation of the channel and show that such quantization leads to a significant loss in achievable goodput.