Opportunistic scheduling in large-scale wireless networks

In this paper, we consider a distributed one-hop wireless network with n pairs of transmitters and receivers. It is assumed that each transmitter/receiver node is only connected to k receiver/transmitter nodes which are defined as neighboring nodes. The channel between the neighboring nodes is assumed to be Rayleigh fading. The objective is to find the maximum achievable sum-rate of the network in the asymptotic case of n, k ¿ ¿. It is shown that the asymptotic throughput of the system scales as n log k/k. An opportunistic on-off scheduling is proposed and shown to be asymptotically throughput optimal.