Method for Transmitting Anisochronous Packet in Time Sensitive Wireless Network

Abstract

The present invention relates to a method for transmitting non-asynchronous packets between devices in a time-sensitive wireless network, comprising the steps of: determining whether the entire packet to be transmitted can be transmitted within the remaining time of a contention period; if the entire packet to be transmitted cannot be transmitted within the remaining time of the contention period, fragmenting the packet to be transmitted into packet fragments of a length that can be transmitted within the remaining time of the contention period; including packet fragment information in the packet fragments; and transmitting the packet fragments within the remaining time of the contention period.

Description

Technology Field

[0001] The present invention relates to wireless network technology, and more specifically, to an efficient method for transmitting non-isochronous packets in a time-sensitive wireless network. Background Technology

[0003] Time-Sensitive Network technology refers to network infrastructure technology capable of deterministic packet transmission of time-sensitive critical mission service traffic.

[0004] Here, deterministic packet transmission refers to the transmission of packets without the transmission delay time and transmission delay time deviation exceeding a limited range, and it is one of the critical requirements in the field of industrial automation. In particular, isochronous services provided through control loop systems must satisfy the requirements for very short transmission delay times (≤1ms) and transmission delay time deviations (≤1μs).

[0005] Meanwhile, time-sensitive networks can be connected and operated with various industrial application systems, such as control loop systems, process status reporting, CCTV, and unmanned transport vehicles, and the requirements to be satisfied may differ depending on the service characteristics provided by each application system.

[0006] For example, isochronous services provided by control loop systems require high levels of transmission delay and transmission delay deviation, whereas CCTV or automated guided vehicle services require relatively low levels of transmission delay and transmission delay deviation, and process status reporting services may not have any requirements regarding transmission delay and transmission delay deviation.

[0007] In time-sensitive wireless networks where multiple devices share a wireless channel to transmit packets from various types of services, the transmission of packets from a specific service may interfere with the transmission of packets from other services, ultimately degrading the quality of that service.

[0008] For example, isochronous service packets, where transmission delay and transmission delay deviation are critical performance metrics, are transmitted at a scheduled time by pre-scheduling their transmission times. If the transmission of a non-isochronous packet, which occurs before the scheduled time of the isochronous service packet, finishes later than planned, the transmission of the isochronous service packet may be delayed or fail to start at all. In such cases, the requirements for transmission delay time and transmission delay deviation may not be met, potentially leading to a degradation in application service quality or system operational errors.

[0009] If there is an isochronous service packet scheduled for transmission, the transmission of non-isochronous packets can be suspended until the transmission of the isochronous service packet begins in order to prevent transmission delays. However, in this case, no one can use the wireless channel until the transmission of the isochronous service packet begins, which ultimately leads to a problem where the efficiency of the entire system decreases.

[0010] Meanwhile, the background technology of the present invention is disclosed in Korean registered patent No. 10-0468606 (January 19, 2005). The problem to be solved

[0012] The present invention aims to solve the problems of the prior art described above and provides a non-isochronous packet transmission method that can increase the transmission efficiency of non-isochronous packets without causing a degradation in the quality of isochronous services in a time-sensitive wireless network. means of solving the problem

[0014] A method for transmitting isochronous packets according to some embodiments of the present invention, in a method for transmitting non-isochronous packets between devices in a time-sensitive wireless network, is characterized by comprising: a step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of a contention period; a step of, if the entire packet to be transmitted cannot be transmitted within the remaining time of the contention period, a step of fragmenting the packet to be transmitted into packet fragments of a length that can be transmitted within the remaining time of the contention period; a step of including packet fragment information in the packet fragments; and a step of transmitting the packet fragments within the remaining time of the contention period.

[0015] The present invention is characterized by further including a step of determining whether packet transmission is possible by comparing the remaining time of the contention period with the minimum time required for packet transmission, prior to the step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of the contention period.

[0016] In the present invention, the minimum time required for the packet transmission is characterized by representing the time for transmitting the packet header and error correction code.

[0017] The step of determining whether the entire packet to be transmitted according to the present invention can be transmitted within the remaining time of the competition interval is characterized by being performed by comparing the time required to transmit the entire packet to be transmitted with the remaining time of the competition interval.

