Name
Title | ||
|---|---|---|
Relay Assignment in Cooperative Communication Networks: Distributed Approaches Based on Matching Theory. |
Abstract | ||
|---|---|---|
In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3837/tiis.2016.11.014 | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS |
Keywords | Field | DocType |
Relay assignment,many-to-one matching,peer effects,mutual benefit,non-substitution model | Telecommunications network,Computer science,Computer network,Relay network,Throughput,Blossom algorithm,Relay,Peer effects,Distributed computing | Journal |
Volume | Issue | ISSN |
10 | 11 | 1976-7277 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yitao Xu | 1 | 60 | 8.50 |
| Dianxiong Liu | 2 | 36 | 7.63 |
| Cheng Ding | 3 | 0 | 1.01 |
| Yuhua Xu | 4 | 857 | 69.31 |
| Zongsheng Zhang | 5 | 0 | 0.34 |