Bus communication protocol optimization method based on time division multiplexing technology

Abstract

The present invention provides a bus communication protocol optimization method based on time division multiplexing technology, which relates to the field of bus communication technology, including: calculating the timing difference of each pair of nodes according to the node information of the data packet; dividing the timing difference matrix and dynamically calculating the change in the weight of the timing difference; performing static time slot division according to a fixed period; dynamically allocating time slot resources through time division multiplexing technology in combination with a node pair weight change table; predicting potential time slot conflicts in combination with historical conflict rate statistics, and dynamically adjusting the backoff time. The present invention realizes intelligent allocation of time slot resources by collecting node timing data in real time and constructing a timing difference matrix, and dynamically calculating the node weight change in combination with the STDP mapping mechanism; a hybrid backoff algorithm of exponential backoff and fixed window constraint greatly reduces the average conflict probability of high-conflict time slot groups, and controls the delay fluctuation of low-conflict time slot groups within a low fluctuation range, taking into account both the real-time response and long-term stability of the system.

Description

Technical Field

[0001] The present invention relates to the field of bus communication technology, and in particular to a bus communication protocol optimization method based on time division multiplexing technology. Background Art

[0002] Bus communication protocols are standardized rules for transmitting data, address, and control signals between electronic devices. Their core goal is to facilitate efficient and reliable communication between different components. From the physical layer to the protocol layer, a bus typically consists of data lines, address lines, and control lines. Data lines transmit actual content, address lines specify the location of the target device or storage unit, and control lines manage key processes such as read and write operations, timing synchronization, and interrupt requests. Buses can be categorized as synchronous or asynchronous based on their communication method. Synchronous communication relies on a unified clock signal (such as I²C and SPI), ensuring high-speed transmission with strict timing, but is limited to short distances. Asynchronous communication uses start and stop bits for loose synchronization (such as UART). Although it is slower, it is suitable for long distances or applications with strong interference resistance requirements. Common bus protocols each have their own unique characteristics. I²C uses a two-wire system (clock line SCL and data line SDA) to interconnect multiple devices, supporting a multi-master-slave architecture and widely used in low-speed applications such as sensors and memory. SPI uses a four-wire full-duplex design (clock and master-slave bidirectional data lines) and, due to its high speed, is the preferred choice for devices such as Flash memories and displays. The CAN bus, with its differential signaling and arbitration mechanism, enables highly interference-resistant multi-node communication in automotive electronics. USB, with its master-slave architecture and hot-swappable functionality, simplifies peripheral connectivity, and its transmission speeds continue to improve with each version iteration. UART, a classic asynchronous serial port protocol, supports debugging and communication in embedded systems with its minimalist transmit and receive line structure (TX, RX), but suffers from low efficiency. PCIe, on the other hand, focuses on high-speed point-to-point transmission, and its layered channel design makes it an ideal choice for high-performance devices such as graphics cards and solid-state drives.

[0003] Conventional bus communication protocol optimization methods rely on fixed-periodic time slot allocation, which is unable to dynamically adjust to real-time changes in node communication needs. When network load fluctuates, both idle and overloaded time slots can easily coexist. Furthermore, using fixed-window backoff algorithms or simple exponential backoff mechanisms increases the probability of conflict exponentially in high-contention scenarios (such as sudden data spikes on industrial buses). Existing optimization solutions often rely on offline parameter presets based on historical statistical data, lacking real-time verification and dynamic iteration capabilities. Summary of the Invention

[0004] The present invention provides a bus communication protocol optimization method based on time division multiplexing technology to solve the defects in the prior art.

[0005] In one aspect, the present invention provides a bus communication protocol optimization method based on time division multiplexing technology, comprising:

[0006] Collect the data packet node information in the bus communication log; calculate the timing difference of each pair of nodes based on the data packet node information, and output the timing difference matrix;

[0007] According to the preset fixed timing difference, the timing difference matrix is divided, and the change in the weight of the timing difference is dynamically calculated, and the node weight change table is output;

[0008] Based on the node information of the data packet, static time slot division is performed according to a fixed period, and the initial time slot allocation table is output; combined with the node weight change table, dynamic time slot resource allocation is performed through time division multiplexing technology, and the optimized time slot allocation table is output;

