期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

流内编码中考虑链路相关性的机会路由机制

Opportunistic Routing Mechanism Considering Link Correlation in Intra-Session Coding
下载PDF
导出
摘要 现存的结合网络编码的机会路由协议假设无线链路传输是相互独立的,但是相关研究表明无线链路传输具有相关性。链路相关性会影响节点转发编码包的次数以及转发节点的选取,进而降低协议的性能表现。对此,提出了一种流内编码中考虑链路相关性的机会路由机制。在该机制中,节点周期性收集邻居节点的反馈信息以衡量链路相关性,并由此准确计算节点期望转发次数进而选取总转发次数更少的转发节点集合。仿真实验表明,该机制能显著降低网络中的发送冗余,提高网络的整体吞吐量。 Existing opportunistic routing protocols that joint network coding assume that wireless link transmissions are independent,but related studies have shown that wireless link transmissions are correlated.Link correlation affects the number of times the forwarder transmit the encoded packet and the selection of the forwarders,which in turn affects the performance of the protocol.In this paper,an opportunistic routing mechanism considering link correlation in intra-session network coding is proposed.In the mechanism,a node periodically collects feedback information of neighbor nodes to measure link correlation,and thus accurately calculates the expected number of forwarding times and selects the forwarder set with fewer transmissions.Simulation experiments have shown that this mechanism can significantly reduce the transmission redundancy in the network and improve the overall throughput of the network.
作者 陈朝辉 杨湘 李鹏 何亨 CHEN Zhaohui;YANG Xiang;LI Peng;HE Heng(School of Computer Science and Technology,Wuhan University of Science and Technology,Wuhan 430065,China)
机构地区 武汉科技大学计算机科学与技术学院
出处 《计算机工程与应用》 CSCD 北大核心 2020年第24期85-94,共10页 Computer Engineering and Applications
基金 湖北省自然科学基金(No.2018CFB424) 国家自然科学基金(No.61502359,No.61602351)。
关键词 流内网络编码 链路相关性 传输计算 转发节点选取 intra-flow network coding link correlation transmission calculating forwarder selection
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献1

二级参考文献36

  • 1Zhang Z.Routing in intermittently connected mobile ad hoc networks and delay tolerant networks:Overview and challenges.IEEE Communications Surveys & Tutorials,2006,8(1):24-37.[doi:10.1109/COMST.2006.323440].
  • 2Perkins C,Royer E.Ad-Hoc on-demand distance vector routing.In:Proc.of the IEEE WMCSA'99.Washington:IEEE Computer Society Press,1999.90-100.[doi:10.1109/MCSA.1999.749281].
  • 3Intanagonwiwat C,Govindan R,Estrin D.Directed diffusion:A scalable and robust communication paradigm for sensor networks.In:Proc.of the ACM MobiCom 2000.New York:ACM Press,2000.56-67.[doi:10.1145/345910.345920].
  • 4Biswas S,Morris R.Opportunistic routing in multihop wireless networks.ACM SIGCOMM Computer Communication Review,2004,34(1):69-74.[doi:10.1145/972374.972387].
  • 5Biswas S,Morris R.ExOR:Opportunistic routing in multi-hop wireless networks.In:Proc.of the ACM SIGCOMM 2005.New York:ACM Press,2005.133-143.http://www.sigcomm.org/sigcomm2005/paper-BisMor.pdf.
  • 6Rozner E,Seshadri J,Mehta Y,Qiu L.Simple opportunistic routing protocol for wireless mesh networks.In:Proc.of the IEEE WiMesh 2006.Washington:IEEE Computer Society Press,2006.48-54.[doi:10.1109/WIMESH.2006.288602].
  • 7Westphal C.Opportunistic routing in dynamic ad hoc networks:The OPRAH protocol.In:Proc.of the IEEE MASS 2006.Washington:IEEE Computer Society Press,2006.570-573.[doi:10.1109/MOBHOC.2006.278612].
  • 8Couto DD,Aguayo D,Bicket J,Morris R.A high-throughput path metric for multi-hop wireless routing.In:Proc.of the ACM/ IEEE MobiCom 2003.Washington:IEEE Computer Society Press,2003.134-146.[doi:10.1145/938985.939000].
  • 9Chachulski S,Jennings M,Katti S,Katabi D.Trading structure for randomness in wireless opportunistic routing.In:Proc.of the ACM SIGCOMM 2007.New York:ACM Press,2007.169-180.[doi:10.1145/1282427.1282400].
  • 10Zorzi M,Rao RR.Geographic random forwarding (GeRaF) for ad hoc and sensor networks:Multihop performance.IEEE Trans.on Mobile Computing,2003,2(4):337-348.[doi:10.1109/TMC.2003.1255648].

共引文献31

计算机工程与应用
2020年 第24期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部