Delay-Efficient and Reliable Data Relaying in Ultra Dense Networks using Rateless Codes

08/25/2020 ∙ by Luyao Shang, et al. ∙ The University of Kansas 0

We investigate the problem of delay-efficient and reliable data delivery in ultra-dense networks (UDNs) that constitute macro base stations (MBSs), small base stations (SBSs), and mobile users. Considering a two-hop data delivery system, we propose a partial decode-and-forward (PDF) relaying strategy together with a simple and intuitive amicable encoding scheme for rateless codes to significantly improve user experience in terms of end-to-end delay. Simulation results verify that our amicable encoding scheme is efficient in improving the intermediate performance of rateless codes. It also verifies that our proposed PDF significantly improves the performance of the decode-and-forward (DF) strategy, and that PDF is much more robust against channel degradation. Overall, the proposed strategy and encoding scheme are efficient towards delay-sensitive data delivery in the UDN scenarios.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Within the last few years, we have witnessed a dramatic growth in the number of connected wireless devices that generate huge amounts of mobile data traffic. According to the Cisco Visual Networking Index (VNI), the global mobile data traffic was 0.24 exabytes (EB) per month in 2010. This number has grown to 40.77 EB per month so far in 2020, nearly a 170-fold increase over the past decade. To better serve this explosive demand in wireless data, ultra-dense network (UDN) has become one of the key enabling technologies in the fifth generation (5G) systems since it significantly improves the overall throughput by deploying small cells near the users [16, 9]. The small cells include relatively low-power base stations that cover geographical areas within a short distance from users.

As shown in Fig. 1, the UDN constitutes the macro base station (MBS), small base stations (SBS), and users. The communications between MBS and users are supported by SBSs, forming a two-hop relay system. Popular relaying strategies such as decode-and-forward (DF) and amplify-and-forward (AF) are commonly adopted in multi-hop relay systems. The AF outperforms the DF in terms of latency but the DF provides higher reliability. On the other hand, to enhance reliability under unknown channel conditions, rateless (fountain) codes [5, 4, 22, 21], such as Luby transform (LT) codes [20] and Raptor codes [29, 30], can be deployed. Rateless codes are capacity achieving for large block lengths, and are widely considered for multi-hop relay systems [7, 11]. In contradistinction with fixed-rate codes, rateless codes do not assume a pre-defined coding rate. Instead, the encoder potentially generates an unlimited number of codewords until decoding is successful.

Rateless codes are particularly beneficial for broadcasting/multicasting applications where a large number of receivers (e.g., massive machine-type and IoT communications) hinder channel estimation that can cause the feedback explosion problem. Yet, the problem with traditional fountain codes is that they show an

all-or-nothing decoding property such that the decoder only recovers a small portion of source messages until the very end. This performance is not desirable for real-time and delay-sensitive data delivery such as the scalable video streaming where the video quality is improved progressively as data arrives.

In order to improve the intermediate performance metric (i.e., number of recovered symbols as coding proceeds), there has been an extensive amount of research such as [31, 32, 33, 6, 13, 12, 17, 18]. These works mostly rely on either feedback channels or encoding/decoding operations with higher complexities, none of which is favorable to UDNs since: (i) due to the massive number of devices, leveraging the feedback channel may not be feasible, and (ii) low-power SBS, IoT, and sensory devices are not well-suited for high complexity encoding and decoding operations. Recently, memory-based LT encoders (MBLTEs) [14, 15, 28, 26, 27] were proposed for improving the bit-error-rate (BER)/frame-error-rate (FER) performance of LT codes with relatively short block-lengths at the cost of adding memory into the encoder while maintaining the same low encoding/decoding complexity as LT codes.

Fig. 1: Illustration of the downlink communications of an ultra-dense network. The network includes a MBS and multiple SBSs with a number of users. The SBSs are densely deployed within a short distance from the users. The MBS fetches data from the content provider through the core network router, and delivers it to the users that are served by the SBSs via a two-hop link that operates on orthogonal spectra.

