Font Size: a A A

Research On Route Optimization Algorithm Based On Connectivity Probability In Vehicular Communication

Posted on:2018-11-18Degree:MasterType:Thesis
Country:ChinaCandidate:H M WangFull Text:PDF
GTID:2348330536979496Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Recently,the growing number of vehicles brings many traffic problems,which makes Vehicular Ad-hoc Networks(VANET)attract much attention.The effective information transmission about traffic safety and infotainment can be achieved by VANET where vehicles communicate with each other and network freely using vehicle terminals.It is difficult to design a routing mechanism for all scenarios.Compared with the highway,the urban road is complicated by the road conditions,the nonuniform distribution of vehicles and other issues,which reduce the successful transmission rate of packets.This thesis focuses on Geographical Location Routing Optimization Algorithm based on connectivity probability under urban scenario in VANET.Firstly,the probability of connectivity is predicted and modeled for the urban scenarios where the road segment is divided into several cells.The maximum and minimum connectivity probabilities algorithm is proposed through analyzing the distribution of vehicles in each cell.Then the connectivity probability on the path can be derived according to the independent and identically concept.The simulation results show the relationship among the connectivity probability,the vehicle density and communication range.Secondly,the proposed algorithm is improved by constructing a constrained optimization problem under urban scenario where the intersection is selected as backbone routing path.The constraints are created by the analytic expressions of end-to-end delay,the numbers of hops,the bit error rate and the connectivity probability.The optimal solution can be obtained using genetic algorithm such as selection,crossover,mutation etc.Then the optimal backbone routing path is added to the packet header.Next,forwarding packets between two adjacent intersections also depend on geographic location information.Neighbor nodes are assigned priority according to position,speed,direction and other factors.Node with highest priority will be selected as the next hop.Simulation and analysis show that this protocol is better in terms of end-to-end delay,hop number,bit error rate and delivery ratio at the cost of routing overhead.
Keywords/Search Tags:VANET, Connectivity probability, Geographic routing protocol, Quality of Service
PDF Full Text Request
Related items