Joseph, V and Sharma, V and Mukherji, U (2010) Providing quality of service via opportunistic splitting using stochastic approximation. In: 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Sept. 29 2010-Oct. 1 2010, Allerton, IL.
Providing.pdf - Published Version
Restricted to Registered users only
Download (422Kb) | Request a copy
We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||20 Dec 2011 08:30|
|Last Modified:||20 Dec 2011 08:30|
Actions (login required)