IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference 2008
DOI: 10.1109/glocom.2008.ecp.798
|View full text |Cite
|
Sign up to set email alerts
|

A Distributed Resource Control for Fairness in OFDMA Systems: English-Auction Game with Imperfect Information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
18
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(18 citation statements)
references
References 14 publications
0
18
0
Order By: Relevance
“…In this particular example, a good trade-off between performance and complexity is D = {8, 16} and p kn = 600 nW. Using these values, the number of operations of the proposed algorithm is experimentally lower than the product K · N, and so considerably lower than the number of operations required by the schemes available in the literature (e.g., see [6,16,18]). Our experiments with different data rate demands show that a smaller data rate reduces also the number of operations significantly.…”
Section: Numerical Resultsmentioning
confidence: 88%
See 1 more Smart Citation
“…In this particular example, a good trade-off between performance and complexity is D = {8, 16} and p kn = 600 nW. Using these values, the number of operations of the proposed algorithm is experimentally lower than the product K · N, and so considerably lower than the number of operations required by the schemes available in the literature (e.g., see [6,16,18]). Our experiments with different data rate demands show that a smaller data rate reduces also the number of operations significantly.…”
Section: Numerical Resultsmentioning
confidence: 88%
“…The complexity of this algorithm is O(K N + K 2 ), again without considering the solution of the RBS. In [18], Noh proposes a distributed and iterative auction-based algorithm in the OFDMA uplink scenario with incomplete information. The experimental complexity of the algorithm is O(K Nlog 2 K).…”
Section: Introductionmentioning
confidence: 99%
“…Non-cooperative game can solve the issue of some undesirable Nash equilibrium that sometimes affects cooperative strategies. In [7], an iterative resource control algorithm for distributed OFDMA systems using an auction game is proposed. Users and BS control the transmitted power and bid to maximize their utility.…”
Section: Introductionmentioning
confidence: 99%
“…The Nash Bargaining Solution (NBS) is considered in [4] together with coalition in order to find an optimal agreement among negotiating users. Other approaches considering the use of game theory in OFDMA RRM have been proposed by Han, Ji and Liu in [6] and by Noh in [7]. In [6] a non-cooperative resource competition game is proposed in opposition to the cooperative approach of [4].…”
Section: Introductionmentioning
confidence: 99%
“…The scenario showed that employing interference avoidance schemes in the network improved the overall network utility. In the English auction game proposed as in [18], users bid for the decoding priorities and the winner obtains the highest decoding priority on a given subcarrier. Authors in [19] examined a distributed RA solution in an uplink multi-cell OFDMA system using Shapley's potential games.…”
Section: Introductionmentioning
confidence: 99%