Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Multiple-Antenna Eavesdropper

Cumanan, Kanapathippillai; Ding, Zhiguo; Sharif, B.S.; Tian, Gui Yun; Leung, Kin K.

doi:10.1109/tvt.2013.2285244

Cited by 165 publications

(137 citation statements)

References 43 publications

Supporting

Mentioning

134

Contrasting

Order By: Relevance

“…When k = 0, w k satisfies (6b) as it is the solution of the initial subproblem (6). This deduces that t = 0 satisfies constraint (12b).…”

Section: Appendix B Proof Of Lemma 32mentioning

confidence: 83%

“…The solution of subproblem (6) w 0 is a strictly feasible point of problem (5). The proof is shown in Appendix B. w 0 is a strictly feasible rather than a feasible point of problem (5), thanks to the parameters β and δ 0 in subproblem (6). It is an important technique for the improvement of the objective function during the iterations.…”

Section: Algorithm Preserving Feasibilitymentioning

confidence: 99%

“…The secure communication is managed through multiple-antenna system [1][2][3][4][5][6][7][8][9] or node cooperation [10,11]. Researches on node cooperation are well explored.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Secure Communication for Two-way Relay Networks with Imperfect CSI

Sun¹,

Liu²,

Zheng³

et al. 2017

Preprint

View full text Add to dashboard Cite

This paper considers a two-way relay network, where two source nodes exchange messages through several relays in the presence of an eavesdropper, and the channel state information (CSI) of the eavesdropper is imperfectly known. The amplify-and-forward relay protocol is used and the relay beamforming weights are designed. The model is built up to minimize the total relay transmit power while guaranteeing the quality of service at users and preventing the eavesdropper from decoding the signals. Due to the imperfect CSI, a semi-infinite programming problem is obtained. An algorithm is proposed to solve the problem, and the iterative points are updated through the linesearch technique, where the feasibility are preserved during iterations. The optimality property is analyzed. The obtained subproblems are quadratic constrained quadratic programming problems, either with less than 4 constraints or with only one variable, which are solved optimally. Simulation results demonstrate the importance of the proposed model, and imply that the proposed algorithm is efficient and converges very fast, where more than 85% of the problems are solved optimally.

show abstract

“…When k = 0, w k satisfies (6b) as it is the solution of the initial subproblem (6). This deduces that t = 0 satisfies constraint (12b).…”

Section: Appendix B Proof Of Lemma 32mentioning

confidence: 83%

Section: Algorithm Preserving Feasibilitymentioning

confidence: 99%

See 1 more Smart Citation

Secure Communication for Two-way Relay Networks with Imperfect CSI

Sun¹,

Liu²,

Zheng³

et al. 2017

Preprint

View full text Add to dashboard Cite

show abstract

“…Then, at time slot , the received signals at the legitimate receiver and the eavesdropper from the transmit user are given by respectively, where ( ) represents the transmitted signal, and ( ) and ( ) denote the corresponding additive white Gaussian noise (AWGN) with zero-mean and unit variance at the the legitimate receiver and the eavesdropper, respectively. Like [5,7], we suppose that all the users have full knowledge of both the main channel state information (CSI) and the wiretap CSI which are described by the vectors h := [ℎ 1 , . .…”

Section: System Modelmentioning

confidence: 99%

“…The results were subsequently extended to the broadcast channels [3] and Gaussian channel [4], respectively. Various physical-layer techniques, such as the use of interference or artificial noise to confuse the eavesdropper, the multi-antenna, beamforming, and resource allocation techniques, were proposed in [5][6][7][8] to improve the secrecy capacity, also known as the largest secrecy rate.…”

Section: Introductionmentioning

confidence: 99%

Fair Resource Allocation with QoS Guarantee in Secure Multiuser TDMA Networks

Bai

Wang

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

We investigate a secure multiuser time division multiple access (TDMA) system with statistical delay quality of service (QoS) guarantee in terms of secure effective capacity. An optimal resource allocation policy is proposed to minimize the -fair cost function of the average user power under the individual QoS constraint, which also balances the energy efficiency and fairness among the users. First, convex optimization problems associated with the resource allocation policy are formulated. Then, a subgradient iteration algorithm based on the Lagrangian duality theory and the dual decomposition theory is employed to approach the global optimal solutions. Furthermore, considering the practical channel conditions, we develop a stochastic subgradient iteration algorithm which is capable of dynamically learning the intended wireless channels and acquiring the global optimal solution. It is shown that the proposed optimal resource allocation policy depends on the delay QoS requirement and the channel conditions. The optimal policy can save more power and achieve the balance of the energy efficiency and the fairness compared with the other resource allocation policies.

show abstract

Metasurface‐Assisted Wireless Communication with Physical Level Information Encryption

Zheng

Chen

et al. 2022

Advanced Science

View full text Add to dashboard Cite

Since the discovery of wireless telegraphy in 1897, wireless communication via electromagnetic (EM) signals has become a standard solution to address increasing demand for information transfer in modern society. With the rapid growth of EM wave manipulation technique, programmable metasurface (PM) has emerged as a new type of wireless transmitter by directly modulating digital information without complex microwave components, thus providing an alternative to simplify the conventional wireless communication system. However, the challenges of improving information security and spectrum utilization still exist. Here, a dual-band metasurface-assisted wireless communication scheme is introduced to provide additional physical channels for the enhancement of information security. The information is divided into several parts and transmitted through different physical channels to accomplish information encryption, greatly reducing the possibility of eavesdropping. As the proof of concept, a dual-channel and high-security wireless communication system based on a 1-bit PM is established to simultaneously transmit two different parts of a picture to two receivers. Experiments show that the transmitted picture can be successfully retrieved only if the received signals of different receivers are synthetized as predefined. The proposed scheme provides a new route of employing PM in information encryption and spectrum utilization of wireless communication.

show abstract

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Multiple-Antenna Eavesdropper

Cited by 165 publications

References 43 publications

Secure Communication for Two-way Relay Networks with Imperfect CSI

Secure Communication for Two-way Relay Networks with Imperfect CSI

Fair Resource Allocation with QoS Guarantee in Secure Multiuser TDMA Networks

Metasurface‐Assisted Wireless Communication with Physical Level Information Encryption

Contact Info

Product

Resources

About