VANET Forwarding Node Selection by Service Type and Virtual Arrival Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Vehicle ad-hoc networks face challenges with network interruptions, high latency, and packet loss due to rapidly changing topology, leading to unstable communication links and failed content delivery.
Innovation Solution
A method for selecting a content forwarding node based on service type, calculating a bandwidth occupation proportion factor, defining a virtual arrival time, and determining a forwarding node impact factor to dynamically choose an optimal forwarding node considering current network topology and service type, thereby improving content arrival success rate and reducing latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If the original request information arrival path is used for content return, then the forwarding process is simple, but the communication link becomes unstable and content delivery fails due to vehicle movement
Solution Approach 1:
The patent implements dynamic path selection by introducing a path validity judgment mechanism that continuously monitors whether vehicles are within communication range. The system dynamically switches between using the original request path and alternative return paths based on real-time vehicle positions and communication link status, resolving the contradiction between forwarding simplicity and link stability.
2Reliability
If a novel path selection mechanism is implemented to improve content delivery reliability, then content arrival success rate improves, but system complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing alternative return paths when request information is received. The content vehicle stores multiple candidate paths in advance, so when the original path becomes invalid, the system can quickly switch to a pre-computed alternative without complex real-time calculations, thus improving reliability while controlling system complexity.
Solution Approach 2:
The patent replaces complex real-time path calculation mechanisms with a simpler table-based alternative path storage and selection mechanism. Instead of performing complex routing calculations when paths become invalid, the system substitutes this with a straightforward process of checking stored alternative paths and selecting the first valid one, reducing computational complexity while maintaining delivery reliability.
3Measurement precision
If bandwidth occupation proportion factor and virtual arrival time are calculated for each candidate node, then forwarding node selection accuracy improves, but calculation overhead increases
Solution Approach 1:
The patent applies local quality by focusing detailed calculations only on one-hop neighboring vehicles that are most likely to be effective forwarding nodes. Instead of evaluating all possible paths in the network, the system concentrates computational resources on local candidates within communication range, calculating their bandwidth occupation proportions and virtual arrival times in detail, while ignoring distant nodes that would require multi-hop forwarding.
4Reliability
If the system waits for vehicles to be in communication range for content return, then transmission reliability improves, but transmission latency increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating virtual arrival times for candidate forwarding nodes based on their current positions, speeds, and directions. The system estimates when vehicles will be in communication range and prepares alternative paths in advance, allowing it to select forwarding nodes that will minimize waiting time while ensuring reliable delivery, thus reducing latency without sacrificing reliability.
Data Source
AI summary
A method for selecting a content forwarding node in a vehicle ad-hoc network on the basis of service type, comprising the following steps: calculating a bandwidth occupation proportion factor according to the type of requested content information and a bandwidth occupation situation of a neighboring vehicle which can perform forwarding in a one-hop transmission range; defining a virtual arrival time of a candidate forwarding vehicle to an initial request vehicle according to the distance between the neighboring vehicle and the initial request vehicle and a driving speed of the neighboring vehicle; calculating a forwarding node impact factor according to the bandwidth occupation proportion factor and the virtual arrival time; and selecting a forwarding node according to the forwarding node impact factor.