Sum-Rate Maximization in Single-Hop Wireless Networks with the On-Off Power Scheme

A single-hop wireless network with K links is considered, where the links are partitioned into M clusters, each operating in a subchannel with bandwidth W/M. We assume that the links in each cluster perform the on-off power allocation strategy proposed in [1]. The problem is to analyze the average sum-rate of the network in terms of M and under the shadow- fading effect with probability a. It is demonstrated that for M ~ o(K) and 0 < alpha les 1, where alpha is a fixed parameter, the average sum-rate of the network scales as W/alpha log K. For M ~ Theta(K), we present an upper bound for the average sum-rate. It is proved that the maximum average sum-rate of the network for every value of 0 < alpha les 1 is achieved at M = 1. In fact, in the proposed model, partitioning the bandwidth W into M subchannels has no gain in terms of enhancing the throughput.