TY - JOUR
T1 - Delay Reduction in Multi-Hop Device-to-Device Communication using Network Coding
AU - Douik, Ahmed
AU - Sorour, Sameh
AU - Al-Naffouri, Tareq Y.
AU - Yang, Hong Chuan
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2018/8/22
Y1 - 2018/8/22
N2 - This paper considers the problem of reducing the broadcast decoding delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In contrast with previous works that assume a fully connected network, this paper investigates a partially connected configuration in which multiple devices are allowed to transmit simultaneously. To that end, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. Afterward, the joint optimization problem over the set of transmitting devices and packet combination of each is formulated. The optimal solution of the joint optimization problem is derived using a graph theoretic approach by introducing the cooperation graph in which each vertex represents a transmitting device with a weight translating its contribution to the network. The paper solves the problem by reformulating it as a maximum weight clique problem which can efficiently be solved. Numerical results suggest that the proposed solution outperforms state-of-the-art schemes and provides significant gain, especially for poorly connected networks.
AB - This paper considers the problem of reducing the broadcast decoding delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In contrast with previous works that assume a fully connected network, this paper investigates a partially connected configuration in which multiple devices are allowed to transmit simultaneously. To that end, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. Afterward, the joint optimization problem over the set of transmitting devices and packet combination of each is formulated. The optimal solution of the joint optimization problem is derived using a graph theoretic approach by introducing the cooperation graph in which each vertex represents a transmitting device with a weight translating its contribution to the network. The paper solves the problem by reformulating it as a maximum weight clique problem which can efficiently be solved. Numerical results suggest that the proposed solution outperforms state-of-the-art schemes and provides significant gain, especially for poorly connected networks.
UR - http://hdl.handle.net/10754/630063
UR - https://ieeexplore.ieee.org/document/8444481/
UR - http://www.scopus.com/inward/record.url?scp=85052681176&partnerID=8YFLogxK
U2 - 10.1109/TWC.2018.2865545
DO - 10.1109/TWC.2018.2865545
M3 - Article
SN - 1536-1276
VL - 17
SP - 7040
EP - 7053
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 10
ER -