{"title":"Distributed Beamforming in Multiuser Multi-Relay Networks with Guaranteed QoS","authors":"D. Nguyen, Ha H. Nguyen, Tung T. Pham","doi":"10.1109/GLOCOM.2009.5425247","DOIUrl":null,"url":null,"abstract":"This paper considers optimal distributed beamforming designs in a multi-relay network with multiple sources and multiple destinations. It is assumed that all source-destination pairs operate in orthogonal channels to avoid inter-user interference at the destinations. The distributed beamforming designs are carried out to minimize the sum relay power with guaranteed quality of service (QoS) in terms of signal-to-noise-ratio (SNR) at the destinations. Considered are optimization problems with and without per-relay power constraints. Although the two optimization problems can be readily transformed into convex second-order conic programs (SOCPs), the paper proposes simple and fast iterative algorithms to efficiently solve them.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2009.5425247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18
Abstract
This paper considers optimal distributed beamforming designs in a multi-relay network with multiple sources and multiple destinations. It is assumed that all source-destination pairs operate in orthogonal channels to avoid inter-user interference at the destinations. The distributed beamforming designs are carried out to minimize the sum relay power with guaranteed quality of service (QoS) in terms of signal-to-noise-ratio (SNR) at the destinations. Considered are optimization problems with and without per-relay power constraints. Although the two optimization problems can be readily transformed into convex second-order conic programs (SOCPs), the paper proposes simple and fast iterative algorithms to efficiently solve them.