WO2024021859A1 - Procédés et appareil de transmission de données, support de stockage et produit-programme - Google Patents

Procédés et appareil de transmission de données, support de stockage et produit-programme Download PDF

Info

Publication number
WO2024021859A1
WO2024021859A1 PCT/CN2023/097876 CN2023097876W WO2024021859A1 WO 2024021859 A1 WO2024021859 A1 WO 2024021859A1 CN 2023097876 W CN2023097876 W CN 2023097876W WO 2024021859 A1 WO2024021859 A1 WO 2024021859A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
data transmission
time slice
sta
information
Prior art date
Application number
PCT/CN2023/097876
Other languages
English (en)
Chinese (zh)
Inventor
王智飞
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024021859A1 publication Critical patent/WO2024021859A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1221—Wireless traffic scheduling based on age of data to be sent
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
    • H04W74/0816—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision avoidance

Definitions

  • the embodiments of the present application relate to the field of communication technology, and in particular to a data transmission method, device, storage medium and program product.
  • the Carrier Sense Multiple Access with Collision Avoid (CSMA/CA) protocol is usually used to avoid multiple stations (Station, STA) transmitting data to the access point (Access) at the same time.
  • Point, AP Point, AP to send data, that is, the STA needs to detect whether the channel is idle before sending data. If it detects that the channel is idle, it will wait for a random period of time before sending data to the AP. Since the waiting time is random, the CSMA/CA protocol can effectively avoid conflicts when STAs send data at the same time to a certain extent, but it will cause a waste of network resources and a reduction in transmission efficiency in certain scenarios. .
  • Embodiments of the present application provide a data transmission method, device, storage medium and program product.
  • embodiments of the present application provide a data transmission method, including: receiving multiple requests to send data frames sent by multiple sites; sending data frames according to the requests to obtain time slice schedules corresponding to multiple sites Result: The time slice scheduling result is sent to all the stations, so that the stations perform data transmission according to the time scheduling result.
  • embodiments of the present application provide a data transmission method, including: sending a request to an access point to send a data frame; receiving a time slice scheduling result sent by the access point; and sending a data frame to the access point according to the time slice scheduling result.
  • the access point sends communication data.
  • embodiments of the present application provide a data transmission device, which includes at least one processor; at least one memory for storing at least one program; when at least one of the programs is executed by at least one of the processors Implement the data transmission method as described in the first aspect or the second aspect.
  • embodiments of the present application provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to perform the tasks described in the first aspect or the second aspect. data transmission method.
  • embodiments of the present application provide a computer program product, including a computer program or computer instructions, characterized in that the computer program or the computer instructions are stored in a computer-readable storage medium, and the processor of the computer device is configured to The computer-readable storage medium reads the computer program or the computer instructions, and the processor executes The computer program or the computer instruction causes the computer device to execute the data transmission method as described in the first aspect or the second aspect.
  • Figure 1 is a schematic diagram of a hidden terminal in a wireless network in related technologies
  • Figure 2 is a schematic flow chart of the method of applying RTS/CTS mechanism to solve hidden terminals
  • FIG. 3 is a schematic diagram of the WLAN system architecture provided by an embodiment of the present application.
  • Figure 4 is a flow chart of a data transmission method provided by an embodiment of the present application.
  • Figure 5 is a flow chart for generating data transmission time slices provided by an embodiment of the present application.
  • Figure 6 is a flow chart for verifying transmission data provided by an embodiment of the present application.
  • Figure 7 is a flow chart of a data transmission method provided by yet another embodiment of the present application.
  • Figure 8 is a module diagram of an example access point device in this application.
  • Figure 9 is a schematic flow chart of a data transmission method provided by an example of this application.
  • Figure 10 is a module diagram of another example site equipment of this application.
  • Figure 11 is a schematic flow chart of a data transmission method provided by another example of this application.
  • Figure 12 is a schematic structural diagram of a data transmission device provided by an embodiment of the present application.
  • the wireless channel has only one collision domain, for a specific AP, there can only be one STA transmitting data with it within its sending and receiving range at the same time.
  • the CSMA/CA protocol stipulates that before sending data, all STAs must wait for a short period of time (continue to listen) before sending the next frame. This period of time is commonly called the InterFrame Space (IFS).
  • IFS InterFrame Space
  • the length of the inter-frame interval depends on the type of frame the STA wants to send. High-priority frames need to wait for a shorter time, so they can be sent first, but low-priority frames have to wait for a longer time.
  • the media becomes busy, and the low-priority frame can only be sent later, thus reducing the chance of collision. .
  • this mechanism can effectively avoid conflicts caused by multiple STAs accessing the network, it also greatly wastes network resources to a certain extent.
  • FIG. 1 is a schematic diagram of a hidden terminal in a wireless network. As shown in the figure, there is one AP10 and two STAs, namely STA1 and STA2. The dotted line range around STA1 indicates the sending range of STA1, and the dotted line range surrounding STA2 indicates the sending range of STA2. It can be seen that the sending ranges of the two STAs do not overlap. Therefore, when the two STAs are sending data, they cannot be physically monitored. method to detect whether the other party has sent data, that is, the two STAs are each other's hidden terminals.
  • RTS/CTS Request To Send/Clear To Send
  • STA1 and STA2 will always mistakenly think that the channel is idle. Therefore, if STA1 and STA2 send data to AP 10 at the same time, a conflict will occur, causing AP 10 to be unable to receive data normally. Therefore, when the terminal is hidden, data packets cannot be delivered when the network performance is at its worst. In other words, the throughputs of STA1 and STA2 are both close to 0.
  • FIG. 2 is a schematic flow chart of the RTS/CTS mechanism in solving hidden terminals.
  • STA2 wants to send data to AP 10
  • it will first send a request to send an RTS data frame to AP 10. If there is no conflict at AP 10, that is, AP 10 successfully demodulates the RTS of STA2, AP 10 will send a CTS data frame allowed to be sent to STA2 after waiting for a certain period of time. Neither the RTS data frame nor the CTS data frame is encrypted.
  • the wireless channel is a broadcast channel
  • all STAs can receive and parse the information, so STA1 can also receive and parse the CTS information.
  • STA1 receives the CTS frame
  • STA1 will not send data packets to AP 10 during this period, thus solving the problem of hidden STA conflict.
  • the RTS/CTS mechanism also has its limitations. Because this mechanism is based on the CSMA/CA protocol, it still wastes a lot of resources in the process of competing for channels, such as the waste of backoff time caused by the backoff mechanism and the waiting time before sending packets. The waste and the waste of time to resend data packets when conflicts occur, etc.
  • embodiments of the present application provide a data transmission method, device, storage medium and program product.
  • the AP actively generates a time slice scheduling result for the STA by receiving and parsing the request data frame sent by the STA in advance, and assigns the time slice to the STA.
  • the scheduling results are sent to each STA, allowing the STA to transmit data within the specified time slice, reducing the waiting time of each STA before transmitting data, saving channel resources and improving transmission efficiency while avoiding conflicts.
  • the embodiments of this application can be applied to various site STAs. It is a device with wireless connection function and capable of providing voice and/or data connectivity to users. It can also be called a terminal device or user equipment (UE). , mobile station (MS), mobile terminal (mobile terminal, MT), etc.
  • UE user equipment
  • MS mobile station
  • MT mobile terminal
  • sites include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MID), wearable devices, virtual reality (VR) devices, augmented reality (augmented reality, AR) equipment, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, and smart grids Wireless terminals, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, vehicle-mounted equipment, etc.
  • the embodiments of this application can be applied to various access points AP, which are devices in communication systems that connect sites to wireless networks. They can also be called radio access network (radio access network, RAN) nodes (or devices) and base stations. wait.
  • access points are: gNB, transmission reception point (TRP), evolved Node B (eNB), radio network controller (radio network controller, RNC), Node B ( Node B, NB), base station controller (base station controller, BSC), base transceiver station (base transceiver station, BTS), Home base station (for example, home evolved NodeB, or home Node B, HNB), base band unit (base band unit, BBU), or Wi-Fi access point device, or home gateway device, or has the ability to connect the site to the wireless network Functional optical network unit (ONU), or it can also be called an ONU that inherits the function of a Wi-Fi access point, or other devices that can connect sites to wireless network functions, or other devices that can operate in a wireless environment Interface equipment working in.
  • ONU
  • the embodiments of this application can be applied to WLAN systems.
  • the WLAN system may include one or more APs and one or more STAs.
  • Figure 3 is a schematic diagram of the WLAN system architecture provided by the embodiment of the present application.
  • the WLAN system 100 in Figure 3 exemplarily includes an access point AP 110 and three STAs, namely a terminal 120, a terminal 130 and a terminal 140.
  • STAs each terminal is associated with AP 110 and needs to transmit data with AP 100.
  • the number of APs and STAs in the above WLAN system is only exemplary and does not constitute a limitation on the embodiments of the present application.
  • Figure 4 is a flow chart of a data transmission method provided by an embodiment of the present application.
  • the data transmission method at least includes but is not limited to steps S1000, S2000, and S3000.
  • Step S1000 Receive multiple request-to-send data frames sent by multiple sites.
  • one or more STAs connected to the AP need to actively send a request to send RTS data frame to the AP.
  • the AP is responsible for receiving the request to send RTS data frame actively sent by the STA.
  • the AP has a designated time period for receiving RTS data frames. Only within the time period of the RTS data frame specified by the AP, the STA can send RTS data. The frame is sent to the AP and received by the AP; if the STA finds that the current time is not within the time period of the RTS data frame specified by the AP, it needs to wait until the time period of the next RTS data frame specified by the AP before sending the RTS data frame.
  • Step S2000 Send data frames according to the request to obtain time slice scheduling results corresponding to multiple sites.
  • the AP parses the RTS data frames and extracts all required data.
  • the RTS data frame contains at least one of the following information: the identification of the STA (such as MAC address), the size of the data packet to be transmitted, the type of data to be transmitted (video, voice, text, etc.), the number of data packets to be transmitted, and STA processing capability information.
  • the AP calculates the data transmission time slice corresponding to the site and obtains the time scheduling result.
  • the time scheduling result includes the data transmission time slice corresponding to one or more sites.
  • the STA identifier is used to identify which STA needs to perform data transmission, so that when the AP feeds back the time slice scheduling result, it can feed back the time slice information to the corresponding STA.
  • the size of the data packet to be sent and the number of data packets to be transmitted are used by the AP to evaluate the time required for transmission. If the data packet is large or there are many data packets, a longer time slice may be allocated to the corresponding STA for data transmission. , if the data packet is small or there are few data packets, a shorter time slice may be allocated to the corresponding STA for transmitting data.
  • the type of data to be transmitted determines the priority of data transmission. For video data or audio data with high real-time requirements, the transmission priority may be higher than the priority of text data transmission.
  • the data priority can also be pre-set according to the needs of the scenario, so as to meet the data transmission requirements in specific application scenarios.
  • FIG. 5 is a flow chart for generating data transmission time slices provided by an embodiment of the present application, illustrating the generation process of data transmission time slices.
  • the data transmission time slice generation process includes at least steps S2100, S2200, and S2300.
  • Step S2100 Obtain weight parameters.
  • the time slice scheduling algorithm needs to fully consider the processing capability of the STA, the amount of data to be transmitted, and the type of data to be transmitted. Therefore, preset weight parameters corresponding to the above variables are obtained, and these weight parameters are used to make a comprehensive evaluation of each data to be transmitted by each STA. It is understandable that these weight parameters can be flexibly adjusted according to the different needs of different scenarios. For example, in scenarios with high real-time requirements for data transmission, the weight value corresponding to the data type to be transmitted can be configured larger, so that after calculating the evaluation results, those video data will be sent with higher priority to ensure real-time sex.
  • Step S2200 Perform weighted calculation on the site processing capability information, data volume information and data priority information according to the weight parameters to obtain the evaluation result.
  • R represents the evaluation result obtained by the final weighted calculation
  • A represents the evaluation value of the number of packets sent
  • B represents the priority evaluation value of the data packet
  • C represents the numerical evaluation value of the STA's processing capability
  • ⁇ 1 represents the weighting coefficient of the number of packets A
  • ⁇ 2 Represents the weighting coefficient of data packet priority B
  • eta 3 represents the weighting coefficient of STA processing capability C.
  • Step S2300 According to the evaluation results, obtain the data transmission time slice corresponding to the site.
  • STAs are ranked according to the evaluation results. If the number of STA sites to be transmitted is less than or equal to the preset quantity threshold, the amount of data to be transmitted is less than or equal to the preset data volume threshold, or the transmission time is less than or equal to the preset time threshold, then all STAs can Obtain the opportunity to send data, and the order of sending data is in descending order according to the evaluation value (or value) of the evaluation result, and the corresponding data transmission time slice is allocated according to the amount of data to be transmitted or the transmission time.
  • STAs are ranked according to the evaluation results. If the number of STA sites to be transmitted is greater than the preset quantity threshold, or the amount of data to be transmitted is greater than the preset data volume threshold, or the transmission time is greater than the preset time threshold, only some STAs may be able to obtain Opportunities to send data, and the STAs that have obtained the opportunity to send are sorted from large to small according to the evaluation results to obtain the order of data transmission, and allocate corresponding data transmission time slices based on the amount of data to be transmitted or the transmission time.
  • the number of sent RTS data frames can also be used as a variable to participate in the calculation, and a weight can be configured for it, so that the data of earlier STAs can be sent as soon as possible.
  • Step S3000 Send the time slice scheduling results to all stations, so that the stations can perform data transmission according to the time scheduling results.
  • the AP uses the data transmission time slices corresponding to multiple STAs as the time slice scheduling results and broadcasts them to all STAs associated with them, so that all STAs can receive and parse the time slice scheduling results, so that each STA All can know whether they have the opportunity to send and within what time they can send. This reduces the waiting time of each STA before transmitting data, saves channel resources and improves transmission efficiency while avoiding conflicts.
  • Figure 6 is a flow chart for verifying transmission data provided by an embodiment of the present application, as shown in the figure.
  • Step S4100 After receiving the communication data sent by the site, verify the data transmission time of the site according to the data transmission time slice corresponding to the site, and obtain the verification result.
  • the AP when the AP receives the communication data sent by the STA, it needs to verify the relevant information, mainly to determine whether the currently received STA data was transmitted within a specified time slice. If it is the current time slice, If the STA is allowed, the data is legally transmitted; if the STA is not allowed in the current time slice, the data is illegally transmitted. Verifying the validity of data is to ensure that the STA transmits data according to the AP's scheduling time, avoids data conflicts, maintains the order of data transmission, and improves data transmission efficiency.
  • Step S4200 Is the data transmission time consistent with the corresponding data transmission time slice?
  • the verification results are two possibilities, one is that the data transmission time is consistent with the corresponding data transmission time slice, that is, the data is legally transmitted; the other is that the data transmission time is inconsistent with the corresponding data transmission time slice, That is, illegally transmitted data.
  • Step S4300 Send communication data.
  • the AP sends the STA's data and then replies with a feedback result to the STA. If the data is received normally, the feedback result is ACK; if the data is received abnormally, the feedback result is NACK.
  • Step S4400 No processing of communication data.
  • the verification result is that the data transmission time is inconsistent with the corresponding data transmission time slice, it means that the current STA does not send data correctly according to the time schedule, and the AP does not process the received communication data.
  • This communication data may be cached or discarded directly.
  • Figure 7 is a flow chart of a data transmission method provided by an embodiment of the present application.
  • the data transmission method at least includes but is not limited to steps S5000, S6000, and S7000.
  • Step S5000 Send a request to send a data frame to the access point.
  • a STA with data transmission requirements sends an RTS data frame to the AP.
  • the data frame carries at least one of the following information: site identification information, data packet size information to be transmitted, number of data packets to be transmitted, data type to be transmitted, and site processing capability information.
  • Step S6000 Receive the time slice scheduling result sent by the access point.
  • the AP parses the information in the data frame based on the received RTS data frame, and performs calculations based on the preset time slice scheduling algorithm to obtain the data transmission time slice corresponding to each STA, and combines these The data transmission time slice is used as the time slice scheduling result and is broadcast to STAs in the domain.
  • the STA parses the broadcast packet and extracts the STA that obtained the time slice and the corresponding data transmission time slice information from the broadcast packet.
  • Step S7000 Send communication data to the access point according to the time slice scheduling result.
  • the STA information of the time slice obtained in the broadcast is consistent with the current STA information, it means that the STA can send data to the AP in the corresponding time slice; if the STA information of the time slice obtained in the broadcast is consistent with the current STA information, If the information of the current STA is inconsistent, it means that the current STA has not got the opportunity to send data and needs to wait for the next round of RTS data frame request. In the request phase, the RTS data frame is sent again. If the current STA obtains the time slice, it sends the data to be sent to the AP within the corresponding time slice allowed by the AP, and waits for the feedback result and data returned by the AP. If the STA does not obtain the time slice, it cannot send data to the AP to prevent occupying wireless information, ensure that the STA obtains the time slice exclusive resources, and improve wireless resource utilization.
  • each STA Before each STA prepares to send an RTS data frame, it also needs to determine whether the AP is allowed to receive RTS data frames at the current moment, that is, determine whether the access point is currently in the request phase, and obtain the judgment result. If the judgment result is that it is in the request phase, the STA can send the RTS data frame; if the judgment result is that it is not in the request phase, the STA needs to wait for the access point to enter the RTS data frame request phase.
  • Example 1 is the AP-based module structure and the corresponding data transmission method flow
  • Example 2 is the STA-based module structure and the corresponding data transmission method flow.
  • the scheduling time is divided into three time periods.
  • the first time period is mainly to receive the RTS data frames of each STA.
  • the AP performs overall calculation on the received RTS data frames of the STA.
  • a certain algorithm arranges the priority and time of each STA's packet sending, and the third time period broadcasts the scheduling results to all STAs.
  • the communication time is when the STA and AP that meet the scheduling conditions for communication send and receive data.
  • the AP device 300 has four modules, which are a receiving module 310, a sending module 320, a time slice scheduling module 330 and a processing module 340. Next, each module will be introduced respectively.
  • Receiving module 310 This module is responsible for receiving data packets from STAs. It mainly receives two aspects of data. On the one hand, it receives RTS data frames of all currently connected STAs. On the other hand, it receives data packets of STAs that have obtained communication time slices. . The STA reports the data information that the STA needs to send through the RTS data frame, and the scheduling time stage receiving module is responsible for receiving this information. When the STA meets the scheduling results and obtains the time slice, and needs to send data to the AP within the specified time, the receiving module receives the STA's data packet and processes the data.
  • Sending module 320 This module is responsible for sending data. It needs to send two aspects of data, broadcast the time slice scheduling result, and after receiving the data from the STA, reply to the STA to indicate that the packet data has been received. After the AP schedules the STA's packet sending order, it needs to broadcast the results. On the one hand, it tells the corresponding STA to obtain the corresponding time slice and can send data to the AP within the corresponding time slice. On the other hand, it tells other STAs that the AP in this time period Busy, the AP will not receive data sent by other STAs, and the next time the AP receives data. During the communication phase, after receiving the data sent by the STA, the AP replies with a confirmation message ACK or NACK to the STA, indicating whether the data is normal.
  • Time slice scheduling module 330 This module is responsible for AP channel time scheduling, which is mainly divided into two aspects of scheduling, one is the allocation of scheduling time, and the other is the scheduling of STA packet sending time.
  • Scheduling time is divided into RTS time, scheduling time, and broadcast time.
  • the RTS time period receives RTS requests from all STAs, the scheduling time period coordinates the received requests and obtains the allocation results, and the broadcast time broadcasts the allocation results.
  • Scheduling time RTS time T1 + calculation time T2 + broadcast time T3. The three times are dynamically adjusted. If there are fewer STAs currently connected, the RTS time will be shorter; if there are more STAs currently connected, more RTS time can be allocated.
  • the scheduling of packet sending time means that the AP parses the RTS data frame received from the STA, allocates the time slice according to the current situation of each STA, and then forwards the time slice allocation result to the sending
  • the module is broadcast to all STAs.
  • the time slice scheduling algorithm needs to comprehensively consider the situation of the AP and all STAs.
  • the AP not only needs to perform data services, but also needs to reserve a certain amount of time to communicate with other STAs other than the current STA, and needs to be updated in real time to ensure that each STAs have the opportunity to report RTS data frames.
  • the RTS data frame includes information such as the size, quantity and priority of the data packets to be sent by the STA.
  • the time scheduling module performs a weighted average of the RTS data of each STA, and then allocates the packet sending time to the specific STA according to the priority.
  • the communication time can consider the number and priority of the current STAs. If there are fewer STAs currently connected, the communication time can be allocated longer, and vice versa. If the priority of the current data packet is higher, the weighting can be appropriately increased during calculation. coefficient.
  • Processing module 340 This module is responsible for coordinating the contract sending module, receiving module and time slice scheduling module. Process the data received by the receiving module. If there is data to be sent to the sending module, transfer the sending data to the sending module, and hand over the RTS data frame to the time slice scheduling module.
  • Figure 9 is a schematic flowchart of a data transmission method provided in an example of this application. As shown in the figure, the data transmission method performed by the AP device includes at least steps S101 to S106.
  • Step S101 Monitor the RTS data frame of the STA
  • the STA connected to the AP needs to proactively report RTS data frames to the AP.
  • the AP is responsible for receiving the RTS data frames proactively reported by the STA.
  • Step S102 Parse the RTS data frame of the STA
  • RTS data contains at least one of the following information: STA identification (such as MAC address), the size of the data packet to be sent, the type of data (video, voice, text, etc.), the number of packets needed to be sent, and the processing capability information of the STA .
  • STA identification such as MAC address
  • the size of the data packet to be sent the size of the data packet to be sent
  • the type of data video, voice, text, etc.
  • the number of packets needed to be sent the processing capability information of the STA .
  • Step S103 Perform time slice scheduling based on the analysis results
  • the RTS data of all STAs are summarized and calculated, and the weighted average number of packets sent by each STA is calculated according to the time slice scheduling algorithm, and then the STA and STA sending data of the obtained time slice are obtained.
  • the time slice scheduling algorithm fully considers the processing capability of the STA, the number of data packets to be sent by the STA, and the data type.
  • R represents the result of the final weighted calculation
  • A represents the evaluation value of the number of packets sent
  • B represents the priority evaluation value of the data packet
  • C represents the numerical evaluation value of the STA's processing capability
  • eta 1 represents the weighting coefficient of the number of packets sent A
  • eta 2 represents the data.
  • the weighting coefficient of packet priority B, eta 3 represents the weighting coefficient of STA processing capability C.
  • the data type is used to evaluate the priority of the package. For example, video data has high real-time requirements and needs to be sent first. Obtain The priority of sending the package will be higher. Finally, a comprehensive evaluation is performed to obtain the STA that obtains the contract issuance time slice and the assigned contract issuance time.
  • Step S104 Broadcast the time scheduling result to the STA.
  • the scheduling result of step S103 is sent to all STAs in the form of broadcast.
  • the content of the broadcast includes the STA that obtains the time slice and the time the STA is allowed to send data. Then if the corresponding time slice arrives, the AP communicates with the STA in the corresponding time slice, and other STAs stop sending data to the AP.
  • Step S105 Transmit communication data with STA.
  • the AP receives the communication data of the STA that has obtained the time slice. After receiving the data, the AP verifies the STA information. If it is an STA allowed by the current time slice, the AP saves the data. If the received information If the data of the STA does not obtain the time slice, it will not be processed.
  • the STA's data will be sent, and then the result will be replied to the STA. If the data is received normally, an ACK will be replied. If the data is received abnormally, a NACK will be replied. At the same time, if there is return data that needs to be sent to STA, the data will be sent to STA.
  • the communication cycle between the AP and STA continues without waiting until the end of the time slice, which maximizes the utilization of the time slice.
  • Step S106 Carry out the next round of process.
  • the data transmission method provided in this example can improve channel resource utilization and data transmission efficiency based on high utilization of time slices.
  • the scheduling time is divided into two time periods.
  • the first time period is when the STA sends RTS data frames to the AP.
  • the second time period is when the STA receives the scheduling information broadcast by the AP.
  • the communication time is if the current STA is assigned the corresponding time slice, the STA and the AP communicate.
  • the STA device 400 has three modules, namely a receiving module 410, a sending module 420 and a processing module 430. Next, each module will be introduced respectively.
  • Receiving module 410 This module is responsible for receiving data packets sent by the AP. It mainly receives two types of data, broadcast packets from the AP during the scheduling period and reply packets from the AP during the communication phase. After the STA sends the RTS data frame to the AP during the scheduling time period, the receiving module starts waiting for the broadcast packet from the AP. In the communication phase, if the current STA obtains the communication time slice and sends the communication data to the AP, the receiving module is responsible for receiving the AP's reply packet.
  • Sending module 420 This module is responsible for sending data packets to the AP. Mainly sends two types of data, RTS data frame and communication data. During the scheduling period, the sending module is responsible for sending the STA's RTS data frame to the AP. In the communication phase, if the current STA obtains a communication time slice, the sending module is responsible for sending communication data to the AP.
  • Processing module 430 This module is responsible for processing the data received by the receiving module. If there is data to be sent to the AP, the processing module will transfer the data to the sending module.
  • Figure 11 is a schematic flowchart of a data transmission method provided by another example of this application.
  • Step C201 Determine whether data is sent?
  • Step C202 Is the monitoring AP busy?
  • the STA if the current STA has data to send, it needs to determine the status of the AP. If the current AP is in the RTS request phase, the STA will send the RTS data to the AP. If the current AP is not in the RTS request phase, it needs to wait for the AP to arrive. RTS requests can be sent only during the RTS request phase.
  • Step S201 Send RTS data frame.
  • the STA sends an RTS data frame to the AP.
  • the RTS data frame needs to contain the STA's identification information, the size of the data packet sent by the STA, the type of data, and the STA's processing capability information.
  • the STA's identification information is to identify the current STA to facilitate distinction from other STAs; the data packet size indicates the amount of data that the current STA needs to send; the data type is used to indicate the priority of the data to be sent; and the STA's processing capability information is used to indicate STA's processing capability. If the current STA's processing capability is strong, it can quickly process the data after receiving the data. If the STA's processing capability is weak, it will take a long time to process the data, resulting in a certain degree of time waste.
  • Step S202 Receive the time slice scheduling result broadcast packet of the AP.
  • the STA after the STA sends the RTS data frame to the AP, it then waits for the AP's time slice to schedule broadcast packets.
  • Step S203 Parse the time slice scheduling broadcast packet.
  • the STA after receiving the AP's time slice scheduling broadcast packet, the STA parses the broadcast packet and extracts the STA that obtained the time slice and the corresponding time slice information from the broadcast packet.
  • Step C203 Determine whether the time slice is obtained?
  • the STA information of the time slice obtained in the broadcast is consistent with the current STA information, it means that the STA can send data to the AP within the corresponding time slice; if the STA information of the time slice obtained in the broadcast is consistent with the current STA information, If the information of the STA is inconsistent, it means that the current STA has not been given the opportunity to send data and needs to wait for the next round of RTS request phase to send the RTS data frame again.
  • Step S204 Transmit communication data with the STA.
  • the current STA obtains the time slice, it will send the data to be sent to the AP within the corresponding time slice allowed by the AP, and wait for the return result and data from the AP; if the STA does not obtain the time slice, it cannot send data to the AP. Prevent the occupation of wireless information, ensure the acquisition of STA exclusive resources in time slices, and improve wireless resource utilization.
  • Step S205 Carry out the next round of process.
  • the data transmission method provided in this example can improve channel resource utilization and data transmission efficiency based on high utilization of time slices.
  • Figure 12 is a schematic structural diagram of a data transmission device provided by an embodiment of the present application. As shown in Figure 12, an embodiment of the present application also provides a data transmission device 500, including: at least one processor 502; at least one memory 501, Used to store at least one program; when at least one program is executed by at least one of the processors, the above data transmission method is implemented.
  • a data transmission device 500 including: at least one processor 502; at least one memory 501, Used to store at least one program; when at least one program is executed by at least one of the processors, the above data transmission method is implemented.
  • An embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions.
  • the computer-executable instructions are used to execute the data transmission method provided by any embodiment of the present application.
  • An embodiment of the present application also provides a computer program product, which includes a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device reads the computer program from the computer-readable storage medium.
  • Program or computer instructions the processor executes the computer program or computer instructions, so that the computer device performs the data transmission method provided by any embodiment of the present application.
  • the AP receives and parses the request sending number sent by the STA in advance. According to the data frame, it actively generates the time slice scheduling results for STA, and delivers the time slice scheduling results to each STA, so that the STA can transmit data in the specified time slice, reducing the waiting time of each STA before transmitting data. On the premise of avoiding conflicts, channel resources are saved and transmission efficiency is improved.
  • the division between functional modules/modules mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. Components execute cooperatively. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit . Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media).
  • computer storage media includes volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .
  • a component may be, but is not limited to, a process, processor, object, executable file, thread of execution, program or computer running on a processor.
  • applications running on the computing device and the computing device may be components.
  • One or more components can reside in a process or thread of execution, and the component can be localized on one computer or distributed between 2 or more computers. Additionally, these components can execute from various computer-readable media having various data structures stored thereon.
  • a component may, for example, be based on a signal having one or more data packets (eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals) Communicate through local or remote processes.
  • data packets eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Les modes de réalisation de la présente demande concernent des procédés et un appareil de transmission de données, un support de stockage et un produit-programme. Un procédé de transmission de données consiste à : recevoir une pluralité de trames de demande de transmission de données envoyées par une pluralité de stations (S1000) ; selon les trames de demande de transmission de données, obtenir un résultat de planification d'intervalle temporel correspondant à la pluralité de stations (S2000) ; et envoyer le résultat de planification d'intervalle temporel à toutes les stations, de telle sorte que les stations effectuent une transmission de données selon le résultat de planification temporelle (S3000).
