Bus communication protocol optimization method based on time division multiplexing technology

Abstract

The invention provides a bus communication protocol optimization method based on a time division multiplexing technology, which relates to the technical field of bus communication, and comprises the following steps: calculating a time sequence difference value of each pair of nodes according to data packet node information; dividing a time sequence difference value matrix, and dynamically calculating the variable quantity of the weight of a time sequence difference value; performing static time slot division according to a fixed period; dynamic time slot resource allocation is carried out through a time division multiplexing technology in combination with the node pair weight change table; potential time slot conflicts are predicted in combination with historical conflict rate statistical data, and the backoff time is dynamically adjusted. According to the method, node time sequence data are collected in real time, a time sequence difference matrix is constructed, and node weight variation is dynamically calculated in combination with an STDP mapping mechanism, so that intelligent allocation of time slot resources is realized; through a hybrid backoff algorithm of exponential backoff and fixed window constraint, the average conflict probability of a high-conflict time slot group is greatly reduced, the delay fluctuation of a low-conflict time slot group is controlled within a low fluctuation range, and the real-time response and long-term stability of the system are both considered.

Description

Technical Field

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

[0002] A bus communication protocol is a standardized rule for transmitting data, addresses, and control signals between electronic devices. Its core goal is to coordinate efficient and reliable communication between different components. From the physical layer to the protocol layer, a bus usually consists of data lines, address lines, and control lines. The data lines are responsible for transmitting the actual content, the address lines specify the location of the target device or storage unit, and the control lines manage key processes such as read / write operations, timing synchronization, and interrupt requests. According to different communication methods, buses can be divided into two categories: synchronous and asynchronous. Synchronous communication relies on a unified clock signal (such as I²C, SPI), and strict timing ensures high-speed transmission, but it is limited to short distances; asynchronous communication achieves loose synchronization through start bits and stop bits (such as UART), although the speed is lower, it is suitable for long-distance or scenarios with strong anti-interference requirements. Common bus protocols have their own characteristics. I²C realizes multi-device interconnection with a two-wire system (clock line SCL, data line SDA), supports a multi-master and multi-slave architecture, and is widely used in low-speed scenarios such as sensors and memories; SPI adopts a four-wire full-duplex design (clock, master-slave bidirectional data lines), and becomes the first choice for devices such as Flash memories and displays due to its high-speed characteristics. The CAN bus realizes multi-node communication with high anti-interference in automotive electronics through differential signals and arbitration mechanisms; USB simplifies peripheral connection through a master-slave architecture and hot-plug function, and its version iteration continuously improves the transmission rate. UART, as a classic asynchronous serial port protocol, supports the debugging and communication of embedded systems with a minimalist transceiver line structure (TX, RX), but the efficiency is low. PCIe focuses on high-speed point-to-point transmission, and its hierarchical channel design makes it an ideal choice for high-performance devices such as graphics cards and solid-state drives.

[0003] Generally, the optimization method of the bus communication protocol adopts a fixed-cycle time slot division mechanism, which cannot be dynamically adjusted according to the real-time changes in the communication requirements of nodes. When the network load fluctuates, the coexistence of "time slot idle" and "time slot overload" is likely to occur. And using a fixed window backoff algorithm or a simple exponential backoff mechanism, in high-conflict scenarios (such as industrial bus bursty data peaks), the conflict probability shows an exponential growth. Existing optimization schemes mostly perform offline parameter preset based on historical statistical data, lacking real-time verification and dynamic iteration capabilities. Summary of the Invention

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

[0005] On the one hand, the present invention provides an optimization method for a bus communication protocol based on time division multiplexing technology, including: Collect the packet node information in the bus communication log; calculate the timing difference between each pair of nodes according to the packet node information, and output the timing difference matrix; Divide the timing difference matrix according to the preset fixed timing difference, and dynamically calculate the change amount of the weight of the timing difference, and output the node pair weight change table; Perform static time slot division on the packet node information at a fixed period, and output the initial time slot allocation table; combine the node pair weight change table, and perform dynamic time slot resource allocation through time division multiplexing technology, and output the optimized time slot allocation table; According to the optimized time slot allocation table, combine the historical conflict rate statistical data to predict potential time slot conflicts, and dynamically adjust the backoff time, and output the final protocol parameter set.

