A Distributed Storage Method for Vehicular Network Based on Bipartite Graph

Abstract

The invention discloses a bipartite graph based in-vehicle network distributed storage method. According to the bipartite graph based in-vehicle network distributed storage method, a distributed storage problem is firstly modeled, and bipartite graph matching is performed, so that optimal in-vehicle network distributed storage of in-vehicle request identification information sent by each in-vehicle node can be achieved under different conditions, and in-vehicle network can respond to maximum in-vehicle request identification information; subsequently, repeated network information stored by roadside units is cleared, resource waste generated by the fact that multiple roadside units respond to the same in-vehicle request identification information is avoided, and meanwhile, in-vehicle request identification information which is met is not affected; finally, in-vehicle request identification information which is not met is collected, and secondary allocation is performed on spare storage space obtained by clearing the roadside units until each roadside unit has no spare storage space, or all the in-vehicle request identification information received by the roadside units is responded, or remaining in-vehicle request identification information cannot be met; a storage resource utilization rate and a data response data are increased, and data service qualities of an in-vehicle network are guaranteed.

Description

technical field [0001] The present invention relates to a bipartite graph-based vehicle network distributed storage method, more particularly, refers to a bipartite graph-based vehicle network distributed storage method in a scene composed of roadside infrastructure and moving vehicles . Background technique [0002] The first edition in May 2010, "Computer Algorithms and Programming Practice", edited by Dong Dong and Zhou Bingyin, page 334. A graph G is said to be bipartite if the vertex set of a graph G can be partitioned into two parts X and Y such that one of the two endpoints of each edge in G is in X and the other is in Y. X and Y are called the bipartite division of G, which is denoted as G=(X, Y, E), and E is an edge. [0003] The in-vehicle network is composed of moving vehicles, fixed roadside infrastructure and information center. On the roadside infrastructure, smart devices with large storage capacity (called roadside units) capable of communicating with the i...

AI Technical Summary

Problems solved by technology

[0005] Due to the rapid change of vehicle network topology caused by vehicle driving, the storage space of roadside units is limited, and the same network information may be requested by multiple vehicle nodes, so the optimal distributed storage method for vehicle network becomes an NPC (non-deterministic polynomial complete) problem , cannot be solved in polynomial time, and has no practical value

Images