TY - GEN
T1 - Rate Aware Instantly Decodable Network Codes
AU - Douik, Ahmed S.
AU - Sorour, Sameh
AU - Al-Naffouri, Tareq Y.
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/2/26
Y1 - 2016/2/26
N2 - This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.
AB - This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The completion time minimization problem in such scenario is first shown to be intractable. The problem is, thus, approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. Further, the paper provides a multi-layer solution to improve the completion time approximation. Simulation results suggest that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme. © 2015 IEEE.
UR - http://hdl.handle.net/10754/621287
UR - http://ieeexplore.ieee.org/document/7414149/
UR - http://www.scopus.com/inward/record.url?scp=84971241641&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2015.7414149
DO - 10.1109/GLOCOMW.2015.7414149
M3 - Conference contribution
SN - 9781467395267
BT - 2015 IEEE Globecom Workshops (GC Wkshps)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -