Opportunistic scheduling of wireless links

Authors:
Vinod Sharma;D. K. Prasad;Eitan Altman
Affiliations:
Dept Elect. Comm. Engg., Indian Istitute of Science, Bangalore, India;Dept Elect. Comm. Engg., Indian Istitute of Science, Bangalore, India;INRIA, Sophia-Antipolis Cedex, France
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 12
Cited 0

Adaptive Markov Control Processes

Adaptive Markov Control Processes
Control of Polling in Presence of Vacations in Heavy Traffic with Applications to Satellite and Mobile Radio Systems

SIAM Journal on Control and Optimization
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
User-level performance of channel-aware scheduling algorithms in wireless data networks

IEEE/ACM Transactions on Networking (TON)
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks

WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
A stochastic control approach for scheduling multimedia transmissions over a polled multiaccess fading channel

Wireless Networks
Asymptotically fair transmission scheduling over fading channels

IEEE Transactions on Wireless Communications
Exploiting wireless channel State information for throughput maximization

IEEE Transactions on Information Theory
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue has its own link (transmission) rate. The link rate of a queue can vary randomly from slot to slot. The queue lengths and channel states of all users are known at the beginning of each slot. We show the existence of an optimal policy that minimizes the long term (discounted) average sum of queue lengths. The optimal policy, in general needs to be computed numerically. Then we identify a greedy (one step optimal) policy, MAX-TRANS which is easy to implement and does not require the channel and traffic statistics. The cost of this policy is close to optimal and better than other well-known policies (when stable) although it is not throughput optimal for asymmetric systems. We (approximately) identify its stability region and obtain approximations for its mean queue lengths and mean delays. We also modify this policy to make it throughput optimal while retaining good performance.