基于随机网络编码的无线报文重传最优策略

高振国; 赵蕴龙; 蔡绍滨; 赵金华

基于随机网络编码的无线报文重传最优策略

1.
哈尔滨工程大学自动化学院, 哈尔滨 150001
2. 哈尔滨工程大学计算机科学与技术学院, 哈尔滨 150001
3. 哈尔滨工业大学通信研究所, 哈尔滨 150001

基金项目: 国家自然科学基金资助项目(60703090);哈尔滨工程大学青年骨干教师基金资助项目(0811)

详细信息

作者简介:
高振国(1976-),男,山东济南人,教授,gag@hrbeu.edu.cn.

中图分类号: TN 911
计量
- 文章访问数: 3984
- HTML全文浏览量: 139
- PDF下载量: 1031
- 被引次数: 0
出版历程
- 收稿日期: 2009-02-15
- 网络出版日期: 2010-02-28

Random network coding based optimal scheme for wireless packet retransmission problems

1.
College of Automation, Harbin Engineering University, Harbin 150001, China
2. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
3. Communication Research Centre, Harbin Institute of Technology, Harbin 150001, China

摘要

摘要: 网络编码技术为无线报文重传问题研究提供了新思路.分析并证明了完全无线报文重传问题最优策略所需重传报文数量等于节点请求报文数量的最大值;基于随机网络编码技术提出了最优重传策略RNCOPT(Random Network Coding based OPTimal Scheme),其编码系数从某选定有限域中随机选取(0除外);利用网络编码矩阵重新生成机制以保证100%解码成功率;描述了RNCOPT组合报文结构及发送节点操作过程.仿真表明:当接收节点数量为30而报文总数为30时,RNCOPT相对于传统非网络编码方案节省重传报文数量可达32%,而此时现有某典型策略CliqueNC却无明显效果.
- 完全无线报文重传问题 /
- 随机网络编码 /
- 最优策略
Abstract: Network coding (NC) provides a new approach to solve wireless packet retransmission problems (WPRTPs). The property that the number of retransmitted packets of optimal NC-based schemes for a perfect WPRTP (P-WPRTP) equals to the maximum number of requested packets of a receiver was proposed and proved. Based on random network coding (RNC) technology, an optimal scheme for P-WPRTPs named as random network coding based optimal scheme(RNCOPT) was proposed where coefficients in network coding matrix are randomly selected from a pre-determined Galois field except for its element zero. Network coding matrix re-creation mechanism was used to guarantee a 100% success probability of decoding. Format of assembled packets and operation process of senders in RNCOPT were described. Simulation results show that, when receiver number and packet number are both 30, number of retransmitted packets in RNCOPT reduces about 32% when compared with traditional scheme where NC is not used, but meanwhile a typical NC-based scheme CliqueNC shows little performance gain.
- perfect wireless packet retransmission problem /
- random network coding /
- optimal scheme

HTML全文

参考文献(1)

[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] Postnikov M M.Foundations of Galois theory [M].New York: Dover Publications,2004 [3] ElRouayheb S Y,Chaudhry M A R,Sprintson A.On the minimum number of transmissions in single-hop wireless coding networks //Jafarkhani H.IEEE Information Theory Workshop.California:IEEE,2007:120-125 [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] 许胤龙,詹成,罗文,等.Ad hoc网络中基于网络编码的可靠组播 [J].中国科技大学学报,2008,38(7):860-866 Xu Yinlong,Zhan Cheng,Luo Wen,et al.Network coding based reliable multicast for wireless ad hoc networks[J].Journal of University of Science and Technology of China,2008,38(7):860-866(in Chinese)

施引文献

资源附件(0)

访问统计