Our work is motivated by the UDN use-cases that call for delay-efficient data delivery with little-to-no coding feedback overhead and low-complexity encoding and decoding operations. To this end, we first demonstrate that memory-based LT codes improve the intermediate performance without utilizing feedback signals. Thus, they are especially suitable for UDN scenarios where feedback explosions and power/complexity are more of a concern than the amount of buffers/memory. Next, we propose a new relaying strategy based on DF for the SBSs in the UDN such that the real-time delay of data delivery to the users can be significantly improved. In addition, we propose an amicable rateless coding scheme that further improves the intermediate performance at the cost of adding temporary buffers. We present simulation results to verify that our proposed relaying strategy and the coding scheme are efficient in improving user experience in terms of real-time data delivery in UDNs.

The rest of the paper is organized as follows. Section II describes the system model including the two-hop relay system, LT codes, and second-order MBLTEs. Section III describes the new relaying strategy proposed for the small cells in the UDN. Section IV describes the amicable encoding scheme for second-order MBLTEs. Section V presents simulation results, and Section VI concludes the paper.

Ii System Model

Ii-a Two-Hop Relay System

Fig. 2: The separated two-hop relay system. and

denotes the erasure probability for the source-relay and the relay-destination link, respectively. The source node encodes

input symbols , …, to output symbols , …, ; the relay node collects these output symbols then decodes, it then re-encodes the input symbols to output symbols , …, and forwards them to the destination; the destination node collects the output symbols then decodes.

In this paper, we consider the three-node two-hop wireless relay system for lossy packet networks as shown in Fig. 2. The system constitutes a source, a relay, and a destination. Two independent links, the source-relay and the relay-destination, are considered in the system. We do not consider the direct link where the source communicates directly with the destination. We term this setting separated two-hop relay, which is the simplest multi-hop communication problem and is frequently encountered in practice; for instance, in UDN scenarios, the source represents the MBS, the relay represents the SBS, and the destination represents the user.

We assume binary erasure channels (BECs) for the links. The packet/symbol that goes through a BEC is either received correctly or erased by the channel. Let and denotes the channel input and output, respectively, then and , where indicates an erasure, which occurs with probability .

For the traditional decode-and-forward (DF) relaying strategy, the communication is divided into two stages. In the first stage, the source encodes and transmits codewords to the relay. The relay starts decoding when it receives all of the codewords. It sends back an acknowledgement (ACK) to the source to terminate the transmission when decoding is successful. In the second stage, the relay re-encodes and transmits the codewords to the destination. The destination starts decoding when all codewords are received, and sends back an ACK to the relay in the event of a successful decoding. The DF achieves Shannon capacity of the separated two-hop relay system when the codeword length tends to infinity [8, 34]. However, DF is significantly suboptimal for finite block-length codes.

Ii-B LT Codes

Encoding: For binary source data of length , a -by- generator matrix encodes the input symbols to output symbols , ,…, . The operation is performed with bitwise, modulo-2 additions, i.e.:


where is an element of the generator matrix. The generator matrix is obtained column by column. Each column represents a relationship between the input symbols and an output symbol. To obtain the output symbols, we sample the output symbol distribution a total of times. The process for each sample is summarized below [21]:

  1. Randomly choose the degree from a degree distribution .

  2. Uniformly choose rows at random in the -th column in which to place a value of “1”.

Decoding: The peeling decoder is used to decode LT codes over the BEC. Assume the decoder receives all output symbols. The decoding process is summarized below [21]:

  1. Find an output symbol that is connected to only one input symbol . If there is no such output symbol, the decoding process stops. If there is, go to Step 2.

  2. Set the input symbol equal to the output symbol: =.

  3. Find other output symbols that are connected to .

  4. Add to each modulo 2.

  5. Remove all the edges connected to .

  6. Return to Step 1.

Next, we describe the memory-based LT encoding (MBLTE) scheme.

Ii-C Second-Order MBLTE

