An Efficient Scalable Trajectory Based Forwarding Scheme for VANETs

被引:10
作者
Labiod, Houda [1 ]
Ababneh, Nedal [1 ]
Garcia de la Fuente, Miguel [2 ]
机构
[1] TELECOM ParisTech, 46 Rue Barrault, F-75013 Paris, France
[2] Tecnalia, Robotiker, Telecom Unit, Zamudio, Spain
来源
2010 24TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) | 2010年
关键词
Vehicular ad hoc networks; Trajectory-based forwarding; Mobility model; Performance evaluation;
D O I
10.1109/AINA.2010.9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The past few years have seen an increasing interest in the development of vehicular ad hoc networks resulting in many routing protocols proposals. Scalability issues in such networks are attracting increasing attention these days. To improve data delivery performance in large scale networks, we propose SIFT, a trajectory based routing scheme that requires sparse infrastructure and rely on low quality information. It merely uses the trajectory and the location of the last node that forwarded the packet to forward a data packet from a source to a destination. SIFT is evaluated against DREAM, a well-known routing protocol from the literature through realistic simulations using Omnet++. Simulation results demonstrate that under dense deployment, using a realistic mobility model scenario, the proposed scheme performs better in terms of delivery ratio, end-to-end delay and route length.
引用
收藏
页码:600 / 606
页数:7
相关论文
共 10 条
[1]  
BASAGNI S, 1998, P ACM IEEE MOBICOM
[2]  
Briesemeister L., 2001, THESIS TU BERLIN
[3]  
Hommel G., 2002, P COMM NETW DISTR SY
[4]  
Jannotti J., 2000, P ACM MOB
[5]  
KO YB, 1999, P 2 IEEE WORKSH MOB
[6]  
Lochert C., 2003, P IEEE INT VEH S IV2
[7]  
NICULESCU D, 2003, P 9 ANN INT C MOB CO
[8]  
Potnis N., 2005, TR051220 FLOR STAT U
[9]  
Wu H., 2004, P 1 ACM WORKSH VEH A
[10]  
Xie F., 2007, P IEEE 66 VEH TECHN