Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

Chu, Zheng; Cumanan, Kanapathippillai; Ding, Zhiguo; Johnston, Martin; Goff, S.Y. Le

doi:10.1109/tvt.2014.2336092

Cited by 193 publications

(96 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors [4,18,19] proposed distributed algorithms for assigning users to SCAs using auctioning, heuristic beamforming designs, Stackelberg games and evolutionary games. Despite all these auction-based algorithms reported in [20,21], algorithms that considered multiple user access through spatial beamforming and auctioning mechanism have not been reported in the literature, which is the focus of this paper.…”

Section: Related Workmentioning

confidence: 99%

Auction‐based competition of hybrid small cells for dropped macrocell users

Basutli

Lambotharan

2017

IET signal process.

View full text Add to dashboard Cite

We propose an auction‐based beamforming and user association algorithm for a wireless network consisting of a macrocell and multiple small cell access points (SCAs). The SCAs compete for serving the macrocell base station (MBS) users (MUs). The corresponding user association problem is solved by the proposed bid‐wait auction method. The authors considered two scenarios. In the first scenario, the MBS initially admits the largest possible set of MUs that it can serve simultaneously and then auctions off the remaining MUs to the SCAs, who are willing to admit guest users in addition to their commitments to serve their own host users. This problem is solved by the proposed forward bid‐wait auction. In the second scenario, the MBS aims to offload as many MUs as possible to the SCAs and then admits the largest possible set of remaining MUs. This is solved by the proposed backward bid‐wait auction. The proposed algorithms provide a solution that is very close to the optimum solution obtained by using a centralised global optimisation.

show abstract

Section: Related Workmentioning

confidence: 99%

Auction‐based competition of hybrid small cells for dropped macrocell users

Basutli

Lambotharan

2017

IET signal process.

View full text Add to dashboard Cite

show abstract

“…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

“…In addition to helping relay the desirable information signals from source nodes to destination nodes, trusted relays can also implement CJ [12,13] to confuse the potential eavesdroppers by simultaneously sending jamming signals together with the information signals. Furthermore, due to the success of multi-antenna techniques in wireless communications, employing multiple antennas in the secure relay systems has also been investigated in the literature recently [14][15][16], in which the multi-antenna nodes can adjust the directions of their transmitted information and jamming signals so as to further improve the secure performance.…”

Section: Introductionmentioning

confidence: 99%

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Fei

2016

J Wireless Com Network

View full text Add to dashboard Cite

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

show abstract

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

Cited by 193 publications

References 27 publications

Auction‐based competition of hybrid small cells for dropped macrocell users

Auction‐based competition of hybrid small cells for dropped macrocell users

Fair Resource Allocation with QoS Guarantee in Secure Multiuser TDMA Networks

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Contact Info

Product

Resources

About