Graph-based path selection and power allocation for relay-aided transmission
Lu Lu, Dawei He, Qiqin Xie, Geoffrey Ye Li, Xingxing Yu · 2016
In this paper, we study path selection and power allocation problems for relay-aided systems with multiple source, relay, and destination nodes. To take fairness among different links into account, we aim at maximizing the minimum source-relay-destination link rate performance. We consider the scenario that the source node can be paired with any destination node. For this scenario, we decouple the original path selection and power allocation problem as two graph-based matching problems and develop algorithms to solve the formulated matching problems with and without sum power constraint, respectively. Numerical results show that our proposed algorithms outperform random matching algorithms in all scenarios and the corresponding performance gains increase with the number of nodes.