Matrix analysis
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Convex Optimization
A game-theoretic approach for distributed power control in interference relay channels
IEEE Transactions on Wireless Communications
Centralized and distributed power allocation in multi-user wireless relay networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Practical algorithms for a family of waterfilling solutions
IEEE Transactions on Signal Processing
Autonomous Spectrum Balancing for Digital Subscriber Lines
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Distributed Spectrum Management Algorithms for Multiuser DSL Networks
IEEE Transactions on Signal Processing - Part I
Opportunistic cooperation by dynamic resource allocation
IEEE Transactions on Wireless Communications
Amplify-and-forward cooperation under interference-limited spatial reuse of the relay slot
IEEE Transactions on Wireless Communications - Part 2
Capacity of fading channels with channel side information
IEEE Transactions on Information Theory
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Wireless channel allocation using an auction algorithm
IEEE Journal on Selected Areas in Communications
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
Spectral efficient protocols for half-duplex fading relay channels
IEEE Journal on Selected Areas in Communications
Auction-Based Resource Allocation for Cooperative Communications
IEEE Journal on Selected Areas in Communications
Wireless Personal Communications: An International Journal
Power Allocation for Amplify-and-Forward Relaying with Correlated Shadowing
Wireless Personal Communications: An International Journal
Hi-index | 0.02 |
In this paper, we consider the amplify-and-forward relaying transmission in the downlink of a multi-channel cellular network with one base station and multiple relay-destination pairs. Spatial reuse of the relaying slot by allowing simultaneous transmissions from the relays is adopted to avoid the spectral loss incurred by the half-duplex relays. The relays are modeled as rational agents engaging in a non-cooperative game. In order to maximize its individual rate, each relay node iteratively allocates its power across different subchannels based on local information, while treating the signals from the other users as additive noise. First, we propose a distributed algorithm based on best response that is applicable in any signal to interference plus noise ratio (SINR) regions. Then, by focusing on the low SINR region, we propose a modified iterative water-filling algorithm. The existence of Nash equilibrium (NE) is guaranteed and the sufficient condition to reach a NE iteratively is determined. Next, we consider medium to high SINR regions and propose a distributed algorithm based on the sub-optimal response, which can be shown to reduce to the classic Gaussian interference channel model, for which analytical sufficient conditions for the convergence to the unique NE can be readily obtained. Finally, we extend the analysis to a general network topology wherein the users having different channel conditions coexist. The results show that, in low SINR regions, the proposed modified iterative water-filling algorithm yields a higher average sum rate than two simplified algorithms, i.e., the equal power allocation scheme and the conventional time-division based protocol, while in medium to high SINR regions, the sub-optimal-response based algorithm outperforms these two simplified algorithms in terms of the average sum rate.