[0006] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the steps of outputting the timing difference matrix include: Extract the effective communication event list from the packet node information; Classify and store the effective communication event list by time according to nodes, and output the event sequence of each pair of nodes; Calculate all existing timing differences according to the event sequence of each pair of nodes; Retain the effective components in the timing difference, eliminate the outliers, and output the timing difference matrix.

[0007] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the steps of dividing the timing difference matrix include: Preset the timing difference classification standard; According to the timing difference classification standard, divide all subsets in the timing difference matrix into the STE trigger area and the LTD trigger area; Generate the STE time difference list and the LTD time difference list according to the STE trigger area and the LTD trigger area.

[0008] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the steps of calculating the change amount of the weight of the timing difference include: Calculate the STDP mapping parameters according to the packet node information; Calculate the STE weight and the LTD weight according to the STDP mapping parameters, the STE time difference list and the LTD time difference list, and output the node pair weight change table.

[0009] According to the bus communication protocol optimization method based on time division multiplexing technology provided by the present invention, the steps of performing static time slot division at a fixed period include: Divide the bus cycle in the packet node information into equal-length time slots; Fill each pair of information nodes in the data packet node information according to equal - length time slots to generate an initial time slot allocation table.

[0010] 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 through time - division multiplexing technology include: Calculate the resource demand increment of each node pair according to the node - pair weight change table; Arrange according to the preset priority policy according to the resource demand increment, and allocate the total number of available time slots according to the STE weight and LTD weight; Traverse the time slot requirements of each node pair according to the total number of time slots to generate time - sequence overlapping data; Set a time slot conflict resolution strategy according to the time slot overlapping data, and output an optimized time slot allocation table.

[0011] 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: The time slot request priority of the STE link is higher than that of the LTD link; If both conflicting parties are STE links, split the time slot into multiple sub - time slots; If the LTD link conflicts with the time slot, forcefully reduce its time slot to a preset minimum guarantee value.

[0012] According to the bus communication protocol optimization method based on time - division multiplexing technology provided by the present invention, the steps of dynamically adjusting the back - off time include: Divide the time slots into a high - conflict time slot group and a low - conflict time slot group according to the conflict frequency based on the historical conflict rate statistical data; For node communication events in the high - conflict time slot group, adopt a hybrid back - off mechanism combining an exponential back - off algorithm and a fixed - window constraint; For node communication events in the low - conflict time slot group, adopt a linear back - off compensation strategy based on a priority queue.

[0013] According to the bus communication protocol optimization method based on time - division multiplexing technology provided by the present invention, the application method of the final protocol parameter set includes: Embed a time slot allocation control module in the bus communication protocol stack for loading the optimized time slot allocation table; Add a dynamic back - off adaptation layer between the physical layer and the data link layer for executing the hybrid back - off mechanism and the linear back - off compensation strategy; Synchronously update the parameter configurations of the time slot allocation control module and the dynamic back - off adaptation layer through the configuration interface of the protocol stack.

[0014] According to the bus communication protocol optimization method based on time - division multiplexing technology provided by the present invention, it also includes a verification mechanism for protocol parameters: Inject test data packets during the bus idle cycle and simulate the multi-node concurrent communication scenario based on the optimized time slot allocation table; Verify the effectiveness of the final protocol parameter set by comparing the transmission delay and collision rate metrics of the test data packets; If the verification result exceeds the preset threshold, trigger the iterative optimization process of the weight change table and the backoff mechanism.

