期刊文献+

车载网中一种低延时的广播路由

A Low Latency Broadcast Routing in VANET
在线阅读 下载PDF
导出
摘要 针对车载自组织网络中大量节点传输信息带来信道竞争,使数据包重传次数增多,引发广播风暴的问题,提出了车载网中一种低延时的广播路由(LLBR)。基于减少广播数据包节点数量的策略,对当前节点的邻居节点构建连通支配集,并优化近似成最小连通支配集,以该支配集中的节点为中继节点并以一定的概率广播数据包。仿真结果表明,所提出的广播路由与传统的广播方法基于邻居覆盖的概率转发(NCPR)和基于距离的多跳广播(DMB)相比,在平均端到端延时和数据包递送率方面有较大改善。 Broadcast storm was caused by the increase of data packet and channel contention resulting from information transmission of large amount of nodes in the Vehicular Ad hoc Network(VANET).To solve this problem,a Low Latency Broadcast Routing(LLBR)was proposed in VANET.Based on the strategy to reduce the number of broadcasting data packet node,a connected dominating set was constructed for the neighboring nodes of the current node,which was optimized to approximate the Minimum Connected Dominating Set(M-CDS).The nodes of the M-CDS was used as relay node and data packet was broadcasted at a given probability.Simulation results have shown the effectiveness of the proposed broadcast routing is improved considerably compared to two traditional broadcast protocols NCPR and DMB in end-to-end latency and packet delivery rate.
作者 杨茂保 徐利亚 葛明珠 舒长兴 Yang Maobao;Xu Liya;Ge Mingzhu;Shu Changxing(Jiujiang University,Jiujiang 332005)
机构地区 九江学院
出处 《汽车技术》 CSCD 北大核心 2018年第12期13-18,共6页 Automobile Technology
基金 国家自然科学基金项目(61362032 61662039) 江西省青年科学基金项目(20151BAB217015) 江西省教育厅科学技术研究项目(GJJ170967 GJJ151081 GJJ61678) 九江学院科研课题(2015LGYB28)
关键词 车载网 紧急信息 广播路由 VANET Emergency information Broadcast routing
  • 相关文献

参考文献6

二级参考文献43

  • 1许力,林志伟.基于图着色的无线自组网极小连通支配集算法[J].通信学报,2007,28(3):108-114. 被引量:17
  • 2陈立家,江昊,吴静,郭成城,徐武平,晏蒲柳.车用自组织网络传输控制研究[J].软件学报,2007,18(6):1477-1490. 被引量:46
  • 3NI S Y, TSENG Y C, CHEN Y S. The broadcast storm problem in a mobile Ad Hoc network [ C]// MobiCom'99: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking. [ S. l. ] : ACM Press, 1999:152 - 162.
  • 4DAI F, WU J. Performance analysis of broadcast protocols in Ad Hoc networks based on self-pruning [ J]. IEEE Transactions on Parallel and Distributed Systems, 2004, 15 (11) : 1 - 13.
  • 5DAS B, HARGHAVAN V B. Routing in Ad Hoc networks using minimum connected dominating sets [C]// ICC'97: IEEE International Conference on Communications. Monreal, Quebec: IEEE Press, 1997:1-20.
  • 6LEE J, MANS B. Energy efficient virtual backbones for reception aware MANET [ C]//VTC 2006-Spring: Proceedings of the 63rd IEEE Vehicular Technology Conference. Montreal: IEEE, 2006, 3: 1097 - 1101.
  • 7GUHA S , KHULLER S . Approximation algorithms for connected dominating sets [ J]. Algorithmica, 1998, 20 (4): 374-387.
  • 8WU J, LI H. On calculating connected dominating set for efficient routing in Ad Hec wireless networks [ C]// Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. Seattle: ACM, 1999:7 - 14.
  • 9WAN P, ALZOUBI K, FRIEDER O. Distributed construction of connected dominating set in wireless Ad Hoc networks [ C]//IEEE INFOCOM'02. Washington, DC: IEEE press, 2002: 141-149.
  • 10CORMEN T H, LEISERSON C E, RIVEST R L, et al. Introduction to Algorithms[ M]. 2nd. Cambridge, MA: The MIT press, 2001.

共引文献107

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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