[0009] According to the optimized time slot allocation table, combined with historical conflict rate statistics, potential time slot conflicts are predicted, and the backoff time is dynamically adjusted to output the final protocol parameter set.

[0010] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the step of outputting the timing difference matrix includes:

[0011] Extract the valid communication event list from the data packet node information;

[0012] The valid communication event list is stored by node time classification, and the event sequence of each pair of nodes is output;

[0013] Calculate all existing timing differences based on each pair of node event sequences;

[0014] Retain the effective components in the time series difference, remove the outliers, and output the time series difference matrix.

[0015] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the step of dividing the timing difference matrix includes:

[0016] Preset time series difference classification standard;

[0017] According to the timing difference classification standard, all subsets in the timing difference matrix are divided into STE triggering areas and LTD triggering areas;

[0018] Generate an STE time difference list and an LTD time difference list according to the STE trigger area and the LTD trigger area.

[0019] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the step of calculating the change in the weight of the timing difference includes:

[0020] Calculate STDP mapping parameters based on data packet node information;

[0021] According to the STDP mapping parameters, the STE time difference list and the LTD time difference list, the STE weight and the LTD weight are calculated, and a node pair weight change table is output.

[0022] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the step of dividing static time slots according to a fixed period includes:

[0023] Divide the bus cycle in the data packet node information into equal length time slots;

[0024] Each pair of information nodes in the data packet node information is filled with equal-length time slots to generate an initial time slot allocation table.

[0025] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the steps of dynamically allocating time slot resources by time division multiplexing technology include:

[0026] Calculate the resource demand increment of each node pair based on the node pair weight change table;

[0027] According to the resource demand increment, they are arranged according to the preset priority strategy and the total number of available time slots is allocated according to the STE weight and LTD weight;

[0028] According to the total number of time slots, the time slot requirements of each node pair are traversed to generate time series overlap data;

[0029] According to the time slot overlap data, the time slot conflict resolution strategy is set and the optimized time slot allocation table is output.

[0030] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the time slot conflict resolution strategy includes:

[0031] The time slot request priority of the STE link is higher than that of the LTD link;

[0032] If both conflicting parties are STE links, the time slot is split into multiple sub-time slots;

[0033] If the LTD link conflicts with the time slot, its time slot is forcibly reduced to the preset minimum guaranteed value.

[0034] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the step of dynamically adjusting the backoff time includes:

[0035] Based on historical conflict rate statistics, time slots are divided into high-conflict time slot group and low-conflict time slot group according to conflict frequency;

[0036] For node communication events in high-conflict time slot groups, a hybrid backoff mechanism combining exponential backoff algorithm and fixed window constraint is adopted;

[0037] For node communication events in low-conflict time slot groups, a linear backoff compensation strategy based on priority queue is adopted.

[0038] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the application of the final protocol parameter set includes:

[0039] A time slot allocation control module is embedded in the bus communication protocol stack to load an optimized time slot allocation table;

[0040] A dynamic backoff adaptation layer is added between the physical layer and the data link layer to implement a hybrid backoff mechanism and a linear backoff compensation strategy;

[0041] The parameter configurations of the timeslot allocation control module and the dynamic backoff adaptation layer are synchronously updated through the configuration interface of the protocol stack.

[0042] The bus communication protocol optimization method based on time division multiplexing technology provided by the present invention also includes a verification mechanism for protocol parameters:

[0043] Inject test data packets during the bus idle period and simulate multi-node concurrent communication scenarios based on the optimized time slot allocation table;

[0044] The effectiveness of the final protocol parameter set is verified by comparing the transmission delay and collision rate indicators of the test data packets;

[0045] If the verification result exceeds the preset threshold, the iterative optimization process of the weight change table and backoff mechanism is triggered.

