A congestion-aware GPCR routing protocol for vehicular ad-hoc network in urban scenarios

Author(s):  
Xiao-Tao Liu ◽  
Bin-Jie Hu ◽  
Zong-Heng Wei ◽  
Zhi-Xiao Zhu
2011 ◽  
Vol 467-469 ◽  
pp. 972-977
Author(s):  
Bon Yeh Lin ◽  
Chi Hua Chen ◽  
Chi Chun Lo

The Vehicular Ad-hoc NETwork (VANET) requires a suitable routing protocol to accommodate its special characteristics (e.g., high mobility, short-lived links, and fast-changing topology). There are many routing algorithms which are developed for transmitting information more quickly and cost-effective. In this paper, we propose a routing protocol which relies on Defer-Time Control Function (DTCF) to reduce the hop count, the transmission delay, and the probability of collisions during transmission. We provide an extensive analysis of DTCFs and choose the power-law model for routing protocol optimization. The function can be adjusted dynamically according to the distribution of the neighboring nodes (vehicles) of each hop. We also propose a mechanism to prevent the selected next-hop leaves the transmission range.


2015 ◽  
Vol 23 (2) ◽  
pp. 311-322 ◽  
Author(s):  
Sourav Kumar Bhoi ◽  
Pabitra Mohan Khilar ◽  
Munesh Singh

Author(s):  
Linna Oktaviana Sari ◽  
Agusurio Azmi ◽  
Ery Safrianti ◽  
Feranita Jalil

Pekanbaru city is a large area, therefore traffic congestion often occurs due to the density of society’s vehicles. From this problem, it is needed a technology that can exchange information between vehicles. Information Technology that can involve many vehicles with special network types without dependence on an infrastructure is Ad Hoc Network. One type of this network is Vehicular Ad Hoc Network (VANET). VANET is a new concept in enabling communication between Vehicle to Vehicle (V2V). For efficient data packet delivery, VANET requires a routing protocol. In this research, for simulated and analyzed performance is used the Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA) protocol. NS-2 is used to simulated a moved nodes, SUMO software is used to simulated real map of SKA Mall crossroad and parameter the quality of performance routing protocol DSR can determined by End to End Delay, Packet Delivery Ratio (PDR) and Routing Overhead (RO). This simulation uses scenario 100 nodes, 150 nodes, 200 nodes and 250 nodes. The simulation results with the scenario of changing the number of nodes, the DSR routing protocol produces better performance with an average of  End to End Delay is 0.1066 s, average of PDR is 95.45% and average of RO is 1.0076. While the TORA routing protocol has an average of End to End Delay is 0.1163s, average of PDR is 93.49% and average of RO is 1.0801. And in the scenario of node speed changes, the TORA routing protocol produces better performance with an average of End to End Delay is 0.0861 s and average of PDR 97.37%. While the DSR routing protocol is better with an average of RO is 1.0076.


Sign in / Sign up

Export Citation Format

Share Document