Search results

1 – 1 of 1
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 4 January 2016

Shahriar Shirvani Moghaddam and Maryam Alibeigi

In this paper, a wireless network consisting of multiple source-destination pairs, which communicate peer-to-peer with the help of multiple Amplify-and-Forward relays is…

90

Abstract

Purpose

In this paper, a wireless network consisting of multiple source-destination pairs, which communicate peer-to-peer with the help of multiple Amplify-and-Forward relays is considered. The purpose of this paper is to minimize the total relay transmit power subject to a sum rate threshold.

Design/methodology/approach

It is shown that finding a beamforming matrix which satisfies the investigation’s goal is a non-convex optimization problem. Therefore, a semidefinite relaxation technique is used to turn it into a semidefinite programming problem. Thus, it can be effectively solved by interior point methods.

Findings

Simulation results show that the total relay transmit power decreases with the number of relays. In addition, it is shown that relays’ power consumption decreases when the quality of uplink and/or downlink channels improves. In order to compare the proposed optimization algorithm to two conventional approaches, energy efficiency criterion used for performance comparison and complexity order for evaluating computational complexity. Although the proposed algorithm does not change the order of complexity, it needs a few more iterations to find the best result which leads to a double the processing time compared to existing approaches.

Originality/value

In the present optimization problem, coefficient ß is used instead of a constant factor 2 in the original optimization problem. It is shown that by changing parameter ß between 1 and 2, a lower power consumption for a target sum rate can be achieved.

Details

COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, vol. 35 no. 1
Type: Research Article
ISSN: 0332-1649

Keywords

1 – 1 of 1
Per page
102050