The University of Southampton
University of Southampton Institutional Repository

Secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul

Secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul
Secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul
In this paper, we investigate the downlink secure beamforming (BF) design problem of cloud radio access networks (C-RANs) relying on multicast fronthaul, where millimeter-wave and microwave carriers are used for the access links and front-haul links, respectively. The base stations (BSs) jointly serve users through cooperating hybrid analog/digital BF. We first develop an analog BF for cooperating BSs. On this basis, we formulate a secrecy rate maximization (SRM) problem subject both to a realistic limited fronthaul capacity and to the total BS transmit power constraint. Due to the intractability of the non-convex problem formulated, advanced convex approximated techniques, constrained concave convex procedures and semi-definite programming (SDP) relaxation are applied to transform it into a convex one. Subsequently, an iterative algorithm of jointly optimizing multicast BF, cooperative digital BF and the artificial noise (AN) covariance is proposed. Next, we construct the solution of the original problem by exploiting both the primal and the dual optimal solution of the SDP-relaxed problem. Furthermore, a per-BS transmit power constraint is considered, necessitating the reformulation of the SRM problem, which can be solved by an efficient iterative algorithm. We then eliminate the idealized simplifying assumption of having perfect channel state information (CSI) for the eavesdropper links and invoke realistic imperfect CSI. Furthermore, a worst-case SRM problem is investigated. Finally, by combining the so-called S-Procedure and convex approximated techniques, we design an efficient iterative algorithm to solve it. Simulation results are presented to evaluate the secrecy rate and demonstrate the effectiveness of the proposed algorithms.
C-RAN, Multicast, millimeter-wave communication, physical layer security
0090-6778
3079-3095
Hao, Wanming
8ce068aa-1812-4964-81aa-7306e1b7d291
Sun, Gangcan
09957474-b08d-4eb7-96b5-8ed2d1439d4f
Zhang, Jiankang
6add829f-d955-40ca-8214-27a039defc8a
Xiao, Pei
976b4b13-a282-4e48-919d-beec8a94396d
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Hao, Wanming
8ce068aa-1812-4964-81aa-7306e1b7d291
Sun, Gangcan
09957474-b08d-4eb7-96b5-8ed2d1439d4f
Zhang, Jiankang
6add829f-d955-40ca-8214-27a039defc8a
Xiao, Pei
976b4b13-a282-4e48-919d-beec8a94396d
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1

Hao, Wanming, Sun, Gangcan, Zhang, Jiankang, Xiao, Pei and Hanzo, Lajos (2020) Secure millimeter wave cloud radio access networks relying on microwave multicast fronthaul. IEEE Transactions on Communications, 68 (5), 3079-3095, [9001081]. (doi:10.1109/TCOMM.2020.2974743).

Record type: Article

Abstract

In this paper, we investigate the downlink secure beamforming (BF) design problem of cloud radio access networks (C-RANs) relying on multicast fronthaul, where millimeter-wave and microwave carriers are used for the access links and front-haul links, respectively. The base stations (BSs) jointly serve users through cooperating hybrid analog/digital BF. We first develop an analog BF for cooperating BSs. On this basis, we formulate a secrecy rate maximization (SRM) problem subject both to a realistic limited fronthaul capacity and to the total BS transmit power constraint. Due to the intractability of the non-convex problem formulated, advanced convex approximated techniques, constrained concave convex procedures and semi-definite programming (SDP) relaxation are applied to transform it into a convex one. Subsequently, an iterative algorithm of jointly optimizing multicast BF, cooperative digital BF and the artificial noise (AN) covariance is proposed. Next, we construct the solution of the original problem by exploiting both the primal and the dual optimal solution of the SDP-relaxed problem. Furthermore, a per-BS transmit power constraint is considered, necessitating the reformulation of the SRM problem, which can be solved by an efficient iterative algorithm. We then eliminate the idealized simplifying assumption of having perfect channel state information (CSI) for the eavesdropper links and invoke realistic imperfect CSI. Furthermore, a worst-case SRM problem is investigated. Finally, by combining the so-called S-Procedure and convex approximated techniques, we design an efficient iterative algorithm to solve it. Simulation results are presented to evaluate the secrecy rate and demonstrate the effectiveness of the proposed algorithms.

Text
final(31) - Accepted Manuscript
Download (714kB)

More information

Accepted/In Press date: 10 February 2020
e-pub ahead of print date: 18 February 2020
Published date: May 2020
Additional Information: Funding Information: Manuscript received August 9, 2019; revised November 9, 2019 and January 17, 2020; accepted February 10, 2020. Date of publication February 18, 2020; date of current version May 15, 2020. This work was supported by National Key Research and Development Project under Grant 2019YFB1803200, and U.K. Engineering and Physical Sciences Research Council under Grant EP/P008402/2, and Scientific and Technological Key Project of Henan Province under Grant 202102210119, and China Post-Doctoral Science Foundation under Grant 2019M662528, and National Natural Science Foundation of China under Grant 61571401, and the Innovative Talent of Colleges and University of Henan Province under grant 18HASTIT021. L. Hanzo would like to acknowledge the financial support of the Engineering and Physical Sciences Research Council projects EP/Noo4558/1, EP/PO34284/1, COALESCE, of the Royal Society’s Global Challenges Research Fund Grant as well as of the European Research Council’s Advanced Fellow Grant QuantCom. The associate editor coordinating the review of this article and approving it for publication was L. Xiao. (Corresponding author: Lajos Hanzo.) Wanming Hao is with the School of Information Engineering, Zhengzhou University, Zhengzhou 450001, China, also with the Henan Institute of Advanced Technology, Zhengzhou University, Zhengzhou 450001, China, and also with the 5G Innovation Center, Institute of Communication Systems, University of Surrey, Guildford GU2 7XH, U.K. (e-mail: iewmhao@zzu.edu.cn). Publisher Copyright: © 2020 IEEE.
Keywords: C-RAN, Multicast, millimeter-wave communication, physical layer security

Identifiers

Local EPrints ID: 438003
URI: http://eprints.soton.ac.uk/id/eprint/438003
ISSN: 0090-6778
PURE UUID: 215f8c17-9817-4a79-9cb8-cd06027290a7
ORCID for Jiankang Zhang: ORCID iD orcid.org/0000-0001-5316-1711
ORCID for Lajos Hanzo: ORCID iD orcid.org/0000-0002-2636-5214

Catalogue record

Date deposited: 26 Feb 2020 17:30
Last modified: 18 Mar 2024 03:14

Export record

Altmetrics

Contributors

Author: Wanming Hao
Author: Gangcan Sun
Author: Jiankang Zhang ORCID iD
Author: Pei Xiao
Author: Lajos Hanzo ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×