Relay Beamforming Designs in Multi-User Wireless Relay Networks Based on Throughput Maximin Optimization

Beamforming design for multi-user wireless relay networks under the criterion of maximin information throughput is an important but also very hard optimization problem due to its nonconvex nature. The existing approach to reformulate the design as a matrix rank-one constrained optimization problem i...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 61; no. 5; pp. 1739 - 1749
Main Authors: Rashid, U., Tuan, H. D., Nguyen, H. H.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2013
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
amply-and-forward relaying
Applied sciences
Array signal processing
Beamforming
Complexity
d.c. (difference of two convex functions) programming
d.c. decomposition
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Information, signal and communications theory
Linear programming
Mathematical analysis
Mathematical models
maximin optimization
Multi-user relay networks
network throughput
Optimization
Relay
Relay networks
Relays
Signal and communications theory
Signal to noise ratio
Signal, noise
Studies
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Throughput
Transmission and modulation (techniques and equipments)
Vectors
Performance evaluation
Relay
Relay network
maximin optimization
Wireless telecommunication
Information rate
Iterative method
network throughput
d.c. decomposition
Beam forming
Function decomposition
d.c. (difference of two convex functions) programming
Algorithm complexity
Traffic control
amply-and-forward relaying
Convex function
Multiple access
Maximin problem
Flow rate regulation
Teletraffic
Multi-user relay networks
Global optimum
Algorithm
Information transmission
Constrained optimization
Upper bound
Algorithm performance
Optimal solution
Wireless network
Numerical simulation
Objective function
beamforming
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Beamforming design for multi-user wireless relay networks under the criterion of maximin information throughput is an important but also very hard optimization problem due to its nonconvex nature. The existing approach to reformulate the design as a matrix rank-one constrained optimization problem is highly inefficient. This paper exploits the d.c. (difference of two convex functions) structure of the objective function and the convex structure of the constraints in such a global optimization problem to develop efficient iterative algorithms of very low complexity to find the solutions. Both cases of concurrent and orthogonal transmissions from sources to relays are considered. Numerical results indicate that the proposed algorithms provide solutions that are very close to the upper bound on the solution of the non-orthogonal source transmissions case and are almost equal to the optimal solution of the orthogonal source transmissions case. This demonstrates the ability of the developed algorithms to locate approximations close to the global optimal solutions in a few iterations. Moreover, the proposed methods are superior to other methods in both performance and computation complexity.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2013.022713.120129