Completion Time Reduction for Partially Connected D2D-enabled Network using Binary Codes

Consider a device-to-device (D2D) enabled network wherein a set of geographically close devices each holding a subset of a frame and interested in receiving all remaining files. This paper investigates the problem of reducing the number of transmissions to complete the reception of all data by all devices using instantly decodable network coding (IDNC). While previous works assume a fully connected communication network, devices in the considered D2D configuration can target only devices in their transmission range. Hence, multiple devices are able to transmit simultaneously. The joint optimization over the transmitting devices and file combinations so as to reduce the completion time is formulated and approximated through a decoding delay control. The first part of the paper prohibits cooperation that results in collisions which allow the decoupling of the problems. The problem is reformulated as a maximum weight clique problem in the cooperation graph wherein the weight of each vertex is obtained by solving the corresponding maximum weight clique problem over the local IDNC graph. The solution is then extended to optimally solve the joint optimization problem by introducing clusters of devices that act as interference-free virtual devices. Extensive simulations reveal that the proposed solutions provide noticeable performance enhancement and outperforms previously proposed IDNC-based schemes.

[1]  Qing Wang,et al.  A Survey on Device-to-Device Communication in Cellular Networks , 2013, IEEE Communications Surveys & Tutorials.

[2]  Robert W. Heath,et al.  Five disruptive technology directions for 5G , 2013, IEEE Communications Magazine.

[3]  Mohamed-Slim Alouini,et al.  Delay reduction in multi-hop device-to-device communication using network coding , 2014, 2015 International Symposium on Network Coding (NetCod).

[4]  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.

[5]  Parastoo Sadeghi,et al.  Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems , 2014, IEEE Transactions on Communications.

[6]  Muriel Médard,et al.  Joint Scheduling and Instantaneously Decodable Network Coding , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

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

[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]  Shahrokh Valaee,et al.  Minimum Broadcast Decoding Delay for Generalized Instantly Decodable Network Coding , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

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

[11]  Mugen Peng,et al.  Fog-computing-based radio access networks: issues and challenges , 2015, IEEE Network.

[12]  Alexandros G. Dimakis,et al.  Finding three transmissions is hard , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

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

[14]  Mohamed-Slim Alouini,et al.  Completion time reduction in instantly decodable network coding through decoding delay control , 2014, 2014 IEEE Global Communications Conference.

[15]  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).

[16]  Mohamed-Slim Alouini,et al.  A game theoretic approach to minimize the completion time of network coded cooperative data exchange , 2014, 2014 IEEE Global Communications Conference.

[17]  Osvaldo Simeone,et al.  Harnessing cloud and edge synergies: toward an information theory of fog radio access networks , 2016, IEEE Communications Magazine.

[18]  Ali A. Nasir,et al.  Decoding delay reduction in network coded cooperative systems with intermittent status update , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[19]  Parastoo Sadeghi,et al.  Coded cooperative data exchange for multiple unicasts , 2012, 2012 IEEE Information Theory Workshop.

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

[21]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[22]  Jeffrey G. Andrews,et al.  What Will 5G Be? , 2014, IEEE Journal on Selected Areas in Communications.

[23]  A. Lozano,et al.  What Will 5 G Be ? , 2014 .

[24]  Muriel Medard,et al.  Network coding : fundamentals and applications , 2012 .

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

[26]  Mohamed-Slim Alouini,et al.  Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections , 2015, IEEE Transactions on Wireless Communications.

[27]  Enzo Baccarelli,et al.  Bandwidth Management VMs Live Migration in Wireless Fog Computing for 5G Networks , 2016, 2016 5th IEEE International Conference on Cloud Networking (Cloudnet).

[28]  Parastoo Sadeghi,et al.  Instantly decodable network coding for delay reduction in cooperative data exchange systems , 2013, 2013 IEEE International Symposium on Information Theory.

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