access icon free Linear precoding for spatially correlated multiple-input single-output wiretap channel

A precoding scheme for physical layer security of multiple-input single-output (MISO) wiretap channel with spatial correlation is designed. Quality-of-service (QoS) of the link is defined in terms of upper bounds on average symbol error rate function at Bob (legitimate user) and Eve (illegitimate user). Specifically, two problems are considered. First, a precoder matrix is designed to minimise the average transmitted power subject to QoS requirements at Bob and Eve. Next, we propose two algorithms to minimize QoS of illegitimate party for a given reliability level, depending on whether main user link has no correlation or is fully correlated. Our result for uncorrelated case demonstrate that by increasing the allocated power, main user can increase secrecy level up to an optimum point above which both legitimate and illegitimate receivers experience adequate QoS in their links. In fully correlated case, the problem is identified as an instance of concave minimisation over a polytope, and optimum power allocation is obtained via the widely known vertex enumeration algorithm. In both cases, our simulations validate the analysis significantly. The results confirm that linear precoding is able to trade average power against minimum achievable Eve performance.

Inspec keywords: concave programming; matrix algebra; quality of service; wireless channels; correlation theory; precoding

Other keywords: average symbol error rate function; optimum power allocation; spatial correlation; Eve channel; precoder matrix; linear precoding scheme; multiple-input single-output wiretap channel; optimal precoder matrix; concave minimisation; quality-of-service; vertex enumeration algorithms; Bob channel

Subjects: Algebra; Radio links and equipment; Codes; Optimisation techniques

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • 23. David Avis, lrs Ver. 4.3: ANSI C implementation as a callable library of the reverse search algorithm for vertex enumeration/convex hull problems. http://cgm.cs.mcgill.ca/~avis/C/lrs.html, June 2012.
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
      • 25. Magnus, J.R., Neudecker, H.: ‘Matrix differential calculus with applications in statistics and econometrics’ (Wiley, New York, 1999).
    12. 12)
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • 24. Marshall, A.W., Olkin, I.: ‘Inequalities: theory of majorization and its applications’ (Academic, New York, 1979).
    18. 18)
    19. 19)
    20. 20)
      • 20. Horn, R.A., Johnson, C.R.: ‘Matrix analysis’ (Cambridge University Press, New York, 1985).
    21. 21)
    22. 22)
      • 21. Horn, R.A., Johnson, C.R.: ‘Topics in matrix analysis’ (Cambridge University Press, New York, 1991).
    23. 23)
    24. 24)
      • 5. Liang, Y., Poor, H.V., Shamai (Shitz), S.: ‘Information theoretic security’, Found. Trends Commun. Inf. Theory, 2009, 5, (4, 5), pp. 355580.
    25. 25)
      • 8. Harrison, W.K., Almeida, J., Klinc, D., et al: ‘Stopping sets for physical layer security’. IEEE Inf. Theory Workshop, Dublin, Australia, 2010.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0152
Loading

Related content

content/journals/10.1049/iet-com.2014.0152
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading