An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels

Sadeghi, Parastoo; Shams, Ramtin; Traskov, Danail

doi:10.1155/2010/618016

Cited by 100 publications

(123 citation statements)

References 5 publications

Supporting

Mentioning

120

Contrasting

Unclassified

Order By: Relevance

“…IDNC attracted many studies [16]- [23], [24] in the recent years for its instant decodability properties. IDNC is achieved by encoding packets using only XOR-based operations [25,26,27].…”

Section: Introductionmentioning

confidence: 99%

Rate aware network codes for coordinated multi base-station networks

Saif

Douik

Sorour

2016

2016 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

“…IDNC attracted many studies [16]- [23], [24] in the recent years for its instant decodability properties. IDNC is achieved by encoding packets using only XOR-based operations [25,26,27].…”

Section: Introductionmentioning

confidence: 99%

Rate aware network codes for coordinated multi base-station networks

Saif

Douik

Sorour

2016

2016 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

“…Due to the aforementioned attractive properties, the authors in [31,32,36,37] considered IDNC for wireless broadcast of a set of packets and aimed to serve the maximum number of receivers with a new packet in each transmission. In [34,38], the authors addressed the problem of minimizing the number of transmissions required for broadcasting a set of packets in IDNC systems and formulated the problem into a stochastic shortest path (SSP) framework.…”

Section: Introductionmentioning

confidence: 99%

“…In [34,38], the authors addressed the problem of minimizing the number of transmissions required for broadcasting a set of packets in IDNC systems and formulated the problem into a stochastic shortest path (SSP) framework. However, the works in [31,32,34,[36][37][38] neither considered dependency between source packets as is present in the scalable video applications nor considered explicit packet delivery deadline. Several other works in IDNC considered different importance of packets and prioritized packets differently in coding decisions.…”

Section: Introductionmentioning

confidence: 99%

Instantly decodable network coding for real-time scalable video broadcast over wireless networks

Karim

Sadeghi

Sorour

et al. 2016

EURASIP J. Adv. Signal Process.

Self Cite

View full text Add to dashboard Cite

In this paper, we study real-time scalable video broadcast over wireless networks using instantly decodable network coding (IDNC). Such real-time scalable videos have hard deadline and impose a decoding order on the video layers. We first derive the upper bound on the probability that the individual completion times of all receivers meet the deadline. Using this probability, we design two prioritized IDNC algorithms, namely the expanding window IDNC (EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm. These algorithms provide a high level of protection to the most important video layer, namely the base layer, before considering additional video layers, namely the enhancement layers, in coding decisions. Moreover, in these algorithms, we select an appropriate packet combination over a given number of video layers so that these video layers are decoded by the maximum number of receivers before the deadline. We formulate this packet selection problem as a two-stage maximal clique selection problem over an IDNC graph. Simulation results over a real scalable video sequence show that our proposed EW-IDNC and NOW-IDNC algorithms improve the received video quality compared to the existing IDNC algorithms.

show abstract

“…On the other hand, feedback-oriented retransmission techniques were developed, like in [13]- [18]. The authors of [13] have developed an algorithm that finds a low-complexity compromise between the above presented solutions.…”

Section: Introductionmentioning

confidence: 99%

“…[14]- [16] propose algorithms that target delaysensitive applications, such as video streaming. Adaptive IDNC algorithms were shown in [17], [18], however, these methods require feedback for every (re)transmitted packet to determine the reception status for every receiver and, hence, make a decision on the packets combination. This technique is not suitable for networks with long Round-Trip Times (RTTs) delay, such as satellite systems.…”

Section: Introductionmentioning

confidence: 99%

Instantly decodable network coding protocols with unequal error protection

Muhammad

Berioli

Liva

et al. 2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-This work aims at introducing two novel packet retransmission techniques for reliable multicast in the framework of Instantly Decodable Network Coding (IDNC). These methods are suitable for order-and delay-sensitive applications, where some information is of high importance for an earlier gain at the receiver's side. We introduce hence an Unequal Error Protection (UEP) scheme, showing by simulations that the Quality of Experience (QoE) for the end-users is improved even without complex encoding and decoding.

show abstract

An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels

Cited by 100 publications

References 5 publications

Rate aware network codes for coordinated multi base-station networks

Rate aware network codes for coordinated multi base-station networks

Instantly decodable network coding for real-time scalable video broadcast over wireless networks

Instantly decodable network coding protocols with unequal error protection

Contact Info

Product

Resources

About