Font Size: a A A

Research On Strategy Of Packet Scheduling For V2X Networks

Posted on:2019-04-15Degree:MasterType:Thesis
Country:ChinaCandidate:Y Y LuFull Text:PDF
GTID:2322330542998819Subject:Information and Communication Engineering
Abstract/Summary:PDF Full Text Request
In recent years,as the number of vehicles has surged,the demand for vehicles to communicate with vehicles,infrastructures and pedestrians has become more and more urgent.Since V2X can effectively improve network efficiency,it has become an important research direction.At present,3 GPP has begun to advance V2X communication technology standardization.The research on strategy of packet scheduling is a critical aspect of V2X communication systems.The requirements of V2X are higher than that of traditional business in terms of mobility,delay and reliability,which poses great challenges on the packet scheduling.Therefore,in view of strategy of packet scheduling for V2X networks,this dissertation mainly investigates the following three issues:According to the traditional V2I Semi-Persistent scheduling process,inter-cell interference,intra-cell interference and delay problems are analysed,and then the collision avoidance scheme in uplink V2I is proposed.First of all,a model is proposed for the problem.Then,the design of the signaling process is presented,which thereby reduces the delay and interference.In order to maximize the revenue of V2I downlink packet transmission process,an optimal resource allocation scheme is designed.Firstly,a price model which is more close to the practical situation is proposed for the problem of the optimal income on the highway.The optimization problem and new price model are described.Secondly,the transformation of the mathematical problem is carried out and graph theory is applied to solve the problem.Finally,the effectiveness of the algorithm is verified by simulation,and the results show that the complexity can be reduced to a certain extent.By using the proposed algorithm,the revenue is increased by 52.31%and the complexity is decreased by 46.80%.To solve the multi-link Network Coding(NC)-based Cooprerative Data Exchange(CDE)problems for latency-sensitive application in ideal and non ideal channel conditions,an effective packet scheduling scheme is proposed.First of all,for this problem,we define a mathematical model.Secondly,according to the mathematical model,the graph model is designed based on graph theory.Finally,the maximum clique problem in graph theory is used to solve the optimization problem.The simulation results show that the number of packets transmitted effectively increases by 20.54%after using the proposed algorithm.In summary,this dissertation studies three issues which are relative to strategy of packet scheduling and proposes schemes respectively.Then the effectiveness of the proposed solutions and algorithms is verified by the simulation.
Keywords/Search Tags:vehicular networks, V2X, packet scheduling, convex optimization, graph theory
PDF Full Text Request
Related items