Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections

This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive ackn...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications Jg. 14; H. 11; S. 5956 - 5970
Hauptverfasser: Douik, Ahmed, Sorour, Sameh, Al-Naffouri, Tareq Y., Alouini, Mohamed-Slim
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.11.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Blinds
Channels
Decoding
decoding delay
Delay
Delays
Feedback
G-IDNC
lossy intermittent feedback
Mathematical models
Multicast channels
Network coding
Networks
persistent erasure channels
Propagation losses
Receivers
Reduction
Uplink
Wireless communication
lossy intermittent feedback
Multicast channels
G-IDNC
persistent erasure channels
decoding delay
ISSN:1536-1276, 1558-2248
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers the multicast decoding delay reduction problem for generalized instantly decodable network coding (G-IDNC) over persistent erasure channels with feedback imperfections. The feedback scenario discussed is the most general situation in which the sender does not always receive acknowledgments from the receivers after each transmission and the feedback communications are subject to loss. The decoding delay increment expressions are derived and employed to express the decoding delay reduction problem as a maximum weight clique problem in the G-IDNC graph. This paper provides a theoretical analysis of the expected decoding delay increase at each time instant. Problem formulations in simpler channel and feedback models are shown to be special cases of the proposed generalized formulation. Since finding the optimal solution to the problem is known to be NP-hard, a suboptimal greedy algorithm is designed and compared with blind approaches proposed in the literature. Through extensive simulations, the proposed algorithm is shown to outperform the blind methods in all situations and to achieve significant improvement, particularly for high time-correlated channels.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2015.2445338