LSGO: Link State aware Geographic Opportunistic routing protocol for VANETs

被引:76
作者
Cai, Xuelian [1 ]
He, Ying [1 ]
Zhao, Chunchun [1 ]
Zhu, Lina [1 ]
Li, Changle [1 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
VANETs; Geographic opportunistic routing; Link state; Priority schedule; AD HOC NETWORKS;
D O I
10.1186/1687-1499-2014-96
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Robust and efficient data delivery in vehicular ad hoc networks (VANETs) with high mobility is a challenging issue due to dynamic topology changes and unstable wireless links. The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links. In this paper, we propose a Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric. The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle's geographic location and the link's quality. We compare the performance of LSGO with GpsrJ + which removes the unnecessary stop at a junction and greedy traffic aware routing protocol (GyTAR) using network simulator ns-2. The simulation results show that it opens more nodes to participate in the opportunistic data forwarding and increases a connection's throughput while using no more network capacity than traditional routing. In the simulation, compared with other two protocols, when the number of vehicles and the average vehicle velocity increase, LSGO's packet dropping rate is reduced and the network throughput is improved.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 33 条
[1]   A New Scalable Hybrid Routing Protocol for VANETs [J].
Al-Rabayah, Mohammad ;
Malaney, Robert .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2012, 61 (06) :2625-2635
[2]  
[Anonymous], 2008, 2008 INT S WORLD WIR
[3]  
[Anonymous], 2005, ACM SIGMOBILE mobile computing and communications review, DOI DOI 10.1145/1055959.1055970
[4]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[5]   Grid-Based Predictive Geographical Routing for Inter-Vehicle Communication in Urban Areas [J].
Cha, Si-Ho ;
Lee, Keun-Wang ;
Cho, Hyun-Seob .
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2012,
[6]   Trading structure for randomness in wireless opportunistic routing [J].
Chachulski, Szymon ;
Jennings, Michael ;
Katti, Sachin ;
Katabi, Dina .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2007, 37 (04) :169-180
[7]  
De Couto D. S. J., 2003, P 9 ANN INT C MOB CO, P134, DOI DOI 10.1145/938985.939000
[8]   Valuable Detours: Least-Cost Anypath Routing [J].
Dubois-Ferriere, Henri ;
Grossglauser, Matthias ;
Vetterli, Martin .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2011, 19 (02) :333-346
[9]  
Harri J., 2006, PROC 3 INT WORKSHOP, P96
[10]   Towards Efficient Geographic Routing in Urban Vehicular Networks [J].
Jerbi, Moez ;
Senouci, Sidi-Mohammed ;
Rasheed, Tinku ;
Ghamri-Doudane, Yacine .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2009, 58 (09) :5048-5059