期刊文献+

基于成功递送率的编码感知机会路由机制 被引量:3

Coding-aware opportunistic routing based on successful delivery probability
下载PDF
导出
摘要 为充分利用无线信道的广播特性,提升网络性能,提出了一种基于成功递送率的编码感知机会路由机制。该机制采用成功递送率替代跳数、期望传输次数等传统路由判据进行路由选择。同时采用转发节点集,允许转发节点集中的所有节点进行编码并按不同的优先级转发数据包,从而避免了传统编码感知的路由方法为获得编码增益'汇聚'数据流所引起的流间干扰、中间节点过载等问题,获得了更高的编码增益。仿真结果表明,该机制能够以增加少量重复数据包为代价获得更多的编码机会,从而有效地提升网络性能。 A successful delivery probability(SDP) based coding-aware opportunistic routing mechanism was proposed.In this mechanism SDP was used as routing metric instead of traditional routing metrics such as hops and expected transmission count(ETX).Forwarder set was adopted and all the nodes in the forwarder set can perform coding and forward packets according to their priority in a distributed manner.Thus,the problems such as inter-flow interference and overloaded intermediate nodes caused by traditional coding-aware routing protocol can be overcome.Simulation results show that the proposed mechanism can obtain more coding opportunities at the cost of increasing a small amount of duplicates,thus effectively promote network performance.
出处 《吉林大学学报(工学版)》 EI CAS CSCD 北大核心 2012年第1期218-222,共5页 Journal of Jilin University:Engineering and Technology Edition
基金 '863'国家高技术研究发展计划项目(2008AA01Z211) 国家自然科学基金项目(60902049 60873190)
关键词 信息处理技术 无线MESH网络 网络编码 机会路由 成功递送率 information processing wireless mesh network network coding opportunistic routing successful delivery probability
  • 相关文献

参考文献8

  • 1Ahlswede R, Cai N, Li S R, et al. Network infor- mation flow[J]. IEEE Trans on Information Theo- ry, 2000, 46(4):1204-1216.
  • 2Katti S, Rahul H, Hu W J, et al. XORs in the air.. practical wireless network coding [C]// ACM SIGCOMM, Pisa, Italy, 2006.. 243-254.
  • 3Sengupta S, Rayanchu S, Banerjee S. An analysis of wireless network coding for unicast sessions: the case for coding-aware routing [C] // INFOCOM 2007, Anchorage, USA, 2007: 1028-1036.
  • 4Le J L, Lui J C S, Chiu D M. DCAR: distributed coding-aware routing in wireless networks[C]//ICDCS, Beijing, China, 2008: 462-469.
  • 5Biswas S, Morris R. ExOR: opportunistic routing in multi-hop wireless networks [C]// ACM SIGCOMM, Philadelphia, USA, 2005:133-144.
  • 6Chachulski S, Jennings M, Katti S, et al. Trading structure for randomness in wireless opportunistic routing [C]// ACM SIGCOMM, Kyoto, Japan, 2007:169-180.
  • 7Zhang J, Chen Y P, Marsic I. Network coding via opportunistic forwarding in wireless mesh networks [C]//WCNC2008, LasVegas, USA, 2008: 1775- 1780.
  • 8Yan Y, Zhang B X, Mouftah H T,et al. Practical coding-aware mechanism for opportunistic routing in wireless mesh networks[C]//ICC, Beijing, China, 2008..2871-2875.

同被引文献42

  • 1Ahlswede R,Cai N,Li S Y R,et al.Network in-formation flow[J].IEEE Trans on Information The-ory,2000,46(4):1204-1216.
  • 2Li S Y R,Yeung R W,Cai N.Linear network cod-ing[J].IEEE Trans on Information Theory,2003,49(2):371-381.
  • 3Koetter R,Medard M.An algebraic approach tonetwork coding[J].IEEE/ACM Transactions onNetworking,2003,11(5):782-795.
  • 4Ho T,Medard M,Koetter R,et al.A random line-ar network coding approach to multicast[J].IEEETrans on Information Theory,2006,52(10):4413-4430.
  • 5Fragouli C,Soljanin E.A connection between net-work coding and convolutional codes[C]∥IEEEConference on Communications,Paris,France,IEEE Press,2004:661-666.
  • 6Erez E,Feder M.Convolutional network codes[C]∥IEEE International Symposium on InformationTheory,Chicago,USA,IEEE Press,2004.
  • 7Yeung R W,Li S Y R,Cai N,et al.Network Cod-ing Theory[C]∥Foundation and Trends in Commu-nications and Information Technology,Boston,USA:Now Pubublishers Inc,2006.
  • 8Li S Y R,Sun Q T.Network coding theory viacommutative algebra[J].IEEE Trans on Inf Theo-ry,2011,57(1):403-415.
  • 9Erez E,Feder M.Efficient network code design forcyclic networks[J].IEEE Trans on Inf Theory,2011,56(8):3862-3878.
  • 10To Duc,Choi Jinho.Convolutional codes in two-way relay networks with physical-layer networkcoding[J].IEEE Transactions on Wireless Commu-nications,2010,9(9):2724-2729.

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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