Title: Optimal relay assignment for fairness in wireless cooperative networks

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

Addresses: 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 China, Suzhou, Jiangsu 215123, China. ' 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 China, Suzhou, Jiangsu 215123, China. ' 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 China, Suzhou, Jiangsu 215123, China. ' 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 China, Suzhou, Jiangsu 215123, China. ' 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 China, Suzhou, Jiangsu 215123, China

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.

Keywords: relay assignment; cooperative communication; proportional fairness; lexicographical fairness; network throughput; wireless networks; relay node selection.

DOI: 10.1504/IJAHUC.2012.045540

International Journal of Ad Hoc and Ubiquitous Computing, 2012 Vol.9 No.1, pp.42 - 53

Available online: 22 Feb 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article