Efficient and Fair Resource Allocation Scheme for OFDMA Networks Based on Auction Game
Autor: | Seyed Mohamad Alavi, Chi Zhou, Wan Wang Gen |
---|---|
Rok vydání: | 2012 |
Předmět: |
Combinatorial auction
Computer Science::Computer Science and Game Theory Mathematical optimization Resource (project management) Frequency-division multiple access Computer science Auction theory Telecommunications link Simulated annealing TheoryofComputation_GENERAL Resource allocation Auction algorithm Valuation (finance) |
Zdroj: | VTC Fall |
DOI: | 10.1109/vtcfall.2012.6399339 |
Popis: | A distributed allocation of resources in the uplink of OFDMA networks is studied through auction theory. A combinatorial auction is formulated and the solutions are provided. Moreover, the users' utility, which is a function of minimum rate requirement and channel gain is defined to enforce truthful resource demands. Since the original problem is NP hard, a method based on simulated annealing applied to find near-optimum results. In a competitive scenario the user valuation is sent to the Resource Allocation Unit (RAU) as the proposed bid, and then the highest bidder wins the auction and pays a value. The algorithm is shown to provide fair distribution of resources among users. Simulation results are presented to illustrate the convergence of the algorithm, the truth-telling behavior of the users, and performance utilization of the network. |
Databáze: | OpenAIRE |
Externí odkaz: |