Abstract-In this paper, we develop medium access control protocols to enable users in a wireless network to opportunistia l l y transmit when they hare 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 hest channel. First. we present a basic algorithm for a system with i.i.d. block fading and a fired number of backlogged users. We give nn analysis of the throughput of this system and show that the average number of mini-slots required to find the user with the hest channel is less than 2 5 independent of the number of usen or the fading distribution. We then extend this algorithm to B channel with memory and also develop a reservation based scheme that offers improved performance ns the channel memory increases. Finally we consider a model with random arrivals and propose a modified algorithm for this c a . Simulation results are given to illustrate the performance in each of these settings. .
In REF , the authors propose an opportunistic splitting algorithm for a multipoint-to-point wireless network.
Opportunistic splitting algorithms for wireless networks
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science