Distributed Irregular Codes Relying on Decode-and-Forward Relays as Code Components

Ng, Soon Xin; Li, Yonghui; Vucetic, Branka; Hanzo, Lajos

doi:10.1109/tvt.2014.2370737

Cited by 5 publications

(4 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…) ρ is the reduced distance related path gain [17,56], and ρ is the pathloss exponent, while the distance between the two transceivers is represented as d kr . The received SNR at node r will be defined as γ kr = |h kr | 2 N 0 , where N 0 /2 is the noise variance per dimension.…”

Section: S D R Untrusted Relaymentioning

confidence: 99%

See 1 more Smart Citation

Cooperative Jamming-Assisted Untrusted Relaying Based on Game Theory for Next-Generation Communication Systems

et al. 2023

Self Cite

View full text Add to dashboard Cite

In this contribution, we investigate the performance of an untrusted relaying system when Cooperative Jammers (CJs) are available. We propose two scenarios, Untrusted Relaying-aided Multiple Cooperative-Jammers-based Simultaneous Transmission (UR-MCJST) and an Untrusted Relaying-aided Multiple Cooperative Jammers-based Time-Division Transmission (UR-MCJTDT). The performances of both UR-MCJST and UR-MCJTDT schemes are investigated. The source node is the primary user (PU) that has access to a transmission bandwidth. An untrusted relay is employed for improving the reliability of the PU transmission, while CJs are invoked for improving the secrecy rate of the PU transmission. The transmission strategy for the scheme proposed in this paper is split into three unique phases. The first phase is called the broadcast-and-jamming phase, while the second phase is called the relaying phase, and the final phase is called CJ’s secondary phase, which is used for transmitting the secondary user message. More explicitly, CJs transmit noise for impairing the untrusted relay node’s ability to decode the message during the broadcast-and-jamming phase. In compensation for their help, CJs are allocated part of the available spectrum by the PU for their transmission during the secondary transmission phase. A Stackelberg leader–follower game was considered between the PU and the CJs, while a power control game that is based on the well-known Nash equilibrium is employed by the CJs. Furthermore, an investigation into the effect of invoking simultaneous transmission and time-division-based transmission scenarios during the CJs’ secondary transmission phase was carried out. Finally, we evaluated the achievable secrecy rate of the PU and the utility rate of the CJs in our proposed scheme.

show abstract

Section: S D R Untrusted Relaymentioning

confidence: 99%

“…The wireless transmission's broadcast nature enables relay terminals to receive signals without incurring additional costs. Moreover, cooperative communications generally take advantage of decreased path loss, resulting in enhanced power efficiency, as emphasized in the studies [16,17].…”

Section: Introductionmentioning

confidence: 99%

Cooperative Jamming-Assisted Untrusted Relaying Based on Game Theory for Next-Generation Communication Systems

et al. 2023

Self Cite

View full text Add to dashboard Cite

show abstract

“…Having this distributed construction lends a higher degree of freedom to the system, which is achieved at the cost of a more complex design and implementation. The distributed coding schemes may be classified into five categories, namely distributed source-channel coding schemes [150]- [152], distributed network and channel coding [153], [154], distributed low density parity check codes (LDPC) [155], [156], distributed turbo coding schemes [157]- [159] and finally distributed space time coding [45], [160]. In all the above-mentioned distributed schemes [45], [151], [154], [156], [159], EXIT charts were shown to be an effective tool used for designing the distributed schemes for approaching the corresponding channel capacity.…”

Section: Application In Cooperative Communicationmentioning

confidence: 99%

“…For the case of considering the availability of the signal transmitted via the SD link, please allow us to refer interested readers to Ref. [45], [159]. Note that the number of relay nodes N R = 2 is chosen for clarity of presentation.…”

Section: Application In Cooperative Communicationmentioning

confidence: 99%

Near-Capacity Wireless System Design Principles

Nguyen

et al. 2015

IEEE Commun. Surv. Tutorials

Self Cite

View full text Add to dashboard Cite

Abstract-In this tutorial, the design procedure of nearcapacity channel code design invoking non-binary EXtrinsic Information Transfer (EXIT) charts is illustrated by using design examples of Irregular Concatenated Coding Arrangements (ICCAs) relying on Irregular Convolutional Codes (IrCCs). More specifically, in order to benchmark the near-capacity design examples, both the capacity and the Outage Probability (OP) of the Continuous-input Continuous-output Memoryless Channel (CCMC), of the Discrete-input Continuous-output Memoryless Channel (DCMC) as well as of the Differential Discreteinput Continuous-output Memoryless Channel (D-DCMC) are characterised. Furthermore, the EXIT-chart aided near-capacity design principles are illustrated by detailing the design process of three characteristic prototype schemes, which represent the family of coherent and non-coherent detection based systems as well as Multi-Input Multi-Output (MIMO) systems, respectively. Moreover, the beneficial application of the EXIT-chart based design principle is also demonstrated in the context of cooperative systems using a specific distributed MIMO prototype scheme.

show abstract

Cooperative Communications, Distributed Coding and Machine Learning

2020

Communications in Computer and Information Science

View full text Add to dashboard Cite

Distributed Irregular Codes Relying on Decode-and-Forward Relays as Code Components

Abstract: Abstract-A near-capacity distributed coding scheme is con-5 ceived by incorporating multiple relay nodes (RNs) for con-6 structing a virtual irregular convolutional code (IRCC). We first

Cited by 5 publications

References 37 publications

Cooperative Jamming-Assisted Untrusted Relaying Based on Game Theory for Next-Generation Communication Systems

Cooperative Jamming-Assisted Untrusted Relaying Based on Game Theory for Next-Generation Communication Systems

Near-Capacity Wireless System Design Principles

Cooperative Communications, Distributed Coding and Machine Learning

Contact Info

Product

Resources

About