TY - GEN
T1 - Opportunistic splitting algorithms for wireless networks
AU - Qin, Xiangping
AU - Berry, Randall
PY - 2004
Y1 - 2004
N2 - In this paper, we develop medium access control protocols to enable users in a wireless network to opportunistically transmit when they have favorable channel conditions, without requiring a centralized scheduler. We consider approaches that use splitting algorithms to resolve collisions over a sequence of mini-slots, and determine the user with the best channel. First, we present a basic algorithm for a system with i.i.d. block fading and a fixed number of backlogged users. We give an analysis of the throughput of this system and show that the average number of mini-slots required to find the user with the best channel is less than 2.5 independent of the number of users or the fading distribution. We then extend this algorithm to a channel with memory and also develop a reservation based scheme that offers improved performance as the channel memory increases. Finally we consider a model with random arrivals and propose a modified algorithm for this case. Simulation results are given to illustrate the performance in each of these settings.
AB - In this paper, we develop medium access control protocols to enable users in a wireless network to opportunistically transmit when they have favorable channel conditions, without requiring a centralized scheduler. We consider approaches that use splitting algorithms to resolve collisions over a sequence of mini-slots, and determine the user with the best channel. First, we present a basic algorithm for a system with i.i.d. block fading and a fixed number of backlogged users. We give an analysis of the throughput of this system and show that the average number of mini-slots required to find the user with the best channel is less than 2.5 independent of the number of users or the fading distribution. We then extend this algorithm to a channel with memory and also develop a reservation based scheme that offers improved performance as the channel memory increases. Finally we consider a model with random arrivals and propose a modified algorithm for this case. Simulation results are given to illustrate the performance in each of these settings.
UR - http://www.scopus.com/inward/record.url?scp=8344242925&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8344242925&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2004.1354578
DO - 10.1109/INFCOM.2004.1354578
M3 - Conference contribution
AN - SCOPUS:8344242925
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 1662
EP - 1672
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -