Distributed beamforming in relay-assisted multiuser communications

Authors:
Duy H. N. Nguyen;Ha H. Nguyen;Hoang D. Tuan
Affiliations:
Department of Electrical and Computer Engineering, University of Saskatchewan, Saskatoon, SK, Canada;Department of Electrical and Computer Engineering, University of Saskatchewan, Saskatoon, SK, Canada;School of Electrical Eng. and Telecommunications, The University of New South Wales, Sydney, NSW, Australia
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 8
Cited 1

Convex Optimization

Convex Optimization
Distributed MMSE Relay Strategies for Wireless Sensor Networks

IEEE Transactions on Signal Processing - Part I
Transmit beamforming for physical-layer multicasting

IEEE Transactions on Signal Processing - Part I
Transmitter Optimization for the Multi-Antenna Downlink With Per-Antenna Power Constraints

IEEE Transactions on Signal Processing
Distributed Beamforming for Relay Networks Based on Second-Order Statistics of the Channel State Information

IEEE Transactions on Signal Processing
Distributed Space-Time Coding in Wireless Relay Networks

IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory

Distributed beamforming in multiuser multi-relay networks with guaranteed QoS

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a communication network with multiple pairs of source and destination, assisted by multiple relays. It is assumed that perfect channel state information (CSI) is available at the relays. In a two-stage AF protocol, all the sources broadcast their signals to all the relays in the first stage. The received signal at each relay is processed by a beamforming weight and then re-broadcasted to all the destinations at the same time with other relays in the second stage. The focus is to find the optimal beamforming weights to meet a given set of target signal-to-interference-and-noise ratio (SINR) at the destinations, while minimizing the total transmitted power at the relays. We show that this problem can be formulated as a nonconvex quadratically constrained quadratic program (QCQP). Through relaxations, the problem can be solved efficiently by convex programming.