Throughput and Fairness maximization in Wireless Networks

A single transmit antenna broadcast channel (BC) with large (n) number of users in a Rayleigh fading environment is considered. It is assumed each user either receives the minimum rate constraint of R min or remains silent. Recently, it is shown that by applying a proper power allocation strategy, the maximum number of active users in such channel scales asin the asymptotic case of n → ∞. The main contribution of this paper is to derive the expected delay of the optimum power allocation strategy in terms of fairness maximization. Accordingly, it is shown the expected delay of this strategy behaves like R min n log(n) log(log(n)) + ω n log(log(n)) , where the expected delay is defined as the minimum number of channel uses which guarantees each user receives at least one packet.

show abstract

“…Congruent to what is done in [8], it can be argued that (4) can be upper bounded as P r{S } ≤ n i=1 P r{S i = 0}, thus we arrive at the following…”

Section: Theoremmentioning

confidence: 99%

Delay analysis for fair power allocation strategy in Rayleigh fading Broadcast Channel

Borhani

Akhlaghi

2010

IEICE Electron. Express

View full text Add to dashboard Cite

show abstract

“…For round-robin scheduling, it is clear that D 1, K = K. For opportunistic single-user scheduling, the average scheduling delay scales as K ln K, while for the orthogonal OBF, it scales as K ln K/N t [1]. Based on the probabilistic arguments similar to [22,Theorem 3], the following theorem shows the average scheduling delay of non-orthogonal OBF with N > N t transmit beams.…”

Section: B Average Scheduling Delaymentioning

confidence: 99%

Non-Orthogonal Opportunistic Beamforming: Performance Analysis and Implementation

Xia

Wu²,

Aı̈ssa

2012

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Aiming to achieve the sum-rate capacity in multiuser multi-antenna systems where Nt antennas are implemented at the transmitter, opportunistic beamforming (OBF) generates Nt orthonormal beams and serves Nt users during each channel use, which results in high scheduling delay over the users, especially in densely populated networks. Non-orthogonal OBF with more than Nt transmit beams can be exploited to serve more users simultaneously and further decrease scheduling delay. However, the inter-beam interference will inevitably deteriorate the sum-rate. Therefore, there is a tradeoff between sum-rate and scheduling delay for non-orthogonal OBF. In this context, system performance and implementation of non-orthogonal OBF with N > Nt beams are investigated in this paper. Specifically, it is analytically shown that non-orthogonal OBF is an interferencelimited system as the number of users K → ∞. When the interbeam interference reaches its minimum for fixed Nt and N , the sum-rate scales as N ln

show abstract

“…Substituting the above upper-bound and lower-bounds in (9), after some manipulations Lemma 1 is proved. (for the detailed proof the reader is referred to [24]). …”

Section: Lemma 1 Definingmentioning

confidence: 99%

“…Finally, the theorem is proved by deriving a lower-bound on the achievable sum-rate based on the threshold level given in (4), which is performed in Lemma 4. For the proof of the lemmas, the reader is referred to [24].…”

Section: Theorem 1 Using the Proposed Algorithm For The Values Ofmentioning

confidence: 99%

See 1 more Smart Citation

Is it possible to achieve the optimum throughput and fairness simultaneously in a MIMO Broadcast Channel?

Bayesteh

Sadrabadi

Khandani

2008

2008 IEEE International Symposium on Information Theory

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, a MIMO Broadcast Channel (MIMO-BC) with large (K) number of users is considered. It is assumed that all users have a hard delay constraint D. We propose a scheduling algorithm for maximizing the throughput of the system, while satisfying the delay constraint for all users. It is proved that by using the proposed algorithm, it is possible to achieve the maximum throughput and maximum fairness in the network, simultaneously, in the asymptotic case of K → ∞. We introduce a new performance metric in the network, called "Minimum Average Throughput", and prove that the proposed algorithm is capable of maximizing the minimum average throughput in a MIMO-BC, in the asymptotic case of K → ∞. Finally, it is established that the proposed algorithm reaches the boundaries of the capacity region and stability region of the network, simultaneously, in the asymptotic case of K → ∞.

show abstract

Throughput and Fairness maximization in Wireless Networks

Cited by 7 publications

References 17 publications

Delay analysis for fair power allocation strategy in Rayleigh fading Broadcast Channel

Delay analysis for fair power allocation strategy in Rayleigh fading Broadcast Channel

Non-Orthogonal Opportunistic Beamforming: Performance Analysis and Implementation

Is it possible to achieve the optimum throughput and fairness simultaneously in a MIMO Broadcast Channel?

Contact Info

Product

Resources

About