Improving route stability and overhead of the AODV routing protocol and makeing it usable for VANETs

被引:0
作者
Abedi, Omid [1 ]
Barangi, Reza [1 ]
Azgomi, M. Abdollahi [1 ]
机构
[1] IUST, Dept Comp Engn, Tehran, Iran
来源
ICDCS: 2009 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS | 2009年
关键词
Ad hoc network; VANET; routing protocol; AODV; control overhead; Manhattan mobility model;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
one of the most important routing protocols used in Ad hoc networks is AODV. This protocol is a reactive protocol that searches routes only when they are needed. It always exchanges control packets between neighbor nodes for routing. For reduction of control overheads and bandwidth consumption and make AODV usable for VANET, we have eliminated route discovery phase by restricting neighbor's distance and number of discovered routes. This restriction leads to reduce most of control overheads. We make an improvement on AODV and propose PAODV as routing protocol. This protocol improves AODV control overheads and makes routes more stable. One of the technical differences between MANET and VANET is mobility model. Manhattan is the mobility model for VANET that we use to evaluate our method.
引用
收藏
页码:464 / 467
页数:4
相关论文
共 15 条
[1]  
[Anonymous], AD HOC DEMA IN PRESS
[2]  
[Anonymous], 802112020 IEEE, P1
[3]  
[Anonymous], 2003, DYNAMIC SOU IN PRESS
[4]  
[Anonymous], 2002, P 1 ACM WORKSH WIR S
[5]  
ARANGO J, EFFICIENT FLOODING A
[6]   Parser: A parallel simulation environment for complex systems [J].
Bagrodia, R ;
Meyer, R ;
Takai, M ;
Chen, YA ;
Zeng, XA ;
Martin, J ;
Song, HY .
COMPUTER, 1998, 31 (10) :77-+
[7]  
JAAP S, 2005, 11 EUNICE OP EUR SUM
[8]  
Lee S, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1, DOI 10.1109/ROBOT.1999.769891
[9]  
LIN GL, 2004, 23 ANN JOINT C IEEE
[10]   On the reduction of broadcast redundancy in mobile ad hoc networks [J].
Peng, W ;
Lu, XC .
MOBIHOC: 2000 FIRST ANNUAL WORKSHOP ON MOBILE AND AD HOC NETWORKING AND COMPUTING, 2000, :129-130