Relay Strategies for High Rate Space-Time Code in Cooperative MIMO Networks

Arti, M K; Bose, Ranjan; Bhatnagar, Manav R.; Hjørungnes, A.

doi:10.1109/iswcs.2007.4392430

Cited by 5 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(44) In contrast to the objective functions in (29a), which are not concave, the objective functions in (44) are clearly seen concave inξ ξ ξ nm = |ξ ξ ξ nm | 2 . It can also be seen that (44) is an upper bound of the objective function in (30a) as well.…”

Section: A Case Study With Mrcmentioning

confidence: 87%

Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks

Che

Tuan

Nguyen

2014

IEEE Trans. Wireless Commun.

153

125

View full text Add to dashboard Cite

This paper considers joint optimization of cooperative beamforming and relay assignment for multi-user multirelay wireless networks to maximize the minimum of the received signal-to-interference-plus-noise ratios (SINR). Separated continuous optimization of beamforming and binary optimization of relay assignment already pose very challenging programs. Certainly, their joint optimization, which involves nonconvex objectives and coupled constraints in continuous and binary variables, is among the most challenging optimization problems. Even the conventional relaxation of binary constraints by continuous box constraints is still computationally intractable because the relaxed program is still highly nonconvex. However, it is shown in this paper that the joint programs fit well in the d.c (difference of two convex functions/sets) optimization framework. Efficient optimization algorithms are then developed for both cases of orthogonal and nonorthogonal transmission by multiple users. Simulation results show that the jointly optimized beamforming and relay assignment not only save transmission bandwidth but can also maintain well the network SINRs. Index Terms-Cooperativebeamforming, power allocation, relay selection, relay assignment, wireless relay networks, d.c. programming. 1536-1276 (c) , IEEE Transactions on Wireless Communications 2 straints. Although these d.c. programs are still very hard, they motivate exploring hidden convex structures of the problem at hand in order to obtain the constructive solutions [36], [37]. It has been recognized for a long time [36] that the d.c. structure of binary constraints has yet to be explored as the binary constraints seem to be more suitable in a d.m. (difference of two monotonic functions/sets) setting [38], [39]. Moreover, different from a binary quadratic problem [40], which has been successfully solved by d.c. optimization, the constructive d.c.representations of the mixed-binary programs considered in the present paper are not available. Through elegant variable changes and effective approximations, our contribution is to reformulate these problems as tractable d.c. programs, which become solvable by d.c. iterations of polynomial complexity and also re-optimization processes. Simulation results show that the proposed computational procedures are capable of locating approximation solutions that are very close to the global optimal solutions. This is evidenced by the fact that the approximation solutions achieve SINR performances that are very close to their upper bounds.The paper is structured as follows. Section II provides a fundamental background on a class of mixed binary optimization and d.c. programming for finding its solution. Its application to the joint program of beamforming and relay assignment for the case of orthogonal transmission of the users is presented in Section III. Section IV is devoted to the problem of jointly optimized beamforming and relay assignment in nonorthogonal transmission of the users. Simulations are presented in Section V. Section VI ...

show abstract

Section: A Case Study With Mrcmentioning

confidence: 87%

Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks

Che

Tuan

Nguyen

2014

IEEE Trans. Wireless Commun.

153

125

View full text Add to dashboard Cite

show abstract

Multi-User Relaying of High-Rate Space–Time Code in Cooperative Networks

Bhatnagar

Arti

Hjørungnes

et al. 2009

Wireless Pers Commun

Self Cite

View full text Add to dashboard Cite

In this paper, we propose high-rate space-time coding for cooperative wireless networks to reduce the overall delay incurred in relaying signals to multiple receivers. The relay structure is optimized in order to achieve maximum SNR at the receiver nodes. The proposed scheme provides a significant reduction in the delay required for the relaying and transmission of the signals to the multiple receivers with a minute loss in performance. We have also shown by simulation that this loss in the performance could be recovered by selecting more number of relays. We propose two relaying strategies for high-rate space-time codes, which are very useful in providing high data-rate in wireless cooperative networks.

show abstract