Delay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence

In this paper, we consider the problem of min- imizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such an environment, the sender does not always receive acknowledgement from the receivers after each transmission. Moreover, both the forward and feedback channels are subject to persistent erasures, which can be modelled by a two state (good and bad states) Markov chain known as Gilbert-Elliott channel (GEC). Due to such feedback imperfections, the sender is unable to determine subsequent instantly decodable packets combination for all receivers. Given this harsh channel and feedback model, we first derive expressions for the probability distributions of decoding delay increments and then employ these expressions in formulating the minimum decoding problem in such environment as a maximum weight clique problem in the G-IDNC graph. We also show that the problem formulations in simpler channel and feedback models are special cases of our generalized formulation. Since this problem is NP-hard, we design a greedy algorithm to solve it and compare it to blind approaches proposed in literature. Through extensive simulations, our adaptive algorithm is shown to outperform the blind approaches in all situations and to achieve significant improvement in the decoding delay, especially when the channel is highly persistent. Index Terms—Multicast Channels, Persistent Erasure Chan- nels, G-IDNC, Decoding Delay, Lossy Intermittent Feedback, Maximum Weight Clique Problem.

[1]  Parastoo Sadeghi,et al.  Optimizing completion delay in network coded systems over TDD erasure channels with memory , 2012, 2012 International Symposium on Communications and Information Technologies (ISCIT).

[2]  Shahrokh Valaee,et al.  Completion delay reduction in lossy feedback scenarios for instantly decodable network coding , 2011, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications.

[3]  Giovanni Giambene,et al.  Instantly decodable network coding protocols with unequal error protection , 2013, 2013 IEEE International Conference on Communications (ICC).

[4]  Alexandros G. Dimakis,et al.  Instantly decodable network codes for real-time applications , 2013, 2013 International Symposium on Network Coding (NetCod).

[5]  Parastoo Sadeghi,et al.  An Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels , 2010, EURASIP J. Wirel. Commun. Netw..

[6]  Xiaojun Lin,et al.  Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Ming Xiao,et al.  Relay-Aided Broadcasting with Instantaneously Decodable Binary Network Codes , 2011, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN).

[8]  Parastoo Sadeghi,et al.  Decoding delay reduction in broadcast erasure channels with memory for network coding , 2012, 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC).

[9]  Ming Xiao,et al.  Design and Analysis of Relay-aided Broadcast using Binary Network Codes , 2011, J. Commun..

[10]  Xiaojun Lin,et al.  On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-Video Broadcast with Hard Deadline Constraints , 2011, IEEE Journal on Selected Areas in Communications.

[11]  Parastoo Sadeghi,et al.  Adaptive network coding for broadcast channels , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

[12]  Christina Fragouli,et al.  Delay with network coding and feedback , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Shahrokh Valaee,et al.  Completion Delay Minimization for Instantly Decodable Network Codes , 2012, IEEE/ACM Transactions on Networking.

[14]  Chi Wan Sung,et al.  Quality-Aware Instantly Decodable Network Coding , 2014, IEEE Transactions on Wireless Communications.

[15]  Shahrokh Valaee,et al.  On Minimizing Broadcast Completion Delay for Instantly Decodable Network Coding , 2010, 2010 IEEE International Conference on Communications.

[16]  Devavrat Shah,et al.  Online network coding for optimal throughput and delay - the three-receiver case , 2008, 2008 International Symposium on Information Theory and Its Applications.

[17]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Mohamed-Slim Alouini,et al.  Delay Reduction in Persistent Erasure Channels for Generalized Instantly Decodable Network Coding , 2013, 2013 IEEE 77th Vehicular Technology Conference (VTC Spring).

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Sudipta Sengupta,et al.  Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation , 2008, SIGMETRICS '08.

[21]  Shahrokh Valaee,et al.  Completion Delay Minimization for Instantly Decodable Network Coding with Limited Feedback , 2011, 2011 IEEE International Conference on Communications (ICC).

[22]  Shahrokh Valaee,et al.  Effect of Feedback Loss on instantly decodable network coding , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

[23]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[24]  Shahrokh Valaee,et al.  On densifying coding opportunities in instantly decodable network coding graphs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[25]  Mohamed-Slim Alouini,et al.  Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding , 2013, 2013 IEEE 9th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[26]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[27]  Shahrokh Valaee,et al.  Minimum Broadcast Decoding Delay for Generalized Instantly Decodable Network Coding , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[28]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[29]  Tracey Ho,et al.  Network Coding: An Introduction , 2008 .

[30]  Mohamed-Slim Alouini,et al.  Partially Blind Instantly Decodable Network Codes for Lossy Feedback Environment , 2014, IEEE Transactions on Wireless Communications.

[31]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

[32]  Kazuaki Yamaguchi,et al.  A New Exact Algorithm for the Maximum Weight Clique Problem , 2008 .