[0018] The present invention is characterized in that, in the step of fragmenting the packet to be transmitted into packet fragments of a length that can be transmitted within the remaining time of the contention period, a packet fragment of the maximum size that can be transmitted within the remaining time of the contention period is generated.

[0019] The present invention is characterized by having a margin value applied to the packet fragment of the maximum size.

[0020] In the present invention, the packet fragment information is characterized by including a parameter indicating whether additional packet fragments exist; and a parameter indicating the order of the packet fragments.

[0021] In the present invention, the packet fragment information is characterized in that the parameter indicating the order of the packet fragment is not changed even when the packet fragment is retransmitted.

[0022] In the present invention, the packet fragment information is characterized by being included in the header of the packet fragment.

[0023] In the present invention, the time-sensitive wireless network is characterized by having a frame structure divided into a non-contention section for transmitting isochronous packets and a contention section for transmitting non-isochronous packets.

[0024] A method for transmitting non-isochronous packets according to some embodiments of the present invention comprises: a step of determining whether the entire non-isochronous packet can be transmitted within the remaining time of a contention period when a request for transmission of a non-isochronous packet occurs; a step of fragmenting the non-isochronous packet into a first packet fragment and a second packet fragment when the entire non-isochronous packet cannot be transmitted within the remaining time of the contention period; a step of transmitting the first packet fragment within the remaining time of the contention period; and a step of determining whether the entire second packet fragment can be transmitted within the remaining time of the subsequent contention period when a request for transmission of the second packet fragment occurs in a subsequent contention period, and performing fragmentation of the second packet fragment or transmission of the second packet fragment.

[0025] The present invention is characterized by further including the step of including packet fragment information in the first packet fragment before the step of transmitting the first packet fragment within the remaining time of the contention period.

[0026] In the step of fragmenting the above-mentioned non-isochronous packet of the present invention into a first packet fragment and a second packet fragment, the first packet fragment is characterized by being fragmented into a length that can be transmitted within the remaining time of the contention interval.

[0027] The step of performing fragmentation of the second packet fragment or transmission of the second packet fragment according to the present invention is characterized by including the step of fragmenting the second packet fragment into a third packet fragment and a fourth packet fragment and transmitting the third packet fragment if the entire second packet fragment cannot be transmitted within the remaining time of the subsequent contention period.

[0028] The step of performing fragmentation of the second packet fragment or transmission of the second packet fragment according to the present invention is characterized by including the step of transmitting the second packet fragment if the entire second packet fragment can be transmitted within the remaining time of the subsequent contention period.

[0029] A non-chronous packet transmission method according to some embodiments of the present invention is characterized by comprising: a step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of a contention period; a step of fragmenting the packet to be transmitted into packet fragments if the entire packet to be transmitted cannot be transmitted within the remaining time of the contention period; and a step of transmitting the packet fragments within the remaining time of the contention period.

[0030] The present invention is characterized by further including a step of including packet fragment information in the packet fragment before the step of transmitting the packet fragment within the remaining time of the contention period.

[0031] The present invention is characterized by further including the step of transmitting the packet to be transmitted if the entire packet to be transmitted can be transmitted within the remaining time of the competition interval. Effects of the invention

[0033] The non-isochronous packet transmission method according to the present invention has the effect of maximizing the utilization of the time allocated for non-isochronous traffic transmission by determining whether the entire non-isochronous packet can be transmitted within a contention interval and performing fragmentation.

[0034] The non-antichronous packet transmission method according to the present invention transmits non-antichronous packets within a contention section while ensuring that no interference occurs with the non-contention section, thereby enabling the transmission of non-antichronous traffic without interference or performance degradation regarding the transmission of isochronous traffic. Brief explanation of the drawing

[0036] FIG. 1 is an exemplary diagram showing the configuration of a time-sensitive wireless network according to one embodiment of the present invention. FIG. 2 is an exemplary diagram showing the wireless frame structure of a time-sensitive wireless network according to one embodiment of the present invention. Figure 3 is an example diagram illustrating a case where the quality of isochronous packet transmission is degraded due to the transmission of non-isochronous packets. Figure 4 is an example diagram illustrating an inefficient non-isochronous packet transmission method. FIG. 5 is a flowchart illustrating a non-asynchronous packet transmission method in a time-sensitive wireless network according to an embodiment of the present invention. FIG. 6 is an exemplary diagram illustrating non-asynchronous packet transmission of a non-asynchronous packet transmission method in a time-sensitive wireless network according to an embodiment of the present invention. Specific details for implementing the invention

