欢迎访问中国科学院大学学报,今天是
简报

基于地理位置和多阶邻节点辅助的编码感知无线多跳网络路由协议

  • 郭冠华 ,
  • 焦臻桢 ,
  • 周猛 ,
  • 张宝贤
展开
  • 1. 中国科学院大学 泛在与传感网研究中心, 北京 100049;
    2. 中国移动通信集团公司技术部, 北京 100033

收稿日期: 2014-03-21

  修回日期: 2014-05-05

  网络出版日期: 2015-01-15

基金资助

国家科技重大专项(2012ZX03005019)资助

A location-based multi-level-neighbor-assisted coding-aware routing protocol for wireless multi-hop networks

  • GUO Guanhua ,
  • JIAO Zhenzhen ,
  • ZHOU Meng ,
  • ZHANG Baoxian
Expand
  • 1. Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences, Beijing 100049, China;
    2. Department of Technology, China Mobile, Beijing 100033, China

Received date: 2014-03-21

  Revised date: 2014-05-05

  Online published: 2015-01-15

摘要

提出一种适用于无线多跳网络的基于地理位置的多阶邻节点辅助的编码感知路由协议(LFCR).LFCR基于数据流间编码思想,借助地理位置信息,在建立路由时,综合考虑编码机会和传输能够带来的数据包正向前进位移,在创造具有编码机会路径时,避免了路由过度绕远.仿真结果表明,相比于经典编码路由协议COPE,LFCR能够显著提高网络性能.

本文引用格式

郭冠华 , 焦臻桢 , 周猛 , 张宝贤 . 基于地理位置和多阶邻节点辅助的编码感知无线多跳网络路由协议[J]. 中国科学院大学学报, 2015 , 32(1) : 140 -144 . DOI: 10.7523/j.issn.2095-6134.2015.01.023

Abstract

We propose a location-based multi-level-neighbor-assisted coding-aware routing protocol (LFCR) for wireless multi-hop networks. LFCR is based on the concept of inter-flow network coding and utilizes location information for establishing routes, which takes into account not only the potential network coding opportunities but also the positive progress brought by each transmission. Simulation results show that, compared to COPE, LFCR significantly improves performance of the network.

参考文献

[1] Ahlswede R, Cai N, Li S Y R, et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000, 46(4): 1 204-1 216.

[2] Katti S, Rahul H, Hu W J, et al. XORs in the air: practical wireless network coding[C]//Proceedings of ACM SIGCOMM 2006. Pisa: ACM, 2006: 243-254.

[3] Sengupta S, Rayanchu S, Banerjee S. An analysis of wireless network coding for unicast sessions: the case for coding-aware routing[C]//Proceedings of IEEE INFOCOM 2007. Anchorage: IEEE, 2007: 1 028-1 036.

[4] Ni B, Santhapuri N, Zhong Z F, et al. Routing with opportunistically coded exchanges in wireless mesh networks[C]//Proceedings of IEEE WiMesh 2006. Reston: IEEE, 2006: 157-159.

[5] Le J L, Lui J C S, Chiu D M. DCAR: distributed coding-aware routing in wireless networks[J]. IEEE Transactions on Mobile Computing, 2010, 9(4): 596-608.

[6] Wu Y N, Das S M, Chandra R. Routing with a Markovian metric to promote local mixing[C]//Proceedings of IEEE INFOCOM 2007. Anchorage: IEEE, 2007: 2 381-2 385.

[7] Hou R H, Qu S K, Lui K S, et al. Coding-and interference-aware routing protocol in wireless networks[J]. Computer Communications, 2013, 36(17): 1 745-1 753.

[8] Chi Y, Agrawal D P. HyCare: hybrid coding-aware routing with ETOX metric in multi-hop wireless networks[C]//Proceedings of IEEE MASS 2013. Hangzhou: IEEE MASS, 2013: 136-144.

[9] Shao X, Wang R C, Lin Q M, et al. Mobile agent based coding aware multipath routing for wireless sensor network[J]. Advances in Wireless Sensor Networks, 2013, 3(34): 371-380.

[10] Blazevic L, Giordano S, Boudec J Y L. Anchored path discovery in terminode routing[C]//Proceedings of NETWORKING 2002. Pisa: Networking, 2002: 141-153.

[11] Perkins C, Belding-Royer E, Das S. Ad hoc on-demand distance vector (AODV) routing[S]. 2003[2014-03-12]. http://tools.ietf.org/html/rfc3561.html.

[12] UCLA. The network simulator (NS-2)[EB/OL]. Los Angeles, UCLA, (2007-03-10)[2012-05-30]. http://www.isi.edu./nsnam/ns.

文章导航

/