Optimizing completion delay in network coded systems over TDD erasure channels with memory

Abstract-In this paper, we study the broadcast decoding delay performance of generalized instantly decodable network coding (G-IDNC) in the lossy feedback scenario. The problem is formulated as a maximum weight clique problem over the G-IDNC graph in [1]. In order to further minimize the decoding delay, we introduce in this paper the lossy G-IDNC graph (LG-IDNC). Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations when the expected decoding delay of the encoded packet is lower than the individual expected decoding delay of each packet encoded in it. Since the maximum weight clique problem is known to be NP-hard, we use the heuristic introduced in [2] to discover the maximum weight clique in the LG-IDNC graph and finally we compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability.

show abstract

“…Similarly, when sending packet l for users i and k the decoding delay D(l) can be obtained by replacing j by l in (11).…”

Section: A Decoding Delay Increment Of a Packet Combinationmentioning

confidence: 99%

“…This assumption is not realistic due to the feedback channel impairments. Recently some research has been dedicated to study the decoding delay with limited feedback [1], [2], [10], [11]. More specifically in [1] we studied the decoding delay performance of G-IDNC in lossy and intermittent feedback for memoryless channels.…”

Section: Introductionmentioning

confidence: 99%

A Lossy Graph Model for Delay Reduction in Generalized Instantly Decodable Network Coding

Douik

Sorour

Al-Naffouri

et al. 2014

IEEE Wireless Commun. Lett.

View full text Add to dashboard Cite

show abstract

“…In the last few years, IDNC is an intensive subject of research [8]- [21]. While the authors in [8] investigate the sum decoding delay reduction for perfect feedback, the authors in [9], [17], [18], [22] study the effects of feedback imperfection on the sum decoding delay minimization. The maximum decoding delay is introduced in [19] as a more reliable delay metric in IDNC.…”

Section: Introductionmentioning

confidence: 99%

A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

Douik

Sorour

Tembiné

et al. 2017

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

“…In [10], [20], the authors extend their formulation to the limited and intermittent feedback scenarios. Reference [21] investigate the minimization of the completion time in a time division duplex (TDD) IDNC-enabled network. In [9], [22], the authors propose a new approach to solving the completion time problem based on decoding delay control.…”

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

Optimizing completion delay in network coded systems over TDD erasure channels with memory

Cited by 13 publications

References 21 publications

A Lossy Graph Model for Delay Reduction in Generalized Instantly Decodable Network Coding

A Lossy Graph Model for Delay Reduction in Generalized Instantly Decodable Network Coding

A Game-Theoretic Framework for Network Coding Based Device-to-Device Communications

Rate Aware Instantly Decodable Network Codes

Contact Info

Product

Resources

About