Partner Selection Based on Optimal Power Allocation in Cooperative-Diversity Systems

We study how to appropriately match users for two-user cooperative-diversity (CD) systems deploying an optimal-power-allocation (OPA) strategy, considering both the amplify and forward and the regenerate and forward CD schemes. The OPA strategies, which can minimize the total energy consumption for the cooperating pair, are derived for both CD schemes. Then, we study the location of the optimal partner for a user and develop a novel nonbipartite stable matching algorithm with a performance that is very close to the optimal maximum weighted (MW) matching algorithm. The proposed matching algorithm is simple to implement, and its computational complexity is one order lower than that of the optimal MW matching algorithm. Numerical results show that with the OPA and the proposed matching algorithm, a 9~10 dB CD gain can be achieved, which is equivalent to prolonging the cell-phone-battery recharge time by about ten times.

[1]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[2]  Gerhard Fettweis,et al.  Cooperative multi-hop transmission in wireless networks , 2005, Comput. Networks.

[3]  Ian J. Wassell,et al.  Optimum power allocation in cooperative networks , 2005, SPAWC 2005.

[4]  D.L. Goeckel,et al.  Cooperative communications in mobile ad hoc networks , 2006, IEEE Signal Processing Magazine.

[5]  Elza Erkip,et al.  Cooperative regions and partner choice in coded Cooperative systems , 2006, IEEE Transactions on Communications.

[6]  Erik G. Larsson,et al.  Collaborative transmit diversity with adaptive radio resource and power allocation , 2005, IEEE Communications Letters.

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Raviraj S. Adve,et al.  Theoretical analysis of cooperative diversity in wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  J. Nicholas Laneman,et al.  Cooperative diversity in wireless networks: algorithms and architectures , 2002 .

[10]  Xuemin Shen,et al.  Maximizing Cooperative Diversity Energy Gain for Wireless Networks , 2007, IEEE Transactions on Wireless Communications.

[11]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[12]  Raviraj S. Adve,et al.  Improving amplify-and-forward relay networks: optimal power allocation versus selection , 2006, IEEE Transactions on Wireless Communications.

[13]  Alexander M. Haimovich,et al.  Decode-and-Forward Cooperative Diversity with Power Allocation in Wireless Networks , 2007, IEEE Transactions on Wireless Communications.

[14]  Xuemin Shen,et al.  WLC41-2: Adaptive Regenerate and Forward Cooperative Diversity System based on Quadrature Signaling , 2006, IEEE Globecom 2006.

[15]  David Avis,et al.  A survey of heuristics for the weighted matching problem , 1983, Networks.

[16]  K. J. Ray Liu,et al.  SER performance analysis and optimum power allocation for decode-and-forward cooperation protocol in wireless networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.