[0046] The bus communication protocol optimization method based on time division multiplexing technology provided by the present invention realizes intelligent allocation of time slot resources by collecting node timing data in real time and constructing a timing difference matrix. It combines the STDP mapping mechanism to dynamically calculate the node weight change. This method breaks through the limitations of traditional static time slot division, allowing high-priority STE links to obtain priority time slot usage. At the same time, through time slot splitting and conflict resolution strategies, it effectively reduces resource competition for LTD links and significantly improves bus bandwidth utilization. Through a hybrid backoff algorithm with exponential backoff and fixed window constraints, combined with a dynamic grouping mechanism based on historical conflict rate statistics, the average conflict probability of high-conflict time slot groups is greatly reduced, and the delay fluctuation of low-conflict time slot groups is controlled within a low fluctuation range, taking into account both the real-time response and long-term stability of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] In order to more clearly illustrate the technical solutions in the present invention or the prior art, a brief introduction is given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0048] Figure 1 This is a step diagram of a bus communication protocol optimization method based on time division multiplexing technology provided by an embodiment of the present invention;

[0049] Figure 2 This is a diagram of the steps for dynamic time slot resource allocation using time division multiplexing technology provided by an embodiment of the present invention;

[0050] Figure 3 This is a diagram of the steps for dynamically adjusting the backoff time provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0051] To make the objectives, technical solutions, and advantages of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the embodiments described are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention. Example 1

[0052] The following combination Figure 1-Figure 3 The present invention describes a bus communication protocol optimization method based on time division multiplexing technology.

[0053] like Figure 1-Figure 3 As shown, the bus communication protocol optimization method based on time division multiplexing technology provided by the embodiment of the present invention includes:

[0054] Collect data packet node information from bus communication logs. Using multi-threaded asynchronous packet capture technology, hardware probes and software sniffers work together to ensure high-precision timestamp acquisition (error < 1μs). Based on the data packet node information, calculate the timing difference between each pair of nodes and output the timing difference matrix. The steps for outputting the timing difference matrix include:

[0055] Calculate all existing timing differences based on each pair of node event sequences. Extract the valid communication event list from the node information of the data packet. Introduce a sliding window mechanism to only calculate event pairs within adjacent periods (such as 100ms windows). d The calculation results are compensated by cubic spline interpolation to eliminate the influence of clock drift.

[0056] Retain the effective components in the time series difference, remove the abnormal values, and output the time series difference matrix. Dynamically calculate the mean μ and standard deviation σ, and remove the time series that meet |t d -μ|>3σ abnormal value. Set a two-level fuse mechanism for sudden abnormalities: single node abnormality isolation 10 cycles, full network abnormality triggers protocol degradation output: enhanced timing difference matrix {t d(i,j)}, containing statistical confidence labels.

[0057] The timing difference matrix is divided according to the preset fixed timing difference. The steps of dividing the timing difference matrix include:

[0058] Preset time series difference classification standards. Introduce a fuzzy logic controller to establish a short-term stability-critical transition zone-long-term offset zone system. The classification threshold supports online calibration.

[0059] According to the timing difference classification standard, all subsets in the timing difference matrix are divided into STE trigger area and LTD trigger area. STE trigger area: t d <10ms. LTD trigger area: 50ms≤t d ≤100ms.

[0060] Based on the STE trigger zone and the LTD trigger zone, an event-driven double-buffered queue is constructed to generate a list of STE and LTD time differences. The weight changes of the timing differences are dynamically calculated, and a node-pair weight change table is output. The node-pair weight change table is a matrix used to quantify the dynamic changes in the strength of associations between different nodes (such as processors, sensors, or event sources) over time. The steps for calculating the weight changes of timing differences include:

[0061] Calculate the STDP mapping parameters based on the node information in the data packet. STDP, which stands for spike timing-dependent plasticity, is an important synaptic plasticity learning rule in neuroscience. It describes how the strength of synaptic connections between neurons dynamically adjusts based on the timing of spike (action potential) firing. The core concept of STDP is that the adjustment of synaptic weights depends on the timing difference in spike firing between two neurons. Parameters include the transmission rate enhancement factor, the conflict retransmission penalty coefficient, the effective window time, and the backoff baseline time.

[0062] According to the STDP mapping parameters, the STE time difference list and the LTD time difference list, the STE weight and the LTD weight are calculated, and a node pair weight change table is output.

[0063] The STE calculation (Short Time Enhancement) is expressed as:

[0064]

