城市场景下车载自组网中基于车辆分布的分层路由算法研究

发布时间：2018-01-14 03:31

本文关键词：城市场景下车载自组网中基于车辆分布的分层路由算法研究　出处：《东华大学》2017年硕士论文　论文类型：学位论文

更多相关文章： 车载自组网 分层 路由协议 GPSR NS-2

【摘要】：当下,车载自组网作为智能交通系统的重要组成部分,具有重要的研究价值和广阔的发展前景。车载自组网的网络性能是限制其发展的主要因素,一个好的车载自组网路由协议能够改善网络性能,使数据实现可靠、稳定的传输。但是由于车载自组网中车辆节点移动速度快、运动轨迹受道路限制等诸多特点,车载自组网对网络路由协议的要求更加严格。本文针对车辆不同分布的情况对车载自组网的路由算法进行了深入的研究。首先,针对城市场景下道路车辆较密集,车辆趋近于均匀分布的情况,提出基于位置的分层路由算法。依赖道路的路边固定设备充当网关,结合车辆的分布密度和车辆在道路的位置,在道路中选取部分车辆充当接入帮助节点(Accessing Help Points,AHPs),结合AHP节点进行GPSR路由改进,提出车辆均匀分布下的分层路由算法,从而有效减少数据从源节点到路边固定设备的数据传输时延。其次,针对城市场景下道路车辆较稀疏,车辆非均匀分布的情况,提出基于相邻车间距的分层路由算法。根据非均匀分布下相邻车辆之间的车间距进行分簇,分簇后的簇头和簇尾节点进行通信半径的动态变化,从而提高网络的稳定性。并在此基础上结合车载自组网中的基于位置的GPSR路由协议进行改进,提出车辆非均匀分布下的分层路由算法,以改善网络性能。通过VanetMobiSim和NS-2仿真工具对上述两种算法进行仿真。仿真结果表明,在车辆趋近均匀分布时,基于位置的分层路由算法能够减少数据传输的时延,降低数据的丢包率,适用于车辆密集拥塞情况下对时延要求较高的城市场景。当车辆非均匀分布时,基于相邻车间距的分层路由算法能够较好的适应车辆的位置变化,在网络负载不大时能够有效减小数据传输时延,提高数据传输的有效性。最后,本文指出了一些有待解决和完善的问题,为后续深入研究指出方向。
[Abstract]:Nowadays, as an important part of intelligent transportation system, vehicle-mounted ad hoc network has important research value and broad development prospect. The network performance of vehicle-mounted ad hoc network is the main factor limiting its development. A good on-board ad hoc routing protocol can improve the network performance, make the data reliable and stable transmission, but because of the vehicular ad hoc network, the vehicle nodes move fast. The movement track is restricted by the road and so on. Vehicle ad hoc network has more strict requirements for network routing protocol. This paper studies the routing algorithm of vehicle ad hoc network in accordance with the different distribution of vehicles. First of all. In view of the situation that the road vehicles are dense and the vehicles are close to uniform distribution in the urban environment, a hierarchical routing algorithm based on location is proposed, which relies on the road fixed devices to act as the gateway. Combined with the distribution density of the vehicle and the location of the vehicle on the road, selected part of the vehicle in the road as the access help node processing Help points AHPs. Combining with AHP nodes to improve GPSR routing, a hierarchical routing algorithm based on uniform distribution of vehicles is proposed to effectively reduce the data transmission delay from source nodes to roadside fixed devices. Secondly. A hierarchical routing algorithm based on the distance between adjacent vehicles is proposed to solve the problem of sparse road vehicles and non-uniform distribution of vehicles in the urban environment. Clustering is carried out according to the distance between adjacent vehicles under the non-uniform distribution. The cluster head and the cluster tail node have dynamic change of communication radius, so as to improve the stability of the network. Based on this, the location based GPSR routing protocol in the vehicle ad hoc network is improved. In order to improve the network performance, a hierarchical routing algorithm with non-uniform vehicle distribution is proposed. The simulation results show that these two algorithms are simulated by VanetMobiSim and NS-2 simulation tools. As vehicles approach to uniform distribution, the hierarchical routing algorithm based on location can reduce the delay of data transmission and the rate of data packet loss. When the vehicle is not uniformly distributed, the hierarchical routing algorithm based on the distance between adjacent vehicles can better adapt to the change of vehicle position. When the network load is small, it can effectively reduce the delay of data transmission and improve the efficiency of data transmission. Finally, this paper points out some problems to be solved and improved, and points out the direction for further research.
【学位授予单位】：东华大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5;U495

【参考文献】