PCT/CN2023/097876 2022-07-29 2023-06-01 Procédés et appareil de transmission de données, support de stockage et produit-programme WO2024021859A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210907486.1 2022-07-29
CN202210907486.1A CN117528820A (zh) 2022-07-29 2022-07-29 数据传输方法、装置、存储介质及程序产品

Publications (1)

Publication Number Publication Date
WO2024021859A1 true WO2024021859A1 (fr) 2024-02-01

Family

ID=89705306

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/097876 WO2024021859A1 (fr) 2022-07-29 2023-06-01 Procédés et appareil de transmission de données, support de stockage et produit-programme

Country Status (2)

Country Link
CN (1) CN117528820A (fr)
WO (1) WO2024021859A1 (fr)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101553005A (zh) * 2009-04-29 2009-10-07 重庆四联微电子有限公司 一种借助cts在csma/ca中加入时分机制的方法
CN102238749A (zh) * 2010-04-15 2011-11-09 杭州华三通信技术有限公司 一种信道竞争的方法及接入点设备
CN102461003A (zh) * 2009-06-17 2012-05-16 高通股份有限公司 多用户多输入多输出无线通信
WO2020173493A1 (fr) * 2019-02-28 2020-09-03 华为技术有限公司 Procédé de détermination de paramètre de pondération de formation de faisceau, et ap dans un wlan
CN111885738A (zh) * 2014-12-18 2020-11-03 华为技术有限公司 一种获取站点设备请求的方法、接入点设备及站点设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101553005A (zh) * 2009-04-29 2009-10-07 重庆四联微电子有限公司 一种借助cts在csma/ca中加入时分机制的方法
CN102461003A (zh) * 2009-06-17 2012-05-16 高通股份有限公司 多用户多输入多输出无线通信
CN102238749A (zh) * 2010-04-15 2011-11-09 杭州华三通信技术有限公司 一种信道竞争的方法及接入点设备
CN111885738A (zh) * 2014-12-18 2020-11-03 华为技术有限公司 一种获取站点设备请求的方法、接入点设备及站点设备
WO2020173493A1 (fr) * 2019-02-28 2020-09-03 华为技术有限公司 Procédé de détermination de paramètre de pondération de formation de faisceau, et ap dans un wlan