[0037] Hereinafter, an embodiment of a non-asynchronous packet transmission method in a time-sensitive wireless network according to the present invention will be described with reference to the attached drawings. In this process, the thickness of lines or the size of components shown in the drawings may be exaggerated for clarity and convenience of explanation. Furthermore, the terms described below are defined considering their functions in the present invention, and these may vary depending on the intention or convention of the user or operator. Therefore, the definitions of these terms should be based on the content throughout this specification.

[0038] FIG. 1 is an exemplary diagram showing the configuration of a time-sensitive wireless network according to one embodiment of the present invention.

[0039] Referring to FIG. 1, a time-sensitive wireless network may include an access point (200, Access Point) and one or more terminals (100, End Device).

[0040] The access point (200) is a device responsible for managing a time-sensitive wireless network composed of multiple terminals (100), and can be connected to an application server or another network through a wired / wireless interface.

[0041] The terminal (100) is responsible for wirelessly transmitting and receiving data generated by application devices that provide specific services connected to a time-sensitive network, such as an Industrial Automation Controller (IAC), sensor, actuator, tablet, and AGV.

[0042] For example, data measured by a sensor can be transmitted to an industrial automation controller via an access point (200) through a terminal (100), and data generated from the industrial automation controller can be transmitted to a driving device to control the driving device. Additionally, video data captured by a tablet can be transmitted to a server responsible for a specific application service via the terminal (100) and the access point (200), and coordinate data generated from a server controlling an unmanned transport vehicle can be transmitted to the unmanned transport vehicle via the access point (200) and the terminal (100) to be used for position control of the unmanned transport vehicle.

[0043] The terminal (100) and the access point (200) may be referred to as wireless network devices.

[0044] In addition, both the terminal (100) and the access point (200) may be wireless LAN devices, and the wireless LAN device may include a medium access control (MAC) layer and a physical (PHY) layer according to the IEEE 802.11 standard.

[0045] The terminal (100) and the access point (200) may be referred to as nodes, and the terminal (100) that is not an access point may be referred to as a station.

[0046] The terminal (100) and the access point (200) may each include a control unit, a memory, and a transmission / reception device. The control unit may be composed of a processor. The processor may implement the operation of the non-aspective packet transmission method described later. Instructions for implementing such operation may be stored in memory.

[0047] The transmitting and receiving device can be implemented as a transceiver, etc., to transmit and receive wireless signals, and, for example, the physical layer of IEEE 802.11 can be implemented.

[0048] The processor and / or transceiver may include an Application-Specific Integrated Circuit (ASIC), other chipsets, logic circuits, and / or data processing devices. The memory may include Read Only Memory (ROM), Random Access Memory (RAM), flash memory, memory cards, storage media, and / or other storage devices. When the embodiment is implemented in software, the operation according to the present invention may be implemented as modules (processes, functions, etc.) that perform respective functions. The modules may be stored in memory and executed by the processor. The memory may be located inside or outside the processor and may be connected to the processor by various means.

[0049] Various types of application devices are connected to the time-sensitive wireless network to provide services, and accordingly, the transmission requirements for packets transmitted between the access point (200) and the terminal (100) may differ depending on the characteristics of each service.

[0050] For example, packets exchanged between sensors, actuators, and industrial automation controllers for the automation control of a specific manufacturing process are isochronous packets requiring a high level of periodicity and determinism, and there is a requirement that all packets must be transmitted or received within a limited delay time and delay time deviation.

[0051] On the other hand, while video data generated from tablets or data for position control of unmanned transport vehicles requires real-time transmission, these requirements are relatively low compared to isochronous packets and can be supported even in general wireless networks rather than time-sensitive ones. In the case of tablets, non-real-time data such as safety inspection results or inventory reports is transmitted in addition to video data. The data transmitted in these instances is best-effort packet, where delivery is the top priority and there are no time-related requirements.

[0052] In the present invention, all service packets that do not have requirements for limited delay time and delay time deviation, such as real-time or best-effort packets, are referred to as non-chronic packets.

[0053] FIG. 2 is an exemplary diagram showing the wireless frame structure of a time-sensitive wireless network according to one embodiment of the present invention.

