Distributed fair resource allocation in wireless multi-user multi-relay networks with heterogeneous rate constraints

Yanyan Shen, Gang Feng, Bo Yang, Xinping Guan

    Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

    3 Citations (Scopus)

    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 languageEnglish
    Title of host publication11th International Symposium on Communications and Information Technologies, ISCIT 2011
    Pages333-338
    DOIs
    Publication statusPublished - 2011
    Event11th International Symposium on Communications and Information Technologies, ISCIT 2011 - Hangzhou, China
    Duration: 12 Oct 201114 Oct 2011

    Conference

    Conference11th International Symposium on Communications and Information Technologies, ISCIT 2011
    PlaceChina
    CityHangzhou
    Period12/10/1114/10/11

    Fingerprint

    Dive into the research topics of 'Distributed fair resource allocation in wireless multi-user multi-relay networks with heterogeneous rate constraints'. Together they form a unique fingerprint.

    Cite this