高级搜索

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

D2D网络中基于立即可解网络编码的时延最小化重传方案

王练 王萌 任治豪 白佳洁

王练, 王萌, 任治豪, 白佳洁. D2D网络中基于立即可解网络编码的时延最小化重传方案[J]. 电子与信息学报, 2018, 40(7): 1691-1698. doi: 10.11999/JEIT170976
引用本文: 王练, 王萌, 任治豪, 白佳洁. D2D网络中基于立即可解网络编码的时延最小化重传方案[J]. 电子与信息学报, 2018, 40(7): 1691-1698. doi: 10.11999/JEIT170976
WANG Lian, WANG Meng, REN Zhihao, BAI Jiajie. Delay Minimization Retransmission Scheme Based on Instantly Decodable Network Coding for D2D Communications[J]. Journal of Electronics & Information Technology, 2018, 40(7): 1691-1698. doi: 10.11999/JEIT170976
Citation: WANG Lian, WANG Meng, REN Zhihao, BAI Jiajie. Delay Minimization Retransmission Scheme Based on Instantly Decodable Network Coding for D2D Communications[J]. Journal of Electronics & Information Technology, 2018, 40(7): 1691-1698. doi: 10.11999/JEIT170976

D2D网络中基于立即可解网络编码的时延最小化重传方案

doi: 10.11999/JEIT170976
基金项目: 

重庆市教委科学技术研究(KJ1704103)

详细信息
    作者简介:

    王练:王 练: 女,1976年生,博士,副教授,研究方向为网络编码、无线网络安全. 王 萌: 女,1991年生,硕士生,研究方向为网络编码. 任治豪: 男,1992年生,硕士生,研究方向为网络编码. 白佳洁: 女,1992年生,硕士生,研究方向为网络编码.

  • 中图分类号: TP393

Delay Minimization Retransmission Scheme Based on Instantly Decodable Network Coding for D2D Communications

Funds: 

The Research on Science and Technology of Chongqing Education Commission (KJ1704103)

  • 摘要: 该文针对D2D无线网络中多终端并发协作重传冲突避免问题,提出一种基于立即可解网络编码的时延最小化重传方案。在重传阶段,充分利用D2D无线网络终端协作传输数据的优势,结合各终端数据包接收状态,综合考虑时延的影响因素,选取单次重传时延增量较小的数据包生成编码包,最小化重传时延。同时,构建终端冲突图,在图中搜索极大独立集,根据各终端的编码包权重值,选择最大加权独立集中的终端作为并发协作重传终端,从而降低重传次数。仿真结果表明,所提方案能够进一步改善D2D无线网络的重传效率。
  • [2] BOCCARDI F, HEATH R W, LOZANO A, et al. Five disruptive technology directions for 5G[J]. IEEE Communications Magazine, 2014, 52(2): 74-80. doi: 10.1109 /MCOM.2014.6736746.
    AAADI A, WANG Q, and MANCUSO V. A survey on Device-to-Device communication in cellular networks[J]. Journal of Guilin University of Electronic Technology, 2014, 16(4): 1801-1819. doi: 10.1109/COMST.2014.2319555.
    [3] AHLSWEDER, CAI N, LI S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1204-1216. doi: 10.1109/18.850663.
    [4] HO T, MEDARD M, KOETTER R, et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Information Theory, 2006, 52(10): 4413-4430. doi: 10.1109 /TIT.2006.881746.
    [5] KATTI S, RAHUL H, HU W, et al. XORs in the air: Practical wireless network coding[J]. IEEE/ACM Transactions on Networking, 2008, 16(3): 497-510. doi: 10.1109/TNET.2008. 923722.
    GOU Liang, ZHANG Gengxin, SUN Wei, et al. Weighted broadcasting retransmission based on opportunistic network coding in wireless networks[J]. Journal of Electronics & Information Technology, 2014, 36(3): 749-753. doi: 10.3724/ SP.J.1146.2013.00598.
    [7] TRASKOV D, MEDARD M, SADEGHI P, et al. Joint scheduling and instantaneously decodable network coding[C]. IEEE Conference on Global Telecommunications. Honolulu, USA, 2009: 3835-3840. doi: 10.1109/GLOCOM.2009. 5425315.
    [8] SOROUR S and VALAEE S. Completion delay minimization for instantly decodable network codes[J]. IEEE/ACM Transactions on Networking, 2015, 23(5): 1553-1567. doi: 10.1109/TNET.2014.2338053.
    [9] GOU L, ZHANG G, BIAN Z, et al. Minimizing completion time for relay-assisted multicast with instantly decodable network coding[J]. IEEE Communications Letters, 2016, 20(3): 434-437. doi: 10.1109/LCOMM.2016.2518163.
    [10] ZHAN C and XIAO F. Coding based wireless broadcast scheduling in real time applications[J]. Journal of Network and Computer Applications, 2016, 64: 194-203. doi: 10.1016/ j.jnca.2016.02.004.
    [11] YAN Y, ZHANG B, and LI C. Opportunistic network coding based cooperative retransmissions in D2D communications[J]. Computer Networks, 2017, 113: 72-83. doi: 10.1016/j.comnet. 2016.12.004.
    [12] TAJBAKHSH S E, SADEGHI P, and ABOUTORAB N. Instantly Decodable Network Codes for Cooperative Index Coding Problem over General Topologies[M]. AUSCTW, Sydney, Australia, 2014: 84-89. doi: 10.1109/AusCTW.2014. 6766433.
    [13] ABOUTORAB N, SADEGHI P, and TAJBAKHSH S E. Instantly decodable network coding for delay reduction in cooperative data exchange systems[C]. IEEE International Symposium on Information Theory Proceedings. Istanbul, Turkey, 2013: 3095-3099. doi: 10.1109/ISIT.2013.6620795.
    [14] ABOUTORAB N and SADEGHI P. Instantly decodable network coding for completion time or decoding delay reduction in cooperative data exchange systems[J]. IEEE Transactions on Vehicular Technology, 2016, 65(3): 1212-1228. doi: 10.1109/TVT.2015.2405917.
    [15] DOUIK A, SOROUR S, TEMBINE H, et al. A game theoretic approach to minimize the completion time of network coded cooperative data exchange[C]. Global Communications Conference. Austin, USA, 2014: 1583-1589. doi: 10.1109/GLOCOM.2014.7037034.
    [16] DOUIK A, SOROUR S, Al-NAFFOURI T Y, et al. Delay reduction in multi-hop device-to-device communication using network coding[C]. International Symposium on Network Coding. Sydney, Australia, 2015: 6-10. doi: 10.1109/ NETCOD.2015.7176779.
    [17] DOUIK A and SOROUR S. Data dissemination using instantly decodable binary codes in fog-radio access networks [C]. Wireless Communications and Mobile Computing Conference. Valencia, Spain, 2017: 604-609. doi: 10.1109/ IWCMC.2017.7986354.
  • 加载中
计量
  • 文章访问数:  1426
  • HTML全文浏览量:  170
  • PDF下载量:  49
  • 被引次数: 0
出版历程
  • 收稿日期:  2017-10-20
  • 修回日期:  2018-01-24
  • 刊出日期:  2018-07-19

目录

    /

    返回文章
    返回