### Abstract

A cooperative communication network is considered wherein L sources aim to transmit to their designated destinations through the use of a multiple-antenna relay. All sources transmit to the relay in a shared channel in the first transmission phase. Then, the relay linearly processes its received signal vector using L relaying matrices and retransmits the resultant signals towards the destinations in dedicated channels in the second transmission phase. The goal is to jointly optimize the sources' transmit powers and the relaying matrices such that the worst normalized signal-to-interference-plus-noise ratio (SINR) among all L destinations is maximized while the relays' transmit powers in the dedicated channels as well as the sources' individual and total transmit powers do not exceed predetermined thresholds. It is shown that the jointly optimal sources' transmit powers and the relaying matrices are the solutions to an optimization problem with a nonconvex objective function and multiple nonconvex constraints. To solve this problem, it is first proved that all normalized SINRs are equal at the optimal point of the objective function. Then, the optimization problem is transformed through multiple stages into an equivalent problem that is amenable to an iterative solution. Finally, an efficient iterative algorithm is developed that offers the jointly optimal sources' transmit powers and the relaying matrices. An extension to the above problem is then studied in the case when the cooperative communication network acts as a cognitive system that is expected to operate such that its interfering effect on the primary users is below some admissibility thresholds. In such a case, the sources' and relay's transmit powers should further satisfy some additional constraints that compel a new technique to tackle the problem of the joint optimization of the sources' transmit powers and the relaying matrices. An iterative solution to the latter problem is also proposed and the efficiency and the high rate of convergence of the proposed iterative algorithms in both the original and the cognitive cases are verified by simulation examples.

Original language | English |
---|---|

Article number | 5783521 |

Pages (from-to) | 4313-4330 |

Number of pages | 18 |

Journal | IEEE Transactions on Signal Processing |

Volume | 59 |

Issue number | 9 |

DOIs | |

Publication status | Published - Sep 2011 |

Externally published | Yes |

### Fingerprint

### Keywords

- Cooperative communication
- joint source and relay design
- multi-source multi-destination network

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Signal Processing

### Cite this

*IEEE Transactions on Signal Processing*,

*59*(9), 4313-4330. [5783521]. https://doi.org/10.1109/TSP.2011.2158426

**Jointly optimal source power control and relay matrix design in multipoint-to-multipoint cooperative communication networks.** / Zarifi, Keyvan; Ghrayeb, Ali; Affes, Sofiène.

Research output: Contribution to journal › Article

*IEEE Transactions on Signal Processing*, vol. 59, no. 9, 5783521, pp. 4313-4330. https://doi.org/10.1109/TSP.2011.2158426

}

TY - JOUR

T1 - Jointly optimal source power control and relay matrix design in multipoint-to-multipoint cooperative communication networks

AU - Zarifi, Keyvan

AU - Ghrayeb, Ali

AU - Affes, Sofiène

PY - 2011/9

Y1 - 2011/9

N2 - A cooperative communication network is considered wherein L sources aim to transmit to their designated destinations through the use of a multiple-antenna relay. All sources transmit to the relay in a shared channel in the first transmission phase. Then, the relay linearly processes its received signal vector using L relaying matrices and retransmits the resultant signals towards the destinations in dedicated channels in the second transmission phase. The goal is to jointly optimize the sources' transmit powers and the relaying matrices such that the worst normalized signal-to-interference-plus-noise ratio (SINR) among all L destinations is maximized while the relays' transmit powers in the dedicated channels as well as the sources' individual and total transmit powers do not exceed predetermined thresholds. It is shown that the jointly optimal sources' transmit powers and the relaying matrices are the solutions to an optimization problem with a nonconvex objective function and multiple nonconvex constraints. To solve this problem, it is first proved that all normalized SINRs are equal at the optimal point of the objective function. Then, the optimization problem is transformed through multiple stages into an equivalent problem that is amenable to an iterative solution. Finally, an efficient iterative algorithm is developed that offers the jointly optimal sources' transmit powers and the relaying matrices. An extension to the above problem is then studied in the case when the cooperative communication network acts as a cognitive system that is expected to operate such that its interfering effect on the primary users is below some admissibility thresholds. In such a case, the sources' and relay's transmit powers should further satisfy some additional constraints that compel a new technique to tackle the problem of the joint optimization of the sources' transmit powers and the relaying matrices. An iterative solution to the latter problem is also proposed and the efficiency and the high rate of convergence of the proposed iterative algorithms in both the original and the cognitive cases are verified by simulation examples.

AB - A cooperative communication network is considered wherein L sources aim to transmit to their designated destinations through the use of a multiple-antenna relay. All sources transmit to the relay in a shared channel in the first transmission phase. Then, the relay linearly processes its received signal vector using L relaying matrices and retransmits the resultant signals towards the destinations in dedicated channels in the second transmission phase. The goal is to jointly optimize the sources' transmit powers and the relaying matrices such that the worst normalized signal-to-interference-plus-noise ratio (SINR) among all L destinations is maximized while the relays' transmit powers in the dedicated channels as well as the sources' individual and total transmit powers do not exceed predetermined thresholds. It is shown that the jointly optimal sources' transmit powers and the relaying matrices are the solutions to an optimization problem with a nonconvex objective function and multiple nonconvex constraints. To solve this problem, it is first proved that all normalized SINRs are equal at the optimal point of the objective function. Then, the optimization problem is transformed through multiple stages into an equivalent problem that is amenable to an iterative solution. Finally, an efficient iterative algorithm is developed that offers the jointly optimal sources' transmit powers and the relaying matrices. An extension to the above problem is then studied in the case when the cooperative communication network acts as a cognitive system that is expected to operate such that its interfering effect on the primary users is below some admissibility thresholds. In such a case, the sources' and relay's transmit powers should further satisfy some additional constraints that compel a new technique to tackle the problem of the joint optimization of the sources' transmit powers and the relaying matrices. An iterative solution to the latter problem is also proposed and the efficiency and the high rate of convergence of the proposed iterative algorithms in both the original and the cognitive cases are verified by simulation examples.

KW - Cooperative communication

KW - joint source and relay design

KW - multi-source multi-destination network

UR - http://www.scopus.com/inward/record.url?scp=80051749753&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051749753&partnerID=8YFLogxK

U2 - 10.1109/TSP.2011.2158426

DO - 10.1109/TSP.2011.2158426

M3 - Article

AN - SCOPUS:80051749753

VL - 59

SP - 4313

EP - 4330

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 9

M1 - 5783521

ER -