中继协作多播网络中基于最小集合覆盖的编码重传方案

doi:10.3969/j.issn.0372-2112.2018.01.001

电子学报 ›› 2018, Vol. 46 ›› Issue (1): 1-7.DOI: 10.3969/j.issn.0372-2112.2018.01.001

• 学术论文 • 下一篇

中继协作多播网络中基于最小集合覆盖的编码重传方案

王练^1,2, 梁申虎¹, 陈巧¹, 彭代渊², 梁宏斌²

1. 重庆邮电大学计算机科学与技术学院, 重庆 400065;
2. 西南交通大学信息科学与技术学院, 四川成都 611756

收稿日期:2016-08-16 修回日期:2017-02-16 出版日期:2018-01-25
- 作者简介:
- 王练,女,1976年生于贵州,博士,副教授.现主要从事无线网络编码、网络安全研究.E-mail:wanglian@cqupt.edu.cn;梁申虎,男,1989年生于四川宜宾,硕士,现主要从事无线网络编码研究.E-mail:liang5284569@163.com
- 基金资助:
- 国家自然科学基金 (No.61571375）; 国家863高技术研究发展计划 (No.2015AA01A705）

Coded Retransmission Scheme Based on Minimum Set Coverage for Relay-Assisted Multicast

WANG Lian^1,2, LIANG Shen-hu¹, CHEN Qiao¹, PENG Dai-yuan², LIANG Hong-bin²

1. School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China;
2. School of Information Science and Technology, Southwest Jiaotong University, Chengdu, Sichuan 611756, China

Received:2016-08-16 Revised:2017-02-16 Online:2018-01-25 Published:2018-01-25

摘要/Abstract

摘要： 为提高单中继协作多播传输效率，本文提出一种基于最小集合覆盖的分类网络编码重传方案.该方案充分利用中继节点协作传输的优势，将接收端的丢包按中继节点的接收状态分为两类，并按类先后进行编码重传.在各类丢包内部，根据对应的状态反馈矩阵寻找编码机会生成编码包，并将编码包的选择过程抽象为集合覆盖问题，通过求最小集合覆盖使重传次数逼近最小值.此外，在不增加所得前类编码包数的前提下，利用两类丢包之间的编码机会进一步生成新编码包，以减少重传编码包数，从而提高重传效率.分析与仿真结果表明了该方案的有效性.

关键词: 网络编码, 重传, 调度, 分类, 集合覆盖

Abstract: A classification network coding retransmission approach based on the minimal set coverage is proposed to improve the single relay cooperative transmission efficiency. In this scheme, to make full use of the advantage of relay-assisted transmission, the lost packets of receivers are classified into two categories according to the packet reception status of relay node after the initial transmission, and then the packets are encoded for retransmission according to the category sequentially. For each classification, according to the corresponding status feed matrix to search for encoding opportunities and generate encoding packets, the encoded packets selecting procedure is abstracted as the set coverage problem, and the number of retransmissions is approached the minimum value by solving the minimal set coverage problem. In addition, to reduce the number of retransmission packets and improve retransmission efficiency, encoding opportunities between the two types of lost packet are further used to generate new encoding packets on the premise of not increasing the current number of encoding packets. The analysis and simulation results show the effectiveness of the scheme proposed.

Key words: network coding, retransmission, scheduling, classification, set coverage

中图分类号:

TN92

王练, 梁申虎, 陈巧, 彭代渊, 梁宏斌. 中继协作多播网络中基于最小集合覆盖的编码重传方案[J]. 电子学报, 2018, 46(1): 1-7.

WANG Lian, LIANG Shen-hu, CHEN Qiao, PENG Dai-yuan, LIANG Hong-bin. Coded Retransmission Scheme Based on Minimum Set Coverage for Relay-Assisted Multicast[J]. Acta Electronica Sinica, 2018, 46(1): 1-7.

参考文献

[1] Ahlswede R,Cai N,Li S Y R,et al.Network information flow[J].IEEE Transactions on Information Theory,2000,46(4):1204-1216.
[2] Li Z,Li B,Lau L C.A constant bound on throughput improvement of multicast network coding in undirected networks[J].IEEE Transactions on Information Theory,2009,55(3):1016-1026.
[3] Rozner E,Iyer A P,Mehta Y,et al.ER:efficient retransmission scheme for wireless LANs[A].Proceedings of the 2007 ACM CoNEXT Conference[C].New York:ACM,2007.8.
[4] Nguyen D,Tran T,Nguyen T,et al.Wireless broadcast using network coding[J].IEEE Transactions on Vehicular Technology,2009,58(2):914-925.
[5] Xiao X,Wang W P,Yang L M,et al.Wireless broadcasting retransmission approach based on network coding[J].Journal on Communications,2009,30(9):782-786.
[6] 王斌,王文鼐.一种基于并行网络编码的无线广播重传方案[J].南京邮电大学学报:自然科学版,2014,34(6):9-14. Wang B,Wang W D.Wireless broadcast retransmission scheme based on parallel network coding[J].Journal of Nanjing University of Posts and Telecommunications,2014,34(6):9-14.(in Chinese)
[7] 戴彬,曹志刚,杨军,等.基于匹配理论的无线广播编码重传算法[J].软件学报,2011,22(11):2833-2842. Dai B,Cao Z G,Yang J,et al.Coded retransmission algorithm based on matching theory for wireless broadcasting[J].Journal of Software,2011,22(11):2833-2842.(in Chinese)
[8] 卢冀,肖嵩,吴成柯.基于机会式网络编码的低时延广播传输算法[J].电子学报,2011,39(5):1214-1219. Lu J,Xiao S,Wu C K.Opportunistic network coding based delay-sensitive broadcast transmission algorithm[J].Acta Electronica Sinica,2011,39(5):1214-1219.(in Chinese)
[9] 苟亮,张更新,孙伟,等.无线网络中基于机会网络编码的加权广播重传[J].电子与信息学报,2014,36(3):749-753. Gou L,Zhang G X,Sun W,et al.Weighted broadcasting retransmission based on opportunistic network coding in wireless networks[J].Journal of Electronics & Information Technology,2014,36(3):749-753.(in Chinese)
[10] 卢冀,吴成柯,肖嵩,等.基于机会式网络编码的高效广播传输算法[J].通信学报,2012,33(1):64-70. Lu J,Wu C K,Xiao S,et al.Efficient broadcast transmission algorithms based on opportunistic network coding[J].Journal of China Institute of Communications,2012,33(1):64-70.(in Chinese)
[11] Yao Y K,Chen X,Ren Z,et al.Efficient network coding broadcasting retransmission approach based on redundancy avoiding[J].Systems Engineering & Electronics,2015,37(5):1170-1176.
[12] Zhao B,Valenti M C.Practical relay networks:a generalization of hybrid-ARQ[J].IEEE Journal on Selected Areas in Communications,2005,23(1):7-18.
[13] Zhi C,Wei C,Fan P,et al.Relay aided wireless multicast utilizing network coding:outage behaviour and diversity gain[A].IFIP International Conference on Network and Parallel Computing[C].Shanghai:IFIP,2008.358-364.
[14] Fan P,Zhi C,Wei C,et al.Reliable relay assisted wireless multicast using network coding[J].IEEE Journal on Selected Areas in Communications,2009,27(5):749-762.
[15] Lu L,Xiao M,Rasmussen L K.Design and analysis of relay-aided broadcast using binary network codes[J].Journal of Communications,2011,6(8):610-617.
[16] Elmahdy A M,Sorour S,Seddik K G.Generalized instantly decodable network coding for relay-assisted networks[A].Proceedings of the 2013 IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications[C].London:IEEE,2014.1759-1763.
[17] 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.
[18] Guangri Q,Bingrong H,Fei Y,et al.A heuristic function algorithm for minimum set-covering problem[J].Journal of Software,1998,9(2):156-160.

中继协作多播网络中基于最小集合覆盖的编码重传方案

Coded Retransmission Scheme Based on Minimum Set Coverage for Relay-Assisted Multicast

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	杨明亮, 吴春明, 沈丛麒, 邱于兵. 基于IEEE 802.1的TSN交换机队列调度技术研究[J]. 电子学报, 2022, 50(9): 2090-2095.
[2]	李雪莹, 王田路, 梁鹏, 王翀. 基于系统模型的用户评论中非功能需求的自动分类[J]. 电子学报, 2022, 50(9): 2079-2089.
[3]	唐捷凯, 胡蓉, 钱斌, 金怀平, 向凤红. 混合帝国竞争算法求解带多行程批量配送的多工厂集成调度问题[J]. 电子学报, 2022, 50(7): 1621-1630.
[4]	李纪三, 纪彦星, 曹鼎, 刘溶, 任渊. 基于广义时间窗的旋转相控阵雷达资源调度算法[J]. 电子学报, 2022, 50(5): 1050-1057.
[5]	陆克中, 陈超凡, 蔡桓, 吴定明. 面向概念漂移和类不平衡数据流的在线分类算法[J]. 电子学报, 2022, 50(3): 585-597.
[6]	王雪松, 张翰林, 程玉虎. 基于自编码器和超图的半监督宽度学习系统[J]. 电子学报, 2022, 50(3): 533-539.
[7]	孙晨峰, 吕卫民, 戴洪德, 张浩晨. 一种基于TimeGAN和OCSVM的多元退化设备小子样数据增广方法[J]. 电子学报, 2022, 50(11): 2678-2687.
[8]	刘浩阳, 林耀进, 刘景华, 吴镒潾, 毛煜, 李绍滋. 由粗到细的分层特征选择[J]. 电子学报, 2022, 50(11): 2778-2789.
[9]	高雷阜, 张梦瑶, 赵世杰. 融合簇边界移动与自适应合成的混合采样算法[J]. 电子学报, 2022, 50(10): 2517-2529.
[10]	刘焕淋, 温濛, 陈勇, 任杰, 胡俊岭. 基于全光节点频谱集中度和频谱离散转换的业务调度方法[J]. 电子学报, 2022, 50(1): 135-141.
[11]	管永明, 王刚, 骆凯波, 吕梁, 吕晓雯, 史玉良. 基于极端不平衡学习的泛化低压异常箱表关系识别研究与应用[J]. 电子学报, 2021, 49(8): 1507-1514.
[12]	孟荣华, 孙艾文, 吴正佳, 朱颖颖, 陈保家, 张彪, 饶运清. 改进灰狼算法求解复杂混合流水调度问题研究[J]. 电子学报, 2021, 49(8): 1515-1523.
[13]	杨国为, 万鸣华, 赖志辉, 张凡龙, 黄伟强. 具有合适拒识机制的高正确识别率分类器设计[J]. 电子学报, 2021, 49(8): 1569-1576.
[14]	郑海颖, 王峰, 姜维, 王志强, 姚西文. 神经网络训练策略对高分辨率遥感图像场景分类性能影响的评估[J]. 电子学报, 2021, 49(8): 1599-1614.
[15]	吕亚平, 贾向东, 路艺, 牛春雨, 曹胜男. 基于簇用户设备分类和频谱共享分配的D2D网络覆盖分析[J]. 电子学报, 2021, 49(7): 1392-1399.