Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding

被引:20
作者
Douik, Ahmed [1 ]
Sorour, Sameh [2 ]
Al-Naffouri, Tareq Y. [3 ]
Alouini, Mohamed-Slim [3 ]
机构
[1] CALTECH, Dept Elect Engn, Pasadena, CA 91125 USA
[2] Univ Idaho, Dept Elect & Comp Engn, Moscow, ID 83844 USA
[3] King Abdullah Univ Sci & Technol, Div Comp Elect & Math Sci & Engn, Thuwal 23955, Saudi Arabia
关键词
Decoding delay; instantly decodable network coding (IDNC); minimum completion time; perfect/imperfect feedback; CODES;
D O I
10.1109/TVT.2016.2585381
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
For several years, the completion time and the decoding delay problems in instantly decodable network coding (IDNC) were considered separately and were thought to act completely against each other. Recently, some works have aimed to balance the effects of these two important IDNC metrics, but none of them studied a further optimization of one by controlling the other. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decoding-delay-dependent expressions of the users' and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, this paper proposes two novel heuristics that minimize the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Afterward, this paper extends the study to the imperfect feedback scenario, in which uncertainties at the sender affect its ability to anticipate accurately the decoding delay increase at each user. This paper formulates the problem in such an environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieve a lower mean completion time, as compared with the best known heuristics for completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.
引用
收藏
页码:2756 / 2770
页数:15
相关论文
共 35 条
  • [1] Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems
    Aboutorab, Neda
    Sadeghi, Parastoo
    Sorour, Sameh
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (04) : 1296 - 1309
  • [2] Network information flow
    Ahlswede, R
    Cai, N
    Li, SYR
    Yeung, RW
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) : 1204 - 1216
  • [3] Akbari ZO, 2013, 2013 IEEE/ACIS 12TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), P503, DOI 10.1109/ICIS.2013.6607889
  • [4] [Anonymous], 2008, PROC 23 INT TECHN C
  • [5] Douik A., 2014, P IEEE VEH TECHN C V, P1, DOI DOI 10.1109/VTCFALL.2014.6966079
  • [6] Douik A., IEEE T MOBI IN PRESS
  • [7] Douik A., IEEE T COMMUN
  • [8] Douik A, 2015, INT SYMP NETW COD, P6, DOI 10.1109/NETCOD.2015.7176779
  • [9] Instantly decodable network coding for real-time device-to-device communications
    Douik, Ahmed
    Sorour, Sameh
    Al-Naffouri, Tareq Y.
    Alouini, Mohamed-Slim
    [J]. EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2016, : 1 - 14
  • [10] Delay Reduction for Instantly Decodable Network Coding in Persistent Channels With Feedback Imperfections
    Douik, Ahmed
    Sorour, Sameh
    Al-Naffouri, Tareq Y.
    Alouini, Mohamed-Slim
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (11) : 5956 - 5970