Abstract
Background & Objective: This paper considers a multi-pair wireless network, which communicates peer-to-peer using some multi-antenna amplify-and-forward relays. Maximizing the throughput supposing that the total relay nodes’ power consumption is constrained, is the main objective of this investigation. We prove that finding the beamforming matrix is not a convex problem.
Methods: Therefore, by using a semidefinite relaxation technique we find a semidefinite programming problem. Moreover, we propose a novel algorithm for maximizing the total signal to the total leakage ratio. Numerical analyses show the effectiveness of the proposed algorithm which offers higher throughput compared to the existing total leakage minimization algorithm, with much less complexity.
Results and Conclusion: Furthermore, the effect of different parameters such as, the number of relays, the number of antennas in each relay, the number of transmitter/receiver pairs and uplink and downlink channel gains are investigated.
Keywords: Convex problem, MIMO, non-regenerative, optimization, power consumption, power control, relay network, sum-rate.
Graphical Abstract
[http://dx.doi.org/10.2174/2210327908666180514105607]
[http://dx.doi.org/10.1109/ICASSP.2007.366575]
[http://dx.doi.org/10.1109/TSP.2007.894410]
[http://dx.doi.org/10.1109/TIT.2004.838089]
[http://dx.doi.org/10.4236/ijcns.2011.47053]
[http://dx.doi.org/10.1109/TSP.2010.2051431]
[http://dx.doi.org/10.1109/NTMS.2012.6208772]
[http://dx.doi.org/10.1109/TSP.2012.2217135]
[http://dx.doi.org/10.1109/TSP.2009.2020002]
[http://dx.doi.org/10.1109/TSP.2012.2236832]
[http://dx.doi.org/10.1186/1687-6180-2012-174]
[http://dx.doi.org/10.1109/JSAC.2012.120212]
[http://dx.doi.org/10.9734/BJAST/2015/13115]
[http://dx.doi.org/10.1108/COMPEL-11-2014-0309]
[http://dx.doi.org/10.1109/TSP.2008.925945]
[http://dx.doi.org/10.1109/TSP.2010.2077632]
[http://dx.doi.org/10.1017/CBO9780511840371]
[http://dx.doi.org/10.1287/moor.1070.0268]
[http://dx.doi.org/10.1109/78.992139]
[http://dx.doi.org/10.1109/TSP.2006.872578]
[http://dx.doi.org/10.1007/s101070050006]
[http://dx.doi.org/10.24138/jcomss.v14i4.490]
[http://dx.doi.org/10.2174/2210327908666180808115057]
[http://dx.doi.org/10.1002/itl2.8]
[http://dx.doi.org/10.1002/ett.3199]