Optimal relay assignment for fairness in wireless cooperative networks

  • Authors:
  • Hongli Xu;Liusheng Huang;Gang Liu;Yindong Zhang;He Huang

  • Affiliations:
  • School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China/ Suzhou Institute for Advanced Study, University of Science and Technology of C ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China/ Suzhou Institute for Advanced Study, University of Science and Technology of C ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China/ Suzhou Institute for Advanced Study, University of Science and Technology of C ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China/ Suzhou Institute for Advanced Study, University of Science and Technology of C ...;School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China/ Suzhou Institute for Advanced Study, University of Science and Technology of C ...

  • Venue:
  • International Journal of Ad Hoc and Ubiquitous Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Under this cooperative communication, the selection of relay node significantly affects the performance of wireless networks. The previous researches optimised the Max-Min Fairness (MF), which may drastically decrease the network throughput. Thus, this paper studies the fairness-aware relay assignment to improve the network throughput. First, we develop the PFRA algorithm, which assigns the relays by saturated bipartite matching, to reach the proportional fairness. Next, a distributed version of Proportional Fairness Relay Assignment (PFRA) algorithm is also proposed. Moreover, lexicographical Max-Min fairness is achieved by Lexicographical Fairness Relay Assignment (LFRA) algorithm. We formally prove the optimality of above three algorithms. The experimental results show the efficiency of the proposed algorithms.