Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Resource Allocation for Wireless Networks: Basics, Techniques, and Applications
Dynamic Spectrum Access and Management in Cognitive Radio Networks
Dynamic Spectrum Access and Management in Cognitive Radio Networks
Autonomous Spectrum Balancing for Digital Subscriber Lines
IEEE Transactions on Signal Processing
Iterative water-filling for Gaussian vector multiple-access channels
IEEE Transactions on Information Theory
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Non-Cooperative Resource Competition Game by Virtual Referee in Multi-Cell OFDMA Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Multi-user rate region maximization for the interference channel has attracted great attention recently. However, close to optimal performance algorithms have high complexity, while the fast and distributed algorithms such as the iterative waterfilling algorithm suffer from poor performances, especially when the interferences are severe. Moreover, a lot of works deal with the case when the number of sub-channels L is equal to one, or perform well with a large number L (i.e. asymptotic case). Few works investigate the optimality under the small and finite L. For networks like cognitive radios, the secondary users can only sense a limited number of available sub-channels. As a result, rate region maximization for finite number of sub-channels becomes an issue of vital importance. In this paper, we propose a heuristic solution for the rate region maximization with low complexity and high performance. The basic idea is to select a limited set of combinations of subchannel assignments which most likely achieve the boundary of the rate region, and then construct the convex hull based on the iterative distributed solution. The complexity of the proposed algorithm is O(N2L2 log L) (without multilevel searches in the Optimal Spectrum Balancing (OSB) algorithm), where N is the number of users. Simulation results show that the proposed scheme can achieve performances comparable to those of a full search solution and OSB solution, and significantly better than the iterative waterfilling scheme in the high interference case.