Sciweavers

13 search results - page 1 / 3
» Throughput and Channel Access Statistics of Generalized Sele...
Sort
View
TWC
2008
91views more  TWC 2008»
13 years 4 months ago
Throughput and Channel Access Statistics of Generalized Selection Multiuser Scheduling
To provide a near-optimal low-complexity solution to parallel multiuser scheduling in code-division multiple-access (CDMA), we propose generalized selection multiuser diversity (GS...
Yao Ma, Jinghua Jin, Dongbo Zhang
ICC
2007
IEEE
123views Communications» more  ICC 2007»
13 years 11 months ago
Channel Access Statistics of Parallel Multiuser Scheduling
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Yao Ma, Dongbo Zhang
INFOCOM
2003
IEEE
13 years 10 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
WIOPT
2011
IEEE
12 years 8 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
ICC
2007
IEEE
13 years 11 months ago
Proportional Fair Scheduling for Downlink OFDMA
— In this paper, the author studies the sum throughput maximization with proportional fair scheduling (PFS) for downlink orthogonal frequency division multiple access (OFDMA) cha...
Yao Ma