Adaptive Routing Protocol for VANETs in City Environments using Real-Time Traffic Information
An effective routing protocol for vehicular ad-hoc networks (VANETs) should have good performance regardless of the status of the network. When the network is sparse, routing protocol should work in a way to increase delivery chance. On the other hand, when network density leads to continues connection, routing protocol must choose a policy to minimize delivery delay. To realize these goals, we proposed adaptive road-based routing (ARBR). In this paper we proposed a novel routing protocol for VANETs, which is well adapted to continuously changing topology in such networks. ARBR includes a mechanism for tracking route-requesting vehicle when it leaves its expected location. When the network is sparse, we use storecarry and forward (SCF) paradigm and vehicles as ferries for overcoming the network partitioning. Finally, our protocol is compared with two VANET routing protocols, VADD and GPSR*. The obtained results show that ARBR outperforms VADD and GPSR* in terms of both packet delivery ratio and average endto-end delay of data packets. For example, under specific conditions that was considered in the simulations, when the total number of nodes varies in networks, the packet delivery ratio of ARBR is approximately 17％ better than VADD and 55％ better than GPSR.
road-based ruoting adaptive vehicular ad hoc network
Saeed Ahmadi Arzil Majid Hosseinpour Aghdam Mohammad Ali Jabraeil Jamali
Department of Computer Science Islamic Azad University Tasuj Branch Tabriz, Iran Department of Computer Science Islamic Azad University Shabestar Branch Shabestar, Iran
国际会议
昆明
英文
132-136
2010-10-17（万方平台首次上网日期，不代表论文的发表时间）