Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

A Resource Allocation with Balanced Data Throughput and Power Consumption under QoS Constraint in MIMO Interference Systems: A Noncooperative Game Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hojoong Kwon ; Sch. of Electr. Eng. & INMC, Seoul Nat. Univ., Seoul ; Byeong Gi Lee

In this paper, we investigate resource allocation in MIMO interference systems where multiple MIMO links share the same frequency band and interfere with each other. For MIMO transmission scheme, we consider a spatial multiplexing scheme that uses linear precoder and decoder. We impose the SINR constraint that the received SINR of each data sub-stream should be larger than a predetermined threshold, and the QoS constraint that the data throughput of individual link should be larger than a required level. In this system, a trade-off exists between the data throughput and the power consumption due to the co-channel interference among the multiple MIMO links. So we arrange a new resource allocation algorithm such that the data throughput and the power consumption are balanced and the QoS constraint is met for each link. We model the resource allocation problem as a noncooperative game and devise a distributed resource allocation algorithm in which the constituent links find a Nash equilibrium point without coordination. The proposed algorithm turns out to perform close to the optimal point achieved by centralized optimization.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008