Skip to main content
SpringerLink
Log in

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers’ constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Notes

  1. For general non-layered networks, such logarithmic dependence may not hold due to intersymbol interference [9].

References

  1. Bloch, M., & Barros, J. (2011). Physical-layer security: From information theory to security engineering. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  2. Leung-Yan-Cheong, S., & Hellman, M. (1978). The Gaussian wire-tap channel. IEEE Transactions on Information Theory, 24(4), 451–456.

    Article  MathSciNet  MATH  Google Scholar 

  3. Lai, L., & El Gamal, H. (2007). Cooperative secrecy: The relay-eavesdropper channel. In IEEE international symposium on information theory (ISIT) (pp. 931–935).

  4. Dong, L., Han, Z., Petropulu, A., & Poor, H. (2009). Amplify-and-forward based cooperation for secure wireless communications. In IEEE international conference on acoustics, speech and signal processing (ICASSP), pp. 2613–2616

  5. Zhang, J., & Gursoy, M. (2010). Relay beamforming strategies for physical-layer security. In 44th annual conference on information sciences and systems (CISS), pp. 1–6

  6. Yang, Y., Li, Q., Ma, W. K., Ge, J., & Ching, P. (2013). Cooperative secure beamforming for AF relay networks with multiple eavesdroppers. IEEE Signal Processing Letters, 20(1), 35–38.

    Article  Google Scholar 

  7. Wyner, A. (1975). The wire-tap channel. Bell Systems Technical Journal, 54(8), 1355–1387.

    Article  MathSciNet  MATH  Google Scholar 

  8. He, S., Luo, Z. Q., Nie, J., & Zhang, S. (2008). Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM Journal on Optimization, 19(2), 503–523.

    Article  MathSciNet  MATH  Google Scholar 

  9. Agnihotri, S., Jaggi, S., & Chen, M. (2011). Amplify-and-forward in wireless relay networks. In IEEE information theory workshop (ITW) (pp. 311–315).

  10. Zhao, Y., Adve, R., & Lim, T. J. (2006). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. In IEEE international symposium on information theory (ISIT) (pp. 1234–1238).

  11. Wang, H. M., Yin, Q., & Xia, X. G. (2012). Distributed beamforming for physical-layer security of two-way relay networks. IEEE Transactions on Signal Processing, 60(7), 3532–3545.

    Article  MathSciNet  Google Scholar 

  12. Swindlehurst, A. (2009). Fixed SINR solutions for the MIMO wiretap channel. In IEEE international conference on acoustics, speech and signal processing (ICASSP) (pp. 2437–2440).

  13. Liao, W. C., Chang, T. H., Ma, W. K., & Chi, C. Y. (2011). QoS-based transmit beamforming in the presence of eavesdroppers: An optimized artificial-noise-aided approach. IEEE Transactions on Signal Processing, 59(3), 1202–1216.

    Article  MathSciNet  Google Scholar 

  14. Qian, L. P., Zhang, Y., & Huang, J. (2009). MAPEL: Achieving global optimality for a non-convex wireless power control problem. IEEE Transactions on Wireless Communications, 8(3), 1553–1563.

    Article  Google Scholar 

  15. Wang, H. M., Luo, M., Xia, X. G., & Yin, Q. (2013). Joint cooperative beamforming and jamming to secure AF relay systems with individual power constraint and no eavesdropper’s CSI. IEEE Signal Processing Letters, 20(1), 39–42.

    Article  Google Scholar 

  16. Sankararaman, S., Abu-Affash, K., Efrat, A., Eriksson-Bique, S. D., Polishchuk, V., Ramasubramanian, S., et al. (2012). Optimization schemes for protective jamming. In Proceedings of the 13th ACM international symposium on mobile ad hoc networking and computing (pp. 65–74).

  17. Sarma, S., Shukla, S., & Kuri, J. (2013). Joint scheduling and jamming for data secrecy in wireless networks. In 11th international symposium on modeling optimization in mobile, ad hoc wireless networks (WiOpt) (pp. 248–255).

  18. Hiriart-Urruty, J. B. (2001). Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints. Journal of Global Optimization, 21(4), 443–453.

    Article  MathSciNet  MATH  Google Scholar 

  19. Sagnol, G. (2011). A class of semidefinite programs with rank-one solutions. Linear Algebra and its Applications, 435(6), 1446–1463.

    Article  MathSciNet  MATH  Google Scholar 

  20. Qualizza, A., Belotti, P., & Margot, F. (2012). Linear programming relaxations of quadratically constrained quadratic programs. In J. Lee & S. Leyffer (Eds.), Mixed integer nonlinear programming. IMA volumes in mathematics and its applications (Vol. 154, pp. 407–426). New York: Springer.

    Chapter  Google Scholar 

  21. Luo, Z. Q., Ma, W. K., So, A. C., Ye, Y., & Zhang, S. (2010). Semidefinite relaxation of quadratic optimization problems. IEEE Signal Processing Magazine, 27(3), 20–34.

    Article  Google Scholar 

  22. Horn, R. A., & Johnson, C. R. (Eds.). (1986). Matrix analysis. New York, NY: Cambridge University Press.

    Google Scholar 

  23. Lofberg, J. (2004). YALMIP: A toolbox for modeling and optimization in MATLAB. In IEEE international symposium on computer aided control systems design (pp. 284–289).

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Systems Engineering, Indian Institute of Science, Bangalore, 560012, Karnataka, India

    Siddhartha Sarma & Joy Kuri

  2. School of Computing and Electrical Engineering, Indian Institute of Technology Mandi, Mandi, 175001, Himachal Pradesh, India

    Samar Agnihotri

Authors
  1. Siddhartha Sarma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samar Agnihotri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joy Kuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siddhartha Sarma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sarma, S., Agnihotri, S. & Kuri, J. Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds. Wireless Pers Commun 85, 1945–1956 (2015). https://doi.org/10.1007/s11277-015-2881-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2881-5

Keywords

Search

Navigation