A time slot allocation method for wireless time-sensitive network inside spacecraft with wired and wireless integration
By mapping wired TSN frames to wireless TDMA frames and using dynamic emergency control algorithms, the data blockage problem caused by wireless communication time slot allocation in the spacecraft is solved, and the deterministic transmission of time-sensitive service flows within the spacecraft is realized, which improves the Real-time and reliability of communication systems.
Patent Information
- Application Number
- CN202210226973.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-03-08
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2042-03-08
AI Technical Summary
When introducing wireless communications into spacecraft, the wireless output port of the communication node needs to wait for the wireless communication time slot, resulting in data blockage and unable to meet the end-to-end delay requirements of time-sensitive services, affecting the certainty of data transmission.
A method of time slot allocation for wireless time-sensitive networks in spacecraft with wired wireless convergence is proposed. By mapping wired TSN frames to wireless TDMA frames, time slot allocation is ensured by using node queue management timers and wireless gateway nodes to ensure time-sensitive data Timely transmission. The specific steps include converting the wired TSN frame into 802.11 wireless frames, storing it in the cache queue according to the QoS field, calculating the total superframe length and unit slot length in the time slot table, and scheduling the data packets through the dynamic urgency control algorithm.
It realizes deterministic end-to-end transmission of time-sensitive service flows within the spacecraft, reduces data waiting delay, and improves the reliability and real-time nature of the communication system.
Smart Images

