TY - GEN
T1 - Delay reduction in multi-hop device-to-device communication using network coding
AU - Douik, Ahmed S.
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 - 2015/8/12
Y1 - 2015/8/12
N2 - This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.
AB - This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.
UR - http://hdl.handle.net/10754/621246
UR - http://ieeexplore.ieee.org/document/7176779/
UR - http://www.scopus.com/inward/record.url?scp=84954285892&partnerID=8YFLogxK
U2 - 10.1109/NETCOD.2015.7176779
DO - 10.1109/NETCOD.2015.7176779
M3 - Conference contribution
SN - 9781479919116
SP - 6
EP - 10
BT - 2015 International Symposium on Network Coding (NetCod)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -