Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1504/IJAHUC.2012.045540 | IJAHUC |
Keywords | Field | DocType |
proportional fairness relay assignment,max-min fairness,pfra algorithm,lexicographical max-min fairness,wireless network,proportional fairness,wireless cooperative network,network throughput,proposed algorithm,bipartite matching,lexicographical fairness relay assignment,wireless networks | Wireless network,Relay channel,Max-min fairness,Wireless,Computer science,Computer network,Fairness measure,Maximum throughput scheduling,Throughput,Relay,Distributed computing | Journal |
Volume | Issue | ISSN |
9 | 1 | 1743-8225 |
Citations | PageRank | References |
9 | 0.52 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongli Xu | 1 | 502 | 85.92 |
| Liusheng Huang | 2 | 473 | 64.55 |
| Gang Liu | 3 | 9 | 0.86 |
| Yindong Zhang | 4 | 64 | 6.91 |
| He Huang | 5 | 79 | 18.92 |