The complexity of Markov decision processes
Mathematics of Operations Research
Causality: models, reasoning, and inference
Causality: models, reasoning, and inference
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
Goodput Analysis and Link Adaptation for IEEE 802.11a Wireless LANs
IEEE Transactions on Mobile Computing
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
HSDPA/HSUPA for UMTS: High Speed Radio Access for Mobile Communications
Robust rate adaptation for 802.11 wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
A tutorial on particle filters for online nonlinear/non-GaussianBayesian tracking
IEEE Transactions on Signal Processing
Cross-Layer combining of adaptive Modulation and coding with truncated ARQ over wireless links
IEEE Transactions on Wireless Communications
POMDP-Based Coding Rate Adaptation for Type-I Hybrid ARQ Systems over Fading Channels with Memory
IEEE Transactions on Wireless Communications
Applications of error-control coding
IEEE Transactions on Information Theory
Performance analysis of IEEE 802.11 WLANs with rate adaptation in time-varying fading channels
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.01 |
We investigate packet-by-packet rate adaptation so as to maximize the throughput. We consider a finite-state Markov channel (FSMC) with collisions, which models channel fading as well as collisions due to multi-user interference. To limit the amount of feedback data, we only use past packet acknowledgements (ACKs) and past rates as channel state information. The maximum achievable throughput is computationally prohibitive to determine, thus we employ a two-pronged approach. Firstly, we derive new upper bounds on the maximum achievable throughput, which are tighter than previously known ones. Secondly, we propose the particle-filter-based rate adaptation (PRA), which employs a particle filter to estimate the a posteriori channel distribution. The PRA can easily be implemented even when the number of available rates is large. Numerical studies show that the PRA performs within one dB of SNR to the proposed upper bounds for a slowly time-varying channel, even in the presence of multi-user interference.