|
 ABSTRACT
Opportunistic scheduling is a key mechanism for improving the performance of wireless systems. However, this mechanism requires that transmitters are aware of channel conditions (or CSI, Channel State Information) to the various possible receivers. CSI is not automatically available at the transmitters, rather it has to be acquired. Acquiring CSI consumes resources, and only the remaining resources can be used for actual data transmissions. We explore the resulting trade-off between acquiring CSI and exploiting channel diversity to the various receivers. Specifically, we consider a system consisting of a transmitter and a fixed number of receivers/users. An infinite buffer is associated to each receiver, and packets arrive in this buffer according to some stochastic process with fixed intensity. We study the impact of limited channel information on the stability of the system. We characterize its stability region, and show that an adaptive queue length-based policy can achieve stability whenever doing so is possible. We formulate a Markov Decision Process problem to characterize this queue length-based policy. In certain specific and yet relevant cases, we explicitly compute the optimal policy. In general case, we provide a scheduling policy that achieves a fixed fraction of the system's stability region. Scheduling with limited information is a problem that naturally arises in cognitive radio systems, and our results can be used in these systems.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
3GPP TS 25.308. Utra high speed downlink packet access (hsdpa); overall description. In Release 5, 2003.
|
| |
2
|
M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, P. Whiting, and R. Vijayakumar. Providing quality of service over a shared wireless link. IEEE Communications Magazine, 39(2):150--154, Feb 2001.
|
| |
3
|
P. Bender, Black, M. Grob, Padovani R, N. Sindhushyana, and S. Viterbi. Cdma/hdr: a bandwidth efficient high speed wireless data servicefor nomadic users. IEEE Communications Magazine, 38(7):70--77, Jul 2000.
|
| |
4
|
|
| |
5
|
S. Borst and P. Whiting. Dynamic rate control algorithms for hdr throughput optimization. In IEEE INFOCOM, Anchorage, Alaska, Apr 2001.
|
| |
6
|
G. Caire, R. Müller, and R. Knopp. Multiuser diversity in wireless systems: Delay-limited vs. scheduling. IEEE Transactions on Information Theory, 2007.
|
 |
7
|
|
| |
8
|
P. Chaporkar and A. Proutiere. Optimal joint probing and transmission strategy for maximizing throughput in wireless systems. IEEE Journal on Selected Areas in Communications, 26(18):1546--1556, Oct 2008.
|
| |
9
|
Yuan-Shih Chow, H. Robbins, and D. Siegmund. Great Expectations: Theory of Optimal Stopping. Houghton Mifflin Co, Jun 1972.
|
| |
10
|
G. Fayolle, V.A. Malyshev, and M.V. Menshikov. Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press, 1995.
|
| |
11
|
S. Guha, K. Mungala, and S. Sarkar. Jointly optimal transmission and probing strategies for multichannel wireless systems. In Conference on Information Sciences and Systems (CISS), Mar 2006. (Invited Paper).
|
| |
12
|
|
| |
13
|
J. Holtzman. Asymptotic analysis of proportional fair algorithm. In IEEE PIMRC, 2001.
|
| |
14
|
Zhengrong Ji , Yi Yang , Junlan Zhou , Mineo Takai , Rajive Bagrodia, Exploiting medium access diversity in rate adaptive wireless LANs, Proceedings of the 10th annual international conference on Mobile computing and networking, September 26-October 01, 2004, Philadelphia, PA, USA
[doi> 10.1145/1023720.1023754]
|
| |
15
|
K. Kar, X. Luo, , and S. Sarkar. Throughput-optimal scheduling in multichannel access point networks under infrequent channel measurements. In IEEE INFOCOM, Anchorage, USA, May 2007.
|
| |
16
|
R. Knopp and P. Humblet. Information capacity and power control in single cell multiuser communications. In IEEE International Conf. on Communications (ICC), pages 331--335, Seattle, WA, Jun. 1995.
|
| |
17
|
H.J. Kushner and P.A. Whiting. Asymptotic properties of proportional fair sharing algorithms. In 40th Annual Allerton Conf. Commun. Control Comp., 2002.
|
| |
18
|
M. Neely and E. Modiano. Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Trans. on Inform. Theory, 51(6):1917--1937, Jun 2005.
|
| |
19
|
H. Robbins. Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc., 1952.
|
| |
20
|
|
| |
21
|
S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. American Mathematical Society Translations, Series 2, A volume in memory of F. Karpelevich, 2002.
|
| |
22
|
|
| |
23
|
A. Stolyar and K. Ramanan. Largest weighted delay first scheduling: Large deviations andoptimality. Annals of Applied Probability, 11(1):1--48, 2001.
|
| |
24
|
L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. on Automatic Control, 37(12):1936--1948, Dec 1992.
|
| |
25
|
L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Trans. Infor. Theory, 39(2):466--478, Mar 1993.
|
| |
26
|
V. Tsibonis, L. Georgiadis, and L. Tassiulas. Exploiting wireless channel state information for throughput maximization. In IEEE Infocom, 2003.
|
| |
27
|
P. Viswanath, D. Tse, and R. Laroia. Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48(6), June 2002.
|
| |
28
|
P. Whittle. Restless bandits: Activity allocation in a changing world. Journal of Applied Probability, 25:287--298, 1988. Special Issue: A Celebration of Applied Probability.
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
C.2