期刊文献+

一种基于部分网络编码的无线网络机会路由算法 被引量:2

Opportunistic Routing Algorithm Based on Partial Network Coding for Wireless Networks
下载PDF
导出
摘要 结合机会路由和网络编码两项新技术各自的优势,提出了一种新的基于部分网络编码的机会路由算法(Opportunistic Routing Algorithm for Wireless Network Based on Partial Network Coding,ORAPNC)。为了避免数据包分叉传输,同时利于执行转发节点间协调机制,ORAPNC首先以期望传输次数作为路由度量建立一条固定路由,并将候选转发节点集中在这条固定路径附近;为了充分减小网络中的冗余数据包,ORAPNC采用一种新的转发节点间协调机制(Forwarding Nodes Coordination Mechanism,FNCM)来实现每跳的数据包传输。仿真结果表明,与其他相关路由协议相比较,ORAPNC可以有效提高网络吞吐量,减小目的节点解出原始数据包的平均时延。 A new opportunistic routing algorithm for wireless network based on partial network coding (ORAPNC) was proposed,which combines the advantages of opportunistic routing and network coding. In order to avoid the bifur- cation transmission of data packets and benefit the implementation of the coordination mechanism among forwarding nodes, firstly,ORAPNC establishes a fixed path using expected transmission count as path metric, meanwhile gathers the candidate forwarding nodes in the vicinity of this fixed path. Then, ORAPNC adopts a new forwarding nodes coordi- nation mechanism (FNCM) to achieve per-hop packet transmission for the sake of reducing redundant data packets in the network sufficiently. Simulation results show that, comparing to other routing protocols, ORAPNC performs more effectively on improving network throughput, decreasing average delay of decoding the original data packets at destina- tion node.
出处 《计算机科学》 CSCD 北大核心 2016年第9期152-155,174,共5页 Computer Science
基金 河北省自然基金项目(F2014201168)资助
关键词 部分网络编码 无线网络 机会路由 网络吞吐量 Partial network coding, Wireless networks, Opportunistic routing, Network throughput
  • 相关文献

参考文献14

  • 1Biswas S, Morris R. Opportunistic Routing in Multi-Hop Wire- less Networks [J]. ACM SIGCf)MM Computer Communications Review, 2004,34 ( 1 ) : 69-74. 被引量:1
  • 2Biswas S, Morris R. ExOR: Opportunistic Multi-Hop Routing for Wireless Networks [J]. ACM SIGCOMM Computer Com- munications Review, 2005,35 (4) : 133-144. 被引量:1
  • 3Thorat S A,Kulkarni P J. Opportunistic Routing in Presence of Selfish Nodes for MANET[J]. Wireless Personal Communica- tions, 2015,82(2) : 689-708. 被引量:1
  • 4Chakchouk N. A Survey on Opportunistic Routing in Wireless Communication Networks [J]. IEEE Communication Surveys Tutorials,2015,17(4) :2214- 2241. 被引量:1
  • 5Ahlswede R,Cai N, Li S Y R, et al. Network information flow [J].IEEE Transactions on Information Theory, 2000, 46 (4), 1204-1216. 被引量:1
  • 6韩莉,钱焕延,刘慧婷.无线多跳网络上基于网络编码的多源多播算法[J].计算机科学,2015,42(10):88-91. 被引量:1
  • 7陈晨,董超,茅娅菲,陈贵海,王海.无线网络编码感知路由综述[J].软件学报,2015,26(1):82-97. 被引量:16
  • 8Chachulski S, Jer:nings M, Katti S, et al. Trading Structure for Randomness in Wireless Opportunistic Routing [J]. ACM SIG- COMM Computer Communication Review, 2007,37 (4) : 169-180. 被引量:1
  • 9Hao Kun,Jin Zhi-gang, Hao Ping. A New Opportunistic Routing Mechanism Based on Partial Network Coding[C]//The Fifth International Conference on Intelligent Networks and Intelligent Systems. IEEE,2012:154-157. 被引量:1
  • 10王晓东,霍广城,孙海燕,孟祥旭,孙言强.移动自组网中基于部分网络编码的机会主义路由[J].电子学报,2010,38(8):1736-1740. 被引量:11

二级参考文献31

  • 1Rahul C shah, Sven Wietholter, Adam Wolisz. When does opportunistic muting make sense[A ]? 3rd 1EEE Conference on Pervasive Computing and Communications Workshops Proceedings[ C ]. Havaii: IEEE Communication Society Press, 2005.350 - 356. 被引量:1
  • 2Zifei Zhong, Srihari Nelakuditi. On the efficacy of opportunistic muting[ A ]. Proceedings of SECON [ C ]. San Diego: IEEE Communication Society Press,2007.441 - 450. 被引量:1
  • 3Z Zhong, J Wang,G-H Lu,S Nelakudit. On selection of candidates for opportunistic anyPath forwarding[ J]. Mobile Computing and Commtmications Review,2006,10(4): 1 - 2. 被引量:1
  • 4S Biswas, R Morris. ExOR: Opportunistic routing in multi-hop wireless networks[ A] .Proceedings of ACM SIGCOMM[ C]. Philadelphia. ACM Press, 2005. 133 - 144. 被引量:1
  • 5Szymon Chachulski, Michael Jennings Sachin Katti Dina Katabi. Trading structure for randomness in wireless opportunistic routing [ A]. Proceedings of ACM SIGCOMM 2007 [C]. Kyoto: ACM Press,2007. 1036 - 1048. 被引量:1
  • 6Sachin Katti,Hariharan Rahul, Wenjun Hu,Dina Katabi. XORs in the air:Practical wireless network coding[ A]. Proceedings of ACM SIGCOMM[ C]. Pisa: ACM Press, 2006.243 - 254. 被引量:1
  • 7Shuo-Yen, Robet Li, Raymond W Yeung. Linear network coding[ J ]. IEEE Transactions on Information Theory, 2003, 49 (2) :371 - 381. 被引量:1
  • 8Jilin Le, John C S Lui, Dab Ming Chiu. How many packets can we encode? -An analysis of practical wireless network coding [A]. Proceedings of INFOCOM'08[C]. Phoenix: ACM Press, 2008,371 - 375. 被引量:1
  • 9Sachin Katti, Dina Katabi, Wenjun Hu, Hariharan Rahul. The importance of being opportunistic: practical network coding for wireless environments[ A] .Proceedings of INFOCOM' 07[ C ]. Anchorage: ACM Press, 2007. 569 - 578. 被引量:1
  • 10D S Lun, M Medard, et al. Efficient operation of wireless packet networks using network coding[ A]. Proceedings of International Workshop on Convergent Technologies (IWCT) [C]. Oulu: IEEE Communication Society Press, 2005. 247 - 251. 被引量:1

共引文献31

同被引文献11

引证文献2

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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