Dynamic Neighbor Probing for VANET Routing Topologies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing protocols like RPL struggle to maintain efficient connectivity in highly mobile networks such as VANETs due to their reliance on dataplane verification and lack of keepalive mechanisms, which are inadequate for fast-moving devices.
Innovation Solution
A local node in a communication network determines the occurrence frequency of neighbor nodes based on the rate of change in distance and probes them to select a suitable preferred next-hop for routing topology, using dynamically adjusted tracking messages to anticipate connectivity issues and maintain routing connectivity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If RPL protocol is used for routing in VANETs, then routing topology management is simplified with DODAG construction, but connectivity maintenance becomes inefficient in fast-moving networks due to lack of keepalive mechanisms
Solution Approach 1:
The patent applies preliminary action by implementing keepalive mechanisms that proactively verify neighbor node availability before actual data transmission is affected. The system periodically sends keepalive packets to anticipate connectivity issues in fast-moving VANET environments, allowing nodes to pre-establish backup routes before primary routes fail due to vehicle mobility.
Solution Approach 2:
The patent implements feedback mechanisms where nodes continuously monitor the availability of neighbor nodes through keepalive packet exchanges. This feedback loop allows the routing protocol to dynamically adapt to changing network conditions in VANETs, detecting when neighbors become unavailable and triggering route repairs or alternative path selection.
2Loss of energy
If dataplane verification is used to detect next-hop availability, then keepalive overhead is reduced, but connectivity detection is delayed in highly mobile networks
Solution Approach 1:
The patent applies dynamics by making the keepalive verification frequency adaptive rather than static. In highly mobile VANET conditions where vehicles are moving rapidly, the system increases keepalive packet frequency to quickly detect connectivity changes. When mobility is lower, the frequency decreases to reduce overhead, thus dynamically balancing between detection speed and energy consumption.
Solution Approach 2:
The patent implements parameter changes by adjusting keepalive interval and packet size based on network conditions and node mobility patterns. This allows the system to optimize the balance between connectivity detection speed and energy overhead, changing verification parameters in response to observed network dynamics rather than using fixed parameters.
3Reliability
If frequent probing is performed to track neighbor nodes in fast-moving networks, then connectivity maintenance improves, but control traffic overhead increases
Solution Approach 1:
The patent applies partial action by performing frequent probing only for critical neighbor relationships that require immediate detection, rather than uniformly probing all neighbors at maximum frequency. This selective approach maintains reliability for essential connections while reducing overall control traffic overhead in the VANET network.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
In one embodiment, a local node in a communication network determines a set of its neighbor nodes, and determines a respective occurrence frequency at which each particular neighbor node is to be probed based on a rate of change in distance between the local node and the particular neighbor node. The local node may then probe each particular neighbor node according to the respective occurrence frequency to determine the rate of change in distance between the local node and each particular neighbor node, and one or more routing metrics for reaching each particular neighbor node. As such, the local node may select, based on the probing, a suitable preferred next-hop node of the set of neighbor nodes for a corresponding routing topology.