Resource Allocations for Secure Cognitive Satellite-Terrestrial Networks

Li, Bin; Fei, Zesong; Xu, Xiaoming; Chu, Zheng

doi:10.1109/lwc.2017.2755014

Cited by 76 publications

(41 citation statements)

References 17 publications

(37 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For practical purposes, the satellite link is modeled by composite fading distribution for describing the statistical properties of the signal envelope accurately. Currently, the Shadowed-Rician fading model has been widely-adopted in the literature [3], [24], [32]. Based on this model, the corresponding channel fading coefficient is given bỹ…”

Section: A Satellite Channel Modelmentioning

confidence: 99%

Robust Chance-Constrained Secure Transmission for Cognitive Satellite–Terrestrial Networks

Fei

Chu

et al. 2018

IEEE Trans. Veh. Technol.

Self Cite

122

View full text Add to dashboard Cite

Abstract-Cognitive satellite-terrestrial networks (CSTNs) have been recognized as a promising network architecture for addressing spectrum scarcity problem in next-generation communication networks. In this paper, we investigate the secure transmission for CSTNs where the terrestrial base station (BS) serving as a green interference resource is introduced to enhance the security of the satellite link. Adopting a stochastic model for the channel state information (CSI) uncertainty, we propose a secure and robust beamforming framework to minimize the transmit power, while satisfying a range of outage (probabilistic) constraints concerning the signal-to-interference-plus-noise ratio (SINR) recorded at the satellite user and the terrestrial user, the leakage-SINR recorded at the eavesdropper, as well as the interference power recorded at the satellite user. The resulting robust optimization problem is highly intractable and the key observation is that the highly intractable probability constraints can be equivalently reformulated as the deterministic versions with Gaussian statistics. In this regard, we develop two robust reformulation methods, namely S-Procedure and Bernstein-type inequality restriction techniques, to obtain a safe approximate solution. In the meantime, the computational complexities of the proposed schemes are analyzed. Finally, the effectiveness of the proposed schemes are demonstrated by numerical results with different system parameters.

show abstract

Section: A Satellite Channel Modelmentioning

confidence: 99%

Robust Chance-Constrained Secure Transmission for Cognitive Satellite–Terrestrial Networks

Fei

Chu

et al. 2018

IEEE Trans. Veh. Technol.

Self Cite

122

View full text Add to dashboard Cite

show abstract

“…We aim to maximize the minimal achievable secrecy rate (ASR) of multiple IRs subject to the constraints of energy harvest requirement, interference threshold of earth station (ES), and the transmit power budget of the BS. As the original problem is nonconvex, we employ the sequential convex approximation (SCA) method and propose an iterative BF algorithm to obtain the optimal solution, which is different from the conventional semidefinite relaxation (SDR) based methods [3], [14]. Simulation results confirm the effectiveness and superiority of our proposed BF scheme.…”

mentioning

confidence: 78%

Beamforming for Secure Wireless Information and Power Transfer in Terrestrial Networks Coexisting With Satellite Networks

Lin

Ouyang

et al. 2018

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

This letter proposes a beamforming (BF) scheme to enhance wireless information and power transfer in terrestrial cellular networks coexisting with satellite networks. By assuming that the energy receivers are the potential eavesdroppers overhearing signals intended for information receivers (IRs), we first formulate a constrained optimization problem to maximize the minimal achievable secrecy rate of the IRs subject to the constraints of energy harvest requirement, interference threshold, and transmit power budget. Through exploiting the sequential convex approximation method, we convert the original problem into a linear one with a series of linear matrix inequality and second-order cone constraints. An iterative algorithm is then proposed to obtain the BF weight vectors. Finally, simulation results demonstrate the effectiveness and superiority of the proposed scheme.Index Terms-Secure communications, wireless information and power transfer, sequential convex approximation (SCA).

show abstract

“…To overcome this issue, physical-layer security (PLS) [4][5][6][7][8][9] has been recently proposed to employ the opening characters of wireless channels to achieve secret communication, resulting in achieving "absolute" security from the concept of information theory. There has been some work to exploit PLS for D2D communications.…”

Section: Introduction and Related Workmentioning

confidence: 99%

Secure Transmission Scheme Based on the Artificial Noise in D2D-Enabled Full-Duplex Cellular Networks

Chen¹,

Yi²,

Zhou³

et al. 2019

KSII TIIS

View full text Add to dashboard Cite

In this paper, a secure transmission scheme based on the artificial noise is proposed for D2D communications underlaying the full-duplex cellular network, and a secure power allocation scheme to maximize the overall secrecy rate of both the cellular user and D2D transmitter node is presented. Firstly, the full-duplex base station transmits the artificial noise to guarantee the secure communications when it receives signals of cellular uplinks. Under this secure framework, it is found that improving the transmission power of the cellular user or the D2D transmitter node will degrade the secrecy rate of the other, although will improve itself secrecy rate obviously. Hence, a secure power allocation scheme to maximize the overall secrecy rate is presented subject to the security requirement of the cellular user. However, the original power optimization problem is non-convex. To efficiently solve it, we recast the original problem into a convex program problem by utilizing the proper relaxation and the successive convex approximation algorithm. Simulation results evaluate the effectiveness of the proposed scheme. . He then received the M.S. degree in NDSC. He has been a faculty member of NDSC since 2014. His research interests include wireless location. KaizhiHuang received her B.E. degree in digital communication and M.S. degree in communication and information system from respectively. She has been a faculty member of NDSC since 1998, where she is currently a professor and director of the Laboratory of Mobile Communication Networks. Xinsheng Ji received the B.E. degree in Fudan University, Shanghai, China, in 1984, and received the M.S. degrees in PLA Information Engineering University, Zhengzhou, China, in 1991. He has been a faculty member of NDSC since 1988, where he is currently a professor and the chief engineer of NDSC. He has been a member of the Network and Communication (NaC) specialist group for China 863 High Technology Program and a senior member of China Institute of Communication. He was awarded as an outstanding expert of state in 2015. His major research interests include wireless communication network, security and signal processing.

show abstract

Resource Allocations for Secure Cognitive Satellite-Terrestrial Networks

Cited by 76 publications

References 17 publications

Robust Chance-Constrained Secure Transmission for Cognitive Satellite–Terrestrial Networks

Robust Chance-Constrained Secure Transmission for Cognitive Satellite–Terrestrial Networks

Beamforming for Secure Wireless Information and Power Transfer in Terrestrial Networks Coexisting With Satellite Networks

Secure Transmission Scheme Based on the Artificial Noise in D2D-Enabled Full-Duplex Cellular Networks

Contact Info

Product

Resources

About