Learn More
We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incurred due to link adaptation. The contributions of this paper are twofold. Firstly, several high performance algorithms (offline and online) are developed for efficient performance in(More)
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread information bits over the entire signal band can take advantage of the frequency selective fading, and choose the sub-carrier(s) that have the best channel conditions for(More)
Given a time slotted list of resource capacities, we address the problem of scheduling resource allocation considering that a change in allocation results in the changeover penalty of one timeslot. The goal is to maximize the overall allocation of resources. We prove that no 1-lookahead algorithm can be better than 8/5-competitive. We provide improved(More)
In multi access network environments, mobile stations may encounter multiple choices for selecting an access network. Carefully designed access selection schemes can provide not only mobile users with better services but also network operators with better resource utilizations. It is also envisioned that further improvements can be achieved by(More)
This paper considers the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. The contributions of this paper are the following. We explicitly consider the time-penalty induced by the transmission-mode changes in wireless networks. We study the trade-offs between the channel-state prediction quality(More)
  • 1