期刊文献+

一种可靠的GPSR改进算法在内河航道中的应用研究 被引量:2

Study on Application of Reliable GPSR Routing Algorithm in Inland Waterway
下载PDF
导出
摘要 内河航道船舶之间采用高频、甚高频等方式进行信息交换,存在着干扰严重、成本昂贵等问题,为改善并丰富内河航道的通信模式,将城市交通中应用较为成熟的车载自组网(Vanet)技术引入到航道通信中,建立了可靠的端到端的船舶通信方式。针对传统的Vanet中GPSR(Greedy Perimeter Stateless Routing)路由协议相关算法易形成"空洞"、节点传输不可靠的缺点,提出了改进算法GPSR-CH(GPSR for Channel)。该算法通过增加可靠航标节点、改进Hello包结构、预测船舶的运动轨迹等方案大大增强了传输的可靠性。在内河航道模型环境下的仿真结果表明,GPSR-CH比经典的GPSR及其他几种改进算法有更低的分组丢包率和传输时延。 In the past research, the inland navigation ship relies on satellite, high frequency band and very high frequency band radio communication for data transmission .In order to enrich the communication methods , we establish a reliable end-to-end communication for inner river ships .In this paper we introduce the mature Vanet technology in city traffic ad hoc vehicle network . We focused on the GPSR routine protocol algorithms in Vanet .The traditional algorithm is easy to form hole and the transmission nodes are not robust.The proposed algorithm GPSR-CH can improve the reliability by adding navigation indication nodes , im-proved Hello package structure, and prediction of ship motion tracks.Simulation results show that, the proposed algorithm has lower package error rate and lower transmission delays compared with the traditional GPSR algorithm and its variants in inland navi-gation channel environment.
出处 《安庆师范学院学报(自然科学版)》 2016年第2期72-76,共5页 Journal of Anqing Teachers College(Natural Science Edition)
基金 安徽省教育厅2016年度高校领军人才引进与培育计划项目(gxfx ZD2016324) 安徽省教育厅省级教学团队(2014jxtd99)
关键词 航道通信 VANET GPSR GPSR-CH 航标节点 channel communication vanet GPSR GPSR-CH beacon node
  • 相关文献

参考文献3

二级参考文献27

  • 1KARP B. Greedy perimeter state routing [R]. USC / Information Sciences Institute, 1998.
  • 2KARP B, KUNG H T. GPSR: Greedy perimeter stateless routing for wireless networks [ C]//MobiCom 2000: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking. Washington, DC: IEEE, 2000:243-254.
  • 3FREY H, GORGEN D. Planar graph routing on geographical clusters[ J]. Ad Hoc Networks, 2005, 5(3) : 560 - 574.
  • 4SUN MIN-TE, MA XIAO-LI, LIU JUN. A greedy smart path pruning strategy for geographical muting in wireless networks [ C]// MILCOM 2005: IEEE Military Communications Conference. Washington, DC: IEEE, 2005: 1326- 1332.
  • 5刘军.无线自组网MAC协议及路由算法研究[D].成都:电子科技大学,2006.
  • 6RUDACK M, MEINCKE M, LOTF M. On the dynamics of Ad Hoc networks for Inter Vehicle Communication(IVC) [ C/OL] // Proceed- ings of the ICWN 2002. Las Vegas: [s. n.], 2002[2012-09-01]. http://www, et2. tu-harburg, de/fleetnet/pdf/ICWN_dynamics_fin v3.6. pdf.
  • 7KARP B, KUNG H. T. GPSR: Greedy perimeter stateless routing for wireless networks [ C]// MobiCom '00: Proceedings of the 6th Annual International Conference on Mobile Computing and Networ- king. New York: ACM Press, 2000:243-254.
  • 8TOUSSAINT G T. The relative neighborhood graph of a finite planar set[ J]. Pattern Recognition, 1980, 12(4) : 261 -268.
  • 9GABRIL K R, SOKAL R R. A new statistical approach to geograph- ic variation analysis[ J]. Systematic Zoology, 1969, 18:259 -278.
  • 10MAUVE M, FUBLER H, WIDMER J, et al. Position-based multicast muting for mobile Ad-Hoc networks, TR-03-O04 [ R]. Mannheim, German: University of Mannheim, Department of Computer Science, 2003.

共引文献23

同被引文献5

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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