As outlined above, the LT encoder works by first sampling the degree distribution to obtain a degree of , and then sampling the input symbols a total of times. For a memoryless LT encoder, the current value of is all that is needed to proceed with sampling the input symbols. For a MBLTE, certain previous outcomes of are remembered which results in the input symbols being sampled differently. The order of the memory refers to the number of outcome types it remembers. For instance, remembering outcome types is called a -order MBLTE. For the sake of exposition, we only consider the second-order MBLTE in this paper. In the remainder of this paper, the term MBLTE represents the second-order MBLTE unless otherwise stated.

The MBLTE remembers two outcomes with values and . When , it samples the input symbol with the highest instantaneous degree, which is defined in [14, 15] as the highest degree at the time when the current output symbol is being constructed. When , it samples one input symbol from those with the highest instantaneous degrees, then another one from those symbols with the second highest instantaneous degree. The details are shown in Algorithm 1 [28].

1:Initialize an empty set
2:for   do
3:     sample to get
4:     if  then
5:         select the input symbol with the highest instantan-
6:         eous degree without replacement, then put this
7:         input symbol into set
8:     else if  then
9:         first select an input symbol from the set unifor-
10:         mly at random with replacement; then select an in-
11:         put symbol with the highest instantaneous degree
12:         except for those in set without replacement
13:     else
14:         for  do
15:              select an input symbol uniformly at random
16:              without replacement
17:         end for
18:     end if
19:end for
Algorithm 1 The MBLTE encoding process.

Iii Proposed Relaying Strategy

The DF relaying strategy provides reliable communication at the cost of non-negligible latency at the destination that grows linearly with the number of hops in the multi-hop system. The large latency at the destination results from the fact that the relay does not start re-encoding until the decoding is done. This problem would be greatly alleviated if decoding and re-encoding could operate simultaneously. Fig. 3 illustrates the motivation for proposing such a new relaying strategy. In the figure we assume zero propagation delay, i.e., once a codeword is generated by the encoder, it is received immediately by the decoder. In this way, the time it takes from source to destination is measured by the length of time it takes for the encodings and decodings in the system. Assume that the decoders at the relay and the destination are able to recover the source data after receiving and time slots’ coded data, respectively, as shown in (a) in Fig. 3. We see that the latency at the destination can be shortened by replacing fixed-rate codes with rateless codes, where decoding is complete right after sufficient data is collected, as shown in (b). The latency can be further improved if the relay starts re-encoding/transmitting before decoding is complete as shown in (c).

To have the relay decode and re-encode simultaneously, two requirements must be met: (i) the relay node operates in the full-duplex mode; and (ii) the relay recovers source data as coded data arrives. Nowadays as the usage of full-duplex relays is widespread, and as techniques such as [25, 3, 19] that mitigate the self-interference of full-duplex relays are well under development, the first requirement is no longer a concern. To meet the second requirement, rateless codes with good intermediate performance are needed. Now that we have discussed in Section I that MBLTE is a good candidate in this regard, the second requirement is also met.

Fig. 3: Motivation of the proposed relaying strategy. The communications between source and destination via relay is measured by the length of time. The box filled with left- and right-tilted stripes represents the time it takes for encoding at the source and the relay, respectively; the blank box with dashed and dotted borders represents the time it takes for decoding at the relay and the destination, respectively.

Iii-a Partial Decode-and-Forward Relaying

In this section, we consider full-duplex relays with rateless codes in the separated two-hop system, and assume no self-interference. Discussions on weighing between half- or full-duplex relays or the self-interference of full-duplex relays are beyond the scope of this paper, and can be found in the literature, cf. e.g. [1, 24, 10, 2, 23]. We also make the following assumptions: (i) each output symbol takes one time slot to be generated by the encoder; (ii) the output symbol is immediately received and processed by the decoder once it is generated; and (iii) the decoder can recover as many input symbols as possible in one time slot. We let and denote the set of recovered input symbols by the decoder at the relay and the destination, respectively, at time , thus and are empty initially. We propose a partial DF (PDF) relaying strategy, where the relay starts re-encoding immediately once becomes non-empty. The relay encodes over the input symbols in dynamically until it is notified by the destination to terminate. We assume that the relay starts encoding in the same time slot as becomes non-empty.

