Abstract
This paper focuses on the problem of fair resource allocation in wireless multi-user multi-relay networks where both constant-rate users and variable-rate users exist. The problem is formulated as an optimization problem targeting at finding the Nash bargaining solution for the variable-rate users subject to a set of users' rate constraints and a set of relay power constraints. The formulated problem is proven to be a concave maximization problem, and the dual decomposition method is employed to find the optimal solution. Based on this method, a distributed algorithm is then proposed and its convergence is proved as well. Finally, simulations validate the convergence and fairness of the proposed algorithm. © 2011 IEEE.
| Original language | English |
|---|---|
| Title of host publication | 11th International Symposium on Communications and Information Technologies, ISCIT 2011 |
| Pages | 333-338 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 11th International Symposium on Communications and Information Technologies, ISCIT 2011 - Hangzhou, China Duration: 12 Oct 2011 → 14 Oct 2011 |
Conference
| Conference | 11th International Symposium on Communications and Information Technologies, ISCIT 2011 |
|---|---|
| Place | China |
| City | Hangzhou |
| Period | 12/10/11 → 14/10/11 |