Research On Data Transmission Strategy Of Vanet Based On Named Data Networking

Named Data Networking,as a network architecture that requests data packets based on content,is more suitable for today's distributed networks than traditional TCP / IP networks.The nodes in Vehicular Ad-hoc Network are characterized by high mobility and intermittent connectivity.Designing to replace existing architectures with named data can greatly overcome these challenges.In Named Data Networking,name-based data packet forwarding represents the core feature of NDN architecture.Therefore,it is crucial to design a forwarding policy that adapts to the state of the network environment.At the same time,the characteristics of Vehicular Ad-hoc Network makes the traditional NDN forwarding strategy difficult to apply,so we must consider its architectural features.In-network caching is an important feature of Named Data Networking.Its core idea is to cache content through internal nodes in the network.When a cosumer requests a data packet he re,the intermediate node hits cached,data packets can be returned directly,without having to obtain from the producer.Excellent caching strategy,especially reasonable content placement,is the key to improving the transmission effi ciency of Named Data Networking.Therefore,this article studies these two aspects.The first part of this paper is a multi-attribute decision-making method based on entropy weight,which solves the forwarding problem in VANET based on Named Data Networking.Firstly,the decision matrix is established based on the three attributes of the neighbor nodes: RTT,the number of hops and the possibility of data transmission.Then the data are normalized,and then the score of each candidate node is calculated according to the standardized attribute value and attribute weight.Finally,forwarding interest groups based on probability.The simulation results show that the proposed forwarding strategies can effectively increase the input rate of interest packets and reduce the network delay.The second part of this paper is a cluster analysis based method,which solves the problem of cache placement in VANET based on Named Data Networking.Firstly,the adjacency matrix is established according to the meeting possibility of nodes in the VANET.Then,the concept of modularity is introduced to obtain the optimal clustering method through the fast Newman algorithm.Based on the the popularity of the content in the community and the distance comparison factor,caching data packets probably.Simulation results show that the cache placement strategy proposed in this paper can effectively improve the cache hit number of data packets and reduce the average number of hops.