In particular, we formulate the radio resource allocation problem in a two-hop network to guarantee the data rate of the UEs while protecting other receiving nodes from interference. Utilizing time sharing strategy, we provide a centralized solution under bounded channel uncertainty. With a view to reducing the computational burden at relay nodes, we propose a distributed solution approach using stable matching to allocate radio resources in an efficient and computationally inexpensive way. Numerical results show that the performance of the proposed method is close to the centralized optimal solution and there is a distance margin beyond which relaying of D2D traffic improves network performance. Index Terms-Device-to-device (D2D) communication, LTE-A L3 relay, uncertain channel state information, distributed resource allocation, stable matching.
Matching theory was employed in REF to solve the resource allocation problem in relay-aided D2D communications.
Distributed Resource Allocation for Relay-Aided Device-to-Device Communication Under Channel Uncertainties: A Stable Matching Approach
IEEE Transactions on Communications
IEEE Transactions on Communications
Computer Science