Paper Info
Title
Sum-Rate Maximization in Single-Hop Wireless Networks with the On-O Power Scheme
Abstract
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 fi. It is demonstrated that for M » o(K) and 0 < fi • 1, where fi is a fixed parameter, the average sum-rate of the network scales as W fi logK. For M » £(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 < fi • 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.
Year
DOI
Venue
2007
10.1109/ISIT.2007.4557636
ISIT
Keywords
Field
DocType
bandwidth allocation,fading channels,probability,radio links,radio networks,bandwidth allocation,on-off power scheme,probability,radio links,shadow-fading,single-hop wireless network,sum-rate maximization
Discrete mathematics,Wireless network,Computer science,Bandwidth allocation,Fading,Upper and lower bounds,Bandwidth (signal processing),Interference (wave propagation),Throughput,Maximization
Conference
Citations 
PageRank 
References 
2
0.41
10
Authors
4
Name
Order
Citations
PageRank
Jamshid Abouei118620.42
Alireza Bayesteh233724.21
Masoud Ebrahimi3314.24
Amir K. Khandani467475.15