Artificial noise–aided secure communication in a bidirectional relaying network

Liu, An; Xu, Yizhu; Wang, Yuhao; Sun, Liang

doi:10.1002/dac.3464

Cited by 5 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Zhou et al, 26 a comparison between one-way and two-way half-duplex AF relaying schemes with an untrusted relay is studied in terms of their secrecy rates, and it is found that with equal transmit power at the two relaying protocols, the two-way relaying scheme has better performance compared with one-way relaying protocol under high SNR regime. In Li et al, 27 an AN-aided jamming strategy is exploited to improve the secrecy rate of a two-way AF relay network in the presence of an eavesdropper, employing power allocation at the source and relay. The authors in Deng et al 28 investigate the secure communications of multiuser untrusted AF relay networks considering direct links where one user is selected with the help of an untrusted relay.…”

Section: Introductionmentioning

confidence: 99%

“…Adopting the transmission scheme in An et al 24 to the proposed model, the three scenarios are studied under two cooperative schemes; AF without and with artificial noise (AN) and their secrecy performance is compared with direct transmission schemes. Here, the main focus is on relay selection; however, the proposed algorithm can be further modified and applied for two-way relay communication 26,27 employing cooperative trusted or untrusted relays.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Jibukumar

Sabu

2018

Int J Communication

View full text Add to dashboard Cite

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify-and-forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end-to-end signal-to-noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R s ); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Jibukumar

Sabu

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Jibukumar

Ali

2019

Int J Communication

View full text Add to dashboard Cite

SummaryCooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.

show abstract

Recursive quadratic programming for constrained nonlinear optimization of session throughput in multiple‐flow network topologies

Mehta

2020

Engineering Reports

View full text Add to dashboard Cite

In this article, we propose and formulate a single‐objective nonlinearly constrained programming problem with delay and capacity constraints. Specifically, we consider the utility resource allocation with the goal of maximizing the throughput amongst the multiple heterogeneous sessions in the network. Several numerical experiments for multiple topologies exhibit the performance and global convergence process of the proposed iterative algorithm. These network topologies are considered with distinct source‐destination communication sessions to emphasize the traffic flow analysis and optimal rate allocation vectors. For this, we employ recursive quadratic programming method and Lagrangian multiplier approach to solve the proposed optimization problem. The presented numerical results are obtained using Octave simulation tool. The results obtained from implementation of numerical simulation demonstrate the robustness and convergence performance of the proposed optimization scheme to optimal solution within finite number of iterations. Finally, we employ various global measures of fairness including the entropy‐based index, G's fairness index, linear product‐based fairness index, and Bossaer's fairness index to assess the performance of the proposed resource allocation scheme.

show abstract

Artificial noise–aided secure communication in a bidirectional relaying network

Cited by 5 publications

References 24 publications

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Recursive quadratic programming for constrained nonlinear optimization of session throughput in multiple‐flow network topologies

Contact Info

Product

Resources

About