A Location Partitioned Resource Allocation And Relay Selection Algorithm For D2D Based Vehicular Networks

With the rapid development and wide use of intelligent transportation, vehicular networking has attracted great interests, Vehicular Ad-hoc Network(VANET) and Long Term Evolution(LTE) are the most widely studied technologies of vehicular networking. VANET has the disadvantages of low scalability, uncontrollable delay, lack of Quality of Service(Qo S) guarantee, etc. LTE has the advantages of lower latency, faster transmission rate, wide coverage, etc. But LTE network lacked of spectrum resources and the load of base station is too big when applied into vehicular networking.To solve the problem of LTE used in vehicular networking, the Device-to-Device(D2D) communications are proposed to support vehicular networking. D2 D is a technology based on LTE system which is a d irect communication way between terminal units without passing through the base station, D2 D peer-to-peer users could communicate with each other by collaboratively sharing radio resources with current cellular users in LTE system. The problems of spectrum allocation and relay selection of communications among vehicular nodes should be primarily considered when D2 D is used in vehicular networking. The base station needs to know all the channel status information(CSI) when the traditional D2 D wireless resource allocation and relay selection are excuted. The resource allocation and relay selection are based on the CSI and the system model. In vehicle networking environment, vehicle distribution is intensive and the number of vehicles is very huge. The acquisition of all CSI will lead to the overload of base station. The time of resource allocation and relay selection is very long since t he number of nodes is too large. In addition, the node communication has the characteristics of high frequency and small amount of data under the vehicle networking environment, so the delay and reliability requirements are more important than the requirements of the capacity in vehicle networking environment, therefore the base station load and the running time of the algorithm are more important parameters when the radio resource allocation and relay selection algorithm in the vehicle networking environment are designed.This paper analyzes the problems of traditional resource allocation algorithm based on the available CSI in the vehicle networking environment, and then discusses the feasibility of resource allocation based on geographical location. On the basis of this, the paper analyzes the problems of resource allocation based on geographical location and a optimization solution of wireless resource allocation algorithm based on the location partitioned is proposed. Finally, by simulation comparison, we can draw the conclusion that the wireless resource allocation algorithm based on the location partitioned has a great advantage in reducing the base station load and the resource allocation time.Based on this, the paper analyzes the problems of the traditional relay selection algorithm based on the maximum S INR in the environment of vehicle networking, and discusses the feasibility of relay selection algorithm based on geographical location. And then, the paper analyzes the problems of relay selection algorithm based on geographical location, and a optimization solution of relay selection algorithm based on the location partitioned is proposed. Finally, by simulation comparison, we can draw the conclusion that the relay selection based on the location partitioned has a great advantage in reducing the base station load and the relay selection time.