Sharma, Vinod and Prasad, DK and Altman, Eitan (2007) Opportunistic scheduling of wireless links. In: ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks, June 2007 , Heidelberg.
Opportunis.pdf - Published Version
Restricted to Registered users only
Download (486Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer-Verlag Berlin.|
|Keywords:||Wireless channel;opportunistic scheduling;greedy scheduling; throughput optimal scheduling;performance analysis.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||17 Oct 2011 06:01|
|Last Modified:||17 Oct 2011 06:01|
Actions (login required)