Distributed Protocol for High-Rate Multi-Hop Vehicular Data Delivery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Vehicular networks face challenges in achieving high data rate connectivity due to high mobility and low equipped vehicle density, leading to complex multi-hop data delivery and unpredictable network conditions, which existing protocols struggle to address effectively.
Innovation Solution
A distributed protocol that utilizes locally available information to dynamically adapt forwarding decisions and maximize end-to-end data rates, operating with minimal state information and not requiring location information of recipients, and rapidly adjusts to changing network conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If store and forward method is used for data relaying, then data delivery is possible in low equipped vehicle density, but delivery rate is low and delays are high
Solution Approach 1:
The patent implements dynamic routing protocols that continuously adapt forwarding decisions based on real-time network conditions, vehicle mobility patterns, and channel quality. This allows the system to transition between store-and-forward and direct transmission modes optimally, improving data delivery rates while maintaining reliability in low-density scenarios
Solution Approach 2:
The system employs feedback mechanisms where vehicles report network state information, packet delivery status, and mobility patterns back to routing algorithms. This feedback enables continuous optimization of forwarding strategies, allowing the network to learn from past transmissions and improve delivery rates over time while maintaining reliable operation
2Ease of manufacture
If heuristic based forwarding methods are used, then implementation is simple, but performance degrades under diverse network conditions
Solution Approach 1:
The patent segments the routing decision-making process into modular components: route discovery, path selection, and dynamic adjustment. Each module handles specific aspects of forwarding independently, maintaining implementation simplicity while collectively achieving robust performance across diverse network conditions through specialized algorithms for each segment
Solution Approach 2:
The system dynamically changes routing parameters such as forwarding probability, transmission power, and route selection metrics based on observed network conditions. This allows the protocol to adapt its behavior to match current environmental factors like vehicle density, mobility patterns, and channel quality without requiring complete protocol redesign
3Ease of operation
If position based routing is used, then end-to-end communication is enabled, but location information exchange increases network overhead
Solution Approach 1:
The patent implements partial position-based routing where vehicles exchange location information only when necessary for route determination, rather than continuously. The system uses approximate positioning and probabilistic forwarding for non-critical traffic, reducing the quantity of position data exchanged while maintaining end-to-end communication capability for important messages
4Reliability
If broadcast and flooding protocols are used for safety applications, then coverage is enhanced, but network congestion increases
Solution Approach 1:
The patent implements asymmetric forwarding strategies where safety-critical messages receive preferential treatment through selective flooding and lower threshold for retransmission, while non-critical data traffic uses more conservative unicast or selective multicast approaches. This asymmetry ensures safety message coverage is maintained while preventing overall network congestion from excessive broadcasting
Data Source
AI summary
A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.