[0015] The bus communication protocol optimization method based on time-division multiplexing technology provided by the present invention realizes the intelligent allocation of time slot resources by collecting node timing data in real time, constructing a timing difference matrix, and dynamically calculating the node weight change amount in combination with the STDP mapping mechanism. This method breaks through the limitation of traditional static time slot division, enables high-priority STE links to obtain the priority time slot usage right, and effectively reduces the resource competition of LTD links through time slot splitting and conflict resolution strategies, significantly improving the bus bandwidth utilization rate. Through the hybrid backoff algorithm of exponential backoff and fixed window constraint, combined with the dynamic grouping mechanism of historical collision rate statistics, the average collision probability of high-collision time slot groups is greatly reduced, and the delay fluctuation of low-collision time slot groups is controlled within a low fluctuation range, taking into account the real-time response and long-term stability of the system. Description of the Drawings

[0016] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0017] Figure 1 It is a step diagram of the bus communication protocol optimization method based on time-division multiplexing technology provided by the embodiments of the present invention; Figure 2 It is a step diagram of dynamic time slot resource allocation through time-division multiplexing technology provided by the embodiments of the present invention; Figure 3 It is a step diagram of dynamically adjusting the backoff time provided by the embodiments of the present invention. Detailed Embodiments

[0018] To make the purpose, technical solutions, and advantages of the present invention clearer, the following will clearly and completely describe the technical solutions in the present invention in conjunction with the drawings in the present invention. Obviously, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art without creative efforts based on the embodiments in the present invention belong to the scope of protection of the present invention. Embodiment 1

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

[0020] like Figures 1 - 3 As shown, the bus communication protocol optimization method based on time division multiplexing technology provided by the embodiment of the present invention includes: Collect the data packet node information in the bus communication log. Use multi-threaded asynchronous packet capture technology, and work together with hardware probes and software sniffers to ensure high-precision timestamp acquisition (error <1μs). According to the data packet node information, calculate the timing difference of each pair of nodes and output the timing difference matrix. The steps to output the timing difference matrix include: According to each pair of node event sequences, all existing timing differences are calculated. The valid communication event list in the data packet node information is extracted. The sliding window mechanism is introduced to only calculate the 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.

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

[0022] The timing difference matrix is ​​divided according to the preset fixed timing difference. The steps of dividing the timing difference matrix include: Preset the time difference classification standard. Introduce fuzzy logic controller to establish a short-term stability-critical transition zone-long-term offset zone system, and the classification threshold supports online calibration.

[0023] 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.

[0024] According to the STE trigger area and the LTD trigger area, an event-driven double buffer queue is constructed to generate the STE time difference list and the LTD time difference list, dynamically calculate the change in the weight of the timing difference value, and output the node pair weight change table. The node pair weight change table is a matrix used to quantify the dynamic change of the association strength between different nodes (such as processors, sensors or event sources) over time. The steps for calculating the change in the weight of the timing difference value include: Calculate the STDP mapping parameters based on the data packet node information. STDP refers to spike-timing-dependent plasticity, which is an important synaptic plasticity learning rule in neuroscience and is used to describe how the synaptic connection strength between neurons dynamically adjusts according to the firing time sequence of spikes (action potentials). The core idea of STDP is that the adjustment of synaptic weights depends on the time difference between spike firings of two neurons. The parameters include: transmission rate enhancement factor, collision retransmission penalty coefficient, effective window time, and backoff baseline time.

[0025] Calculate the STE weight and LTD weight based on the STDP mapping parameters, the STE time difference list, and the LTD time difference list, and output the node pair weight change table.

[0026] The STE calculation (short-term enhancement) is expressed as:

