TY - GEN
T1 - Joint Dynamic Spectrum Access and Multi-Relay Selection
T2 - 85th IEEE Vehicular Technology Conference, VTC Spring 2017
AU - Xu, Wenjun
AU - Li, Xue
AU - Wang, Yixin
AU - Lee, Chia-Han
AU - Feng, Zhiyong
PY - 2017/11/14
Y1 - 2017/11/14
N2 - In this paper, the problem of joint dynamic spectrum access and multi-relay selection is investigated in relayenabled cooperative communication systems to maximize the system sum-capacity. Since the considered problem is a mixed integer nonlinear program, which is generally intractable to find the optimal solution, two matching theory-based suboptimal algorithms are proposed to reduce the computational complexity for two different cases. For the case that each source node can only be assisted by one relay, a cyclic three-sided matching algorithm is firstly proposed to attain the stable matching results for the selection of the source node and the relay with the spectrum band used. Then, for the case that each source node can be assisted by more than one relay, a two-step matching algorithm is proposed to perform joint dynamic spectrum access and multi-relay selection. Simulation results show that the proposed algorithms, with much lower complexity compared to the optimal exhaustive search, can achieve the near-optimal performance with a gap to the optimum being less than 5%.
AB - In this paper, the problem of joint dynamic spectrum access and multi-relay selection is investigated in relayenabled cooperative communication systems to maximize the system sum-capacity. Since the considered problem is a mixed integer nonlinear program, which is generally intractable to find the optimal solution, two matching theory-based suboptimal algorithms are proposed to reduce the computational complexity for two different cases. For the case that each source node can only be assisted by one relay, a cyclic three-sided matching algorithm is firstly proposed to attain the stable matching results for the selection of the source node and the relay with the spectrum band used. Then, for the case that each source node can be assisted by more than one relay, a two-step matching algorithm is proposed to perform joint dynamic spectrum access and multi-relay selection. Simulation results show that the proposed algorithms, with much lower complexity compared to the optimal exhaustive search, can achieve the near-optimal performance with a gap to the optimum being less than 5%.
KW - Cyclic three-sided matching
KW - Dynamic spectrum access
KW - Matching theory
KW - Multi-relay
KW - Two-step matching
UR - http://www.scopus.com/inward/record.url?scp=85040593513&partnerID=8YFLogxK
U2 - 10.1109/VTCSpring.2017.8108230
DO - 10.1109/VTCSpring.2017.8108230
M3 - Conference contribution
AN - SCOPUS:85040593513
T3 - IEEE Vehicular Technology Conference
BT - 2017 IEEE 85th Vehicular Technology Conference, VTC Spring 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 4 June 2017 through 7 June 2017
ER -