To better illustrate our proposed PDF relaying strategy, we resort to an example shown in Fig. 4. The circles and rectangles represent input and output symbols, respectively. There are five input symbols . The encoder at the source encodes these symbols into a potentially unlimited number of output symbols using modulo-2 operations. The decoder at the relay process each successfully-received encoded symbol . For instance, we assume that and are erased by the channel. The relay recovers and when and (t) becomes non-empty as shown in (2). The relay immediately starts re-encoding by encoding over and and generates its first output , which is transmitted to the destination but is erased by the channel. The relay generates an output symbol by re-encoding over the input symbols in (t) during each time slot thereafter until where the destination successfully completes decoding. The dynamic evolution of the sets and is shown in (2) and (3), respectively.

Fig. 4: Example of the proposed PDF relaying strategy.

Next, we propose amicable encoding scheme that will be used in conjunction with MBLTE.

Iv Amicable Encoding Scheme

Based on the proposed relaying strategy, the relay starts re-encoding and transmitting immediately once an input symbol is recovered. The earlier the relay starts re-encoding, the earlier the destination starts reception and decoding; thus, the real-time delay experienced by the users is reduced. As such, in this section we aim to propose an amicable MBLTE so that (i) it starts recovering input symbols earlier; and (ii) it recovers more input symbols during each time slot.

For the MBLTE, the decoder is not able to recover any input symbols until a degree- output symbol is received. Therefore, a good encoder should generate and transmit degree- output symbols early. In addition, according to the encoding process of the MBLTE, input symbols that are connected to the degree- output symbols are highly likely to be also connected to the degree- output symbols. Once the above-mentioned input symbols are recovered, their neighboring degree- output symbols reduce to degree-, enabling the decoder to proceed in terms of recovering more input symbols. Therefore, a good MBLTE should also transmit degree- output symbols early, following right after the transmission of the degree- symbols. However, because the encoder does not know how many output symbols to generate in the rateless scenario, it is also unknown how many degree- or degree- output symbols will be generated, not to mention ordering the transmissions.

To solve this problem, we propose an amicable rateless encoding scheme that divides the encoding process into two stages where the first stage can be viewed as a fixed-rate transmission and the second stage is rateless. We now predetermine the number of output symbols for the first stage. According to [27], the optimal memory order is the smallest integer that satisfies


where is the probability that an output symbol is degree-. In our case where the memory order is , we rearrange the inequality as


Although (5) does not apply for the rateless scenario where is unknown, it is a useful tool in determining the number of output symbols for the first stage of encoding. According to [27], ideally without channel erasures the decoder is able to recover all input symbols with the reception of output symbols if satisfies (5), while the performance degrades as grows if the channel erasure probability is nonzero. Therefore, selecting to be the smallest integer that satisfies (5) results in the second-order MBLTE being optimal. We thereby modify the MBLTE as detailed in Algorithm 2.

1:Initialize two empty sets: and
2:Define as the smallest integer that satisfies (5)
3:Sample a total of times, store values in . Rearrange the elements in such that they are in ascending order
4:for   do
5:     if  then
6:          the first element in
7:         remove the first element from
8:     else
9:         sample to get
10:     end if
11:     Select input symbols as detailed in Alg. 1, Lines 4–18
12:end for
Algorithm 2 The encoding process of the amicable MBLTE.

Because the amicable MBLTE does not change the degree distribution of the output symbols, and because it does not affect the decoding process, it maintains the same low encoding and decoding complexities as the traditional MBLTE. Compared to the traditional one, the amicable encoder requires additional buffers at the initial stage of encoding. However, is not large and only depends on the input symbol length when the degree distribution is fixed regardless of the channel condition. Moreover, the number of buffers decreases linearly as encoder proceeds as detailed in Algorithm 2. For applications where buffer size is less of a concern than delay or complexity, the amicable MBLTE is beneficial.