[0054] As illustrated in FIG. 2, in a time-sensitive network, wireless frames can be divided into two segments to ensure the quality of service of isochronous packets.

[0055] The Contention Free Period (CFP) is a period for transmitting isochronous packets where data is transmitted through pre-allocated slots, and isochronous packets are transmitted without contention at predetermined times (e.g., slots).

[0056] On the other hand, the contention period (CP) is a period for transmitting non-asynchronous traffic, in which a method of acquiring resources through a competitive process and transmitting packets is applied. An access point (200) or terminal (100) that wishes to transmit data first acquires wireless resources through a competitive process and then transmits packets using the acquired wireless resources.

[0057] For example, in a competition section, an access point (200) or a terminal (100) may be allocated a slot to transmit packets based on multiple access technology by CSMA / CA (Carrier Sense Multiple Access / Collision Avoidance).

[0058] When transmitting non-asynchronous packets in such a contention period (i.e., when non-asynchronous packets that need to be transmitted during the contention period occur), the access point (200) or terminal (100) can perform an operation according to the non-asynchronous packet transmission method described later.

[0059] FIG. 3 is an example diagram illustrating a case where the quality of isochronous packet transmission is degraded due to the transmission of non-isochronous packets, and FIG. 4 is an example diagram illustrating an inefficient non-isochronous packet transmission method.

[0060] Figure 3 illustrates a case where the transmission of a non-achronous packet, which occurs before the end of the contention period, does not end within the contention period but encroaches upon the non-contention period. In this case, the transmission of an isochronous packet scheduled for the first slot of the non-contention period is delayed until the time when the transmission of the previously occurring non-achronous packet ends. If the transmission of the non-achronous packet ends at the time of the second slot of the non-contention period, the isochronous packet scheduled for transmission in the first slot cannot be transmitted and is discarded. Furthermore, due to the transmission delay occurring in the first slot, the transmission in the next slot may also be delayed, and eventually, transmission delays or interference may occur for all isochronous packets.

[0061] Figure 4 illustrates a case where, in order to prevent quality degradation of isochronous packets, the transmission of non-isochronous packets is delayed until the next contention period when transmission of such non-isochronous packets is required after a specific threshold point before the end of the contention period. In this case, delays in the transmission of isochronous packets can be prevented by delaying the transmission of non-isochronous packets until the next contention period. However, since packet transmission is intentionally stopped until the start of the non-contention period, the corresponding wireless resources may not be used and may be wasted, and the amount of wasted wireless resources may increase depending on the threshold point for determining the delay in transmission of non-isochronous packets.

[0062] In contrast, the non-asynchronous packet transmission method according to the present invention determines whether to transmit the packet based on the remaining time of the contention period when a non-asynchronous packet requiring transmission occurs during the contention period, and if it is determined that a portion of the packet can be transmitted during the remaining time of the contention period, uses a method of fragmenting and transmitting the packet to enable the transmission of non-asynchronous packets without interference with isochronous packets, and maximizes the utilization of wireless resources by making the most of the time allocated for non-asynchronous traffic transmission, thereby improving system efficiency.

[0063] FIG. 5 is a flowchart illustrating a non-asynchronous packet transmission method in a time-sensitive wireless network according to an embodiment of the present invention, and FIG. 6 is an example diagram illustrating non-asynchronous packet transmission of a non-asynchronous packet transmission method in a time-sensitive wireless network according to an embodiment of the present invention.

[0064] As illustrated in FIG. 5, when a non-asynchronous packet transmission procedure is initiated in a contention period, the access point (200) or terminal (100) [determines] the current remaining time (T) of the contention period. residual ) and the minimum time required for packet transmission (T tx_min Compares ) (S100). Since general packets and packet fragments according to the present invention include a header and an error correction code (e.g., CRC), the minimum time required for packet transmission may mean the time to transmit the header and the error correction code.

