Dynamic Verification Rate Control for VANET Message Security

The patent applies partial verification by selectively verifying only a subset of received beacon messages rather than all messages. The system determines a verification probability for each neighbor node based on historical verification results, and randomly decides whether to verify each message according to this probability. This partial action approach maintains security by verifying enough messages to detect malicious nodes while reducing the overall computational burden compared to verifying every single message.

The patent dynamically changes the verification probability parameter based on the verification history of each neighbor node. Nodes that have consistently provided valid signatures receive lower verification probabilities, while nodes with suspicious or failed verifications receive higher probabilities. This adaptive parameter adjustment allows the system to optimize the balance between security and processing throughput by concentrating verification resources on potentially malicious nodes while trusting established nodes.

The patent implements partial verification where only a fraction of received beacon messages are verified based on dynamically adjusted probabilities. This approach maintains security by ensuring that malicious nodes are detected with high probability while avoiding the excessive energy consumption that would result from verifying every single message, especially in high-density scenarios with many neighbor nodes.

The system dynamically adjusts the verification probability parameter based on verification history and current network conditions. This parameter change allows the energy consumption to be optimized by reducing verification frequency for trusted nodes while maintaining high verification rates for suspicious nodes, thereby achieving high security without proportional increases in energy consumption across the board.

In high-density scenarios with many neighbor nodes, the patent applies partial verification by selecting only a subset of messages for verification based on dynamically calculated probabilities. This prevents processing overload that would occur if all messages from all neighbor nodes were verified, while still maintaining security by ensuring that malicious nodes are detected with sufficiently high probability through selective verification of their messages.

The system adapts the verification probability parameter based on the number of neighbor nodes and verification history. In high-density scenarios, the absolute number of verifications is controlled by adjusting these probabilities, allowing the system to maintain security requirements while preventing processing overload that would result from verifying every message from every neighbor node simultaneously.