[0065] Where, It is expressed as the weight of the time series in the STE state. eff The effective window time indicates the effective duration of the short-term enhancement effect (e.g. data packet transmission needs to be within T eff (L represents the bus length, Vs represents the signal propagation speed, and θ represents the processing delay. T backoffThe backoff baseline time indicates the minimum backoff time in the LTD scenario (e.g., after a conflict, you need to wait for at least T backoff time and then try to retransmit). ACI is the average conflict interval. Specifically, it refers to the average time interval between two conflicts in the network. If the ACI is small (conflicts are frequent), k needs to be increased to extend the backoff time. If the ACI is large (conflicts are sparse), k can be reduced to quickly restore communication. k represents the conservative coefficient for conflict retransmission. k is an adjustable parameter used to dynamically adjust the length of the node's backoff time after a conflict. Balance the following two goals: Conflict suppression: Increasing k can extend the backoff time and reduce the probability of conflict retransmission. Resource utilization: Reducing k can shorten the backoff time and improve channel utilization. α is the transmission rate enhancement factor, which represents the rate increase ratio corresponding to the short-term enhancement effect under high-frequency pulses (for example, from 1Gbps to 2Gbps). β is the conflict retransmission penalty coefficient, which represents the attenuation weight of the number of retransmissions under the long-term suppression effect (for example, the number of retransmissions after each LTD event is reduced by β times).

[0066] The LTD calculation formula is expressed as:

[0067]

[0068] Where, It is the weight of the time sequence in the LTD state. γ is the conflict suppression strength coefficient. It directly determines the backoff time T backoff The negative sign indicates a degradation in link quality, and γ controls the magnitude of this degradation. The larger γ is, the more severe the degradation in link quality will be, and the node will have to wait longer (with a longer backoff time) before retransmitting after a conflict. By adjusting γ, we can balance the following two points:

[0069] Rapidly suppress inefficient links: A high γ value accelerates the elimination of links with frequent conflicts.

[0070] Avoid over-suppression: A low γ value prevents misjudging temporary conflicts as long-term interference.

[0071] γ is inversely proportional to the average conflict interval (ACI) and is expressed as:

[0072]

[0073] For example, if the ACI decreases from 50ms to 20ms (collisions become more frequent), γ needs to be increased from 0.15 to 0.35. The method for determining the optimal γ value is as follows:

[0074] Initially set γ and calculate the collision rate and throughput.

[0075] If the collision rate increases, γ increases; if the throughput decreases, γ decreases.

[0076] When the conflict rate is stable within a preset range, the optimal γ is determined.

[0077] Based on the node information of the data packet, static time slot division is performed according to a fixed period, and an initial time slot allocation table is output. The steps of performing static time slot division according to a fixed period include:

[0078] The bus cycle in the data packet node information is divided into equal-length time slots. The time slot division process first requires establishing a mathematical model of the bus cycle, dividing the total time axis into equal-length time slot units. The overall frame is determined by calculating the bus cycle length, and guard intervals are inserted to account for channel propagation delays.

[0079] Each pair of information nodes in the data packet node information is filled with equal-length time slots to generate an initial time slot allocation table. This process takes into account the communication needs and priorities between nodes. A dynamic weight mapping algorithm (such as a weighted calculation based on RSSI, LQI, and Traffic_Priority) is used to generate a weight matrix. The weights are updated using a time decay factor to ensure real-time and fair resource allocation.

[0080] Combined with the node weight change table, time division multiplexing technology is used to dynamically allocate time slot resources and output an optimized time slot allocation table. During the dynamic optimization phase, a game theory model is introduced to analyze the competitive relationship between nodes. Nash equilibrium is used to achieve efficient resource allocation. Flexible time slot segmentation technology is used to dynamically adjust time slot lengths, and a cross-layer optimization framework (such as the collaborative design of the PHY and MAC layers) is combined to improve system performance. The steps for dynamic time slot resource allocation using time division multiplexing technology include:

[0081] Calculate the incremental resource requirements for each node pair based on the node pair weight change table. Based on the real-time weight values in the node pair weight change table, combined with historical time slot occupancy, packet priority (Traffic_Priority), and link quality index (LQI), calculate the incremental resource requirements for each node pair. Specifically, this includes:

[0082] Calculate the transmission demand increment based on the packet size, transmission rate, and remaining lifetime:

[0083]

[0084] Where, It is expressed as the resource demand increment of node pair (i, j). is the payload size of the data packet. is the transmission rate (such as 1Gbps, 2Gbps). The remaining lifetime of the data packet. is the weight coefficient of short-term enhancement (STE) or long-term suppression (LTD). The dynamic channel occupancy factor is introduced to correct the resource demand increment to reflect the actual channel contention, which is expressed as:

[0085]

[0086] Where, Indicates the updated transmission requirement increment. The dynamic channel occupancy factor reflects the conflict probability and channel contention intensity of the current time slot. Its value range is [0.0, 0.1]. It is updated in real time by monitoring the conflict probability and backoff times of the current time slot.

[0087] Based on the incremental resource demand, services are arranged according to the preset priority strategy, and the total number of available time slots is allocated based on the STE weight and LTD weight. A multi-dimensional priority sorting algorithm is used to sort the incremental resource demand based on the service type (such as real-time control, general data) and urgency (Urgency_Level):

[0088] High priority nodes (such as security data) are given a dynamic weight amplification factor (W high =1+β·γ), where β is the conflict retransmission penalty coefficient and γ is the conflict suppression strength coefficient.

[0089] Low priority node pairs (such as background monitoring data) use basic weight decay (W low =1−λ·T idle ), λ is the slot idle attenuation factor, T idle The node idle time window.

[0090] The time slot allocation weight formula is expressed as:

[0091]

[0092] Where, T slot is the basic time slot unit, and N is the total number of nodes. It is a dynamic weight that combines service priority, link quality (LQI) and historical conflict behavior. The number of time slots allocated to node pair (i, j). s is a conservative coefficient that balances conflict suppression and resource utilization. Dynamic weight The calculation of , needs to combine the conflict retransmission penalty coefficient β and the conflict suppression strength coefficient γ, which can be expressed as:

[0093]

[0094] Where RSSI is the received signal strength and LQI is the link quality indicator, which need to be normalized when used.

[0095] Nodes in the STE trigger area receive additional burst time slot compensation, which is controlled by the burst compensation coefficient.

[0096] Based on the total number of time slots, the time slot requirements of each node pair are traversed to generate time sequence overlap data. A spatiotemporal conflict matrix is constructed to record the resource request conflicts of each node pair in the time domain and frequency domain.

[0097] The set of requesting nodes for each time slot segment is marked and the time slot saturation is calculated. OFDM subcarrier utilization is analyzed to identify high-frequency conflicting frequency bands. If the time slot requests of two node pairs meet preset conditions, a cross-dimensional overlapping conflict is determined. A time-series conflict topology map is generated, including the conflict level and the coordinates of the overlapping area.

[0098] Based on the time slot overlap data, a time slot conflict resolution strategy is set to output an optimized time slot allocation table. In wireless communication networks, efficient time slot resource allocation requires a dynamic conflict management mechanism. Here, hierarchical priority determination and rules are used to ensure a balance between the reliability of critical service time slots and resource utilization. Time slot conflict resolution strategies include:

[0099] STE links have higher priority for timeslot requests than LTD links. When a timeslot overlap conflict is detected, the system prioritizes access to the STE link. This policy is suitable for bursty, latency-sensitive services (such as emergency control command transmission), ensuring that short-duration services can preempt resources.

[0100] If both conflicting links are STE links, the timeslot is split into multiple sub-timeslots. The system divides the original timeslot into multiple consecutive or non-consecutive sub-timeslots and dynamically allocates sub-timeslot resources to meet the access needs of the conflicting links. The split granularity can be adjusted based on service needs. For example, a 1ms timeslot can be split into two 500μs sub-timeslots to support concurrent transmission on multiple devices.

[0101] If an LTD link conflicts with a timeslot, the timeslot is forcibly reduced to a preset minimum guaranteed value. This minimum guaranteed value is set based on the service contract or historical average demand (for example, a minimum of 10% bandwidth) to ensure basic service continuity. The remaining timeslot resources after the compression are preferentially allocated to STE links or other high-priority services to avoid resource waste.

[0102] The system monitors timeslot utilization and conflict frequency in real time and dynamically optimizes these policy parameters. For example, when LTD links experience prolonged periods of low load, it proactively releases redundant timeslots for global scheduling. Once burst traffic on STE links decreases, it gradually restores compressed LTD timeslot resources. This closed-loop mechanism continuously optimizes resource allocation.

[0103] Based on the optimized time slot allocation table and combined with historical conflict rate statistics, potential time slot conflicts are predicted, and the backoff time is dynamically adjusted to output the final protocol parameter set. The steps for dynamically adjusting the backoff time include:

[0104] Based on historical collision rate statistics, time slots are divided into high- and low-collision groups based on collision frequency. A collision heat map is generated by continuously monitoring metrics such as the number of collisions, duration, and channel occupancy for each time slot. Dynamic thresholds are set (for example, a collision count exceeding twice the mean is considered high), and groupings are periodically updated to adapt to network changes. Low-collision time slots are further prioritized, for example, by assigning differentiated processing weights based on service type (real-time traffic vs. non-real-time traffic).

[0105] For node communication events within high-contention time slots, a hybrid backoff mechanism combining an exponential backoff algorithm and a fixed window constraint is employed. The initial backoff time is randomly selected based on the contention window. With each subsequent conflict, the window size is exponentially increased (e.g., by 2), but a maximum window limit is set to prevent excessive delays. The fixed window constraint mechanism forces nodes that continuously conflict within high-contention time slots to enter a cool-down period, suspending transmission until the start of the next time slot cycle. In conjunction with mobility prediction of conflicting nodes, if a node is detected to be about to leave the high-contention area, its backoff time is shortened to improve resource utilization.

[0106] For node communication events within low-contention time slots, a linear backoff compensation strategy based on priority queues is implemented. High-priority services (such as emergency control commands) are assigned short backoff times, ensuring real-time performance through preemptive scheduling while simultaneously compressing the backoff windows for low-priority services. A positive incentive mechanism is designed: nodes with consecutive successful transmissions gradually reduce their backoff times in subsequent time slots, creating a positive feedback loop of "low contention, low backoff." When a time slot is detected to be in a long-term low-contention state, the maximum number of access nodes is proactively increased, improving throughput through multi-user diversity.

[0107] When outputting the final protocol parameter set, the time slot grouping results, node priority status and dynamic backoff parameters are integrated to generate a configuration scheme including the contention window size, the upper limit of the number of retransmissions, and the priority mapping relationship, and synchronize it to all nodes in the network through the broadcast channel.

[0108] The final protocol parameter set can be applied in the following ways:

[0109] A time slot allocation control module is embedded in the bus communication protocol stack to load the optimized time slot allocation table. The time slot allocation control module is integrated into the data link layer of the protocol stack as an independent subunit or runs independently in the middleware layer, interacting with upper-layer applications and lower-layer hardware drivers through standardized APIs. Time slot size and timing are divided as needed based on the service load of network nodes (e.g., differentiated traffic such as video streaming and sensor data), prioritizing the transmission bandwidth of high-priority services. Potential time slot competition risks are predicted based on historical communication records, and allocation strategies are adjusted in advance to avoid channel congestion. Hardware acceleration or dedicated coprocessors are used to achieve efficient module operation and reduce resource usage on the main control unit. Finally, pre-generated multi-scenario optimized time slot allocation tables (e.g., peak hours / low load modes) are loaded from the cloud or local storage and gradually implemented through a grayscale release mechanism.

[0110] A dynamic backoff adaptation layer is added between the physical layer and the data link layer to implement a hybrid backoff mechanism and a linear backoff compensation strategy. This adaptation layer, acting as a virtual logical layer, interfaces with the channel state information (CSI) of the PHY layer and provides a configurable backoff parameter set to the MAC layer. Control command data uses a fixed short backoff time to reduce latency, while large data packets use an adaptive long backoff window. By monitoring metrics such as channel utilization and packet loss rate, the backoff algorithm mode (such as IEEE 802.11's enhanced RTS / CTS or TDMA hybrid mode) is dynamically switched. The linear backoff compensation strategy includes fairness guarantees: for nodes that have repeatedly failed backoffs, the backoff time limit is exponentially extended to prevent individual nodes from monopolizing the channel. When the channel idle rate is detected to be persistently above a threshold, the baseline backoff time is proactively shortened to improve throughput efficiency.

[0111] The parameter configurations of the time slot allocation control module and the dynamic backoff adaptation layer are synchronously updated through the protocol stack's configuration interface. Hierarchical permission management is supported for key parameters such as the time slot allocation table, backoff algorithm parameters (such as CWmin / CWmax), and weights. A historical configuration snapshot is retained with each update, and a one-click rollback to the stable version is possible in the event of an anomaly. In a multi-node network, parameter updates are consistently propagated across the entire network through the Gossip protocol or the Raft consensus algorithm. Only parameter change fields are transmitted, rather than the entire configuration file, to reduce communication overhead. After the update, a small-scale pilot verification is triggered to verify the effectiveness of the new parameters by simulating traffic impacts. Node performance indicators (such as latency jitter and packet loss rate) are collected to form a feedback loop for iterative optimization of global parameter strategies.

[0112] The bus communication protocol optimization method based on time division multiplexing technology also includes a verification mechanism for protocol parameters:

[0113] During bus idle periods, test packets with multi-dimensional characteristics are injected, including variable data payload size (from minimum frame length to maximum allowable payload), differentiated priority identification, and randomized target address distribution. By constructing a layered simulation scenario matrix, we simulate multi-node concurrent communication scenarios with mixed master-slave node topologies, varying traffic patterns (periodic and bursty), and node fault tolerance. During the test, auxiliary observation indicators such as physical layer channel utilization and media access contention counts are simultaneously recorded.

[0114] A bidirectional correlation verification model was established based on an optimized time slot allocation table. The end-to-end transmission delay of the test data packets was decomposed into three components: medium access delay, queuing delay, and propagation processing delay, and these components were analyzed independently. A sliding window statistical method was used to compare the deviation between the theoretical collision probability model and the measured collision rate, with particular attention paid to abnormal collisions caused by hidden terminals under high load conditions. A visual dashboard presented the spatiotemporal distribution characteristics of key performance indicators, enabling engineers to quickly locate hotspots of time slot allocation conflicts.

[0115] When verification results exceed a preset threshold, a dual closed-loop feedback optimization mechanism is triggered. First, the weight change table is dynamically updated based on the conflict hotspot distribution map, and fuzzy logic algorithms are used to recalculate the time slot occupancy weight coefficients of each node, prioritizing services with high real-time requirements. Second, the backoff mechanism is upgraded to an intelligent exponential compensation algorithm, which predicts the optimal backoff time window based on historical conflict sequences and introduces a random perturbation factor to prevent secondary congestion caused by simultaneous backoff of multiple nodes. Regression testing is automatically performed after each iteration until stability convergence conditions are met.

[0116] Example 1:

[0117] Performance verification: Inject mixed traffic: 10% emergency control instructions (STE), 30% periodic messages, and 60% background data. Apply interference: Node movement causes 30% time slot conflicts.

[0118] Table 1:

[0119] index Before optimization After optimization Improvement End-to-end latency 14.2ms 8.7ms 38.7% Conflict Probability 22.4% 7.9% 64.7% Throughput Mbps 136Mbps 65.8% Control command delay jitter 3.2μs 0.9μs 71.9%

[0120] The above table is a comparison table of the optimization effects.

[0121] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units. That is, they may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of the present embodiment. Persons of ordinary skill in the art will be able to understand and implement the present invention without inventive effort.

[0122] Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented using software plus a necessary general-purpose hardware platform, or of course, hardware. Based on this understanding, the essence of the above technical solution, or the portion that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, or an optical disk, and includes a number of instructions for causing a computer device (such as a personal computer, server, or network device) to execute the methods described in each embodiment or certain portions of the embodiments.

[0123] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A bus communication protocol optimization method based on time division multiplexing technology, characterized in that: include: Collect data packet node information in bus communication logs; Calculate the timing difference of each pair of nodes according to the node information of the data packet and output the timing difference matrix; Divide the timing difference matrix according to the preset fixed timing difference, dynamically calculate the change in the weight of the timing difference, and output a node pair weight change table; Based on the node information of the data packet, static time slot division is performed according to a fixed period, and an initial time slot allocation table is output; combined with the node weight change table, dynamic time slot resource allocation is performed through time division multiplexing technology, and an optimized time slot allocation table is output; According to the optimized time slot allocation table, combined with historical conflict rate statistics, potential time slot conflicts are predicted, and the backoff time is dynamically adjusted to output the final protocol parameter set.

2. The bus communication protocol optimization method based on time division multiplexing technology according to claim 1 is characterized in that: The step of outputting the time series difference matrix includes: Extracting a valid communication event list from the data packet node information; Classify and store the valid communication event list according to the time of the nodes, and output the event sequence of each pair of nodes; Calculate all existing timing differences according to each pair of node event sequences; The effective components in the time series difference are retained, abnormal values are eliminated, and the time series difference matrix is output.

3. The bus communication protocol optimization method based on time division multiplexing technology according to claim 1 is characterized in that: The step of dividing the time series difference matrix includes: Preset time series difference classification standard; According to the timing difference classification standard, all subsets in the timing difference matrix are divided into STE trigger areas and LTD trigger areas; A STE time difference list and a LTD time difference list are generated according to the STE trigger area and the LTD trigger area.

4. The bus communication protocol optimization method based on time division multiplexing technology according to claim 3 is characterized in that: The step of calculating the change in the weight of the time series difference includes: Calculate STDP mapping parameters according to the data packet node information; According to the STDP mapping parameters, the STE time difference list and the LTD time difference list, the STE weight and the LTD weight are calculated, and the node pair weight change table is output.

5. The bus communication protocol optimization method based on time division multiplexing technology according to claim 4 is characterized in that: The steps of performing the static time slot division according to a fixed period include: Dividing the bus cycle in the data packet node information into equal-length time slots; Each pair of information nodes in the data packet node information is filled with the equal-length time slots to generate the initial time slot allocation table.

6. The bus communication protocol optimization method based on time division multiplexing technology according to claim 5 is characterized in that: The steps of performing the dynamic time slot resource allocation by time division multiplexing technology include: Calculating the resource demand increment of each node pair according to the node pair weight change table; Arrange the resources according to the resource demand increment according to a preset priority strategy, and allocate the total number of available time slots according to the STE weight and LTD weight; According to the total number of time slots, traverse the time slot requirements of each of the node pairs to generate time sequence overlap data; According to the time slot overlap data, a time slot conflict resolution strategy is set, and the optimized time slot allocation table is output.

7. The bus communication protocol optimization method based on time division multiplexing technology according to claim 6 is characterized in that: The time slot conflict resolution strategy includes: The time slot request priority of the STE link is higher than that of the LTD link; If both conflicting parties are STE links, the time slot is split into multiple sub-time slots; If the LTD link conflicts with the time slot, its time slot is forcibly reduced to the preset minimum guaranteed value.

8. The bus communication protocol optimization method based on time division multiplexing technology according to claim 6 is characterized in that: The steps for dynamically adjusting the backoff time include: Based on historical conflict rate statistics, time slots are divided into high-conflict time slot group and low-conflict time slot group according to conflict frequency; For node communication events in the high-contention time slot group, a hybrid backoff mechanism combining an exponential backoff algorithm and a fixed window constraint is adopted; For node communication events in the low-conflict time slot group, a linear backoff compensation strategy based on a priority queue is adopted.

9. The bus communication protocol optimization method based on time division multiplexing technology according to claim 1 is characterized in that: The application method of the final protocol parameter set includes: Embedding a time slot allocation control module in the bus communication protocol stack for loading the optimized time slot allocation table; A dynamic backoff adaptation layer is added between the physical layer and the data link layer to implement a hybrid backoff mechanism and a linear backoff compensation strategy; The parameter configurations of the time slot allocation control module and the dynamic backoff adaptation layer are synchronously updated through the configuration interface of the protocol stack.

10. The bus communication protocol optimization method based on time division multiplexing technology according to claim 1, characterized in that: It also includes verification mechanisms for protocol parameters: Injecting test data packets during the bus idle period to simulate a multi-node concurrent communication scenario based on the optimized time slot allocation table; Verifying the validity of the final protocol parameter set by comparing transmission delay and collision rate indicators of the test data packets; If the verification result exceeds the preset threshold, the iterative optimization process of the weight change table and backoff mechanism is triggered.

Images