Also Published As

Publication number Publication date
CN117528820A (zh) 2024-02-06

Similar Documents

Publication Publication Date Title
US11903029B2 (en) Trigger frames adapted to packet-based policies in an 802.11 network preliminary class
US10674539B2 (en) System and method for managing contention in a wireless communications system
US11812467B2 (en) Emission of a signal in unused resource units to increase energy detection of an 802.11 channel
US10959266B2 (en) OFDMA contention method and access point
US8730905B2 (en) Transmission resource reservation scheme
US20210282183A1 (en) Communication method, apparatus, computer-readable medium and electronic device
US20160295612A1 (en) Information sending method and apparatus
WO2016188245A1 (fr) Système, station et procédé de négociation de canal
WO2016127348A1 (fr) Point d'accès (ap), station (sta), système de communication et procédé de transmission de données
US11350435B2 (en) Method for obtaining request of station, access point, and station
JP2017508405A (ja) マルチチャネルアクセス方法及び装置
EP3079432B1 (fr) Procédé de réservation de canaux et dispositif de communications
GB2540184A (en) Dynamic ajusting of contention mechanism for access to random resource units in an 802.11 channel
US20220116997A1 (en) Communication devices and methods
JP2023546232A (ja) 通信方法および装置
WO2024021859A1 (fr) Procédés et appareil de transmission de données, support de stockage et produit-programme
US20160119952A1 (en) Method and Network Node for Coordination of Channel Resources Between Transmissions
CN115226159A (zh) 基于空间复用机制的退避参数的确定方法以及装置
CN106488580B (zh) 竞争接入方法、竞争接入装置、站点及竞争接入系统
WO2017036258A1 (fr) Procédé d'accès avec concurrence, dispositif d'accès avec concurrence, station de base et système d'accès avec concurrence
CN117769047A (zh) 数据传输方法、装置、设备及存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23845072

Country of ref document: EP

Kind code of ref document: A1