Figure CN114501654B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of wired and wireless integrated spacecraft internal time-sensitive network communication, and in particular to a wired and wireless integrated spacecraft internal wireless time-sensitive network time slot allocation method. Background Art
[0002] In recent years, various countries have actively carried out space exploration and manned space missions, and the functions of spacecraft have become more complex. As a highly integrated and complex space body, a large number of sensors and monitoring equipment are deployed inside and outside the spacecraft to monitor real-time status data. The internal data transmission bus of the spacecraft generally uses 1553B and CAN bus for data communication, which accounts for a large proportion of mass, affecting the spacecraft to carry more payloads; at the same time, the mobility communication needs of astronauts when working inside and outside the cabin are increasing, and the reliability and real-time performance of communication need to be guaranteed. It can be seen that introducing wireless communication methods into the spacecraft communication system can effectively meet its communication needs and reduce the proportion of communication harness mass. However, in the wired real-time communication system, how to integrate wireless and wired methods and solve the joint scheduling of communication resources is the key to achieving end-to-end deterministic transmission of business data.
[0003] Real needs drive the emergence of relevant standard protocols, and TSN (Time-Sensitive Network) came into being. It was first proposed by the IEEE 802.1 task group in 2012 to build a unified and standardized Layer 2 network protocol so that it can be used in any environment using Ethernet technology to provide guarantee for real-time data transmission. TSN has the following goals: 1) Ensure that the message delay of the switching network is guaranteed; 2) Time-sensitive data streams and non-time-sensitive data streams can be transmitted on the same network, and the transmission of non-time-sensitive data streams will not affect the transmission delay of time-sensitive data streams. It can be seen that TSN can not only provide reliable quality of service (Quality of Service, QoS) guarantee for time-sensitive services, but also support the transmission of non-time-sensitive services in the network. Therefore, the existing TSN standard can be well utilized in the intra-satellite network.
[0004] Wireless TSN technology research is in the initial stage and has not yet formed a standard. Currently, there are studies on improving the existing IEEE802.11 protocol to make the wireless network reliable and have real-time performance. Therefore, wireless TSN technology can be introduced into the internal network of spacecraft.
[0005] In summary, it is necessary to introduce TSN technology to reduce the weight of spacecraft wiring harnesses while ensuring the time delay determinism of intra-satellite communication. However, when the wireless communication mechanism is introduced into the spacecraft, the wireless output port of the communication node needs to wait for the wireless communication time slot of the node, and the time slot cannot be allocated for the node in time, which will cause data congestion at the wireless output port, and thus fail to meet the end-to-end delay requirements of time-sensitive services. Therefore, the division of communication time slots will greatly affect the waiting delay of data. Therefore, the reasonable division of communication time slots in TDMA-based wireless communication networks is the focus of research. Summary of the invention
[0006] In order to ensure deterministic end-to-end transmission of time-sensitive service flows, the present invention proposes a method for allocating time slots in a wireless time-sensitive network within a spacecraft that integrates wired and wireless networks, which specifically includes the following steps:
[0007] Mapping wired TSN frames in spacecraft internal data packets into wireless TDMA frames;
[0008] storing the wireless TDMA frame into a corresponding buffer queue according to the destination MAC address and QoS field of the wireless TDMA frame;
[0009] Under the control of the node queue management timer interrupt, the node collects the queue entry time period and data volume information of the time-sensitive data in the queue, as well as the data volume information of the non-time-sensitive data, and reports the queue status to the wireless gateway node in the corresponding time slot;
[0010] The wireless gateway node receives the relevant information of all nodes participating in the time slot allocation and calculates the total superframe length T in the next time slot table. sp , Node access time slot length T B , unit time slot length T p and the corresponding node transmission time slot positions.
[0011] Furthermore, mapping the wired TSN frame in the data packet inside the spacecraft to the wireless TDMA frame includes: the wired TSN frame is an Ethernet frame with a VLAN tag, the TDMA frame is a custom 802.11 frame, and the custom 802.11 frame includes an 802.11 header, a sequence number, a data length QoS field, a maximum survival time, a load, and a 32-bit CRC check; when the wired side data inside the spacecraft passes through the TSN switch and reaches the TSN gateway receiving port, the wired TSN frame is converted into an 802.11 wireless frame, the pcp priority field in the VLAN tag is mapped to the QoS field of the wireless TDMA frame, and the custom data packet maximum survival is mapped to the wireless TDMA frame in sequence.
[0012] Furthermore, the wireless TDMA frame is stored in the corresponding cache queue according to the destination MAC address and QoS field of the wireless TDMA frame. That is, if the QoS field of the TDMA frame is a specific value, that is, the data packet is time-sensitive data, it is stored in the TSN list; otherwise, that is, the data packet is non-time-sensitive data, then the data packet is stored in the non-TSN list.
[0013] Furthermore, the transmission time slot position allocated by the wireless gateway node to node i is expressed as:
[0014]
[0015] Among them, T i port is the time when the time-sensitive data of node i arrives at the wireless output port; T i trans is the time slot position allocated by the wireless gateway for node i; n is the number of all nodes participating in the time slot allocation.
[0016] Furthermore, if the time slot unit length in the TDMA time slot is T p , then the number of unit time slots required for data flow s in node i is C i,s It is expressed as:
[0017]
[0018] Among them, T g represents the length of the guard band between time slots of node i; is the TSN data flow bandwidth of node i; R space is the wireless link transmission rate.
[0019] Furthermore, the length of the guard band between time slots of node i is T g It is expressed as:
[0020]
[0021] in, is the maximum synchronization error between any two nodes in the network; T prop is the propagation delay of electromagnetic waves.
[0022] Furthermore, the calculation of the synchronization error between the two nodes includes: judging whether the priority information and source address information of the received data packet are the first time to receive and send the time-sensitive data of this terminal at the current priority. If it is the first time to receive, then the arrival time of the data packet is recorded; otherwise, the difference between the arrival time of the time-sensitive data at the current priority of this terminal at this moment and the arrival time at the previous moment is calculated, and the current node records the difference, and the maximum difference between any two nodes in the network is recorded as
[0023] Furthermore, the unit length of the time slot in the TDMA time slot is T p The following conditions need to be met:
[0024]
[0025] Constraints:
[0026]
[0027] in, Indicates the bandwidth required for the minimum packet length in the channel, represents the bandwidth required by the largest amount of data among all nodes; N represents the number of nodes participating in time slot allocation; N * Represents a positive integer.
[0028] Furthermore, the length of each node's network access time slot T is calculated at the node. B , unit time slot length T p After finding the corresponding node transmission time slot position, poll the TSN list. If there is data to be sent in the TSN list, schedule the TSN queue data for sending according to the first-in-first-out principle. After sending the data in the TSN queue, poll the non-TSN queue data to obtain the urgency information of all queues to be sent, and send them from high to low urgency. Queues with the same urgency send data according to the priority level. Data in the same queue is scheduled in a first-in-first-out manner.
[0029] Furthermore, the process of scheduling and sending TSN queue data and non-TSN queue data specifically includes the following steps:
[0030] Step 1: The TSN wireless node reads its own time information in each time slot to determine whether the current time slot belongs to the wireless node;
[0031] Among them, the TSN wireless node reads the identity corresponding to the time slot number in its own time slot table at the start time of each time slot to determine whether the current time slot belongs to the wireless node;
[0032] Step 2: If it is determined through the identity that the current time slot belongs to the wireless node, poll the TSN list;
[0033] Step 3: If it is detected that there is data waiting to be sent in the TSN list, it is determined whether the currently transmitted frame is a non-TSN frame. If so, the TSN frame is made to preempt the non-TSN frame resources to schedule the current data packet. If not, wait for the wired TSN frame scheduling to end before scheduling the current data packet.
[0034] Step 4: If no non-TSN data is currently being sent, a pop operation is performed from the head of the TSN list, and the amount of data packets taken each time does not exceed the queue byte threshold;
[0035] Step 5: When the data frame is dequeued, delete the dequeued queue from the updated circular list;
[0036] Step 6: When the TSN list is empty, polling scheduling starts from the non-TSN list, polling queues from the head of the non-TSN list, calculating the sending urgency of all non-TSN queues, and selecting the queue with the highest weight to send;
[0037] Step 7: Each time data is sent, the sending urgency of all queues is updated, thereby completing a polling schedule and returning to step 1.
[0038] The present invention establishes a data arrival model for wireless nodes in a network through a queue transmission time management mechanism, collects the size and position of the transmission time slot required by each wireless node by reporting the time slot demand to the wireless gateway, and designs a time slot interaction scheme based on TDMA to ensure that the node can access the gateway in time and can flexibly adjust the time slot division according to the different time slot demands of each node. The wireless gateway node allocates the transmission time slot of each node through a time slot dynamic control algorithm, and can adjust the time slot for network status changes in a relatively short time; thereby ensuring that the TSN flow in the wireless node terminal can be forwarded in time within a superframe period, ensuring the end-to-end delay demand of the TSN flow service. BRIEF DESCRIPTION OF THE DRAWINGS
[0039] Figure 1 It is a schematic diagram of an embodiment of the queue management scheduling method of the present invention;
[0040] Figure 2 is a flow chart of a time slot allocation method in an embodiment of the present invention;
[0041] Figure 3 is a schematic diagram of a spacecraft internal network scenario used in an embodiment of the present invention;
[0042] Figure 4 Schematic diagram of the superframe structure adopted by the present invention;
[0043] Figure 5 It is a schematic diagram of mapping TSN frame to wireless TDMA frame of the present invention;
[0044] Figure 6 It is a diagram of the periodic information table structure of the present invention;
[0045] Figure 7 It is a statistical flow chart of the node data model of the present invention;
[0046] Figure 8It is a flow chart of the dynamic urgency control scheduling algorithm of the present invention for scheduling data packets. DETAILED DESCRIPTION
[0047] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0048] The present invention proposes a method for allocating time slots in a wireless time-sensitive network in a spacecraft with wired and wireless integration, which specifically includes the following steps:
[0049] Mapping wired TSN frames in spacecraft internal data packets into wireless TDMA frames;
[0050] storing the wireless TDMA frame into a corresponding buffer queue according to the destination MAC address and QoS field of the wireless TDMA frame;
[0051] Under the control of the node queue management timer interrupt, the node collects the queue entry time period and data volume information of the time-sensitive data in the queue, as well as the data volume information of the non-time-sensitive data, and reports the queue status to the wireless gateway node in the corresponding time slot;
[0052] The wireless gateway node receives the relevant information of all nodes participating in the time slot allocation and calculates the total superframe length T in the next time slot table. sp , Node access time slot length T B , unit time slot length T p and the corresponding node transmission time slot positions.
[0053] Figure 1 Schematic diagram of an embodiment of the queue management scheduling method of the present invention, Figure 1 When the data packet arrives at the wireless output port of the TSN gateway from the wired side, it is first enqueued and managed. After the enqueuing management is completed, multiple queues Q1, Q2, ..., Q N , assign priorities to each queue and form a cache queue; after the queue is completed, various TDMA wireless frames are scheduled using a dynamic weight control scheduling algorithm.
[0054] Figure 2 is a flow chart of the queue management scheduling method in an embodiment of the present invention. Figure 2 , the queue management scheduling method specifically includes:
[0055] 101. Map the wired TSN frames in the spacecraft internal data packets into wireless TDMA frames.
[0056] Before describing how to map the wired TSN frames in the data packets inside the spacecraft into the wireless TDMA frames, the network scenario in the embodiment of the present invention is described first. Figure 3 is a schematic diagram of a spacecraft internal network scenario used in an embodiment of the present invention, such as Figure 3 There are sensor terminals inside the spacecraft to collect data such as the temperature and shell pressure of each cabin, and the user terminal transmits audio and control data. In order to ensure the transmission delay of time-sensitive services, the data processing center acts as a TSN controller to obtain the global status information of each node in the network and issue decisions. The sensor acquisition network includes multiple TSN switches, each of which can be connected to temperature sensors, telemetry sensors, video monitors, remote sensing cameras, data storage systems, onboard computers, TSN gateways, etc. The wireless nodes are networked in a TDMA manner, and each terminal and wireless gateway are reachable in one hop, forming a wireless TSN network. The TSN controller, as the master control node, is mainly responsible for network topology discovery, demand collection, and time slot table calculation and issuance. The internal subsystems of the gateway and the control node are connected in a wired Ethernet manner, and communicate with the corresponding control system through the TSN switch. The wired TSN architecture mainly includes data sending nodes (TSN Talker), data receiving nodes (TSN Listener) and TSN switches (TSN Switch). The TSN gateway should have wireless transmission and receiving functions, responsible for forwarding the data of each cabin to the control node and receiving the data transmitted by the control node to the terminal.
[0057] Figure 4 Schematic diagram of the superframe structure used in the embodiment of the present invention. Figure 4 In the present invention, channel resources are divided into superframe periods. Each superframe consists of two parts: time slot sending and data transmission. In the time slot sending stage, the control node calculates the time slot allocation results of each node and sends the time slot table by broadcasting beacon frames. After the time slot table is sent, the control center waits for a period of time, and the newly connected nodes compete to report the time slot request information. Then, in the data transmission stage, the wireless nodes transmit data in their respective time slots and report the time slot request information and sleep information of their own nodes.
[0058] Since the data volume of different terminals is different, if the time slot length is divided only according to the size of the terminal's own business volume, it may cause the time slot of a node to be too long, affecting the data transmission of other nodes, and the time slots in the network are severely fragmented. Therefore, the unit length of the time slot in the TDMA time slot in the network is T p The following conditions need to be met:
[0059]
[0060] stC1:
[0061] C2:
[0062] In the above formula, R space is the wireless link transmission rate, is the TSN data stream bandwidth of node i, which is expressed in time slot units T p The choice needs to consider all nodes in k times T p The minimum spare time under the transmission time is to ensure the channel utilization rate when the time slot is divided. Constraint 1 represents the length range that the minimum time slot unit needs to meet. Indicates the bandwidth required for the minimum packet length in the channel, represents the bandwidth required for the maximum amount of data among all nodes. Constraint 2 represents the time slot within k times the minimum unit time slot T p The transmission can be completed in the length of The size of the data.
[0063] The required time slot length of a node is related to the size of the data flow in the node, so the number of unit time slots required for data flow s in node i is C i,s is determined as follows:
[0064]
[0065] T g Indicates the length of the guard band between different node time slots, Indicates rounding up.
[0066] Under the above-mentioned design of time slot allocation, in an embodiment of the present invention, when a data packet arrives at the wireless output port of the TSN gateway from the wired side data through the TSN switch, the wired TSN frame priority is first mapped to the wireless TDMA frame.
[0067] Specifically, when the wired side data inside the spacecraft passes through the TSN switch and reaches the TSN gateway receiving port, the wired TSN frame is converted into an 802.11 wireless frame, the pcp priority field in the VLAN tag is mapped to the QoS field of the wireless TDMA frame, and the customized maximum survival of the data packet is mapped into the wireless TDMA frame in turn.
[0068] Figure 5 Schematic diagram of TSN frame to wireless TDMA frame mapping provided in an embodiment of the present invention. Figure 5 , where the wired TSN frame is an Ethernet frame with a VLAN tag, and the TDMA frame is a custom 802.11 frame. The VLAN tag (VLAN Tag) pcp field in the TSN frame is mapped to the Qos field of the wireless frame, and the custom maximum survival of the data packet is mapped to the wireless TDMA frame in turn.
[0069] The format of the Ethernet frame may refer to the existing 802.2 or 802.3 protocol, and the customized 802.11 frame includes an 802.11 header, a sequence number, a data length QoS field, a maximum survival time, a load, and a 32-bit CRC check.
[0070] 102. According to the arrival time of the statistical data packet, the arrival model of the data packet is updated, and the queue status data packet of the wireless node is constructed for reporting.
[0071] Figure 6 This is a diagram of the periodic information table in an embodiment of the present invention. In this embodiment of the present invention, when a data packet is transmitted to a wireless output port via wired transmission, the priority information of the wired data packet is extracted, the time when the data packet arrives at the wireless node is read, the data transmission cycle information of this traffic is calculated, a data arrival schedule is established, and the queue status information of this node is constructed and reported to the wireless gateway node.
[0072] Specifically, first determine the traffic type of the data frame based on the source address and service type fields in the wired data frame, then obtain the priority information in the VLAN field, put it into the corresponding data queue according to the priority information, and obtain the time information of the local clock at the same time, calculate the arrival cycle information of the current data packet, and count the sending information of non-time-sensitive services. If the non-time-sensitive service queue is not successfully sent in this superframe, the urgency meter of this queue will be increased accordingly according to the priority of this queue. When the sending is completed, the urgency meter of this queue will be cleared, and finally the corresponding data information of this node will be sent to the wireless gateway node in the form of a data packet.
[0073] 103. The wireless gateway node receives the reporting information of the wireless node, and divides the time slots according to the minimum average delay and the maximum time slot utilization.
[0074] Figure 7 is a statistical flow chart of the node data model in an embodiment of the present invention, such as Figure 7 The wireless gateway node analyzes all data packets arriving at this node to determine whether they are time slot demand reporting messages. If so, it is necessary to analyze the reported data packet to determine whether the data packet contains periodic information of time-sensitive data. If so, it is necessary to extract the relevant information of the time-sensitive data and record it. If there is no relevant information of the time-sensitive data, it is necessary to record the time slot demand in the reported data packet. After obtaining the time slot requirements of N nodes, the wireless gateway node calculates and sends the transmission time slots of the connected wireless nodes. It is necessary to wait for a period of time after the beacon time slot for the network access requirements of dormant nodes and mobile nodes in the network. Then the number of mobile nodes and dormant nodes under a single gateway is n, and the probability of node collision is p. n, the expected number of collisions for successful access to the network is k n , the node data retransmission waiting time is The random time selected in the range, then the time required for node j to complete receiving the beacon frame and finish sending the network access request is:
[0075]
[0076] In the above formula, IFS (Inter Frame Space) is the inter-frame space specified by 802.11, which is used to separate the data frames of the conversation between different nodes, and rand (0,2 2+n ) is the size of the backoff window selected by the node at the nth collision, B j / R space After the node successfully accesses the network, it transmits B j The time required to send a certain amount of data.
[0077] Therefore, when the control node covers N nodes, the beacon phase length is T B for:
[0078]
[0079] T g Indicates the length of the guard band between different node time slots, Indicates rounding up. p Indicates the unit length of the time slot in the TDMA time slot, which needs to meet the following conditions:
[0080]
[0081] stC1:
[0082] C2:
[0083] In the above formula, R space is the wireless link transmission rate, is the TSN data stream bandwidth of node i, which is expressed in time slot units T p The choice needs to consider all nodes in k times T p The minimum spare time under the transmission time is to ensure the channel utilization rate when the time slot is divided. Constraint 1 represents the length range that the minimum time slot unit needs to meet. Indicates the bandwidth required for the minimum packet length in the channel, represents the bandwidth required for the maximum amount of data among all nodes. Constraint 2 represents the time slot within k times the minimum unit time slot T p The transmission can be completed in the length of The size of the data.
[0084] 104. During the outbound scheduling, determine whether the current time slot belongs to the wireless node for queue sending scheduling, and schedule the data of each queue according to the queue status to ensure the end-to-end delay of time-sensitive data.
[0085] The present invention adopts an urgency weight control algorithm to schedule non-time-sensitive data packets. First, the urgency E of each non-time-sensitive queue is initialized. i , the urgency initialization value is 0, the queue weight that has not completed the transmission in the current time slot is increased according to the queue priority. The queues with priorities of 6 and 7 are time-sensitive queue data. Such queues are scheduled with the minimum waiting delay as the goal. Therefore, time-sensitive data does not consider urgency information. The queues with priorities of 0 and 1 are background traffic data and have no end-to-end transmission requirements. Therefore, the urgency value of the background traffic data queue is kept at 0. The remaining queue data is mainly multimedia data, including video and voice data. Such data has certain business successful transmission requirements. Therefore, the urgency calculation method when queue i is not successfully sent is as follows:
[0086]
[0087] Where p i is the priority size of queue i, f j It is the data flag of queue j, which is 1 if there is data and 0 if there is no data.
[0088] After the node obtains the sending time slot, it first polls the TSN list. If there is data to be sent in the TSN list, the TSN queue data is scheduled and sent according to the first-in-first-out principle. After the data in the TSN queue is sent, the non-TSN queue data is polled. First, the urgency information of all queues to be sent is obtained, and the urgency is sent from high to low. Queues with the same urgency send data according to the priority. Data in the same queue is scheduled in a first-in-first-out manner.
[0089] Based on the above analysis, the dynamic urgency scheduling algorithm of the present invention adopts the method of preferentially polling the TSN list. After polling the TSN list, based on the control of the urgency of the non-TSN queue, the non-TSN list is polled to fairly schedule the non-TSN flow, thereby ensuring the successful transmission rate of the non-TSN queue. The basic process of scheduling various data packets using the dynamic urgency scheduling algorithm in this embodiment may include the following:
[0090] Step 1: The TSN wireless node reads its own time information in each time slot to determine whether the current time slot belongs to the wireless node;
[0091] Among them, the TSN wireless node reads the identity corresponding to the time slot number in its own time slot table at the start time of each time slot to determine whether the current time slot belongs to the wireless node.
[0092] Step 2: If it is determined through the identity that the current time slot belongs to the wireless node, poll the TSN list;
[0093] Step 3: If it is detected that there is data waiting to be sent in the TSN list, it is determined whether the currently transmitted frame is a non-TSN frame. If so, the TSN frame is made to preempt the non-TSN frame resources to schedule the current data packet. If not, wait for the wired TSN frame scheduling to end before scheduling the current data packet.
[0094] In some embodiments, in order to ensure the transmission delay of TSN frames and seize non-TSN frame resources, the data packets in the non-TSN list being transmitted are split into 64 bytes, and then the TSN stream seizes the remaining byte resources, thereby ensuring that the TSN stream can be scheduled out first.
[0095] Step 4: If non-TSN data is not currently being sent, a queue pop operation is performed from the head of the TSN list, and the amount of data taken each time does not exceed the queue byte threshold.
[0096] Step 5: When the data frame is dequeued, delete the dequeued queue from the updated circular list;
[0097] From the constraints in the above analysis, it can be seen that the TSN flow data packets do not have internal queues, so the queue must be empty at this time, so this queue can be directly deleted from the new circular list.
[0098] Step 6: When the TSN list is empty, polling scheduling starts from the non-TSN list, and the queues are polled from the head of the non-TSN list. First, the sending urgency of all non-TSN queues is calculated, and the queue with the highest weight is selected for sending;
[0099] Step 7: Each time data is sent, the sending urgency of all queues is updated, thereby completing a polling schedule and returning to step 1.
[0100] Figure 8 A schematic diagram of a process for scheduling data packets using a dynamic urgency control scheduling algorithm in an embodiment of the present invention is given. Figure 8 , the scheduling process includes:
[0101] First, determine whether the current time slot belongs to the current wireless node. If it does, start polling the list to determine whether the TSN list is empty. If it is not empty, start polling the TSN list queue and select the queue to exit. Determine whether the currently transmitted frame is a non-TSN frame. If it is a non-TSN frame, seize the resources of the non-TSN frame and use TDMA to schedule the data packet. Otherwise, wait for the TSN frame scheduling to end before scheduling the data packet. After the scheduling is completed, delete the queue from the TSN list to complete this polling.
[0102] On the other hand, when the TSN list is empty, you can start polling the non-TSN list queues; determine the sending urgency of all current non-TSN queues, select the queue with the highest sending urgency for data transmission, and select the number of bytes to be sent based on the remaining time slot length. If the data in the queue cannot be sent in the remaining time slots, the data of this polling needs to be sent in pieces to ensure the utilization of the slots. After completing this polling, recalculate the sending urgency of all non-TSN queues and the number of bytes that can be transmitted in the next transmission. Determine whether the current queue is empty. If it is empty, delete the queue from the TSN list, otherwise wait for the next polling to complete this polling.
[0103] The present invention is mainly divided into time slot allocation management and queue dequeue scheduling; the present invention can obtain accurate node queue information through node queue management operations, and through the time slot allocation method of the minimum waiting delay algorithm, it can deterministically ensure that TSN flows are transmitted deterministically in wired and wireless converged networks, and fairly schedule other types of data packets to ensure the successful transmission rate of various services.
[0104] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.
Claims
1. A method for allocating time slots in a wireless time-sensitive network within a spacecraft with wired and wireless integration, characterized in that: The specific steps include: Mapping wired TSN frames in spacecraft internal data packets into wireless TDMA frames; storing the wireless TDMA frame into a corresponding buffer queue according to the destination MAC address and QoS field of the wireless TDMA frame; Under the control of the node queue management timer interrupt, the node collects the queue entry time period and data volume information of the time-sensitive data in the queue, as well as the data volume information of the non-time-sensitive data, and reports the queue status to the wireless gateway node in the corresponding time slot; The wireless gateway node receives the relevant information of all nodes participating in the time slot allocation and calculates the network access time slot length T of each node. B , unit time slot length T p And the corresponding node transmission time slot position, where the transmission time slot position allocated by the wireless gateway node to node i is expressed as: Among them, T i port is the time when the time-sensitive data of node i arrives at the wireless output port; T i trans is the time slot position allocated by the wireless gateway for node i; n is the number of nodes participating in the time slot allocation; If the unit length of the time slot in a TDMA time slot is T p , then the number of unit time slots required for data flow s in node i is C i,s It is expressed as: Among them, T g It represents the length of the guard band between time slots of node i, which is expressed as is the maximum synchronization error between any two nodes in the network. The calculation process includes judging whether the priority information and source address information of the received data packet are the first time to receive and send the time-sensitive data of this terminal at the current priority. If it is the first time to receive, the arrival time of the data packet is recorded. Otherwise, the difference between the arrival time of the time-sensitive data at this moment and the arrival time at the previous moment under the current priority of this terminal is calculated, and the current node records the difference. The maximum difference between any two nodes in the network is recorded as T prop is the propagation delay of electromagnetic waves; is the TSN data flow bandwidth of node i; R space is the wireless link transmission rate; The unit length of a time slot in a TDMA time slot is T p The following conditions need to be met: Constraints: in, Indicates the bandwidth required for the minimum packet length in the channel, represents the bandwidth required by the largest amount of data among all nodes; N represents the number of nodes participating in time slot allocation; N * Represents a positive integer.
2. The method for allocating time slots in a wireless time-sensitive network in a spacecraft with wired and wireless integration according to claim 1, characterized in that: Mapping the wired TSN frame in the data packet inside the spacecraft into the wireless TDMA frame includes: the wired TSN frame is an Ethernet frame with a VLAN tag, the TDMA frame is a custom 802.11 frame, and the custom 802.11 frame includes the use of an 802.11 header, a sequence number, a data length QoS field, a maximum survival time, a load, and a 32-bit CRC check; when the wired side data inside the spacecraft passes through the TSN switch and reaches the TSN gateway receiving port, the wired TSN frame is converted into an 802.11 wireless frame, the pcp priority field in the VLAN tag is mapped to the QoS field of the wireless TDMA frame, and the custom data packet maximum survival is mapped to the wireless TDMA frame in sequence.
3. The method for allocating time slots in a wireless time-sensitive network in a spacecraft with wired and wireless integration according to claim 1, characterized in that: The wireless TDMA frame is stored in the corresponding cache queue according to the destination MAC address and QoS field of the wireless TDMA frame. That is, if the QoS field of the TDMA frame is a specific value, that is, the data packet is time-sensitive data, it is stored in the TSN list; otherwise, that is, the data packet is non-time-sensitive data, then the data packet is stored in the non-TSN list.
4. The method for allocating time slots in a wireless time-sensitive network in a spacecraft with wired and wireless integration according to claim 1, characterized in that: The length of each node's network access time slot T is calculated at the node B , unit time slot length T p After finding the corresponding node transmission time slot position, poll the TSN list. If there is data to be sent in the TSN list, schedule the TSN queue data for sending according to the first-in-first-out principle. After sending the data in the TSN queue, poll the non-TSN queue data to obtain the urgency information of all queues to be sent, and send them from high to low urgency. Queues with the same urgency send data according to the priority level. Data in the same queue is scheduled in a first-in-first-out manner.
5. The method for allocating time slots in a wireless time-sensitive network in a spacecraft with wired and wireless integration according to claim 4, characterized in that: The process of scheduling and sending TSN queue data and non-TSN queue data specifically includes the following steps: Step 1: The TSN wireless node reads its own time information in each time slot to determine whether the current time slot belongs to the wireless node; Among them, the TSN wireless node reads the identity corresponding to the time slot number in its own time slot table at the start time of each time slot to determine whether the current time slot belongs to the wireless node; Step 2: If it is determined through the identity that the current time slot belongs to the wireless node, poll the TSN list; Step 3: If it is detected that there is data waiting to be sent in the TSN list, it is determined whether the currently transmitted frame is a non-TSN frame. If so, the TSN frame is made to preempt the non-TSN frame resources to schedule the current data packet. If not, wait for the wired TSN frame scheduling to end before scheduling the current data packet. Step 4: If no non-TSN data is currently being sent, a pop operation is performed from the head of the TSN list, and the amount of data packets taken each time does not exceed the queue byte threshold; Step 5: When the data frame is dequeued, delete the dequeued queue from the updated circular list; Step 6: When the TSN list is empty, polling scheduling starts from the non-TSN list, polling queues from the head of the non-TSN list, calculating the sending urgency of all non-TSN queues, and selecting the queue with the highest weight to send; Step 7: Each time data is sent, the sending urgency of all queues is updated, thereby completing a polling schedule and returning to step 1.
