Skip to main content

DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security

  • Conference paper
Advanced Computational Methods for Knowledge Engineering

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 358))

Abstract

In this paper, we consider the problem of resource allocation in emerging area of cooperative physical layer security, whose objective function is of the difference of two convex functions, called DC function, and whose some constraints are coupling. We propose a novel DC decomposition for the objective function and use DCA (DC algorithms) to solve this problem. The main advantage of the proposed DC decomposition is that it leads to strongly convex quadratic sub-problems that can be easily solved by both distributed and centralized methods. The numerical results show the efficiency of this DC decomposition compared with the one proposed in ([2]). The DC decomposition technique in this article may be applied for a wide range of multiuser DC problems in communication systems, signal processing and networking.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Shatri, A., Weber, T.: Achieving the maximum sum rate using dc programming in cellular networks. IEEE Trans. Signal Process 60(3), 1331–1341 (2012)

    Article  MathSciNet  Google Scholar 

  2. Alvarado, A., Scutari, G., Pang, J.-S.: A new decomposition method for multiuser dc-programming and its application. IEEE Transactions on Signal Processing 62(11), 2984–2998 (2014)

    Article  MathSciNet  Google Scholar 

  3. Chiang, M.: Geometric programming for communication systems. Foundations and Trends in Communication and Information Theory 2(1-2), 1–154 (2005)

    Article  MATH  Google Scholar 

  4. Dong, L., Han, Z., Petropulu, A., Poor, H.: Improving wireless physical layer security via cooperating relays. IEEE Trans. Signal Process 58(3), 1875–1888 (2010)

    Article  MathSciNet  Google Scholar 

  5. Han, Z., Marina, N., Debbah, M., Hjorungnes, A.: Physical layer security game: intersaction between source, eavesdropper, and friendly jammer. EURASIP J. Wireless Commun. Netw 2009(1), 1–11 (2009)

    Article  Google Scholar 

  6. He, X., Yener, A.: Cooperative jamming: The tale of friendly interference for secrecy, pp. 65–88. Spinger (2010)

    Google Scholar 

  7. Jorswieck, E., Wolf, A., Gerbracht, S.: Secrecy on the Physical Layer in Wireless Networks, vol. 20. INTECH (2010)

    Google Scholar 

  8. Julian, D., Chiang, M., O’Neill, D., Boyd, S.P.: QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks. In: IEEE INFOCOM 2002, pp. 477–486 (June 2002)

    Google Scholar 

  9. Kha, H.H., Tuan, H.D., Nguyen, H.H.: Fast global optimal power allocation in wireless network by local dc programming. IEEE Trans. on Wireless Communications 11(2), 510–512 (2012)

    Article  Google Scholar 

  10. Le Thi, H.A.: Dc programming and dca, http://lita.sciences.univ-metz.fr/lethi

  11. Le Thi, H.A., Nguyen, M.C., Dinh, T.P.: A dc programming approach for finding communities in networks. Neural Computation 26(12), 2827–2854 (2014)

    Article  MathSciNet  Google Scholar 

  12. Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: Self-organizing maps by difference of convex functions optimization. Data Mining and Knowledge Discovery 28, 1336–1365 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  13. Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Resp. 133, 23–46 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  14. Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: Dc approximation approaches for sparse optimization. European Journal of Operational Research 244(1), 26–46 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Feature selection for linear svms under uncertain data: Robust optimization based on difference of convex functions algorithms. Neural Networks 59, 36–50 (2014)

    Article  MATH  Google Scholar 

  16. Li, J., Petropulu, A., Weber, S.: On cooperative relaying schemes for wireless physical layer security. IEEE Trans. Signal Process 59(10), 4985–4997 (2011)

    Article  MathSciNet  Google Scholar 

  17. Mutherjee, A., Fakoorian, S.A.A., Huang, J., Swindlehurst, A.L.: Principle of physical layer security in multiuser wireless networks: A survey. IEEE Communication Survey and Tutorials 16(3), 1550–1573 (2014)

    Article  Google Scholar 

  18. Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to dc programming: Theory, algorithms and applications. Acta Mathematica Vietnamica 22(1), 289–357 (1997)

    MathSciNet  MATH  Google Scholar 

  19. Pham Dinh, T., Le Thi, H.A.: optimization algorithms for solving the trust region subproblem. SIAM J. Optimization 8 (1998)

    Google Scholar 

  20. Pham Dinh, T., Le Thi, H.A.: Recent advances on DC programming and DCA. To appear in Transactions on Computational Collective Intelligence 37 (2013)

    Google Scholar 

  21. Piot, V., Geist, M., Pietquin, O.: Difference of convex functions programming for reinforcement learning. In: Advances in Neural Information Processing Systems (2014)

    Google Scholar 

  22. Stanojev, I., Yener, A.: Improving secrecy rate via spectrum leasing for friendly jamming. IEEE Trans. Inf. Forensics Security 12(1), 134–145 (2013)

    Google Scholar 

  23. Vucic, N., Schubert, M.: Dc programming approach for resource allocation in wireless networks. In: IEEE, Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, pp. 380–386 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Thi Thuy Tran .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tran, T.T., Thi, H.A.L., Dinh, T.P. (2015). DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security. In: Le Thi, H., Nguyen, N., Do, T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 358. Springer, Cham. https://doi.org/10.1007/978-3-319-17996-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17996-4_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17995-7

  • Online ISBN: 978-3-319-17996-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics