2 research outputs found
On the Throughput Maximization in Dencentralized Wireless Networks
A distributed single-hop wireless network with links is considered, where
the links are partitioned into a fixed number () of clusters each operating
in a subchannel with bandwidth . The subchannels are assumed to be
orthogonal to each other. A general shadow-fading model, described by
parameters , is considered where denotes the
probability of shadowing and () represents the average
cross-link gains. The main goal of this paper is to find the maximum network
throughput in the asymptotic regime of , which is achieved by: i)
proposing a distributed and non-iterative power allocation strategy, where the
objective of each user is to maximize its best estimate (based on its local
information, i.e., direct channel gain) of the average network throughput, and
ii) choosing the optimum value for . In the first part of the paper, the
network hroughput is defined as the \textit{average sum-rate} of the network,
which is shown to scale as . Moreover, it is proved that in
the strong interference scenario, the optimum power allocation strategy for
each user is a threshold-based on-off scheme. In the second part, the network
throughput is defined as the \textit{guaranteed sum-rate}, when the outage
probability approaches zero. In this scenario, it is demonstrated that the
on-off power allocation scheme maximizes the throughput, which scales as
. Moreover, the optimum spectrum sharing for
maximizing the average sum-rate and the guaranteed sum-rate is achieved at M=1.Comment: Submitted to IEEE Transactions on Information Theor
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 α. It is demonstrated that for M ∼ o(K) and 0 < α ≤ 1, where α is fixed, the average sum-rate of the network scales as W α K lo