On the empirical distribution of eigenvalues of a class of large dimensional random matrices
Journal of Multivariate Analysis
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1)
Distributed communication control mechanisms for ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Spectral efficiency of CDMA with random spreading
IEEE Transactions on Information Theory
Linear multiuser receivers: effective interference, effective bandwidth and user capacity
IEEE Transactions on Information Theory
Linear multiuser receivers in random environments
IEEE Transactions on Information Theory
The impact of frequency-flat fading on the spectral efficiency of CDMA
IEEE Transactions on Information Theory
Optimum power allocation for parallel Gaussian channels with arbitrary input distributions
IEEE Transactions on Information Theory
Scaling results on the sum capacity of cellular networks with MIMO links
IEEE Transactions on Information Theory
Multicell uplink spectral efficiency of coded DS-CDMA with random signatures
IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We considered a dense interference network with a large number (K → ∞) of transmitter-receiver pairs. Each transmitter is endowed with a finite buffer and accepts packets from an arrival process. Each transmitter-receiver link is a fading vector channel with N diversity paths whose statistics are described by a Markov chain. We investigate distributed algorithms for joint admission control, rate and power allocation aiming at maximizing the individual throughput defined as the average information rate successfully received. The decisions are based on the statistical knowledge of the channel and buffer states of the other communication pairs and on the exact knowledge of their own channel and buffer states. In the case of a finite number of communication pairs this problem is computationally extremely intensive with an exponential complexity in the number of users. Assuming that K, N → ∞ with constant ratio the algorithm complexity becomes substantially independent of the number of active communications and grows with the groups of users having distinct asym ptotic channel statistics. The cross-layer design is investigated for different kind of decoders at the receiver. The benefits of a cross layer approach compared to a resource allocation ignoring the states of the queues are assessed. The performance loss due to the use of policies designed for asym ptotic conditions and applied to networks with a finite number of active communications is studied.