Delay Reduction in Persistent Erasure Channels for Generalized Instantly Decodable Network Coding

IEEE Commun. Surv. Tutorials

Al-Naffouri

et al. 2017

Self Cite

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications Ahmed DouikFrom its introduction to its quindecennial, network coding has built a strong reputation in enhancing the packet recovery process and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the network by proposing complex schemes that achieve optimal delay. With the shift toward distributed computing on mobile devices, throughput and complexity become both critical factors that affect the efficiency of a coding scheme. Instantly decodable network coding imposed itself as a new paradigm in network coding that trades off these two aspects. This paper presents a survey of instantly decodable network coding schemes that are proposed in the literature. The various schemes are identified, categorized and evaluated. Two categories can be distinguished namely the conventional centralized schemes and the distributed or cooperative schemes. For each scheme, the comparison is carried out in terms of reliability, performance, complexity and packet selection methodology. Although the performance is generally inversely proportional to the computation complexity, numerous successful schemes from both the performance and complexity viewpoint are identified.

Section: Motivation Of Instantly Decodable Network Codingmentioning

confidence: 99%

Section: Formulations and Solutions For Completion Time And Decoding mentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

IEEE Commun. Surv. Tutorials

Al-Naffouri

et al. 2017

Self Cite

“…The problem was formulated in [5] as a linear programming problem called Strict IDNC (S-IDNC), limiting the BS to generate packets that can be decoded by all users then extended to Generalized IDNC (G-IDNC) in [8] by loosening this constraint and asking the users instead to discard all non decodable packets. The decoding delay performance of G-IDNC for independent erasure channels was studied in [8] and extended to persistent erasure channels in [9]. In the aforementioned works, the authors considered a prompt and perfect reception of the feedback.…”

Section: Introductionmentioning

confidence: 99%

“…In these paper, the problem was formulated as a maximum weight clique problem over the G-IDNC graph. Since the problem is known to be NP-hard, many heuristics to perform effective packet selection were proposed [1], [2], [9].…”

Section: Introductionmentioning

confidence: 99%

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

IEEE Wireless Commun. Lett.

Al-Naffouri

et al. 2014

Self Cite

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.

A game theoretic approach to minimize the completion time of network coded cooperative data exchange

2014 IEEE Global Communications Conference

Tembiné

et al. 2014

Self Cite

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. The utility function is designed such that increasing individual payoff results in a collective behavior achieving both a desirable system performance in a shared network environment and the Pareto optimal solution. Through extensive simulations, our approach is compared to the best performance that could be found in the conventional point-to-multipoint (PMP) recovery process. Numerical results show that our formulation largely outperforms the conventional PMP scheme in most practical situations and achieves a lower delay.