• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Relay Assignment in Cooperative Communication Networks: Distributed Approaches Based on Matching Theory

Vol. 10, No. 11, November 29, 2016
10.3837/tiis.2016.11.014, Download Paper (Free):

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 aMutual 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.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Y. Xu, D. Liu, C. Ding, Y. Xu and Z. Zhang, "Relay Assignment in Cooperative Communication Networks: Distributed Approaches Based on Matching Theory," KSII Transactions on Internet and Information Systems, vol. 10, no. 11, pp. 5455-5475, 2016. DOI: 10.3837/tiis.2016.11.014.

[ACM Style]
Yitao Xu, Dianxiong Liu, Cheng Ding, Yuhua Xu, and Zongsheng Zhang. 2016. Relay Assignment in Cooperative Communication Networks: Distributed Approaches Based on Matching Theory. KSII Transactions on Internet and Information Systems, 10, 11, (2016), 5455-5475. DOI: 10.3837/tiis.2016.11.014.