Vehicular Neighbor Discovery Protocol for IP Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing vehicular neighbor discovery methods in IP-based networks face challenges with fast vehicle mobility and high wireless control traffic overhead, requiring improved adaptability and efficiency in prefix and service discovery.
Innovation Solution
The proposed method enhances IPv6 neighbor discovery by implementing an optimized vehicular neighbor discovery (VND) protocol that includes multihop duplicate address detection, shared-prefix models, and new ND options for prefix and service discovery, allowing vehicles to maintain unique IP addresses across multiple wireless subnets and support efficient V2V and V2I communications through relay vehicles.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If IPv6 neighbor discovery is used in vehicular networks, then neighbor discovery functionality is provided, but wireless control traffic overhead increases and adaptability to fast vehicle mobility is insufficient
Solution Approach 1:
The neighbor discovery process is segmented into multiple phases: initial discovery phase using multicast NS/NA messages, and subsequent registration phase using unicast messages through relay vehicles. This segmentation allows the system to reduce overhead by avoiding repeated multicast transmissions while maintaining discovery functionality across fast-moving vehicular networks.
Solution Approach 2:
Relay vehicles are introduced as intermediaries to forward neighbor discovery and registration messages between vehicles and road-side units. This intermediary mechanism enables indirect communication paths that adapt to fast vehicle mobility, allowing vehicles to maintain connections even when direct communication with RSUs is unavailable, thereby reducing the need for frequent re-discovery transmissions.
2Reliability
If traditional router discovery is used for direct registration with RSU, then registration functionality is provided, but it fails when direct communication with RSU is unavailable due to fast vehicle mobility
Solution Approach 1:
The system dynamically switches between direct registration mode (when RSU is accessible) and relay-based registration mode (when RSU is inaccessible). This dynamic adaptation allows the registration mechanism to remain reliable regardless of vehicle mobility patterns, as the system automatically selects the appropriate communication path based on current network conditions.
Solution Approach 2:
Vehicles perform preliminary neighbor discovery and establish relay connections before direct RSU communication is needed. By pre-establishing relay paths through neighbor discovery messages, the system ensures that registration can proceed reliably even when direct RSU communication becomes unavailable due to fast vehicle movement.
3Adaptability or versatility
If neighbor discovery messages are multicast to all surrounding vehicles, then discovery coverage is maximized, but wireless traffic overhead increases significantly
Solution Approach 1:
Multicast neighbor discovery messages are transmitted periodically rather than continuously, and only when necessary for initial discovery. After initial discovery, the system transitions to unicast communication for registration and ongoing communication. This periodic approach maintains adequate discovery coverage while significantly reducing overall wireless traffic overhead compared to continuous multicast transmission.
Solution Approach 2:
The system uses multicast messages partially - only for initial neighbor discovery when needed - rather than excessively using them for all communication scenarios. This partial application of multicast action provides sufficient discovery coverage for the mobile vehicular environment while avoiding the excessive overhead that would result from continuous or universal multicast transmission.
Data Source
AI summary
A method for a first vehicle to perform a neighbor discovery in an IP-based vehicular network is disclosed. The method includes, based on the first vehicle failed in a router discovery for a direct registration with an adjacent road-side unit (RSU), sending one or more first neighbor solicitation (NS) messages to a second vehicle; receiving, from the second vehicle, a first neighbor advertisement (NA) message as a response to the first NS message; and sending, to the second vehicle, a second NS message for registering the second vehicle as a relay vehicle based on the first NA message.


