Abstract
This paper deals with the problem of distributed resource allocation in multiple-input multiple-output multi-carrier multiple-Access channel networks. The assignment between users and subcarriers is allocated together with the users' transmit powers for energy efficiency maximization, by means of a novel approach which merges the popular Dinkelbach's algorithm with the frameworks of distributed auction theory and stable matching. Two distributed algorithms are presented, which can be implemented in a fully decentralized way. The former is guaranteed to converge to the global optimum of the system energy efficiency, up to a threshold which can be set in advance, while the latter enjoys weaker optimality properties, but has an even lower computational complexity. Additionally, we develop a novel energy consumption model which explicitly accounts for the energy consumption due to feedback transmissions. Employing this new model, it is shown that the proposed distributed algorithms can even outperform centralized resource allocations which require a larger feedback energy consumption.
Original language | English |
---|---|
Article number | 7676375 |
Pages (from-to) | 3451-3465 |
Number of pages | 15 |
Journal | IEEE Journal on Selected Areas in Communications |
Volume | 34 |
Issue number | 12 |
DOIs | |
State | Published - Dec 2016 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 1983-2012 IEEE.
Keywords
- Dinkelbach's algorithm
- Energy Efficiency
- distributed auction
- multi-carrier
- multipleantenna
- stable matching theory