[0027] In the formula, represents the weight at the time sequence in the STE state. T eff is the effective window time, representing the effective duration of the short-term enhancement effect (e.g., the data packet transmission needs to be completed within T eff to avoid collisions). L represents the bus length, Vs represents the signal propagation speed. θ represents the processing delay. T backoff is the backoff baseline time, representing the minimum backoff time in the LTD scenario (e.g., after a collision, it is necessary to wait at least T backoff time and then try to retransmit). ACI is the average collision interval time. Specifically, it refers to the average time interval between two collisions in the network. If ACI is small (frequent collisions), it is necessary to increase k to extend the backoff time; if ACI is large (sparse collisions), k can be reduced to quickly resume communication. k represents the conservative coefficient of collision retransmission. k is an adjustable parameter used to dynamically adjust the backoff time length of the node after a collision. Balance the following two goals: Collision suppression: Increasing k can extend the backoff time and reduce the probability of collision retransmission. Resource utilization: Reducing k can shorten the backoff time and improve the channel utilization rate. α is the transmission rate enhancement factor, representing the rate increase ratio corresponding to the short-term enhancement effect under high-frequency pulses (e.g., from 1 Gbps to 2 Gbps). β is the collision retransmission penalty coefficient, representing the attenuation weight of the retransmission times under the long-term inhibition effect (e.g., the retransmission times decrease by β times after each LTD event).

[0028] The LTD calculation (long-term depression) formula is expressed as:

[0029] In the formula, represents the weight at the time sequence in the LTD state. γ represents the collision suppression intensity coefficient. It directly determines the backoff time T backoffPenalty strength. The negative sign indicates a decrease in link quality, and γ controls the degree of decrease. The larger γ is, the more severe the link quality attenuation is, and the longer the node needs to wait (a larger backoff time) before retransmitting after a collision. By adjusting γ, the following two points are balanced: Quickly suppress inefficient links: A high γ value accelerates the elimination of frequently colliding links.

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

[0031] γ is inversely proportional to the average collision interval (ACI), expressed as:

[0032] For example: If the ACI drops from 50 ms to 20 ms (more frequent collisions), then γ needs to increase from 0.15 to 0.35. The method to determine the optimal γ value is as follows: Initially set γ and count the collision rate and throughput.

[0033] If the collision rate rises, then γ increases; if the throughput drops, then γ decreases.

[0034] When the collision rate stabilizes within the preset range, determine the optimal γ.

[0035] According to the packet node information, perform static time slot division at fixed intervals and output the initial time slot allocation table. The steps for performing static time slot division at fixed intervals include: Divide the bus cycle in the packet node information into equal-length time slots. During the time slot division process, first, a mathematical model of the bus cycle needs to be established, divide the total time axis into equal-length time slot units, determine the overall framework by calculating the bus cycle length, and insert a guard interval to cope with the channel propagation delay.

[0036] Fill each pair of information nodes in the packet node information according to equal-length time slots to generate the initial time slot allocation table. This process needs to consider the communication requirements and priorities between nodes, generate a weight matrix through a dynamic weight mapping algorithm (such as weighted calculation based on RSSI, LQI, and Traffic_Priority), and update the weights using a time decay factor to ensure the real-time and fairness of resource allocation.

[0037] Combine the node pair weight change table and perform dynamic time slot resource allocation through time division multiplexing technology to output the optimized time slot allocation table. In the dynamic optimization stage, a game theory model is introduced to analyze the competition relationship between nodes, achieve efficient resource allocation through Nash equilibrium solution, at the same time use elastic time slot splitting technology to dynamically adjust the time slot length, and combine a cross-layer optimization framework (such as the co-design of the PHY layer and the MAC layer) to improve system performance. The steps for performing dynamic time slot resource allocation through time division multiplexing technology include: Calculate the resource demand increment for each node pair according to the node pair weight change table. Based on the real-time weight values in the node pair weight change table, combined with the historical time slot occupancy rate, data packet priority (Traffic_Priority), and link quality indicator (LQI), calculate the resource demand increment for each node pair. Specifically, it includes: Calculate the transmission demand increment according to the data packet size, transmission rate, and remaining survival time:

[0038] In the formula, represents the resource demand increment for the node pair (i, j). is the effective payload size of the data packet. is the transmission rate (such as 1 Gbps, 2 Gbps). is the remaining survival time of the data packet. is the weight coefficient of short-term enhancement (STE) or long-term suppression (LTD). Introduce a dynamic channel occupancy factor to correct the resource demand increment to reflect the actual channel competition, which is expressed as:

