In this paper, we have proposed a multi-relay selection and power allocation scheme for two-way relay network which aims to maximize the sum-rate of two-way relay system. First, to prolong network lifetime, a multi-re...In this paper, we have proposed a multi-relay selection and power allocation scheme for two-way relay network which aims to maximize the sum-rate of two-way relay system. First, to prolong network lifetime, a multi-relay selection strategy is proposed in which both channel state information (CSI) and remaining energy (RE) are considered. Next, a multi-relay power allocation algorithm based on convex optimization (MRPA-CO) is presented. To reduce the computational complexity, it can be divided into two steps: terminal nodes power allocation (TNPA) and relay nodes power allocation (RNPA). Simulation results indicate that the proposed relay selection strategy can significantly prolong network lifetime compared to other relay selection strategies which consider CSI only, and the MRPA-CO algorithm has great advantage over equal power allocation (EPA) on sum-rate in two-way relay network.展开更多
This paper proposes rate-maximized (MR) joint subcarrier pairing (SP) and power allocation (PA) (MR-SP&PA), a novel scheme for maximizing the weighted sum rate of the orthogonal-frequency-division multiplexi...This paper proposes rate-maximized (MR) joint subcarrier pairing (SP) and power allocation (PA) (MR-SP&PA), a novel scheme for maximizing the weighted sum rate of the orthogonal-frequency-division multiplexing (OFDM) relaying system with a decode-and-forward (DF) relay. MR-SP&PA is based on the joint optimization of both SP and power allocation with total power constraint, and formulated as a mixed integer programming problem in the paper. The programming problem is then transformed to a convex optimization problem by using continuous relaxation, and solved in the Lagrangian dual domain. Simulation results show that MR-SP&PA can maximize the weighted sum rate under total power constraint and outperform equal power allocation (EPA) and proportion power allocation (PCG).展开更多
基金supported by the National Natural Science Foundation of China (61201205)the Natural Science Foundation Project of CQ CSTC (cstc2012jjA40042)+2 种基金the Chongqing Natural Science Foundation (cstc2013jjB40001)the special fund of Chongqing key laboratory (CSTC)the transformation project of excellent achievement of Chongqing Municipal Education Commission (Kjzh11206)
文摘In this paper, we have proposed a multi-relay selection and power allocation scheme for two-way relay network which aims to maximize the sum-rate of two-way relay system. First, to prolong network lifetime, a multi-relay selection strategy is proposed in which both channel state information (CSI) and remaining energy (RE) are considered. Next, a multi-relay power allocation algorithm based on convex optimization (MRPA-CO) is presented. To reduce the computational complexity, it can be divided into two steps: terminal nodes power allocation (TNPA) and relay nodes power allocation (RNPA). Simulation results indicate that the proposed relay selection strategy can significantly prolong network lifetime compared to other relay selection strategies which consider CSI only, and the MRPA-CO algorithm has great advantage over equal power allocation (EPA) on sum-rate in two-way relay network.
基金supported by the National Key Technology R&D Program (2008BAH30B10)the National Natural Science Foundation of China (60972070)+1 种基金the Chongqing Municipal Science & Technology Development Program,China (CSTC2010A-C2143)the Natural Science Foundation of Chongqing,China (CSTC2009B-A2090)
文摘This paper proposes rate-maximized (MR) joint subcarrier pairing (SP) and power allocation (PA) (MR-SP&PA), a novel scheme for maximizing the weighted sum rate of the orthogonal-frequency-division multiplexing (OFDM) relaying system with a decode-and-forward (DF) relay. MR-SP&PA is based on the joint optimization of both SP and power allocation with total power constraint, and formulated as a mixed integer programming problem in the paper. The programming problem is then transformed to a convex optimization problem by using continuous relaxation, and solved in the Lagrangian dual domain. Simulation results show that MR-SP&PA can maximize the weighted sum rate under total power constraint and outperform equal power allocation (EPA) and proportion power allocation (PCG).