韩莉,钱焕延.流间编码与流内编码相结合的机会路由算法[J].计算机科学,2018,45(5):69-74
流间编码与流内编码相结合的机会路由算法
Opportunistic Routing Algorithm Combining Intra-session Coding and Inter-session Coding in Wireless Network
投稿时间:2017-04-14  修订日期:2017-06-07
DOI:10.11896/j.issn.1002-137X.2018.05.012
中文关键词:  流内网络编码,流间网络编码,网络效用最大化,机会路由,无线Mesh网络,最大权值调度
英文关键词:Intra-session network coding,Inter-session network coding,Network utility maximization,Opportunistic routing,Wireless Mesh network,Maximum weight scheduling
基金项目:本文受安徽省自然科学基金(1408085MF122),安徽省高校自然科学研究重点项目(KJ2016A041)资助
作者单位
韩莉 安徽大学计算机科学与技术学院 合肥230039
南京理工大学计算机科学与技术学院 南京210094 
钱焕延 南京理工大学计算机科学与技术学院 南京210094 
摘要点击次数: 335
全文下载次数: 235
中文摘要:
      文中提出了一个无线Mesh网络上的、结合流内和流间网络编码的MWS优化结构。在该优化结构中,编码分组的虚队列长度,即“信用度”积压,由信用度分配算法决定,节点根据信用度积压对编码方式进行选择,旨在各个流之间均衡分配资源,实现网络效用的最大化。同时,给出了该优化结构对偶算法的启发式实现MiiCode,该算法不使用确定路径,具有更大的灵活性,也有利于获得更多的流间编码机会。流内网络编码具有的良好本地补偿特性减少了源节点发送补偿分组的数量,降低了网络的整体开销。最后,在OMNET++仿真实验中将MiiCode与基于确定路由的COPE和LOR进行了比较。
英文摘要:
      This paper proposed a maximum weight scheduling framework in wireless mesh network.In the framework,the virtual queues of coding packets (named “credit queue”) are updated according to a credit assignment algorithm.A node chooses the way of encoding according to its credit queues to achieve network utility maximization and fair resource allocation between flows.A heuristic algorithm MiiCode was given.In this algorithm,no deterministic routing is needed,which makes it more flexible and helpful for finding more chances for inter-session coding.Intra-session’s capacity of local reparation decreases the number of packets retransmitted from source nodes,and the total cost of the network is decreased.This paper compared MiiCode with COPE and LOR based on routing in simulation results of OMNET++.
查看全文  查看/发表评论  下载PDF阅读器