[0039] In the formula, represents the updated transmission demand increment. represents the dynamic channel occupancy factor, which reflects the current time slot conflict probability and channel competition intensity, and its value range is [0.0, 0.1], and it is updated in real time by monitoring the conflict probability and backoff times of the current time slot.

[0040] Arrange according to the resource demand increment according to the preset priority strategy, and allocate the total number of available time slots according to the STE weight and LTD weight. Adopt a multi-dimensional priority sorting algorithm, combined with the service type (such as real-time control, ordinary data) and urgency level (Urgency_Level), to sort the resource demand increment: Assign a dynamic weight amplification coefficient (W high = 1 + β·γ) to high-priority node pairs (such as security-class data), where β is the conflict retransmission penalty coefficient and γ is the conflict suppression intensity coefficient.

[0041] For low-priority node pairs (such as background monitoring data), use basic weight attenuation (W low = 1 - λ·T idle ), where λ is the time slot idle attenuation factor and T idle is the node idle time window.

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

[0043] In the formula, T slotis 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 the 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 γ, expressed as:

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

[0045] The nodes in the STE trigger area obtain additional burst time slot compensation, which is controlled by the burst compensation coefficient.

[0046] According to the total number of time slots, the time slot requirements of each node pair are traversed to generate timing overlap data. A time-space conflict matrix is ​​constructed to record the resource request conflicts of each node pair in the time domain and frequency domain.

[0047] Mark the requesting node set of each time slot segment and calculate the time slot saturation. Analyze the OFDM subcarrier utilization and identify the high-frequency conflicting frequency band. If the time slot requests of two node pairs meet the preset conditions, it is determined to be a cross-dimensional overlapping conflict. Generate a timing conflict topology map containing the conflict level and the coordinates of the overlapping area.

[0048] According to the time slot overlap data, the time slot conflict resolution strategy is set and the optimized time slot allocation table is output. In wireless communication networks, the efficient allocation of time slot resources requires the combination of dynamic conflict management mechanisms. Here, the reliability of key business time slots and the balance of resource utilization are ensured through hierarchical priority determination and rules. The time slot conflict resolution strategy includes: The time slot request priority of the STE link is higher than that of the LTD link. When a time slot overlap conflict is detected, the system prioritizes the access requirements of the STE link. This strategy is suitable for business scenarios with strong burstiness and delay sensitivity (such as emergency control command transmission) to ensure the ability of short-term business to seize resources.

[0049] If both conflicting parties are STE links, the time slot is split into multiple sub-time slots. The system divides the original time slot into multiple continuous or non-continuous sub-time slots and dynamically allocates sub-time slot resources to meet the access requirements of the conflicting links. The split granularity can be adjusted according to business needs. For example, a 1ms time slot can be split into two 500μs sub-time slots to support parallel transmission of multiple devices.

[0050] If the LTD link conflicts with the time slot, forcefully reduce its time slot to the preset minimum guaranteed value. The minimum guaranteed value is set based on the service contract or historical average demand (such as a minimum of 10% bandwidth) to ensure the continuity of basic services. The remaining time slot resources after compression will be preferentially allocated to the STE link or other high-priority services to avoid resource waste.

[0051] The system monitors the time slot utilization rate and conflict frequency in real time and dynamically optimizes the above policy parameters. For example, when the LTD link has a long-term low load, redundant time slots can be actively released for global scheduling; after the burst traffic of the STE link drops, the compressed LTD time slot resources can be gradually restored. This closed-loop mechanism realizes the continuous optimization of resource allocation.

[0052] According to the optimized time slot allocation table, combined with the historical conflict rate statistical data, predict potential time slot conflicts and dynamically adjust the backoff time to output the final set of protocol parameters. The steps for dynamically adjusting the backoff time include: According to the historical conflict rate statistical data, divide the time slots into a high-conflict time slot group and a low-conflict time slot group according to the conflict frequency. By continuously monitoring indicators such as the number of conflict occurrences, conflict duration, and channel occupancy rate of each time slot, generate a conflict heat map. Set a dynamic threshold (such as determining a high conflict if the number of conflicts exceeds twice the average) and update the grouping periodically to adapt to network changes. Further subdivide the priorities of the low-conflict time slots, for example, allocate different processing weights based on the service type (real-time traffic / non-real-time traffic).

