Earticle

초록

영어

The paper investigates the problem of a distributed robust relay beamforming in cognitive one-way relay networks with imperfect channel state information. We aim to the minimum the transmit power of relays, satisfying the SNR (signal-to-noise ratio) of the secondary users high a threshold and keeping the interference at primary users below an acceptable threshold. Because of the robust identity the optimal problem is a non-convex problem which is hard to be solved. In this paper we transform the non-convex problem into a convex one which can be solved efficiently by exploiting S-procedure and Schur complement theorem and relaxing the rank-one constrain. Then the robust beamforming vector can be obtained. Simulation results show that the proposed algorithm can solve the minimum problem with robust features efficiently and obtain satisfactory results.

목차

Abstract
 1. Introduction
 2. System Model
 3. Robust Distributed Beamforming
 4. Simulation results
 5. Conclusions 
 Acknowledgements 
 References

키워드

저자

• Hongyan Cai [ School of Information and Communication Engineering, Beijing University of Posts and Telecommunications Address: Beijing University of Posts and Telecommunications, No 10, Xitucheng Road, Haidian District, Beijing, PRC ]
• Wenbo Wang [ School of Information and Communication Engineering, Beijing University of Posts and Telecommunications Address: Beijing University of Posts and Telecommunications, No 10, Xitucheng Road, Haidian District, Beijing, PRC ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605