Opportunistic scheduling in large-scale wireless networks
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Throughput scaling of wireless networks with random connections
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimal throughput of two-hop relay networks with different relay cooperation
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Throughput scaling of wireless networks with random connections
IEEE Transactions on Information Theory
Virtual cooperation for throughput maximization in distributed large-scale wireless networks
EURASIP Journal on Advances in Signal Processing - Special issue on cooperative MIMO multicell networks
| Hi-index | 754.90 |
A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like log n; (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.