Computer Science ›› 2018, Vol. 45 ›› Issue (5): 75-78.doi: 10.11896/j.issn.1002-137X.2018.05.013

Previous Articles     Next Articles

Intersection-relay-assisted Routing Scheme in VANETs

SUN Hai-feng and SONG Li-li   

  • Online:2018-05-15 Published:2018-07-25

Abstract: For the characteristics of fast moving vehicles and rapid changing network links in vehicular Ad hoc networks,local maximum is often happened at road intersections in previous routing schemes.Based on road characteristics in urban environments,and supported by physical infrastructure and electronic conditions of the traffic light system,an intersection-relay-assisted routing(IRAR) scheme was proposed.By building a stochastic model of the road message delay,the global optimum forwarding path is got for each message,and local maximum is solved by relay assisted infrastructure.Furthermore,intersection forward mode and greedy straight way mode are designed according to the intersection location and straight way location of messages,separately.Finally,simulations are conducted to compare the proposed IRAR and the state-of-the-art schemes.Simulation results suggest that IRAR outperforms the compared schemes significantly in delivery ratio and delay.

Key words: Vehicular ad hoc network,Relay assisted,Routing scheme,Local maximum,Stochastic model

[1] HUANG C M,LIN S Y.An early collision warning algorithm for vehicles based on V2V communication [J].International Journal of Communication Systems,2012,25(6):779-795.
[2] 李东颖.车联网将成产业革命推动力 [N].北京青年报,2014(1).
[3] CUNHA F,VILLAS L,BOUKERCHE A,et al.Data communication in VANETs:Protocols,applications and challenges [J].Ad Hoc Networks,2016,44:90-103.
[4] MACKER J P,CORSON M S.Mobile ad hoc networking andthe IETF [J].ACM SIGMOBILE Mobile Computing and Communications Review,1998,2(1):9-14.
[5] KARP B,KUNG H T.GPSR:greedy perimeter stateless routing for wireless networks [C]∥6th annual international conference on Mobile computing and networking(MobiCom’00).New York:ACM,2010:243-254.
[6] BAYLESS S H,GUA A.Connected vehicle technical insights[EB/OL].[2016-11-08].http://www.itsinternational.com/sections/nafta/features/its-america-publishes-connected-vehicle-guidance.
[7] BAZZI A,ZANELLA A.Position based routing in crowd sen-sing vehicular networks [J].Ad Hoc Networks,2016,36:409-424.
[8] WISITPONGPHAN N,BAI F,MUDALIGE P,et al.Routing in sparse vehicular ad hoc wireless networks [J].IEEE Journal on Selected Areas in Communications,2007,25(8):1538-1556.
[9] TIAN D X,LEUNG V C M.Analysis of broadcasting delays in vehicular ad hoc networks [J].Wireless Communications & Mobile Computing,2011,11(11):1433-1445.
[10] ZHAO J,CAO G.VADD:Vehicle-assisted data delivery in vehicular Ad hoc networks [J].IEEE Transactions on Vehicular Technology,2008,57(3):1910-1922.
[11] SUN H F,LUO G C,CHEN H.JTAR:Junction-Based Traffic Aware Routing in Sparse Urban VANETs [J].IEICE Transactions on Communications,2012,E95B(3):1007-1010.
[12] JERBI M,SENOUCI S M,RASHEED T,et al.Towards effi-cient geographic routing in urban vehicular networks [J].IEEE Transactions on Vehicular Technology,2009,58(9):5048-5059.
[13] GUAN X,HUANG Y,CAI Z P,et al.Intersection-based forwarding protocol for vehicular ad hoc networks [J].Telecommunication Systems,2016,62(1):67-76.
[14] NSNAM.Network Simulator(ns-2) [EB/OL].[2010-05-08].http://nsnam.isi.edu/nsnam/index.php/Main_Page.
[15] HARRI J,FIORE M,FILALI F,et al.Vehicular mobility simu-lation with VanetMobiSim [J].Simulation,2009,87(4):275-300.
[16] WU T Y,WANG Y B,LEE W T.Mixing greedy and predictive approaches to improve geographic routing for VANET [J].Wireless Communications & Mobile Computing,2012,12(4):367-378.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .