Joint Secure Beamforming and User Selection for Multi-user MISO Systems with Confidential Messages

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9204)


In this paper, we propose a joint secure beamforming and user selection (J-SBS) scheme to improve the secrecy sum rate in multi-user multiple-input-single-output (MISO) broadcast channels with confidential messages (BCC). The user selection mechanism can bring about multi-user diversity which may be also exploited by eavesdroppers in multi-user MISO sysytem. We show how the system secrecy sum rate under the semi-orthogonal user selection (SUS) algorithm will be limited if users collude with each other. To solve this problem, based on the prediction that selected users have mutual orthogonal beamformers, we characterize a new expression of the secrecy rate. By optimizing the secrecy rate we then derive a corresponding suboptimal secrecy beamformer for each user to reduce the interference and information leakage. Moreover, we apply SUS to select suitable beamformers matching with the prediction. Simulation results show the effectiveness of our proposed method.


Multi-user MISO broadcast channel Secrecy beamforming User selection Physical layer security Secrecy rate 


  1. 1.
    Wyner, A.D.: The wire-tap channel. Bell. Syst. Tech. J. 54(8), 1334–1387 (1975)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Csiszar, I., Korner, J.: Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24(3), 339–348 (1978)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bloch, M., Barros, J., Rodrigues, M., McLaughlin, M.: Wireless information-theoretic security. IEEE Trans. Inf. Theory 54(6), 2515–2534 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Xu, Q., Su, Z., Han, B., Fang, D., Xu, Z., Gan, X.: Analytical model with a novel selfishness division of mobile nodes to participate cooperation. Peer-to-Peer Netw. Appl. (2015). doi:10.1007/s12083-015-0330-6
  5. 5.
    Su, Z., Xu, Q., Zhu, H., Wang, Y.: A novel design for content delivery over software defined mobile social networks. IEEE Network 29(4) (2015)Google Scholar
  6. 6.
    Liang, Y., Poor, H.V., Shamai, S.: Secure communication over fading channels. IEEE Trans. Inf. Theory 54(6), 2470–2492 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Ekrem, E., Ulukus, S.: The secrecy capacity region of the Gaussian MIMO multi-receiver wiretap channel. IEEE Trans. Inf. Theory 57(4), 2083–2114 (2011)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Liu, R., Liu, T., Poor, H.V., Shamai, S.: Multiple-input multiple-output Gaussian broadcast channels with confidential messages. IEEE Trans. Inf. Theory 56(9), 4215–4227 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Geraci, G., Egan, M., Yuan, J., Razi, A., Collings, I.B.: Secrecy sum-rates for multi-user MIMO regularized channel inversion precoding. IEEE Trans. Commun. 60(11), 3472–3482 (2012)CrossRefGoogle Scholar
  10. 10.
    Viswanath, P., Tse, D.N.C., Laroia, R.: Opportunistic beamforming using dumb antennas. IEEE Trans. Inf. Theory 48(6), 1277–1294 (2002)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Hochwald, B.M., Peel, C.B., Swindlehurst, A.L.: A vector-perturbation technique for near-capacity multiantenna multiuser communication - Part II: Perturbation. IEEE Trans. Commun. 53(3), 537–544 (2005)CrossRefGoogle Scholar
  12. 12.
    Yoo, T., Goldsmith, A.: On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming. IEEE J. Sel. Areas Commun. 24(3), 528–541 (2006)CrossRefGoogle Scholar
  13. 13.
    Paige, C., Saunders, M.A.: Towards a generalized singular value decomposition. SIAM J. Numer. Anal. 18(3), 398–405 (1981)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Information and Communications EngineeringXi’an Jiaotong UniversityXi’anChina
  2. 2.School of Electronic and Information EngineeringXi’an Jiaotong UniversityXi’anChina

Personalised recommendations