[0065] Current remaining time in the competition interval (T residual The minimum time (T) required for packet transmission tx_min If it is less than ) (example of S100), it means that there are no non-asynchronous packets available for transmission during the remaining time, so the current remaining time of the contention interval (T residual Terminates the non-isochronous packet transmission procedure regardless of the value.

[0066] Current remaining time in the competition interval (T residual The minimum time (T) required for packet transmission tx_min If it is greater than (No in S100) and there are non-asynchronous packets waiting to be transmitted (Yes in S110), the current remaining time in the contention interval (T residual ) and the time to transmit non-asyncal packets waiting for transmission (T tx_packet Compares ) (S120).

[0067] Current remaining time in the competition interval (T residual The time (T) for transmitting a non-asynchronous packet that is waiting to be transmitted tx_packet If it is smaller than (e.g., S120), it means that it is impossible to transmit the entire non-asynchronous packet during the remaining time, so the non-asynchronous packet is fragmented into a transmittable length (S130).

[0068] For example, the current remaining time (T) of the competition interval residual Considering ), a packet fragment of the maximum size that can be sent within that time can be generated. In some embodiments, since the packet fragment may include a header, transmitted data, and an error correction code, the current remaining time (T) of the contention interval residual A packet fragment containing data of the maximum size that can be sent can be generated within the time excluding the time for sending headers and error correction codes. That is, the maximum size can be determined by the data transmission speed and the time available to send the data.

[0069] In some embodiments, a margin value may be applied to the maximum size of the transmitted data to prevent transmission errors. For example, in the case where 20 bytes of data can be transmitted, a packet fragment can be generated that can transmit only 19 bytes of data by using a margin value of 1 byte.

[0070] In some embodiments, similar to applying a margin value to the transmitted data, the current remaining time of the contention interval and / or the current remaining time of the contention interval (T residual A margin value can be applied to the time excluding the time for transmitting headers and error correction codes from ).

[0071] In some embodiments, the current remaining time (T) of the competition interval residual The time remaining after subtracting the time for transmitting headers and error correction codes from ) is the current remaining time of the contention interval (T residual The minimum time required for packet transmission (T) in ) tx_min It can be a value obtained by subtracting ).

[0072] Then, packet fragment information is set in the header of the fragmented packet (S140).

[0073] Packet fragment information may include a parameter (More Fragment) used to indicate that the currently transmitted packet fragment is the last or only fragment, and a parameter (Fragment Number) indicating the sequence number of the packet fragment.

[0074] The parameter (More Fragment), used to indicate that the packet fragment currently being transmitted is the last or only fragment, is set to a first value (e.g., 1) if there is an additional (other) packet fragment corresponding to the current packet, and can be set to a second value (e.g., 0) if the current packet fragment is the last fragment corresponding to the packet or if the current packet fragment contains the entire packet. Since additional packet fragments may have existed at the time of the initial transmission of the packet fragment, but may have already been transmitted at the time of the retransmission of the packet fragment, More Fragment may be changed by considering whether there are currently additional packet fragments to be transmitted at the time of the retransmission of the packet fragment.

[0075] For the parameter (Fragment Number) representing the sequence number of a packet fragment, the Fragment Number of the first packet fragment is set to an initial value (e.g., 0), and can be increased by 1 for each subsequent packet fragment. The Fragment Number does not change even when the packet fragment is retransmitted.

[0076] Afterwards, the access point (200) or terminal (100) transmits a packet (packet fragment) (S150).

[0077] In subsequent steps, each step of FIG. 5 described above may be repeated; that is, the process of determining whether the entire packet (packet fragment) can be transmitted within the remaining time of the contention period for the packet (packet fragment) to be transmitted, and if the entire packet (packet fragment) cannot be transmitted, the process of re-fragmenting and transmitting the packet (packet fragment) may be repeated. This repetition may continue to be performed when the contention period is entered and there is a packet to be transmitted.

[0078] In the present invention, a packet fragment can also be considered as a type of packet to be transmitted.

[0079] Meanwhile, the receiving side can reassemble the received packet fragments by referring to the fragment information contained in the packet fragments. That is, by referring to the packet fragment information, it is determined whether the entire fragmented packet has been received, and if the entire fragmented packet has been received, it can be reassembled.

[0080] In some embodiments, when a request for transmission of an asynchronous packet occurs, it is determined whether the entire asynchronous packet can be transmitted within the remaining time of the contention period, and if the entire asynchronous packet cannot be transmitted within the remaining time of the contention period, the asynchronous packet is fragmented into a first packet fragment and a second packet fragment, and then the first packet fragment can be transmitted within the remaining time of the contention period.