[0053] For node communication events within the high-conflict time slot group, adopt a hybrid backoff mechanism that combines the exponential backoff algorithm with a fixed window constraint. The initial backoff time is randomly selected based on the contention window, and the window size will be exponentially increased (such as multiplied by 2) for each subsequent conflict, but a maximum window limit is set to avoid excessive delay. Introduce a fixed window constraint mechanism to force nodes that continuously conflict within the high-conflict time slot to enter a cooling period and pause sending until the next time slot period starts. Combining the mobility prediction of conflict nodes, if it is detected that a node is about to leave the high-conflict area, shorten its backoff time to improve resource utilization.

[0054] For node communication events within the low-conflict time slot group, adopt a linear backoff compensation strategy based on a priority queue. Allocate a short backoff time for high-priority services (such as emergency control instructions), ensure real-time performance through preemptive scheduling, and at the same time compress the backoff window of low-priority services. Design a positive incentive mechanism: Nodes that continuously transmit successfully gradually reduce the backoff time in subsequent time slots, forming a positive feedback loop of "low conflict - low backoff". When it is detected that the time slot is in a long-term low-conflict state, actively increase the upper limit of the number of access nodes to improve throughput through multi-user diversity.

[0055] 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 contention window size, upper limit of retransmission times and priority mapping relationship, and synchronize it to all nodes in the network through the broadcast channel.

[0056] The final protocol parameter set is applied in the following ways: The 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, and interacts with the upper-layer application and the lower-layer hardware driver through a standardized API. According to the business load of the network node (such as differentiated traffic such as video streaming and sensor data), the time slot size and timing are divided as needed to give priority to the transmission bandwidth of high-priority services. Combined with historical communication records, the potential time slot competition risk is predicted, and the allocation strategy is adjusted in advance to avoid channel congestion. Hardware acceleration or dedicated coprocessors are used to achieve efficient operation of the module and reduce the resource occupation of the main control unit. Finally, the pre-generated multi-scenario optimized time slot allocation table (such as peak hours / low load mode) is loaded from the cloud or local storage, and gradually takes effect through the grayscale release mechanism.

[0057] A dynamic backoff adaptation layer is added between the physical layer and the data link layer to implement the hybrid backoff mechanism and the linear backoff compensation strategy. As a virtual logic layer, the adaptation layer connects to the channel state information (CSI) of the PHY layer downward and provides a configurable backoff parameter set to the MAC layer upward. Control instruction data uses a fixed short backoff time to reduce latency, while large data packet transmission uses an adaptive long backoff window. By monitoring indicators such as channel utilization and packet loss rate, the backoff algorithm mode (such as the enhanced version of RTS / CTS of IEEE 802.11 or the TDMA hybrid mode) is dynamically switched. The linear backoff compensation strategy includes: fairness guarantee For nodes that have failed to backoff multiple times, the backoff time upper limit is gradually extended in an exponential proportion to prevent individual nodes from monopolizing the channel. When it is detected that the channel idle rate is continuously higher than the threshold, the subsequent backoff time baseline value is actively shortened to improve throughput efficiency.

[0058] Synchronously update the parameter configuration of the time slot allocation control module and the dynamic backoff adaptation layer through the configuration interface of the protocol stack. Support hierarchical permission management of key parameters such as time slot allocation table, backoff algorithm parameters (such as CWmin / CWmax), and weight. Keep historical configuration snapshots for each update, and roll back to the stable version with one click in case of abnormality. In a multi-node network, the Gossip protocol or Raft consensus algorithm is used to achieve network-wide consistent propagation of parameter updates. Only the parameter change fields are transmitted instead of the complete configuration file to reduce communication overhead. After the update, a small-scale pilot verification is triggered to verify the validity of the new parameters by simulating traffic impact. Collect node performance indicators (such as delay jitter and packet loss rate) to form a feedback loop for iterative optimization of global parameter strategies.

