期刊文献+

基于道路段评价机制低延时VANETs路由算法 被引量:1

A LOW-DELAY ROUTING ALGORITHM FOR VANETS BASED ON ROAD-SECTION EVALUATION MECHANISM
下载PDF
导出
摘要 针对城市车辆自组织网络应用需求,提出一种低延时路由协议。该路由协议以城市交通网络模型为基础,首先从各道路段上寻找显著节点,然后估计显著节点之间的链路生存时间,接着从交叉口区域寻找最优的中继节点。一旦找到中继节点便开始广播道路段评价数据包,依据传输延时计算每一个道路段的权重值,最后在路由构建阶段依据道路段权重和有效期选取最优传输路径,实现数据的低延时传输。大量的仿真实验结果表明,与常用的GPSR和GPSR-R路由协议相比,该路由协议不仅端到端平均延时大幅降低,而且报文送达率高、网络开销小。 A low-delay routing protocol is proposed for appl icat ion demand of city vehicle ad hoc networks. Based on the model of city traffic network, the new routing protocol look for the significant nodes on each road-section firstly, then it estimated the lifetime of links between two significant nodes, and found the optimal relay nodes on intersection. Once finding the relay node, the algorithm will begin broadcasting the road-section evaluation packet and calculate a weight value for every road-section according to transmission delay. In the end, it selects the optimal transmission path according to weight and validity of road-sections in routing building stage and achieve low-delay transmission for data. Experiments show that the new routing protocol can not only reduce the average end-to-end transmission delay significantly, but also obtain high packet delivery rate and low network overhead compared with the commonly used GPSR and GPSR-R routing protocols.
出处 《计算机应用与软件》 2017年第8期270-275,共6页 Computer Applications and Software
基金 国家高技术研究发展计划项目(2009AA012420) 广东省科技计划项目(2014A020218016)
关键词 车辆自组织网络 路由协议 传输延时 链路生存时间 显著节点 Vehicle ad hoc networks Routing protocol Transmission delay Link l ifet ime Significant node
  • 相关文献

参考文献4

二级参考文献40

  • 1Leng Supeng,et al.Medium access control in vehicular ad hoc networks[ J ]. Wireless Communications & Mobile Computing, 2011,11(7) :796- 812.
  • 2Uzcategui R. Wave: a tutorial [J]. IEEE Communications Mag- azine,2009,47(5) : 126 - 133.
  • 3Borgonovo F, Capone A,et al. ADHOC MAC:A new MAC ar- chitecture for ad hoc networks providing efficient and reliable point-to-point and broadcast services [ J ]. Wireless Networks, 2004,10(4) :359 - 366.
  • 4Massey J and Mathys P. The collision channel without feedback [J]. IEEE Transactions on Information Theory, 1985,31 (2) : 192 - 204.
  • 5Shaar A A, Davies P A. Prime sequences: quasi-optimal se- quences for OR channel code division multiplexing [J]. IEE Electronic Letters, 1983,19(21 ) : 888 - 890.
  • 6Wong W S. New protocol sequences for random access chan- nels without feedback [ J ]. IEEF. Transactions on Information Theory,2007,53(6) :2060 - 2071.
  • 7Shum K W and Wong W S. Construction and applications of CRT sequences[ J]. IEEE Transactions on Information Theo- ry,2010,56(11) :5780- 5795.
  • 8Shum K W, et al. Shift-Invariant protocol sequences for the collision channel without feedback[ J]. IEEE Transactions on Informaation Theory, 2009.55(7) : 3312 - 3322.
  • 9Shum K W, Wong W S, et al. Design and construction of pro- tocol sequences:Shift invariance and user irrepressibility[ A]. IEEE IS1T 2009[ C]. IEEE, 2009. 1368 - 1372.
  • 10滕达,杨寿保,孙伟峰,王大鹏.车载网络中提高公平性的数据包大小自适应调节方案[J].电子学报,2007,35(8):1521-1526. 被引量:3

共引文献15

同被引文献14

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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