Data-aware routing method and system for ad hoc wireless vehicular network, storage medium and device

A data-aware routing method for an ad hoc wireless vehicular network, comprising:

• for the wireless vehicular network, carrying out data routing in the wireless vehicular network on a basis of a joint scheduling based wireless vehicular network routing algorithm;
• the joint scheduling based wireless vehicular network routing algorithm comprising:
• the wireless vehicular network needing to transmit a given data packet set, the given data packet set being recorded as Φ, a source node of each data packet p being recorded as δ(p), and a destination node of each data packet p being recorded as ψ(p);
• p having no subscript being used for representing the data packet, and pi(⋅) having a node subscript being used for representing a geographic position;
• for a certain data packet p, a copy set of all the data packets in the wireless vehicular network being recorded as θ(p), and θ(p) being called as a data packet group;
• when the data packets are subjected to one-time wireless transmission, a size of the data packet group being increased by 1;
• overall transmission performance of the wireless vehicular network being a function of transmission performance of a single data packet, and a transmission success rate ρp of the single data packet being as follows:
• ρp=fY(δ(p),ψ(p),{Tn}) (4),
• {Tn} representing a motion track set of all the nodes, and fγ(⋅) representing a transmission success rate function;
• a transmission latency σp of the data packet p being as follows:
• σp(τ)=τ+Γγ(δ(p),ψ(p),{Tn}) (5)
• Γγ(⋅) representing a transmission latency function;
• transmission cost of the data packet p being as follows:
• =|ϑ(p)| (6)
• |θ(p)| representing capacity of the data packet group θ(p);
• an optimal transmission strategy being as follows:
• maximizing the transmission success rate, minimizing the transmission latency and minimizing network cost:
• max Σp∈Φ[ρp] (7)
• min Σp∈Φ[σp] (8)
• min Σp∈Φ[] (9)
• [•] representing an expectation;
• and
• network transmission efficiency being as follows:
• Σp∈Φ[ρp]/Σp∈Φ[] (10)
• using a multi-order Markov chain to model position change processes of vehicle nodes, and predicting and estimating a next moment and several moments in the future under a condition that positions at previous several moments are given;
• and
• on a basis of position actual values and predicted estimated values of the vehicle nodes, combining the optimal transmission strategy to achieve data routing in the wireless vehicular network.