Font Size: a A A

A Study On Roadside-aided Routing Algorithms For Vehicular Ad Hoc Networks

Posted on:2018-06-23Degree:MasterType:Thesis
Country:ChinaCandidate:Y ZhangFull Text:PDF
GTID:2348330569986289Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
Vehicular Ad Hoc Networks(VANETs)are a branch of Mobile Ad Hoc Networks(MANETs).As a special ad hoc network,it is an important component of intelligent transportation.It has not only the common characters of mobile ad hoc networks,but also some own features,such as the nodes have a high speed in the network,the wireless link is easy to be broken and the topology structure changes frequently.On the other hand,the trace of the node's movement follows some certain patterns,for example,the direction of the node is restricted by the fixed road,the node is unconstrained by energy,etc.All of these features make the routing algorithms used by mobile ad hoc networks unsuitable for a vehicular ad hoc network.It is feasible and significant to construct a fast and reliable route on the basis of the information in the vehicular ad hoc network,which combines information collected from the vehicle on the road and make full use of the roadside units and the fixed facilities,for instance,base stations,satellites,etc.Firstly,an introduction of the vehicular ad hoc network is briefly described,which is mainly about the basic concepts,the basic characters,the developing trend and its applications.Then,a classification of the existing Vehicular Ad Hoc Network routing algorithms is presented.Each type,one to three representativerouting algorithms willdetailedly be introduced.On the foundation of classical routing algorithms,some roadside-aided routing algorithms will be introduced,and analyze the advantages and disadvantages.Secondly,to solve the problem that the existing roadside-aided with location based routing algorithms introduce a large number of redundant control packets and it is easy to fall into local maximum by using greedy forward method,an Efficient Routing with Message Aggregation in Vehicular Networks(ERMA)is proposed.By aggregating control packet and piggybacking mechanism of data,ERMA can reduce the number of sending control packets and efficiently deal with the local maximum problem.The simulation shows that ERMA can efficiently improve the packet deliver ratio,reduce control overhead and the delay.Then,to solve the problem that the existing routing algorithms,which use digital map and roadside units,have not considered the situation that the node's velocityis zero with roadside-aided predicting the node's destination.The situation will cause the prediction range out of date,and the data can't be successfully delivered to the destination.On the other hand,the route using the digital map to construct,which is made up of the shortest roads,is not the most optimal routing path.AReliable Routing with Roadside-aided Prediction in Vehicular Ad Hoc Networks(RRRP)is proposed.By considering the situation that the node's velocityis zero and the road's density,RRRP use the reliable prediction and density aware mechanism to make sure the data successfully delivered to the destination.The simulation shows that RRRP canimprovethepacket deliver ratio,reduce the end to end delay and increase the throughput.Finally,a summary of this thesis is given,then a future of roadside-aided with location based routing algorithms is prospected,and directions for future research will be given.
Keywords/Search Tags:VANETs, greedy forwarding, roadside-aided routing, message aggregation, density aware
PDF Full Text Request
Related items