首页 | 本学科首页   官方微博 | 高级检索  
     

无线网络中网络编码子图优化问题的研究
引用本文:杨叶舒,梅中辉. 无线网络中网络编码子图优化问题的研究[J]. 计算机技术与发展, 2014, 0(3): 86-89,93
作者姓名:杨叶舒  梅中辉
作者单位:南京邮电大学 通信与信息工程学院,江苏 南京210003
基金项目:国家“973”重点基础研究发展计划项目(2011CB302903)
摘    要:文中主要针对存在链路时延且节点缓存受限的无线网络来考虑网络编码子图优化问题。提出所研究问题的连续时间模型,进而又推导出离散时间模型。为简化所研究问题,引入时间扩展网络拓扑模型,基于该模型提出网络编码子图分布式优化算法,并通过仿真评估节点缓存大小对系统性能的影响。仿真结果表明,节点缓存越长,最优子图的总能耗越少。最后,对比网络编码技术和路由技术对系统性能的影响,仿真结果表明有网络编码的系统性能优于传统的无网络编码系统。

关 键 词:网络编码  组播  无线网络  子图

Research on Optimal Sub-graph Selection with Network Coding in Wireless Networks
YANG Ye-shu,MEI Zhong-hui. Research on Optimal Sub-graph Selection with Network Coding in Wireless Networks[J]. Computer Technology and Development, 2014, 0(3): 86-89,93
Authors:YANG Ye-shu  MEI Zhong-hui
Affiliation:( College of Telecommunication & Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China)
Abstract:Consider the problem of finding a minimum cost multicast sub-graph over wireless networks based on network coding,where delay values associated with each link,limited buffer-size of the nodes are taken into account. For such networks,the continuous-time model is formulated,and the discrete-time model is derived. To simplify the problem,introduce the time-expanded network topology model. Then,a distributed optimized algorithm of network coding sub-graph based on this model is proposed. As shown by the simulation results,larger buffer-size of the nodes may lead to cost reduction,and the performance of the system with network coding outperforms the traditional system.
Keywords:network coding  multicast  wireless network  sub-graph
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号