Performance Analysis of Fountain Codes in Multihop Relay Networks

James, Ashish; Madhukumar, A. S.; Kurniawan, Ernest; Adachi, Fumiyuki

doi:10.1109/tvt.2013.2265279

Cited by 18 publications

(17 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The formula in (4) does not admit a close-form expression, and neither does (5). However, we will now illustrate a conveniently compact way to write (4), which we will leverage on to compute other metrics.…”

Section: Scenario Description and Modelmentioning

confidence: 99%

“…The value of q r thus derived can be finally plugged into (5) to obtain an upper bound to the probability of decoding the fountain code at D. Along the same line of (10), we now compute the average number of transmissions that all nodes carry out to advance a given packet towards the destination (regardless of whether the packet actually reaches the destination or not). Focus on relay stage i and assume that j i−1 nodes failed the reception of the packet at stage i − 1.…”

Section: Scenario Description and Modelmentioning

confidence: 99%

“…The latter condition makes fountain codes particularly suited for wireless networks [3], [4], where the capability to dynamically adjust the amount of redundancy offers a further shield against link breakages and communication failures [5].…”

Section: Introduction and Related Workmentioning

confidence: 99%

“…In the same vein, distributed storage systems can be made more reliable by employing packet codes in the presence of erasure channels [10]. In [5], an analytical model is provided for the throughput performance of a fountain code transmitted through either a conventional or a cooperative multihop network, both in the delay tolerant and in the delayconstrained case, assuming a Nakagami fading model. However, multihop communications take place through a single, fixed path known a priori, rather than considering a flooding scenario as we do in this paper.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 3 more Smart Citations

On the number of transmissions vs. redundancy tradeoff for flooded fountain codes

Casari

Abbas

Zorzi

2014

2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

View full text Add to dashboard Cite

We consider a multihop ad hoc network where a source node must reliably deliver a set of data packets to a given destination node. To do so, the source applies a fountain code and floods the encoded packets through the network, until they reach their destination or are lost in the process. We model the probability that the destination can recover the original transmissions from the received coded packets as a function of the network topology and of the number of redundant packets generated by the source, and show that our analytical results predict the outcome of simulations very well. These results are finally employed to discuss how the number of cooperating relays and the redundancy of the code should be set in order to achieve a good working point on the tradeoff between the reliability of end-to-end communications and the number of packet transmissions that take place in the network

show abstract

Section: Scenario Description and Modelmentioning

confidence: 99%

Section: Scenario Description and Modelmentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

On the number of transmissions vs. redundancy tradeoff for flooded fountain codes

Casari

Abbas

Zorzi

2014

2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

View full text Add to dashboard Cite

show abstract

“…The existence of efficient and reliable rateless codes for DCNs under different channel conditions has been proved in [17]. Recently the authors have also analysed the impact of delay constraints on multihop rateless coded networks [18], [19]. In DCNs, the maximum transmission time is fixed to constrain the total delay.…”

Section: Introductionmentioning

confidence: 99%

Spectrally Efficient Packet Recovery in Delay Constrained Rateless Coded Multihop Networks

James

Madhukumar

Kurniawan

et al. 2013

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Rateless codes have been found to be particularly attractive for decode and forward based relaying strategy in delay tolerant multihop networks. The latency performance of such networks is dependent on the worst links that results in the starvation of subsequent nodes with good channel conditions. The total delay suffered by such networks can be constrained by limiting the number of rateless coded transmissions, especially for applications with critical latency requirements. However, the performance of rateless codes deteriorates in such circumstances due to the lack of sufficient mutual information for successfully recovering the entire source packets. The fraction of source packets that can be recovered will depend on the encoded packets received across the transmission channel. This paper investigates the degradation in the performance of such rateless coded networks by deriving the average packet recovery rate.In order to improve the reliability in such delay constrained networks, a novel spectrally efficient transmission scheme for reliable multihop data transfer is proposed. The proposed scheme exploits the broadcast nature of wireless transmissions, which provides an inherent implicit feedback channel, to ensure the reliable delivery of information packets to the nodes in the network. Rather than allocating dedicated channels to feedback the packet recovery information, the implicit feedback channel determines such information which enhances the spectral efficiency. Further, the optimum number of packets recoverable within the specified delay constraint to reduce the reprocessing of lost packets across hops is analytically analysed in this paper.Index Terms-Fountain/rateless codes, delay constrained multihop networks, implicit feedback assisted transmission.

show abstract

Survey on cooperative strategies for wireless relay channels

Dai

Wang

Zhang

et al. 2014

Trans. Emerging. Tel. Tech.

View full text Add to dashboard Cite

Cooperative communication has the potential of providing better throughput and reliability to wireless systems when compared with direct communication. To realise the potential gain, it is important to design cooperative strategies for some representative scenarios. This survey deals with three basic wireless relay channels, namely, the parallel relay channel, the multiple‐access relay channel and the broadcast relay channel. For the first channel, which models a single unicast connection, various forwarding strategies are studied. For the second and third channels, which model, respectively, the uplink and downlink scenarios with multiple unicast connections; network codes that exploit the possibility of coding among the connections are studied. The common aim pertaining to the studies of all these three channels is to use the limited radio resource in the most efficient way. Beside the aforementioned conventional works, studies that have state‐of‐the‐art assumptions for relay networks, including outdated channel state information at the transmitter, full duplex relay and practical rateless‐coded cooperation, are also extensively reviewed. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Performance Analysis of Fountain Codes in Multihop Relay Networks

Cited by 18 publications

References 29 publications

On the number of transmissions vs. redundancy tradeoff for flooded fountain codes

On the number of transmissions vs. redundancy tradeoff for flooded fountain codes

Spectrally Efficient Packet Recovery in Delay Constrained Rateless Coded Multihop Networks

Survey on cooperative strategies for wireless relay channels

Contact Info

Product

Resources

About