[0059] The bus communication protocol optimization method based on time-division multiplexing technology further includes a verification mechanism for protocol parameters: Inject test data packets with multi-dimensional characteristics during the bus idle period, including variable data payload sizes (from the minimum frame length to the maximum allowed payload), differentiated priority identifiers, and randomized target address distributions. By constructing a hierarchical simulation scenario matrix, simulate the multi-node concurrent communication scenarios including master-slave node hybrid topologies, different communication traffic patterns (periodic / burst), and node fault tolerance states. During the test, synchronously record auxiliary observation indicators such as the physical layer channel utilization rate and the number of medium access contentions.

[0060] Based on the optimized time slot allocation table, establish a two-way association verification model, and decompose the end-to-end transmission delay of the test data packet into three sub-items: medium access delay, queuing waiting delay, and propagation processing delay for independent analysis. Use the sliding window statistical method to compare the deviation value between the theoretical collision probability model and the measured collision rate, and pay special attention to the abnormal collision phenomenon caused by hidden terminals under high load conditions. Present the spatio-temporal distribution characteristics of key performance indicators through a visualization dashboard to support engineers in quickly locating the hot spots of time slot allocation conflicts.

[0061] When the verification result breaks through the preset threshold, trigger the double closed-loop feedback optimization mechanism: on the one hand, dynamically update the weight change table based on the conflict hot spot distribution map, and use the fuzzy logic algorithm to recalculate the time slot occupancy weight coefficients of each node, giving priority to guaranteeing the service flows with high real-time requirements; on the other hand, upgrade the backoff mechanism to an intelligent exponential compensation algorithm, predict the optimal backoff time window according to the historical conflict sequence, and introduce a random perturbation factor to prevent secondary congestion caused by multi-node synchronous backoff. Automatically perform regression tests after each iteration until the stability convergence condition is met.

[0062] Example 1: Conduct performance verification: Inject mixed traffic: 10% emergency control instructions (STE), 30% periodic messages, 60% background data. Apply interference: 30% time slot conflicts caused by node movement.

[0063] Table 1: Index Before optimization After optimization Improvement rate End - to - end delay 14.2ms 8.7ms 38.7% Collision probability 22.4% 7.9% 64.7% Throughput Mbps 136Mbps 65.8% Control instruction delay jitter 3.2μs 0.9μs 71.9% The above table is a comparison table of the optimized effects.

[0064] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art can understand and implement it without creative efforts.

[0065] Through the description of the above embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence, or the part 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, magnetic disk, optical disk, etc., and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0066] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them. Although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments or perform equivalent replacements for some of the technical features. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of each embodiment 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 log; According to the node information of the data packet, the timing difference of each pair of nodes is calculated, and the timing difference matrix is ​​output; According to the preset fixed timing difference, the timing difference matrix is ​​divided, and the change of the weight of the timing difference is dynamically calculated, and a node pair weight change table is output; According to 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; in combination with the node pair 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, potential time slot conflicts are predicted in combination with historical conflict rate statistics, 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 timing difference matrix comprises: Extracting a list of valid communication events 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; According to each pair of node event sequences, all existing timing differences are calculated; The effective components in the time series difference are retained, the 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 timing difference matrix comprises: 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 timing difference comprises: 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; According to the resource demand increment, the resources are arranged according to a preset priority strategy, and the total number of available time slots is allocated according to the STE weight and the LTD weight; According to the total number of time slots, traverse the time slot requirements of each of the node pairs to generate timing 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 to dynamically adjust 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-conflict time slot group, a hybrid backoff mechanism combining an exponential backoff algorithm and a fixed window constraint is adopted; For the 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 to load the optimized time slot allocation table; A dynamic backoff adaptation layer is added between the physical layer and the data link layer to implement the hybrid backoff mechanism and the 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 is characterized in that: It also includes verification mechanisms for protocol parameters: Injecting a test data packet during a 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 the backoff mechanism is triggered.

Images