4.7 Article Proceedings Paper

Fair multiuser channel allocation for OFDMA networks using nash bargaining solutions and coalitions

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 53, Issue 8, Pages 1366-1376

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2005.852826

Keywords

channel allocation; coalition; cooperative game; Nash bargaining solution; orthogonal frequency-division multiple access (OFDMA)

Ask authors/readers for more resources

In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only O((KN)-N-2 log(2) N + K-4), where N is the number of subcarriers and K is the number of users.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available