Noncooperative power control and transmission scheduling in wireless collision channels
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Uplink SDMA with limited feedback: throughput scaling
EURASIP Journal on Advances in Signal Processing
Opportunistic CSMA/CA for achieving multi-user diversity in wireless LAN
IEEE Transactions on Wireless Communications
Improving power efficiency of CSMA wireless networks using multi-user diversity
IEEE Transactions on Wireless Communications
Opportunistic Scheduling in Multiuser OFDM Systems with Clustered Feedback
Wireless Personal Communications: An International Journal
User resource structure design with enhanced diversity for OFDMA in time-varying channels
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Transmission control with imperfect CSI in channel-aware slotted ALOHA networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Transmission control with imperfect CSI in channel-aware slotted ALOHA networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Exploiting multiuser diversity for spectrum sensing in cognitive radio networks
RWS'10 Proceedings of the 2010 IEEE conference on Radio and wireless symposium
Exploiting cooperative advantages in slotted ALOHA random access networks
IEEE Transactions on Information Theory
Hi-index | 754.90 |
In wireless fading channels, multiuser diversity can be exploited by scheduling users to transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires global knowledge of every user's channel gain, which may be difficult to obtain in some situations. This paper addresses contention-based protocols for exploiting multiuser diversity with only local channel knowledge. A variation of the ALOHA protocol is given in which users attempt to exploit multiuser diversity gains, but suffer contention losses due to the distributed channel knowledge. The growth rate of the sum throughput for this protocol is characterized in a backlogged system under both short-term and long-term average power constraints. A simple "fixed-rate" system is shown to be asymptotically optimal and to achieve the same growth rate as in a system with an optimal centralized scheduler. Moreover, asymptotically, the fraction of throughput lost due to contention is shown to be 1/e. Also, in a system with random arrivals and an infinite user population, a variation of this ALOHA protocol is shown to be stable for any total arrival rate, given that users can estimate the backlog.