Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks

Hejazi, Mohsen; Azimi-Abarghouyi, Seyed Mohammad; Makki, Behrooz; Nasiri-Kenari, Masoumeh; Svensson, Tommy

doi:10.1109/tvt.2015.2506981

“…where (12) is obtained with the same procedure as in (11). Using (4), the SNR received by the destination from the data transmission of the AF-relay is found as…”

Section: A Two-hop Networkmentioning

confidence: 99%

“…However, finite block-length analysis of relay networks which is of interest in delay-constrained applications, has been rarely studied [3]- [8]. Different decode-and-forward (DF) [9], AF (A:amplify) [10], compute-and-forward [11] and compress-and-forward [12] methods have been proposed for relaying the messages, among which AF and DF are of particular interest due to their simplicity and appropriate data transmission efficiency.…”

Section: Introductionmentioning

confidence: 99%

End-to-End Performance Analysis of Delay-Sensitive Multi-Relay Networks

Makki¹,

Alouini

²

2019

Self Cite

View full text Add to dashboard Cite

We study the end-to-end (E2E) performance of multirelay networks in delay-constrained applications. The results are presented for both decode-and-forward (DF) and AF (A: amplify) relaying schemes. We use some fundamental results on the achievable rates of finite-length codes to analyze the system performance in the cases with short packets. Taking the message decoding delays and different numbers of hops into account, we derive closed-form expressions for the E2E packet transmission delay, the E2E error probability as well as the E2E throughput. Moreover, for different message decoding delays, we determine the appropriate codeword length and the relay power such that the same E2E error probability and packet transmission delay are achieved in the AF-and DF-relay networks. As we show, for different codeword lengths and numbers of hops, the E2E performance of multi-relay networks are affected by the message decoding delay of the nodes considerably.

show abstract

“…This paper assumes that the transmissions from the relays to the destination are lossless. The process of forwarding the codeword combinations to the destination can be done as in the works of [8,9] by exploiting the coordination from the destination via control messages between the relays and the destination to select which codeword combinations are to be forwarded and which relays to forward. 1 This scenario is considered as data collection in wireless sensor networks or data backhauling in ultra-dense networks, and it is a part of the topologies of these networks.…”

Section: Scenariomentioning

confidence: 99%

“…In order to make λ k (d k ) denser, in addition to forcing to obtain β (i) lm without zero elements at each relay, improving the diversity of the received codeword combinations by increasing the number of participating relays or equipping more antennas at relays as in work of [8,9] might be a solution.…”

Section: Impact Of the Participation Factor Of Each Sourcementioning

confidence: 99%

A Design of Overlapped Chunked Code over Compute-and-Forward in Multi-Source Multi-Relay Networks

Ngeth

¹

,

Lim

²

,

Kurkoski

³

et al. 2018

2018 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

This paper investigates the design of overlapped chunked codes (OCC) for multi-source multi-relay networks where a physical-layer network coding approach, compute-and-forward (CF) based on nested lattice codes (NLC), is applied for the simultaneous transmissions from the sources to the relays. This code is called OCC/CF. In this paper, OCC is applied before NLC before transmitting for each source. Random linear network coding is applied within each chunk. A decodability condition to design OCC/CF is provided. In addition, an OCC with a contiguously overlapping, but non-rounded-end fashion is employed for the design, which is done by using the probability distributions of the number of innovative codeword combinations and the probability distribution of the participation factor of each source to the codeword combinations received for a chunk transmission. An estimation is done to select an allocation, i.e., the number of innovative blocks per chunk and the number of blocks taken from the previous chunk for all sources, that is expected to provide the desired performance. From the numerical results, the design overhead of OCC/CF is low when the probability distribution of the participation factor of each source is dense at the chunk size for each source.

show abstract

“…The destination can recover the original blocks of all sources from the codeword combinations forwarded from the relays if it receives enough linearly independent (i.e., innovative) codeword combinations. The cooperation between relays can provide the opportunity for the destination to collect enough linearly independent codeword combinations with desired purposes such as obtaining the highest sum rate [ 8 , 9 ] or the highest throughput [ 10 ] while the sources also take part.…”

Section: Introductionmentioning

confidence: 99%

A Design of Overlapped Chunked Code over Compute-and-Forward for Multi-Source Multi-Relay Networks

Ngeth

¹

,

Kurkoski

²

,

Lim

³

et al. 2018

Sensors

0

View full text Add to dashboard Cite

This paper investigates the design of overlapped chunked codes (OCC) for multi-source multi-relay networks where a physical-layer network coding approach, compute-and-forward (CF) based on nested lattice codes (NLC), is applied for the simultaneous transmissions from the sources to the relays. This code is called OCC/CF. In this paper, OCC is applied before NLC before transmitting for each source. Random linear network coding is applied within each chunk. A decodability condition to design OCC/CF is provided. In addition, an OCC with a contiguously overlapping, but non-rounded-end fashion is employed for the design, which is done by using the probability distributions of the number of innovative codeword combinations and the probability distribution of the participation factor of each source to the codeword combinations received for a chunk transmission. An estimation is done to select an allocation, i.e., the number of innovative blocks per chunk and the number of blocks taken from the previous chunk for all sources, that is expected to provide the desired performance. From the numerical results, the design overhead of OCC/CF is low when the probability distribution of the participation factor of each source is dense at the chunk size for each source.

show abstract

Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks

Cited by 15 publications

References 39 publications

End-to-End Performance Analysis of Delay-Sensitive Multi-Relay Networks

End-to-End Performance Analysis of Delay-Sensitive Multi-Relay Networks

A Design of Overlapped Chunked Code over Compute-and-Forward in Multi-Source Multi-Relay Networks

A Design of Overlapped Chunked Code over Compute-and-Forward for Multi-Source Multi-Relay Networks

Contact Info

Product

Resources

About