Vehicle Network Transmission Opportunity Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Ethernet-based vehicle networks face challenges in ensuring reliable communication, particularly during emergency situations, due to limitations in the PHY layer collision avoidance function, which struggles to prioritize high-priority nodes like brakes and airbags.
Innovation Solution
The proposed method involves an operation method for end nodes in an Ethernet-based vehicle network, where high-priority nodes receive additional transmission opportunities by adjusting the configuration of main-cycles and sub-cycles, allowing them to transmit data more frequently, thereby improving communication reliability and performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the current PLCA function with round-robin scheduling is used to ensure fairness in transmission opportunities, then all nodes are provided with equal transmission opportunities, but high-priority nodes (such as brake and airbag systems) cannot receive additional transmission opportunities when needed
Solution Approach 1:
The patent applies local quality by differentiating transmission opportunities based on node priority. High-priority nodes (brake, airbag) are granted additional transmission opportunities in specific sub-cycles, while standard nodes follow the regular round-robin schedule. This creates localized quality variations in the transmission schedule that match the different reliability requirements of different node types.
Solution Approach 2:
The patent introduces dynamics by making the transmission opportunity allocation adaptive rather than static. The main-cycle structure with multiple sub-cycles allows the system to dynamically adjust which nodes get transmission opportunities based on their priority level. High-priority nodes can access the medium more frequently during critical sub-cycles, making the system responsive to different communication needs.
2Reliability
If the transmission schedule is optimized for high-priority nodes by providing additional transmission opportunities, then communication reliability for emergency data improves, but the complexity of the scheduling algorithm increases
Solution Approach 1:
The patent applies segmentation by dividing the transmission cycle into multiple sub-cycles, where each sub-cycle serves different purposes. The main-cycle is segmented into sub-cycles that can be dedicated to high-priority nodes, standard nodes, or used for collision avoidance. This segmentation allows the complex requirement of prioritizing multiple node types to be broken down into manageable, repetitive patterns.
Solution Approach 2:
The patent uses periodic action through the main-cycle and sub-cycle structure. Transmission opportunities are allocated in periodic intervals rather than through complex real-time calculations. Each node type has predetermined periodic opportunities to transmit, which simplifies the scheduling logic while ensuring high-priority nodes receive adequate attention.
3Productivity
If the round-robin scheduling algorithm is used to provide equal transmission opportunities to all nodes, then fairness is ensured, but the transmission rate for critical emergency data cannot be increased
Solution Approach 1:
The patent introduces dynamics by making the transmission opportunity allocation adaptive rather than static. The main-cycle structure with multiple sub-cycles allows the system to dynamically adjust which nodes get transmission opportunities based on their priority level. High-priority nodes can access the medium more frequently during critical sub-cycles, making the system responsive to different communication needs.
Solution Approach 2:
The patent uses periodic action through the main-cycle and sub-cycle structure. Transmission opportunities are allocated in periodic intervals rather than through complex real-time calculations. Each node type has predetermined periodic opportunities to transmit, which simplifies the scheduling logic while ensuring high-priority nodes receive adequate attention.
Data Source
AI summary
An operation method of a first end node constituting an Ethernet-based vehicle network includes receiving a first beacon from a second end node, the beacon including first configuration information of a first main-cycle including a plurality of sub-cycles each of which includes N time slots; transmitting a signal in a time slot corresponding to an identifier of the first end node among the N time slots within a sub-cycle #k of the plurality of sub-cycles; and transmitting a signal in a time slot corresponding to the identifier of the first end node among the N time slots in a sub-cycle #(k+1) consecutive with the sub-cycle #k of the plurality of sub-cycles.


