基于位置分区的D2D车联网无线资源分配及中继选择算法

发布时间：2018-02-22 10:15

本文关键词： 车联网终端直接通信干扰资源分配中继选择　出处：《哈尔滨工业大学》2015年硕士论文　论文类型：学位论文

【摘要】：随着智能交通的快速发展和应用,车联网技术受到了广泛的关注,目前被研究较多的车联网技术是车载自主网(Vehicular Ad-hoc Network,VANET)和第四代移动通信技术(Long Term Evolution,LTE)。VANET应用于车联网时存在扩展性低、时延不可控、没有业务服务质量(Quality of Service,Qo S)保证等缺点。LTE具有低延时、传输速率快、覆盖广泛等优点,但研究表明LTE应用于车联网时存在频谱资源匮乏以及基站负载过大等问题。为解决LTE应用于车联网环境下存在的问题,本文将终端直接(Device-to-Device,D2D)通信技术应用于车联网。D2D技术是在LTE系统架构下支持终端之间直接通信的技术,节点之间通过复用蜂窝用户频谱资源进行直接通信。D2D应用于车联网首先要解决车辆节点之间通信的频谱资源分配以及路由选择问题。传统情况下的D2D通信在进行资源分配和中继选择时,基站需要知道所有可能链路的信道状态信息(Channel State Information,CSI),根据CSI以及系统模型进行资源分配及中继选择。车联网环境下车辆分布密集、节点数量较多,要获取所有信道CSI会导致基站负载过大。同时节点数量较多会导致资源分配时间和中继选择时间较长。此外,车联网环境下节点通信具有频率高、数据量小等特点,因此车联网环境下节点通信对时延和可靠性要求比对容量要求更高。因此降低基站负载以及减少算法时间开销是车联网环境下无线资源分配和中继选择需要关注的重要问题。本文首先分析了传统基于CSI可知的资源分配算法在车联网环境下的问题,探讨了基于地理位置分配资源的可行性。之后分析了基于地理位置分配资源存在的问题,给出了优化解决方案,提出本文基于位置分区的无线资源分配算法。最后通过仿真对比,证明了本文基于位置分区的无线资源分配算法在降低基站负载、减少无线资源分配时间等性能方面具有较大优势。在此基础上,本文分析了传统基于信噪比最大的中继选择算法在车联网环境下存在的问题,探讨了基于地理位置选择中继的可行性。之后分析了基于地理位置选择中继存在的问题,给出优化解决方案,提出本文基于位置分区的中继选择算法。最后通过仿真对比,证明了本文基于位置分区的中继选择算法在降低基站负载、减少中继选择时间等性能方面具有很大优势。
[Abstract]:With the rapid development and application of intelligent transportation, vehicle networking technology has received extensive attention. At present, vehicle networking technologies are vehicle autonomous Ad-hoc network VANET and 4th generation mobile communication technology, long Term Evolution LTE.VANET, which has low expansibility and uncontrollable delay when it is applied to vehicle networking. LTE has the advantages of low delay, fast transmission rate, wide coverage and so on. However, the research shows that there are some problems in the application of LTE in vehicle networking, such as the lack of spectrum resources and the overloading of base stations. In order to solve the problems existing in the application of LTE in the environment of vehicle networking, In this paper, the terminal direct Device-to-device D2D communication technology is applied to the vehicle networking. D2D technology is a technology to support the direct communication between terminals under the framework of LTE system. Direct communication between nodes by multiplexing cellular user spectrum resources .D2D for vehicle networking must first solve the problem of spectrum resource allocation and routing between vehicle nodes. When resource allocation and relay selection, The base station needs to know the channel state information of all possible links, channel State information, resource allocation and relay selection according to CSI and system model. In order to obtain all the CSI channels, the base station will be overloaded. At the same time, the number of nodes will lead to a longer time of resource allocation and relay selection. In addition, the node communication in the car network environment has the characteristics of high frequency, small data, and so on. Therefore, the requirement of delay and reliability of node communication is higher than the requirement of capacity. Therefore, reducing the load of base station and reducing the time cost of algorithm is the focus of wireless resource allocation and relay selection in vehicle networking environment. First of all, this paper analyzes the problem of traditional resource allocation algorithm based on CSI in the environment of vehicle networking. This paper discusses the feasibility of allocating resources based on geographical location, and then analyzes the problems existing in the allocation of resources based on geographical location, and gives an optimized solution. A wireless resource allocation algorithm based on location partition is proposed in this paper. Finally, the simulation results show that the wireless resource allocation algorithm based on location partition can reduce the load of base station. This paper analyzes the problems of traditional relay selection algorithm based on the maximum signal-to-noise ratio (SNR) in the environment of vehicle network. The feasibility of selecting relay based on geographical location is discussed. Then the problems existing in relay selection based on geographical location are analyzed, and the optimization solution is given. A relay selection algorithm based on location partition is put forward in this paper. It is proved that the proposed relay selection algorithm based on location partition has great advantages in reducing the load of base station and reducing the time of relay selection.
【学位授予单位】：哈尔滨工业大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN929.5;U495

【相似文献】