V Simulation Results

In this section, we present simulation results to evaluate the proposed partial decode-and-forward (PDF) strategy. Because the PDF would benefit from rateless codes that have good intermediate performance, we first compare the traditional MBLTE with the amicable MBLTE encoder and show that the latter has a better intermediate performance than the former. We then employ the amicable codes as the rateless codes in the two-hop system to evaluate the performance of our proposed PDF method against the decode-and-forward (DF) scheme. In the simulations, we fix the length of the input symbols at , and adopt the robust soliton distribution (RSD) with and  [20].

Fig. 5: Intermediate performance comparison of traditional MBLTE and amicable MBLTE as coding proceeds. The dotted lines represent the traditional encoder and the solid lines represent the amicable encoder. The channel erasure probability is denoted by . The input symbol length is fixed at .

V-a Performance of Amicable MBLTE for Single-hop

Fig. 5 shows the intermediate performance of the traditional MBLTE and amicable MBLTE under various erasure probabilities ranging from to . From the results, we note that although the performance of each encoder degrades as channel conditions worsen, the amicable encoder outperforms the traditional encoder for all channel conditions shown in the figure. Specifically, the gap between the encoders is about the same for the cases where , , and ; the gap becomes negligible during most of the decoding period when the channel erasure probability increases to and . One of the interesting phenomena in the figure is that for there is an obvious performance gain of the amicable encoder relative to the traditional one at the early stage of decoding where . It should be noted that we predetermine the number of output symbols for the first stage of encoding in Algorithm 2 such that the amicable encoder differs from the traditional one only in the first output symbols. For the parameters used in this simulation, the predetermined is around . Therefore, this phenomenon appearing in the case of is consistent with the amicable encoding process. Moreover, it verifies that the proposed amicable encoder is effective in improving the intermediate performance of the traditional MBLTE. A similar phenomenon is also observed for the case of although it is less obvious because of the poor channel condition. This is not observed for cases where because both codes have recovered most of the input symbols and are close to completion of decoding at .

Fig. 6: Comparison of DF and PDF using the amicable MBLTE as coding proceeds. The dotted lines represent DF and the solid lines represent PDF. The vertical axis represents the ratio of recovered input symbols at the destination. The input symbol length is fixed at . Various respective channel erasure probabilities and for the source–relay and relay–destination links are evaluated. The two sub-figures give a detailed view of PDF for some channel conditions around and .

V-B Performance of Partial Decode-and-Forward for Two-hop

Fig. 6 compares the performance of PDF with DF by employing the amicable MBLTE as the rateless codes at the source and the traditional MBLTE at the relay. Various channel erasure probabilities are evaluated with (source to relay) and (relay to destination) ranging from to , respectively. From the results, we see that PDF significantly improves the performance of DF for all channel conditions. Specifically, for each case with the PDF strategy, the destination starts to recover input symbols right from the beginning; while with DF, the destination is not able to recover any input symbols until . In addition, in each erasure scenario shown in the figure, DF only recovers less than 20% of input symbols at the time when 97% are recovered by PDF.

Moreover, from the figure we also notice that the gap between the best and worst scenarios is much smaller for PDF than it is for DF, i.e. PDF recovers 50% of the input symbols when in the case of and , and when in the case of and , resulting in a gap of ; while PDF does so at and , resulting in a gap of , which is more than double that of PDF. Therefore, PDF is much more robust against performance degradation due to erasures.

Vi Conclusions

