Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission

In this letter, we study path selection and power allocation for decode-and-forward 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 under two scenarios depending on whether source nodes have their targeted destination nodes or not. For each scenario, graph-based algorithms are proposed to find the optimal solutions for cases with/without sum power constraints on relay nodes.

[1]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[2]  Yingbin Liang,et al.  Cooperative Relay Broadcast Channels , 2005, IEEE Transactions on Information Theory.

[3]  Raviraj S. Adve,et al.  Relay selection and power allocation in cooperative cellular networks , 2009, IEEE Transactions on Wireless Communications.

[4]  Robert Schober,et al.  Relay Selection for Simultaneous Information Transmission and Wireless Energy Transfer: A Tradeoff Perspective , 2013, IEEE Journal on Selected Areas in Communications.

[5]  Geoffrey Ye Li,et al.  Graph-based path selection and power allocation for relay-aided transmission , 2016, 2016 IEEE Wireless Communications and Networking Conference.

[6]  Jiannong Cao,et al.  Optimal Relay Assignment and Power Allocation for Cooperative Communications , 2013, Journal of Computer Science and Technology.

[7]  Geoffrey Ye Li,et al.  Energy-efficient resource allocation for cognitive radio networks , 2013, 2013 IEEE Global Communications Conference (GLOBECOM).

[8]  Geoffrey Ye Li,et al.  Graph-based robust resource allocation for cognitive radio networks , 2015, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[9]  Daniel Benevides da Costa,et al.  An Efficient Relay–Destination Selection Scheme for Multiuser Multirelay Downlink Cooperative Networks , 2012, IEEE Transactions on Vehicular Technology.

[10]  Neelesh B. Mehta,et al.  En Masse Relay Selection Algorithms for Multi-Source, Multi-Relay, Decode-and-Forward Cooperative Systems , 2013, IEEE Transactions on Communications.

[11]  Jing Li,et al.  Amplify-forward and decode-forward: the impact of location and capacity contour , 2005, MILCOM 2005 - 2005 IEEE Military Communications Conference.

[12]  Xing Zhang,et al.  Performance analysis of multiuser diversity in cooperative multi-relay networks under rayleigh-fading channels , 2009, IEEE Transactions on Wireless Communications.

[13]  Robert E. Tarjan,et al.  Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.

[14]  Yindi Jing,et al.  Power Allocation in Multi-User Wireless Relay Networks through Bargaining , 2013, IEEE Transactions on Wireless Communications.

[15]  Gang Feng,et al.  Fair Resource Allocation and Admission Control in Wireless Multiuser Amplify-and-Forward Relay Networks , 2012, IEEE Transactions on Vehicular Technology.

[16]  K. J. Ray Liu,et al.  Cooperative communications with relay-selection: when to cooperate and whom to cooperate with? , 2008, IEEE Transactions on Wireless Communications.

[17]  Raviraj S. Adve,et al.  Selection cooperation in multi-source cooperative networks , 2008, IEEE Transactions on Wireless Communications.

[18]  Tho Le-Ngoc,et al.  Power allocation in wireless multi-user relay networks , 2009, IEEE Transactions on Wireless Communications.