The Design of Traffic-Aware Routing Protocols for Vehicular Ad Hoc Networks

  • 羅 群智

Student thesis: Doctoral Thesis


The vehicular ad hoc network is an emerging paradigm that has the potential to improve the safety and efficiency of transportation in the future Since the distribution and movement pattern of vehicles are constrained by road layouts and traffic regulations digital maps and geographical locations of vehicles can be useful for making routing decisions However varying vehicle mobility often results in unreliable connectivity and consequent unstable service quality To address the aforementioned problem a cooperative information collection method was developed in this dissertation This method dynamically selects the most appropriate vehicular nodes at junctions as information aggregators and nodes on road segments as information collectors to cooperatively collect hierarchical information However the location of the destination is not always available during data transmission Thus a cooperative destination discovery protocol is introduced to enable vehicles to cooperatively assist source vehicle to discover the position of the destination when the location of the destination is unobtainable Generally vehicle density is an important metric in monitoring traffic conditions to improve the safety and efficiency of roads By obtaining reliable traffic density results that faithfully reflect actual road conditions not only improve routing performances but also require less transmission overhead for the collection of traffic information Thus this dissertation introduced a more effective density estimation method that will reflect the real traffic situation to improve the effectiveness when making routing decisions In sparse vehicular environments connectivity among vehicles may significantly decrease the probability of information exchange among vehicles or sometimes it’s just simply not feasible due to lack of participants in such environment In this situation vehicles may share or exchange content only through opportunistic contact with one another There are cases where some contents may need to be delivered to destinations within a specific time interval To this end this dissertation introduces a time-validity-constrained content delivery method that constructs an abstract model for the traveling behavior of each mobile node on the basis of the node’s travel records and adopts a high-performance cooperative content delivery scheme The simulation results shows the methods proposed in this dissertation can be used to in both densely and sparsely environments
Date of Award2016 Feb 2
Original languageEnglish
SupervisorYau-Hwang Kuo (Supervisor)

Cite this