Optimal relay assignment for fairness in wireless cooperative networks. (23rd February 2012)

• Record Type: Journal Article
• Authors: Xu, Hongli; Huang, Liusheng; Liu, Gang; Zhang, Yindong; Huang, He
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 9:Number 1(2012)
• Page Start: 42
• Page End: 53
• Publication Date: 2012-02-23
• Subjects: relay assignment -- cooperative communication -- proportional fairness -- lexicographical fairness -- network throughput -- wireless networks -- relay node selection; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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.