Adaptive network coding for broadcast channels

Sadeghi, Parastoo; Traskov, Danail; Koetter, R.

doi:10.1109/netcod.2009.5191398

Cited by 98 publications

(97 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Definition II.1. A transmitted packet or combination is noted as innovative for user j if he is missing the packet or one packet from the combination [17]. [17].…”

Section: System Modelmentioning

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%

See 1 more Smart Citation

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

“…Definition II.1. A transmitted packet or combination is noted as innovative for user j if he is missing the packet or one packet from the combination [17]. [17].…”

Section: System Modelmentioning

confidence: 99%

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

show abstract

“…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

“…Such optimization is very difficult even for erasure-free [14] and offline coding [15], [16] scenarios, i.e., perfect knowledge of the future channel realizations. The problem is even more complicated in online [17]- [19] coding scenarios as it becomes anti-causal due to the dynamic nature of the channel realizations and the dependence of the optimal solution on their effect.…”

Section: Introduction Imentioning

confidence: 99%

Rate Aware Instantly Decodable Network Codes

Douik

Sorour

Al-Naffouri

et al. 2015

2015 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

Abstract-This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications and abstract the model as equally slotted time for all users, this paper proposes a crosslayer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The consideration of asymmetric rates for receivers reflects more practical application scenarios and introduces a new trade-off between the choice of coding combinations for various receivers and the broadcasting rates. The completion time minimization problem in such scenario is first shown to be intractable. The problem is thus approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. The highest weight clique in the created graph being potentially not unique, the paper further suggests a multi-layer version of the proposed solution to improve the obtained results from the employed completion time approximation. Simulation results indicate that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme.

show abstract

Adaptive network coding for broadcast channels

Cited by 98 publications

References 10 publications

Instantly decodable network coding protocols with unequal error protection

Instantly decodable network coding protocols with unequal error protection

Rate aware network codes for coordinated multi base-station networks

Rate Aware Instantly Decodable Network Codes

Contact Info

Product

Resources

About