earticle

논문검색

Multiple Peer-To-Peer Relay Network Robust Beamforming Based on Lorentz-Positive Matrices

원문정보

초록

영어

Aiming at minimizing the total transmit power of relay nodes in the multiple peer-to-peer relay network in the presence of channel estimation error, a relay beamforming method based on Lorentz positive matrix is proposed. Firstly, assuming the channel state information of the second hop in the relay network is uncertain and the signal to noise ratios of the destination nodes are given, the expression of total relay nodes transmit power minimization optimization problem is deduced. Secondly, some real valued variables are defined and the concept of Lorentz cone is used to transform the optimization problem into a real valued problem. Finally, using the equivalent linear matrix inequality description of Lorentz positive matrices, the relay transmit power minimization problem is transformed into a real valued convex optimization problem. The proposed method overcomes the problem existing in the conventional robust relay beamforming methods based on semi definite relaxation technique, which sometimes yield solution matrix of with a rank greater than 1. Simulation results show that in the case of different relay nodes and channel error coefficients, the proposed method yields minimum relay transmit power in line with the results of the robust relay beamforming method based on semi definite relaxation technique, which validates the effectiveness of the proposed method.

목차

Abstract
 1. Introduction
 2. Problem Formulation
 3. Robust Optimization Based on Lorentz-Positive Maps
 4. Numerical Results
 5. Conclusions
 References

저자정보

  • Jianhua Li College of Mathematical Science, Luoyang Normal University, Luoyang, China
  • Yunshan Hou College of Information Engineering, Henan University of Science and Technology, Luoyang, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.