English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we investigate opportunistic relaying and jamming techniquesand develop relay selection algorithms that maximize the secrecy rate formultiuser buffer-aided relay networks. We develop an approach to maximize thesecrecy rate of relay systems that does not require the channel stateinformation (CSI) of the eavesdroppers. We also devise relaying and jammingfunction selection (RJFS) algorithms to select multiple relay nodes as well asmultiple jamming nodes to assist the transmission. In the proposed RJFSalgorithms inter-relay interference cancellation (IC) is taken into account. ICis first performed to improve the transmission rate to legitimate users andthen inter-relay IC is applied to amplify the jamming signal to theeavesdroppers and enhance the secrecy rate. With the buffer-aided relays thejamming signal can be stored at the relay nodes and a buffer-aided RJFS(BF-RJFS) algorithm is proposed. Greedy RJFS and BF-RJFS algorithms are thendeveloped for relay selection with reduced complexity. Simulation results showthat the proposed RJFS and BF-RJFS algorithms can achieve a higher secrecy rateperformance than previously reported techniques even in the absence of CSI ofthe eavesdroppers.

Study of Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Buffer-Aided Relay Systems