Computer Science – Information Theory
Scientific paper
2009-02-15
Computer Science
Information Theory
Submitted to IEEE Transactions on Wireless Communications
Scientific paper
A game theoretic approach is used to derive the optimal decentralized power allocation (PA) in fast fading multiple access channels where the transmitters and receiver are equipped with multiple antennas. The players (the mobile terminals) are free to choose their PA in order to maximize their individual transmission rates (in particular they can ignore some specified centralized policies). A simple coordination mechanism between users is introduced. The nature and influence of this mechanism is studied in detail. The coordination signal indicates to the users the order in which the receiver applies successive interference cancellation and the frequency at which this order is used. Two different games are investigated: the users can either adapt their temporal PA to their decoding rank at the receiver or optimize their spatial PA between their transmit antennas. For both games a thorough analysis of the existence, uniqueness and sum-rate efficiency of the network Nash equilibrium is conducted. Analytical and simulation results are provided to assess the gap between the decentralized network performance and its equivalent virtual multiple input multiple output system, which is shown to be zero in some cases and relatively small in general.
Belmega Elena Veronica
Debbah Merouane
Lasaulce Samson
No associations
LandOfFree
Power Allocation Games for MIMO Multiple Access Channels with Coordination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Power Allocation Games for MIMO Multiple Access Channels with Coordination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Power Allocation Games for MIMO Multiple Access Channels with Coordination will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-718263