A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Convex Optimization
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
On the throughput, capacity, and stability regions of random multiple access
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Accurate capture models and their impact on random access in multiple-destination networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Game Theoretic Cross-Layer Transmission Policies in Multipacket Reception Wireless Networks
IEEE Transactions on Signal Processing
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Exploiting decentralized channel state information for random access
IEEE Transactions on Information Theory
Distributed opportunistic scheduling with two-level probing
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
We consider a random-access-based ad hoc network, where different links use mini-slots to contend for the channel, and then successful links transmit data packets, as in CSMA. The focus of our study is to develop optimal strategies for physical-layer-aware (PHY-aware) distributed scheduling, which involves a joint process of channel probing and distributed scheduling. Because of channel fading and cochannel interference, the signal-to-interference-plus-noise-ratio (SINR) across links is highly dynamic and can exhibit significant variation. In the low SINR case, further channel probing is likely to lead to better SINR conditions and hence yield higher throughput. The desired tradeoff boils down to judiciously choosing the optimal stopping strategy for channel probing before data transmissions. In this paper, we investigate PHY-aware distributed scheduling, aiming to maximize the overall network throughput. The problem under consideration is inherently challenging: 1) multiple links can transmit successfully simultaneously and the number of simultaneously transmitting links is random; and 2) the network throughput is the sum rate of all transmitting links, but each link involved in the transmission has no knowledge of the instantaneous rates of other links, and the stopping decision is made in a distributed manner based on local information only. We use optimal stopping theory to tackle this challenge, and show that the optimal policy for distributed scheduling has a threshold structure. Accordingly, after a channel probing, a link would proceed with data transmissions only if a function of its instantaneous rate is greater than the optimal rate threshold. Observing that the network throughput depends heavily on the contention probability of each link, we generalize the study to jointly optimize the rate threshold and the contention probability, and propose a two-stage algorithm for computing the pair of optimal rate threshold and contention probability by using fractional optimization and geometric programming.