期刊文献+

VANETs中的基于最小传输选择的局部机会路由

Minimum Transmission Selection-based Localized Opportunistic Routing in Vehicular Ad Hoc Networks
下载PDF
导出
摘要 机会路由充分利用无线网络的广播特性,极大地提高单播吞吐量。然而,现有的机会路由依赖拓扑的全局信息,而且收集全局信息增加了系统开销,这将限制了机会路由在大型无线网络的应用。为此,提出基于最小传输选择MTS-B(minimum transmission selection)算法的局部机会路由LOR(localized opportunistic routing)协议,记为MTS-BLOR。提出的MTS-BLOR采用分布式最小传输选择算法MTS-B,并利用局部信息将网络拓扑划分小的邻近节点集CNS(close-node-set),拓宽了机会路由在大型的无线网络中的应用。由于无需使用全局动态信息,MTS-BLOR降低了系统开销,减少了系统复杂度。同时,分析了转发清单的全局优化与因开销受限的可扩展性之间的权衡。实验仿真表明,与ExOR(extremely opportunistic routing)、MORE(MAC-independent opportunistic routing protocol)相比,MTS-BLOR在时间复杂度、端到端传输时延和吞吐量方面得到明显的提升。 Opportunistic routing utilizes the broadcast nature of wireless networks,significantly promoting the unicast throughput. Many variations of opportunistic routing designs have been proposed,although all of the current designs consistently rely on all of the topology information to construct forwarder lists and process data forwarding,which indeed restricts the application in large-scale wireless networks,where collecting global optimal information is very costly was proposed. Minimum transmission selection-based the localized opportunistic routing( LOR) protocol,marked as MTS-BLOR. The MTS-BLOR utilizes the distributed minimum transmission selection( MTS-B) algorithm to partition the topology into several nested close-node-sets( CNSs) using local information. MTS-BLOR can locally realize the optimal opportunistic routing for a large-scale wireless network with low control overhead cost. Since it does not use global topology information,MTS-BLOR highlights an interesting tradeoff between the global optimality of the used forwarder lists and scalability inferred from the incurred overhead. Extensive simulation results show that MTS-BLOR dramatically improves performances over extremely opportunistic routing( ExOR) and MAC-independent opportunistic routing protocol( MORE),which are two well-known designs from the literature,in terms of control overhead,end-to-end delay,and throughputs.
作者 倪红彪 李卓
出处 《科学技术与工程》 北大核心 2014年第27期90-95,共6页 Science Technology and Engineering
基金 吉林警察学院院级科研项目(yjky201311)资助
关键词 分布式路由 图分割 局部信息 机会路由 最小传输选择 车载网 distributed routing graph partitioning local information opportunistic routing minimum transmission selection VANETs
  • 相关文献

参考文献12

  • 1Johnson D B, Maltz D A. Dynamic source routing in ad hoc wireless networks. Mobile Computing, Norwell, MA: Kluwer,1996.
  • 2Perkins C E, Royer E M. Ad-hoc on-demand distance vector routing. Proc Mobile Comput Syst, 1999:90-96.
  • 3Biswas S, Morris R. ExOR: opportunistic routing in multi-hop wire- less networks. Proc ACM SIGCOMM, 2012:133-144.
  • 4徐子豪,张腾飞.基于语音识别和无线传感网络的智能家居系统设计[J].计算机测量与控制,2012,20(1):180-182. 被引量:67
  • 5Couto D D, Aguayo D, Bicket J, et al. High-throughput path metric for multi-hop wireless routing. Proc MOBICOM, 2011 : 134-146.
  • 6Chachulski S, Jennings M, Katti S, et al. Trading structure for ran- domness in wireless opportunistic routing. Proc ACM SIGCOMM,2007 : 169-180.
  • 7Li Y, Chen W, Zhang Z L. Optimal forwarder list selection in oppor- tunistic routing. Proc. IEEE MeshTech, 2010:670--675.
  • 8高键,方滨,尹金玉,胡葛军.ZigBee无线通信网络节点设计与组网实现[J].计算机测量与控制,2008,16(12):1912-1914. 被引量:54
  • 9Li Y, Liu Y A, Li L, et al. Local scheduling scheme for opportunis- tic routing. Proc IEEE WCNC, 2009:1--6.
  • 10Zhao J, Cao G. VADD: Vehicle-assisted data delivery in vehicular ad hoc networks. IEEE Trans Veh Technoi, 2011 ; 57 (3) : 1910-1922.

二级参考文献12

共引文献119

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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