[0081] If a transmission request for the second packet fragment occurs during a subsequent contention period, it is determined whether the entire second packet fragment can be transmitted within the remaining time of the subsequent contention period; if the entire second packet fragment cannot be transmitted within the remaining time of the subsequent contention period, the process of fragmenting the second packet fragment into a third packet fragment and a fourth packet fragment can be repeated. In this case, the third packet fragment is transmitted, and the operation of determining whether the fourth packet fragment can be transmitted during a subsequent contention period may be performed.

[0082] Meanwhile, if the entire second packet fragment can be transmitted within the remaining time of the subsequent contention period, it is configured to transmit the second packet fragment within the remaining time of the subsequent contention period.

[0083] Referring to Fig. 6, the transmission of the first non-asynchronous packet (Pkt. 1) of Fig. 6 is a case where the entire non-asynchronous packet can be transmitted within the remaining contention period. In this case, the non-asynchronous packet is transmitted in the conventional manner. However, to indicate that the currently transmitted non-asynchronous packet is an unprocessed, complete packet, both the More fragment parameter and the Fragment Number parameter are set to 0 and transmitted.

[0084] The second transmission in Fig. 6 is a case where it is impossible to transmit the entire non-asynchronous packet within the remaining contention period. In this case, the packet is fragmented into a length that can be transmitted during the remaining contention period, and then the first packet fragment (Pkt. 2-1) is transmitted. Since the packet fragment currently being transmitted is the first packet fragment and the second packet fragment is scheduled to be transmitted thereafter, the fragment information is set to (1, 0).

[0085] The third transmission in Fig. 6 is the transmission of a packet fragment that could not be transmitted in the previous contention period, and it is a case where it is impossible to transmit the entire packet fragment remaining within the contention period. In this case, as in the second transmission, the remaining packet fragment is fragmented again, and the fragment information is set to (1, 1) to transmit the corresponding packet fragment (Pkt. 2-2). The fragment information (1, 1) indicates that the packet fragment currently being transmitted (Pkt. 2-2) is the second packet fragment, and that the third packet fragment is scheduled to be transmitted thereafter.

[0086] The last transmission in Fig. 6 is the transmission of a packet fragment that could not be transmitted in the previous contention period, and it is possible to transmit the entire remaining packet fragment within the contention period. To indicate that the remaining packet fragment is the third packet fragment and the last packet fragment, the fragment information is set to (0, 2), and the entire remaining packet fragment is transmitted.

[0087] As such, the method for transmitting non-isochronous packets in a time-sensitive wireless network according to an embodiment of the present invention enables the transmission of non-isochronous traffic in a time-sensitive wireless network without interference or performance degradation regarding the transmission of isochronous traffic, and simultaneously maximizes the utilization of wireless resources by making maximum use of the time allocated for the transmission of non-isochronous traffic, thereby improving system efficiency.

[0088] Although the present invention has been described with reference to the embodiments illustrated in the drawings, this is merely illustrative, and those skilled in the art will understand that various modifications and equivalent alternative embodiments are possible therefrom. Accordingly, the technical scope of protection of the present invention should be determined by the following claims. Explanation of the symbols

[0090] 100: Access Point 200: Terminal

Claims

