Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Quality of service assurance in multi-antenna relay-assisted networks

Quality of service assurance in multi-antenna relay-assisted networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

This study concerns two-hop communication over a relay-assisted wireless network, including L point-to-point communication links and a multi-antenna relaying node. It is assumed the relay is equipped with Nr antennas and the amplify-and-forward strategy is employed at this node, considering the second-order statistics of channel coefficients are merely available at the relay. To this end, each source sends its desired signal to the relay during the first hop. Thus, the relay simultaneously receives a faded version of L transmitted signals corrupted with an additive white Gaussian noise in a vector form. Then, the relay applies a weight matrix of dimension Nr×Nr to the received vector and transmits the resulting vector to the destinations throughout the second hop. In this regard, the task of finding the best weight matrix at the relaying node under two different criteria, that is, minimising the relay's transmit power to have a minimum signal-to-interference noise ratio (SINR) at destinations and maximising the worst-case SINR for a given relay's transmit power, is investigated. Accordingly, it is demonstrated that the corresponding problems can be formulated as optimisation problems which are not convex in general. This motivated the authors to propose suboptimal solutions through using the so-called semidefinite relaxation method to translate original problems into semidefinite programming problems. Numerical results are provided, showing the superiority of the proposed methods as compared to the best known method.

References

    1. 1)
    2. 2)
    3. 3)
      • Nguyen, D.H.N., Nguyen, H.H., Tuan, H.D.: `Distributed beamforming in relay-assisted multiuser communications', Proc. IEEE Int. Conf. Communication, June 2009, Dresden, Germany, p. 1–5.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • M. Grant , S. Boyd . CVX: Matlab software for disciplined convex programming (web page and software).
    18. 18)
    19. 19)
      • Chen, W., Zheng, H., Li, Y., Zhang, S., Wu, X.: `Beamforming methods for multiuser relay networks', Proc. Vehicular Technology Conf., September 2008, Calgary, BC, p. 1–5.
    20. 20)
      • Nguyen, D.H.N., Nguyen, H.H.: `SNR maximization and distributed beamforming in multiuser multi-relay networks', Proc. IEEE Global Telecommunication Conf., November–December 2009, Honolulu, HI, p. 1–6.
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
    26. 26)
    27. 27)
      • Nguyen, D.H.N., Nguyen, H.H., Pham, T.T.: `Distributed beamforming in multiuser multi-relay networks with guaranteed QoS', Proc. GLOBECOM, November–December 2009, Honolulu, HI, p. 1–6.
    28. 28)
    29. 29)
      • A. Goldsmith . (2005) Wireless communication.
    30. 30)
    31. 31)
    32. 32)
    33. 33)
    34. 34)
    35. 35)
    36. 36)
    37. 37)
      • Z.-Q. Luo , N.D. Sindiropoulos , P. Tseng , S. Zhang . Approximation bounds for quadratic optimization with homogeneous quadratic constraints. SIAM J. Optim. , 1 , 1 - 28
    38. 38)
    39. 39)
    40. 40)
      • S. Boyd , L. Vandenberghe . (2004) Convex optimization.
    41. 41)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0811
Loading

Related content

content/journals/10.1049/iet-com.2010.0811
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address