An Iterative Semidefinite and Geometric Programming Technique for the SINR Balancing in Two-Way Relay Network

Bournaka, Georgia; Cumanan, Kanapathippillai; Lambotharan, Sangarapillai; Lazarakis, F.

doi:10.1109/glocom.2011.6134550

Cited by 4 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The generalization of the single link scenario is the multiuser bidirectional relay channel where multiple users compete for the wireless resources [7]- [12]. The transmission can be achieved over multiple relays each equipped with a single antenna as in [8], [9], or over a single relay equipped with multiple antennas as in [7], [10]- [12]. In this multi-link scenario it is often desired to improve the fairness among the users by optimizing the precoding vectors [8], [9], [12].…”

Section: A Related Workmentioning

confidence: 99%

“…The transmission can be achieved over multiple relays each equipped with a single antenna as in [8], [9], or over a single relay equipped with multiple antennas as in [7], [10]- [12]. In this multi-link scenario it is often desired to improve the fairness among the users by optimizing the precoding vectors [8], [9], [12]. The resulting problem is called max-min signal-tointerference-plus-noise ratio (SINR) optimization and is nonconvex, in general.…”

Section: A Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Modified Levenberg–Marquardt Method for the Bidirectional Relay Channel

Dartmann

Zandi

Ascheid

2014

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

This paper presents an optimization approach for a system consisting of multiple bidirectional links over a two-way amplify-and-forward relay. It is desired to improve the fairness of the system. All user pairs exchange information over one relay station with multiple antennas. Due to the joint transmission to all users, the users are subject to mutual interference. A mitigation of the interference can be achieved by max-min fair precoding optimization where the relay is subject to a sum power constraint. The resulting optimization problem is non-convex. This paper proposes a novel iterative and low complexity approach based on a modified Levenberg-Marquardt method to find near optimal solutions. The presented method finds solutions close to the standard convex-solver based relaxation approach.Index Terms-Max-min beamforming, two-way relays, low complexity arXiv:1307.3121v3 [cs.IT]

show abstract

Section: A Related Workmentioning

confidence: 99%

Section: A Related Workmentioning

confidence: 99%

A Modified Levenberg–Marquardt Method for the Bidirectional Relay Channel

Dartmann

Zandi

Ascheid

2014

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…For instance [8] and [9] consider multiple single-antenna relays, while in [1], [10] and [11] the system is equipped with one multiple-input multiple-output (MIMO) relay node. One famous method in these works is to maximize minimum SINR of all users [1], [8] and [9]. The corresponding optimization problem is known as max-min SINR optimization which is non-convex and N P-hard, in general [12].…”

Section: Introductionmentioning

confidence: 99%

“…the transmitted signal by l th MS at its corresponding node, i.e., γ l (p, ω) or in short form γ l , is expressed by (9).…”

Section: Introductionmentioning

confidence: 99%

Fast power control for amplify-and-forward multiple-antenna bidirectional relays

Zandi

Dartmann

Ascheid

et al. 2015

2015 Iran Workshop on Communication and Information Theory (IWCIT)

View full text Add to dashboard Cite

Cooperative relay communication is an interesting area of research, since it is to enhance data rate and coverage in wireless networks. In this paper, we propose a method to optimize power allocation strategy in an amplify-and-forward relay system. Our objective is to attain a max-min fairness within co-channel users. To reduce the complexity we maximize the upper bound on the performance. The reason is that this bound is observed to be tight in low noise conditions. Therefore, one achievement of this work is separating the problem of relay precoding design from power allocation. Then, the power control is done iteratively via the proposed low-complexity algorithm whose convergence is proven. The relay precoder can be subsequently designed via existing methods, such as semidefinite programming, nonetheless, it is beyond the main focus of the current work. The optimality of the proposed power allocation algorithm is very hard to mathematically prove. Yet, the simulation results are promising.Index Terms-iterative power allocation, non-alternating joint design, max-min fairness, multi-user, multi-antenna relay 978-1-4799-8235-6/15/$31.00 ©2015 IEEE

show abstract

“…In particular, transmitter and receiver beamforming techniques will assist interference free multi-user spatial multiplexing. In addition to transmitter and receiver beamforming, relays with spatial diversity can be employed, which has an additional advantage of enhancing coverage of wireless networks [3][4][5][6][7]. There have been many works available in the literature on the design of relays for single and multiple users within the context of cellular networks.…”

Section: Introductionmentioning

confidence: 99%

Transmitter‐receiver and relay optimisation for spectrum sharing multiple‐input and multiple‐output peer‐to‐peer users

Bournaka

Cumanan

Lambotharan

et al. 2013

IET signal process.

View full text Add to dashboard Cite

The authors investigate a spectrum sharing peer-to-peer relay network where multiple source nodes with multiple antennas communicate with their desired destination nodes with multiple antennas through a multiple-input and multipleoutput (MIMO) relay. The authors establish the duality between uplink and downlink peer-to-peer MIMO channels with any number of antennas at each node and demonstrate mean square error (MSE) of a downlink peer-to-peer network can be achieved in a virtual uplink network with the same total network transmission power constraint. By applying this result, the authors develop an iterative algorithm to optimise the source, relay and receiver processing matrices such that the weighted MSE of the retrieved signal at the receivers is minimised. The simulation results demonstrate satisfactory performance of the proposed algorithm.

show abstract

An Iterative Semidefinite and Geometric Programming Technique for the SINR Balancing in Two-Way Relay Network

Cited by 4 publications

References 15 publications

A Modified Levenberg–Marquardt Method for the Bidirectional Relay Channel

A Modified Levenberg–Marquardt Method for the Bidirectional Relay Channel

Fast power control for amplify-and-forward multiple-antenna bidirectional relays

Transmitter‐receiver and relay optimisation for spectrum sharing multiple‐input and multiple‐output peer‐to‐peer users

Contact Info

Product

Resources

About