Claim 1 A method for transmitting non-asynchronous packets between devices in a time-sensitive wireless network, comprising: determining whether the entire packet to be transmitted can be transmitted within the remaining time of a contention period; if the entire packet to be transmitted cannot be transmitted within the remaining time of the contention period, fragmenting the packet to be transmitted into packet fragments of a length that can be transmitted within the remaining time of the contention period; including packet fragment information in the packet fragments; and transmitting the packet fragments within the remaining time of the contention period, wherein the packet fragment information includes a parameter indicating whether there is an additional packet fragment and a parameter indicating the order of the packet fragments, wherein the parameter indicating the order of the packet fragments is not changed even when the packet fragments are retransmitted, and the parameter indicating whether there is an additional packet fragment is changeable by considering whether there is currently an additional packet fragment to be transmitted when the packet fragments are retransmitted. Claim 2 A non-aspective packet transmission method according to claim 1, characterized by further including, prior to the step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of the contention period, a step of determining whether packet transmission is possible by comparing the remaining time of the contention period with the minimum time required for packet transmission. Claim 3 A non-aspective packet transmission method according to claim 2, characterized in that the minimum time required for the packet transmission indicates the time for transmitting the packet header and error correction code. Claim 4 A non-chronic packet transmission method according to claim 1, wherein the step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of the contention period is performed by comparing the time for transmitting the entire packet to be transmitted with the remaining time of the contention period. Claim 5 A non-asynchronous packet transmission method according to claim 1, characterized in that, in the step of fragmenting the packet to be transmitted into packet fragments of a length that can be transmitted within the remaining time of the contention period, a packet fragment of the maximum size that can be transmitted within the remaining time of the contention period is generated. Claim 6 A non-isochronous packet transmission method characterized in that, in claim 5, a margin value is applied to the packet fragment of the maximum size. Claim 7 delete Claim 8 delete Claim 9 A non-isochronous packet transmission method according to claim 1, wherein the packet fragment information is included in the header of the packet fragment. Claim 10 A method for transmitting non-isochronous packets according to claim 1, wherein the time-sensitive wireless network has a frame structure divided into a non-contention section for transmitting isochronous packets and a contention section for transmitting non-isochronous packets. Claim 11 When a request for transmission of an asynchronous packet occurs, a step of determining whether the entire asynchronous packet can be transmitted within the remaining time of the contention period; if the entire asynchronous packet cannot be transmitted within the remaining time of the contention period, a step of fragmenting the asynchronous packet into a first packet fragment and a second packet fragment; and a step of transmitting the first packet fragment within the remaining time of the contention period. A non-aspective packet transmission method comprising the step of determining whether the entire second packet fragment can be transmitted within the remaining time of the subsequent contention period when a transmission request for the second packet fragment occurs in the subsequent contention period, and performing fragmentation of the second packet fragment or transmission of the second packet fragment, and further comprising the step of including packet fragment information in the first packet fragment before the step of transmitting the first packet fragment within the remaining time of the contention period, wherein the packet fragment information includes a parameter indicating whether there is an additional packet fragment and a parameter indicating the order of the packet fragments, wherein the parameter indicating the order of the packet fragments is not changed even when the packet fragments are retransmitted, and the parameter indicating whether there is an additional packet fragment is changeable by considering whether there is currently an additional packet fragment to be transmitted when the packet fragments are retransmitted. Claim 12 delete Claim 13 delete Claim 14 A non-isochronous packet transmission method according to claim 11, wherein, in the step of fragmenting the non-isochronous packet into a first packet fragment and a second packet fragment, the first packet fragment is fragmented into a length that can be transmitted within the remaining time of the contention interval. Claim 15 A non-asynchronous packet transmission method according to claim 11, wherein the step of performing fragmentation of the second packet fragment or transmission of the second packet fragment includes, if the entire second packet fragment cannot be transmitted within the remaining time of the subsequent contention interval, fragmenting the second packet fragment into a third packet fragment and a fourth packet fragment and transmitting the third packet fragment. Claim 16 A non-asynchronous packet transmission method according to claim 11, wherein the step of performing fragmentation of the second packet fragment or transmission of the second packet fragment includes the step of transmitting the second packet fragment if the entire second packet fragment can be transmitted within the remaining time of the subsequent contention interval. Claim 17 A non-aspective packet transmission method comprising: a step of determining whether the entire packet to be transmitted can be transmitted within the remaining time of a contention period; a step of fragmenting the packet to be transmitted into packet fragments if the entire packet to be transmitted cannot be transmitted within the remaining time of the contention period; and a step of transmitting the packet fragments within the remaining time of the contention period, wherein, prior to the step of transmitting the packet fragments within the remaining time of the contention period, the method further comprises a step of including packet fragment information in the packet fragments, wherein the packet fragment information includes a parameter indicating whether there is an additional packet fragment and a parameter indicating the order of the packet fragments, wherein the parameter indicating the order of the packet fragments is not changed even when the packet fragments are retransmitted, and the parameter indicating whether there is an additional packet fragment is changeable by considering whether there is currently an additional packet fragment to be transmitted when the packet fragments are retransmitted. Claim 18 delete Claim 19 delete Claim 20 A non-asynchronous packet transmission method according to claim 17, characterized by further including the step of transmitting the packet to be transmitted if the entire packet to be transmitted can be transmitted within the remaining time of the competition interval.

Images