In this paper, we have proposed a partial decode-and-forward (PDF) relaying strategy and have realized it with rateless codes. We have argued that the proposed PDF benefits from rateless codes that have good intermediate performance. We have showed that the recently developed MBLTE has good intermediate performance and we have proposed an amicable encoding scheme for a further performance gain at the cost of additional temporary buffers. We have presented simulation results to show that our amicable encoding algorithm is efficient in further improving the intermediate performance especially when the channel erasure probability is not too high, and that our proposed PDF not only significantly improves the performance of DF but is also more robust against performance degradation due to erasures. Overall, the proposed encoding scheme and the relaying strategy are efficient towards near real-time data delivery in the UDN and also the Internet of Things (IoT) scenario where many devices/sensors are power-limited thus a direct link from the source to destination is impossible. In our future work, we will investigate the tradeoffs between the delay and the overhead of the PDF strategy and extend the work to scenarios with more than two hops.


  • [1] V. Aggarwal, M. Duarte, A. Sabharwal, and N. K. Shankaranarayanan (2012) Full- or half-duplex? a capacity analysis with bounded radio resources. In 2012 IEEE Information Theory Workshop, Vol. , pp. 207–211. Cited by: §III-A.
  • [2] E. Aryafar, M. A. Khojastepour, K. Sundaresan, S. Rangarajan, and M. Chiang (2012-Aug.) MIDU: enabling MIMO full duplex. In 18th Annual Intl. Conf. on Mobile Computing and Networking, Vol. , pp. 257–268. Cited by: §III-A.
  • [3] I. Atzeni, M. Maso, and M. Kountouris (2016) Optimal low-complexity self-interference cancellation for full-duplex MIMO small cells. In 2016 IEEE International Conference on Communications (ICC), Vol. , pp. 1–6. Cited by: §III.
  • [4] J.W. Byers, M. Luby, and M. Mitzenmacher (2002-10) A digital fountain approach to asynchronous reliable multicast. IEEE Journal on Selected Areas in Communications 20 (8), pp. 1528–1540. Cited by: §I.
  • [5] J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege (1998) A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Computer Communication Review 28 (4), pp. 56–67. Cited by: §I.
  • [6] Y. Cassuto and A. Shokrollahi (2015) Online fountain codes with low overhead. IEEE Trans. Info. Theory 61 (6), pp. 3137–3149. Cited by: §I.
  • [7] J. Castura and Y. Mao (2007) Rateless coding for wireless relay channels. IEEE Trans. Wireless Commun. 6 (5), pp. 1638–1642. Cited by: §I.
  • [8] T. Cover and A. E. Gamal (1979-09) Capacity theorems for the relay channel. IEEE Trans. Info. Theory 25 (5), pp. 572–584. Cited by: §II-A.
  • [9] H. S. Dhillon, R. K. Ganti, F. Baccelli, and J. G. Andrews (2012) Modeling and analysis of K-tier downlink heterogeneous cellular networks. IEEE Journal on Selected Areas in Commun. 30 (3), pp. 550–560. Cited by: §I.
  • [10] M. Duarte, C. Dick, and A. Sabharwal (2012) Experiment-driven characterization of full-duplex wireless systems. IEEE Transactions on Wireless Communications 11 (12), pp. 4296–4307. Cited by: §III-A.
  • [11] R. Gummadi and R. S. Sreenivas (2008) Relaying a fountain code across multiple nodes. In IEEE Info. Theory Workshop, Vol. , pp. 149–153. Cited by: §I.
  • [12] M. Hashemi, Y. Cassuto, and A. Trachtenberg (2016) Fountain codes with nonuniform selection distributions through feedback. IEEE Trans. Info. Theory 62 (7), pp. 4054–4070. Cited by: §I.
  • [13] M. Hashemi and A. Trachtenberg (2014) Near real-time rateless coding with a constrained feedback budget. In 52nd Annual Allerton Conf. on Commun., Control, and Computing (Allerton), Vol. , pp. 529–536. Cited by: §I.
  • [14] K. F. Hayajneh, S. Yousefi, and M. Valipour (2014-06) Left degree distribution shaping for LT codes over the binary erasure channel. In 27th Biennial Symposium on Communications (QBSC), Vol. , pp. 198–202. Cited by: §I, §II-C.
  • [15] K.F. Hayajneh, S. Yousefi, and M. Valipour (2015) Improved finite-length Luby-Transform codes in the binary erasure channel. IET Communications 9 (8), pp. 1122–1130. Cited by: §I, §II-C.
  • [16] J. Hoadley and P. Maveddat (2012-04) Enabling small cell deployment with HetNet. IEEE Wireless Communications 19 (2), pp. 4–5. Cited by: §I.
  • [17] B. Jun, P. Yang, J. No, and H. Park (2015) New rateless codes for receiver with limited memory. In 2015 International Conference on Information and Communication Technology Convergence (ICTC), Vol. , pp. 482–484. Cited by: §I.
  • [18] B. Jun, P. Yang, J. No, and H. Park (2017) New fountain codes with improved intermediate recovery based on batched zigzag coding. IEEE Transactions on Communications 65 (1), pp. 23–36. Cited by: §I.
  • [19] M. T. Kabir, M. R. A. Khandaker, and C. Masouros (2017) Reducing self-interference in full duplex transmission by interference exploitation. In IEEE Global Communications Conference (GLOBECOM), pp. 1–6. Cited by: §III.
  • [20] M. Luby (2002) LT codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271–280. External Links: Document, ISBN 0272-5428 Cited by: §I, §V.
  • [21] D.J.C. MacKay (2005-12) Fountain codes. IEE Proceedings - Communications 152 (6), pp. 1062–1068. Cited by: §I, §II-B, §II-B.
  • [22] P. Maymounkov (2002) Online codes. Technical report New York University. Cited by: §I.
  • [23] M. M. Razlighi and N. Zlatanov (2017) On buffer-aided relaying for the two-hop full duplex relay channel with self-interference. In IEEE Global Communications Conference (GLOBECOM), pp. 1–7. Cited by: §III-A.
  • [24] T. Riihonen, S. Werner, and R. Wichman (2011) Hybrid full-duplex/half-duplex relaying with transmit power adaptation. IEEE Transactions on Wireless Communications 10 (9), pp. 3074–3085. Cited by: §III-A.
  • [25] T. Riihonen, S. Werner, and R. Wichman (2011) Mitigation of loopback self-interference in full-duplex MIMO relays. IEEE Transactions on Signal Processing 59 (12), pp. 5983–5993. Cited by: §III.
  • [26] L. Shang and E. Perrins (2018-12) Memory based LT encoders over BIAWGN channels. In IEEE GLOBECOM 2018, pp. 1–6. External Links: ISSN 1930-529X Cited by: §I.
  • [27] L. Shang and E. Perrins (2019-02) Optimal memory order of memory based LT encoders for finite block-length codes over binary erasure channels. IEEE Transactions on Communications 67 (2), pp. 875–889. External Links: ISSN 0090-6778 Cited by: §I, §IV.
  • [28] L. Shang and E. S. Perrins (2016-12) Second-order memory based LT encoder design. In 2016 IEEE Globecom Workshops, pp. 1–6. Cited by: §I, §II-C.
  • [29] A. Shokrollahi (2004-06) Raptor codes. In IEEE ISIT’04, Cited by: §I.
  • [30] A. Shokrollahi (2006-06) Raptor codes. IEEE Transactions on Information Theory 52 (6), pp. 2551–2567. External Links: Document, ISSN 0018-9448 Cited by: §I.
  • [31] A. Talari and N. Rahnavard (2010) Enhanced intermediate packet delivery in delay tolerant networks. In MILCOM 2010, Vol. , pp. 575–580. Cited by: §I.
  • [32] A. Talari and N. Rahnavard (2012) On the intermediate symbol recovery rate of rateless codes. IEEE Transactions on Communications 60 (5), pp. 1237–1242. Cited by: §I.
  • [33] N. Thomos, R. Pulikkoonattu, and P. Frossard (2013) Growth codes: intermediate performance analysis and application to video. IEEE Transactions on Communications 61 (11), pp. 4710–4721. Cited by: §I.
  • [34] C. Wang, D. J. Love, and D. Ogbe (2017) Transcoding: a new strategy for relay channels. In 2017 55th Allerton Conf., Vol. , pp. 450–454. Cited by: §II-A.