SNR maximization and distributed beamforming in multiuser multi-relay networks

Authors:
Duy H. N. Nguyen;Ha H. Nguyen;Tung T. Pham
Affiliations:
University of Saskatchewan, Saskatoon, SK, Canada;University of Saskatchewan, Saskatoon, SK, Canada;University of Saskatchewan, Saskatoon, SK, Canada
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 8
Cited 2

Convex Optimization

Convex Optimization
Power allocation and distributed beamforming optimization in relay-assisted multiuser communications

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Distributed beamforming in multiuser multi-relay networks with guaranteed QoS

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimizations of a MIMO Relay Network

IEEE Transactions on Signal Processing - Part II
Linear precoding via conic optimization for fixed MIMO receivers

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
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
A framework for uplink power control in cellular radio systems

IEEE Journal on Selected Areas in Communications

Distributed beamforming in multiuser multi-relay networks with guaranteed QoS

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Semi-analytic Performance of a Multiaccess MIMO Scheme Using Precoding Vectors

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies optimal distributed beamforming designs to jointly maximize the signal-to-noise (SNR) margin in a multiuser multi-relay network. Considered are optimization problems with two different types of power constraints: sum relay power constraint and per-relay power constraints. Although these two problems can be readily solved by the bisection method via a sequence of second-order conic feasibility programs, we propose simple and fast converging iterative algorithms to directly solve the two optimization problems under consideration.