[go: up one dir, main page]

WO2018166344A1 - Procédé et dispositif de programmation et de demande de données de liaison montante - Google Patents

Procédé et dispositif de programmation et de demande de données de liaison montante Download PDF

Info

Publication number
WO2018166344A1
WO2018166344A1 PCT/CN2018/077208 CN2018077208W WO2018166344A1 WO 2018166344 A1 WO2018166344 A1 WO 2018166344A1 CN 2018077208 W CN2018077208 W CN 2018077208W WO 2018166344 A1 WO2018166344 A1 WO 2018166344A1
Authority
WO
WIPO (PCT)
Prior art keywords
root
terminal
terminals
sequence
parameter
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2018/077208
Other languages
English (en)
Chinese (zh)
Inventor
陈鹏
杨博
杨超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of WO2018166344A1 publication Critical patent/WO2018166344A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • 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
    • H04W74/00—Wireless channel access
    • H04W74/04—Scheduled access

Definitions

  • the present application relates to the field of communications technologies, and in particular, to an uplink data scheduling request method and apparatus.
  • the Wireless Local Area Network adopts a central scheduling mechanism based on Point Coordination Function (PCF) and Hybrid Coordination Function (HCF).
  • the access point (AP) in the PCF/HCF periodically schedules uplink data of the terminal, and each scheduling period is divided into a Contention Free Period (CFP) and a Contention Period (CP).
  • CFP is the time when the central controller of the AP allocates channel resources.
  • the CP is the time for the terminal and the AP to freely contend for the channel resources.
  • CSMA/CA carrier Sense Multiple Access with Collision Avoidance
  • the uplink data of the terminal recorded in the pre-established scheduling list is scheduled in the CFP of each scheduling period.
  • the AP cannot know the uplink data to be sent in the terminal in the CFP, and thus the pair does not
  • the uplink data of the terminal is scheduled, and the terminal can only send the uplink data to the AP in a free-competitive manner in the CP after the CFP.
  • the sending delay of the uplink data of the terminal is the time of generating the uplink data. The length of time between the time when the uplink data is successfully transmitted within the CP. That is, when there is uplink data to be transmitted in the terminal and the AP cannot be known in time, the uplink data transmission delay of the terminal is large.
  • the CFP can be further divided into a Distributed Polling Protocol Period (DPPP) and a Real-time Traffic Downlink (RTDP).
  • DPPP Distributed Polling Protocol Period
  • RTDP Real-time Traffic Downlink
  • the AP can use the beacon frame to schedule the uplink data of all the associated terminals in the DPPP phase.
  • the terminal associated with the AP is the terminal accessing the AP.
  • the AP may carry a polling list in the Beacon frame, where the sending sequence of the uplink data of all the terminals associated with the AP is specified in the polling list, and each terminal that receives the Beacon frame may perform uplink data according to the sending sequence. send.
  • each terminal must be able to monitor the transmission status of the terminal that sent the uplink data before it to determine whether the current transmission can be performed.
  • the transmission of uplink data If a terminal fails to listen to the transmission status of the terminal that sent the uplink data before, the terminal will consider that the terminal that sent the uplink data before it has no uplink data to send, and the terminal will directly perform uplink data. Sending, in this case, the uplink data sent by the terminal is very likely to collide with the uplink data sent by other terminals.
  • the present application provides an uplink data scheduling request method and apparatus.
  • the technical solution is as follows:
  • the first aspect provides an uplink data scheduling request method, which is applied to an AP, where the method includes:
  • SR Scheduling Request
  • AID Association Identifier
  • the specified sequence is related to the SR sent by the M terminals to determine whether the specified sequence is included in the SR sent by the M terminals.
  • the N designated sequences are in one-to-one correspondence with the N terminals, and each of the N designated sequences is not related to each other;
  • the specified sequence When the specified sequence is included in the SR sent by the M terminals, it is determined that there is uplink data to be sent in the terminal corresponding to the specified sequence.
  • the AP may allocate an AID for each terminal associated with the AP, and for each terminal associated with the AP, the AID of the terminal is used to uniquely identify the terminal.
  • the AP when the AP receives the SRs sent by the M terminals of the N terminals, it is not necessary to demodulate the SRs sent by the M terminals, and only needs to store each of the N specified sequences.
  • the specified sequence the specified sequence is related to the SR sent by the M terminals, and the sequence of the SR sent by the M terminals is quickly determined, thereby not only saving the processing resources of the AP, but also improving The efficiency of judgment.
  • the AP may determine that the uplink data to be sent exists in the terminal corresponding to the specified sequence, thereby implementing the AP to the terminal that has the uplink data to be sent. The fast knowledge is obtained, thereby ensuring timely scheduling of the uplink data of the terminal by the AP, and reducing the transmission delay of the uplink data of the terminal.
  • the SRs sent by the M terminals are received at the same time.
  • the AP may determine whether there is uplink data to be sent in each of the M terminals, and the determining efficiency is high.
  • the method before sending the SR query frame to the N terminals associated with the AP, the method further includes:
  • the N terminals are selected from the other terminals.
  • the AP Since the terminal identified by the AID included in the scheduling list determines the terminal that has the uplink data to be sent for the AP, the AP does not need to send the SR query frame to the terminal identified by the AID included in the scheduling list, only from the scheduling list.
  • N terminals are selected among other terminals than the terminal identified by the included AID, and an SR inquiry frame may be transmitted to the N terminals.
  • the method before sending the SR query frame to the N terminals associated with the AP, the method further includes:
  • the parameter frame carries K first root parameters and K unit cyclic shift values, and the K first root parameters are in one-to-one correspondence with the K unit cyclic shift values, the K The first root parameter is used to generate K first Constant Envelope Zero Auto Correlation (CAZAC) root sequences, and the K first CAZAC root sequences are cyclically shifted to obtain the N A sequence is specified, the K being a natural number not less than one.
  • CAZAC Constant Envelope Zero Auto Correlation
  • the K first root parameters and the K unit cyclic shift values carried in the parameter frame are the SR generation parameters required by each of the N terminals.
  • the parameter frame further carries K first time offset values, the K first time offset values are in one-to-one correspondence with the K first root parameters, and for the K a first time offset value, where the first time offset value is used to indicate that the terminal that generates the SR by using the first root parameter corresponding to the first time offset value sends the The time of the SR, and the time indicated by the first time offset value is the time from the first time offset value of the time when the SR challenge frame is received.
  • the N terminals will receive the SR query frame at the same time. If the N terminals generate the SR by using the same first root parameter, under the indication of the first time offset value corresponding to the first root parameter, multiple terminals of the N terminals that have uplink data to be sent are Sending the SR to the AP at the same time; or, if the first time offset value corresponding to the first parameter used by the N terminals to generate the SR is the same, then under the indication of the first time offset value, A plurality of terminals that have uplink data to be sent in the N terminals will send the SR to the AP at the same time. At this time, the AP can determine that there are uplink data to be sent in multiple terminals at one time, thereby improving the determining efficiency.
  • the SR query frame further carries N second root parameters and N second cyclic shift values, the N second root parameters, the N second cyclic shift values, and the N terminals correspond to each other, and each of the N second root parameters is used to generate a second CAZAC root sequence of the corresponding terminal, and the second CAZAC of each of the N terminals After the root sequence is cyclically shifted, the corresponding specified sequence can be obtained.
  • the second root parameter and the second cyclic shift value corresponding to the terminal carried in the SR query frame are the SR generation parameters required by the terminal, and the The specified sequence corresponding to the terminal is obtained by cyclically shifting the second CAZAC root sequence of the terminal to the second cyclic shift value corresponding to the terminal.
  • the SR query frame further carries N third root parameters, where the N third root parameters are in one-to-one correspondence with the N terminals, and each of the N third root parameters The three parameters are used to generate a specified sequence corresponding to the corresponding terminal.
  • the third root parameter corresponding to the terminal carried in the SR query frame is an SR generation parameter required by the terminal.
  • the SR query frame further carries a fourth parameter and N third cyclic shift values, and the N third cyclic shift values are in one-to-one correspondence with the N terminals, and the fourth The root parameter is used to generate a third CAZAC root sequence, and the N CAZAC root sequence is cyclically shifted to obtain the N designated sequences.
  • the fourth root parameter carried in the SR query frame and the third cyclic shift value corresponding to the terminal are the SR generation parameters required by the terminal, and the The specified sequence corresponding to the terminal is obtained by cyclically shifting the third CAZAC root sequence to the third cyclic shift value corresponding to the terminal.
  • the SR query frame may further carry N second time offset values, where the N second time offset values are in one-to-one correspondence with the N terminals, and the N second time Each second time offset value of the offset value is used to indicate a time at which the corresponding terminal sends the SR, and for each of the N terminals, the second time offset value corresponding to the terminal indicates The time is the time from the second time offset value corresponding to the terminal from the time when the SR challenge frame is received.
  • the second aspect provides an uplink data scheduling request method, which is applied to a terminal, where the method includes:
  • the SR query frame carries an AID of N terminals associated with the AP, where N is a natural number not less than 1;
  • the SR of the terminal is generated, and the SR of the terminal is the N specified sequence corresponding to the terminal.
  • the N designated sequences are in one-to-one correspondence with the N terminals, and each of the N designated sequences is uncorrelated;
  • the SR query frame when the SR query frame is received, and the AID of the N terminals carried in the SR query frame includes the AID of the terminal, it may be determined that the N terminal includes the terminal, and if If there is uplink data to be sent, the SR of the terminal may be generated, and the SR of the terminal is sent to the AP. Since the SR of the terminal is only one sequence and does not include other additional data, the SR of the terminal can be quickly sent to the AP by consuming less channel resources.
  • the AP After receiving the SR sent by the terminal, the AP can quickly determine the uplink data to be sent in the terminal based on the SR sent by the terminal, thereby ensuring timely scheduling of the uplink data of the AP and then reducing the uplink data of the terminal. The transmission delay of the uplink data of the terminal is reduced.
  • the method before receiving the SR query frame sent by the AP, the method further includes:
  • the parameter frame carries K first root parameters and K unit cyclic shift values, and the K first root parameters and the K unit cyclic shift values are one by one
  • the K first root parameters are used to generate K first constant envelope zero autocorrelation CAZAC root sequences, and the K first CAZAC root sequences are cyclically shifted to obtain the N designated sequences.
  • the K is a natural number not less than 1;
  • the generating the SR of the terminal includes:
  • Determining, by the ith first root parameter of the K first root parameters, determining that the first CAZAC root sequence generated by the ith first root parameter is cyclically shifted by a corresponding unit cyclic shift value The step of obtaining the number of sequences until the number of cyclic shifts is not greater than the number of sequences;
  • the operation of generating the SR of the terminal may be: determining the AID of the terminal at the N terminals. Arranging position in the unit; multiplying the arrangement position by the unit cyclic shift value to obtain a first cyclic shift value; generating a first CAZAC root sequence based on the first root parameter; cyclically shifting the generated first CAZAC root sequence After the first cyclic shift value, the SR of the terminal is obtained.
  • the K first root parameters and the K unit cyclic shift values carried in the parameter frame are the SR generation parameters required by the terminal.
  • the parameter frame further carries K first time offset values, the K first time offset values are in one-to-one correspondence with the K first root parameters, and for the K a first time offset value, where the first time offset value is used to indicate that the terminal that generates the SR by using the first root parameter corresponding to the first time offset value sends the The time of the SR, and the time indicated by the first time offset value is the time from the first time offset value of the time when the SR challenge frame is received.
  • the SR query frame further carries N second root parameters and N second cyclic shift values, the N second root parameters, the N second cyclic shift values, and the N terminals correspond to each other, and each of the N second root parameters is used to generate a second CAZAC root sequence of the corresponding terminal, and the second CAZAC of each of the N terminals After the root sequence is cyclically shifted, a corresponding designated sequence can be obtained;
  • the generating the SR of the terminal includes:
  • the SR of the terminal is obtained.
  • the second root parameter and the second cyclic shift value corresponding to the terminal carried in the SR query frame are the SR generation parameters required by the terminal.
  • the SR query frame further carries N third root parameters, where the N third root parameters are in one-to-one correspondence with the N terminals, and each of the N third root parameters The three parameters are used to generate a specified sequence corresponding to the corresponding terminal;
  • the generating the SR of the terminal includes:
  • the third root parameter corresponding to the terminal carried in the SR query frame is the SR generation parameter required by the terminal.
  • the SR query frame further carries a fourth parameter and N third cyclic shift values, and the N third cyclic shift values are in one-to-one correspondence with the N terminals, and the fourth The root parameter is used to generate a third CAZAC root sequence, and the third CAZAC root sequence is cyclically shifted to obtain the N designated sequences;
  • the generating the SR of the terminal includes:
  • the SR of the terminal is obtained.
  • the fourth parameter carried in the SR query frame and the third cyclic shift corresponding to the terminal are SR generation parameters required by the terminal.
  • the SR query frame may further carry N second time offset values, where the N second time offset values are in one-to-one correspondence with the N terminals, and the N second time Each second time offset value of the offset value is used to indicate a time at which the corresponding terminal sends the SR, and for each of the N terminals, the second time offset value corresponding to the terminal indicates The time is the time from the second time offset value corresponding to the terminal from the time when the SR challenge frame is received.
  • an uplink data scheduling request apparatus is provided, and the uplink data scheduling request apparatus has a function of implementing the behavior of the uplink data scheduling request method in the first aspect.
  • the uplink data scheduling requesting apparatus includes at least one module, and the at least one module is configured to implement the uplink data scheduling request method provided by the foregoing first aspect.
  • an uplink data scheduling request apparatus where the uplink data scheduling request apparatus has a function of implementing the behavior of the uplink data scheduling request method in the second aspect.
  • the uplink data scheduling requesting apparatus includes at least one module, and the at least one module is configured to implement the uplink data scheduling request method provided by the foregoing second aspect.
  • a computer readable storage medium is provided, the instructions being stored in the computer readable storage medium, when executed on a computer, causing the computer to perform the uplink data scheduling request method of the first aspect described above.
  • a computer readable storage medium is provided, the instructions being stored in the computer readable storage medium, when executed on a computer, causing the computer to perform the uplink data scheduling request method of the second aspect.
  • a computer program product comprising instructions for causing a computer to perform the uplink data scheduling request method of the first aspect described above when executed on a computer is provided.
  • a computer program product comprising instructions for causing a computer to perform the uplink data scheduling request method of the second aspect described above when executed on a computer is provided.
  • the SR query frame may be sent to the N terminals associated with the AP, so that any one of the N terminals receives the SR query. Returns the SR after the frame. Since the SR is only a sequence and does not contain other additional data, the terminal can quickly return to the SR by consuming less channel resources.
  • the terminal When receiving the SRs sent by the M terminals of the N terminals, it is not necessary to demodulate the SRs sent by the M terminals, and only the designated sequence is specified for each of the stored N designated sequences.
  • the M terminals By performing related operations on the SRs sent by the M terminals, it is possible to quickly determine whether the specified sequence is included in the SRs sent by the M terminals, thereby saving processing resources and improving the efficiency of the determination. Then, when the specified sequence is included in the SR sent by the M terminals, it may be determined that the uplink data to be sent exists in the terminal corresponding to the specified sequence, thereby realizing fast knowledge of the terminal having the uplink data to be sent, and further The subsequent scheduling of the uplink data of the terminal is ensured, and the transmission delay of the uplink data of the terminal is reduced.
  • FIG. 1 is a schematic diagram of an implementation environment involved in an uplink data scheduling request method according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of an AP according to an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of a terminal according to an embodiment of the present invention.
  • 4A is a flowchart of an uplink data scheduling request method according to an embodiment of the present invention.
  • 4B is a schematic diagram of a format of an SR query frame according to an embodiment of the present invention.
  • 4C is a schematic diagram of a format of a trigger frame according to an embodiment of the present invention.
  • 4D is a schematic diagram of a format of a user information field according to an embodiment of the present invention.
  • 4E is a schematic diagram of a format of a public information domain according to an embodiment of the present invention.
  • 5A is a schematic structural diagram of a first uplink data scheduling request apparatus according to an embodiment of the present invention.
  • FIG. 5B is a schematic structural diagram of a second uplink data scheduling request apparatus according to an embodiment of the present disclosure.
  • 5C is a schematic structural diagram of a third uplink data scheduling request apparatus according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a fourth uplink data scheduling request apparatus according to an embodiment of the present invention.
  • FIG. 6B is a schematic structural diagram of a fifth uplink data scheduling request apparatus according to an embodiment of the present disclosure.
  • 6C is a schematic structural diagram of a first generation module according to an embodiment of the present invention.
  • 6D is a schematic structural diagram of a second generation module according to an embodiment of the present invention.
  • 6E is a schematic structural diagram of a third generation module according to an embodiment of the present invention.
  • FIG. 6F is a schematic structural diagram of a fourth generation module according to an embodiment of the present invention.
  • FIG. 1 is a schematic diagram of an implementation environment involved in an uplink data scheduling request method according to an embodiment of the present invention.
  • the implementation environment may include an AP 101 and at least one terminal 102, the AP 101 is associated with at least one terminal 102, and the AP 101 and the at least one terminal 102 can communicate via a wireless connection.
  • the AP 101 can be a wireless switch, a wireless router, etc.
  • the at least one terminal 102 can be a smart phone, a tablet computer, a notebook computer, etc., which is not limited in this embodiment of the present invention.
  • the AP 101 may include a central controller, and the central controller may periodically schedule uplink data of the at least one terminal 102 based on a central scheduling mechanism of the PCF/HCF. Specifically, in the CFP of each scheduling period, the central controller may schedule uplink data of the terminal recorded in the pre-established scheduling list. At this time, for each terminal recorded in the scheduling list, the central controller may The terminal sends a polling frame, and the terminal can send uplink data to the AP 101 after receiving the Poll frame. Within the CP of each scheduling period, each of the at least one terminal 102 can transmit uplink data to the AP 101 in a freely competitive manner.
  • the embodiment of the present invention provides an uplink data scheduling request method, so that the AP 101 can quickly know that there is uplink data to be sent in the terminal.
  • the operation performed by the AP 101 in the uplink data scheduling request method provided by the embodiment of the present invention may be performed by the central controller included in the AP 101 in an actual application, which is not limited by the embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of an AP according to an embodiment of the present invention.
  • the AP may be the AP 101 shown in FIG. 1.
  • the AP includes at least one processor 201, a communication bus 202, a memory 203, and at least one communication interface 204.
  • the processor 201 can be a general purpose central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more for controlling the execution of the program of the present application. integrated circuit.
  • CPU general purpose central processing unit
  • ASIC application-specific integrated circuit
  • Communication bus 202 can include a path for communicating information between the components described above.
  • the memory 203 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type that can store information and instructions.
  • the dynamic storage device can also be an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical disc storage, and a disc storage device. (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be Any other medium accessed by the AP, but is not limited thereto.
  • Memory 203 may be present independently and coupled to processor 201 via communication bus 202.
  • the memory 203 can also be integrated with the processor 201.
  • the communication interface 204 uses devices such as any transceiver for communicating with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), WLAN, and the like.
  • devices such as any transceiver for communicating with other devices or communication networks, such as Ethernet, Radio Access Network (RAN), WLAN, and the like.
  • RAN Radio Access Network
  • WLAN Wireless Local Area Network
  • processor 201 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG.
  • the AP may include multiple processors, such as processor 201 and processor 205 shown in FIG. Each of these processors can be a single core processor (CPU) or a multi-core processor (multi-CPU).
  • processors herein may refer to one or more devices, circuits, and/or processing cores for processing data.
  • the memory 203 is configured to store the program code 210 for executing the solution of the present application, and the processor 201 is configured to execute the program code 210 stored in the memory 203.
  • the AP can implement the uplink data scheduling request method provided by the embodiment of FIG. 4A below through the processor 201 and the program code 210 in the memory 203.
  • FIG. 3 is a schematic structural diagram of a terminal according to an embodiment of the present invention.
  • the terminal may be any one of at least one terminal 102 shown in FIG. 1.
  • the terminal includes at least one processor 301, a communication bus 302, a memory 303, and at least one communication interface 304.
  • Processor 301 can be a CPU, microprocessor, ASIC, or one or more integrated circuits for controlling the execution of the program of the present application.
  • Communication bus 302 can include a path for communicating information between the components described above.
  • the memory 303 can be a ROM or other type of static storage device that can store static information and instructions, RAM or other types of dynamic storage devices that can store information and instructions, or EEPROM, CD-ROM or other optical disk storage, optical disk storage. (including compact discs, laser discs, optical discs, digital versatile discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, or can be used to carry or store desired program code in the form of instructions or data structures and can be Any other medium accessed by the terminal, but is not limited thereto.
  • Memory 303 may be present independently and coupled to processor 301 via communication bus 302. The memory 303 can also be integrated with the processor 301.
  • Communication interface 304 using any type of transceiver, is used to communicate with other devices or communication networks, such as Ethernet, RAN, WLAN, and the like.
  • processor 301 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG.
  • the terminal can include multiple processors, such as processor 301 and processor 305 shown in FIG. Each of these processors can be a single-CPU or a multi-CPU.
  • a processor herein may refer to one or more devices, circuits, and/or processing cores for processing data.
  • the terminal may further include an output device 306 and an input device 307.
  • Output device 306 is in communication with processor 301 and can display information in a variety of ways.
  • the output device 306 can be a liquid crystal display (LCD), a light emitting diode (LED) display device, a cathode ray tube (CRT) display device, or the like.
  • Input device 307 is in communication with processor 301 and can receive user input in a variety of ways.
  • input device 307 can be a mouse, keyboard, touch screen device, or sensing device, and the like.
  • the memory 303 is configured to store program code 310 for executing the solution of the present application, and the processor 301 is configured to execute the program code 310 stored in the memory 303.
  • the terminal can implement the uplink data scheduling request method provided by the embodiment of FIG. 4A below through the processor 301 and the program code 310 in the memory 303.
  • FIG. 4A is a flowchart of an uplink data scheduling request method according to an embodiment of the present invention. Referring to Figure 4A, the method includes:
  • Step 401 The AP sends an SR query frame to the N terminals associated with the AP, where N is a natural number not less than 1.
  • the SR query frame carries the AIDs of the N terminals.
  • the AP may assign an AID to each terminal associated with the AP, and for each terminal associated with the AP, the AID of the terminal is used to uniquely identify the terminal.
  • the SR query frame is used to determine whether there is uplink data to be sent in each of the N terminals, and the SR query frame may be a data frame, a control frame, etc., for example, the SR query frame may be in the 802.11 standard.
  • the format of the SR query frame can be as shown in FIG. 4B.
  • the SR query frame carries a synchronization header
  • the terminal that subsequently receives the SR inquiry frame can complete time synchronization and frequency synchronization with the AP based on the synchronization header.
  • the N terminals may be determined first. Specifically, it is possible to determine, among all the terminals associated with the AP, other terminals than the terminal identified by the AID included in the stored scheduling list; and select N terminals from the other terminals.
  • the AP Since the terminal identified by the AID included in the scheduling list determines the terminal that has the uplink data to be sent for the AP, the AP does not need to send the SR query frame to the terminal identified by the AID included in the scheduling list, only from the scheduling list.
  • N terminals are selected among other terminals than the terminal identified by the included AID, and an SR inquiry frame may be transmitted to the N terminals.
  • N terminals When N terminals are selected from the other terminals, N terminals may be randomly selected from the other terminals; or N may be selected from the other terminals according to the order of priority of the other terminals from high to low. terminal. Of course, N terminals can be selected from the other terminals in other manners, which is not limited in this embodiment of the present invention.
  • the AP may set a priority for each terminal associated with the AP, and for each terminal associated with the AP, the priority of the terminal is used to indicate that there is uplink data to be sent in the terminal.
  • the probability that the terminal has a higher priority the higher the probability that the terminal has the uplink data to be sent, the lower the priority of the terminal, the lower the probability that the terminal has the uplink data to be sent. .
  • the AP sends an SR query frame to the N terminals, so that any one of the subsequent N terminals receives the SR query frame, and then returns the SR of the terminal to the AP, and the AP is based on the terminal.
  • the SR determines whether there is uplink data to be sent in the terminal. Therefore, in order to facilitate the SR of the terminal to generate an SR of the terminal after receiving the SR query frame, the AP needs to send the SR generation parameter to the SR.
  • the operation of the N terminals, specifically, the AP sending the SR generation parameters to the N terminals may be implemented in the following four manners.
  • the first mode before the AP sends the SR query frame to the N terminals, the parameter frame is broadcasted, and the parameter frame carries K first parameters and K unit cyclic shift values, and K first root parameters and K
  • the unit cyclic shift values correspond one-to-one, and the K first root parameters are used to generate K first CAZAC root sequences, and the K first CAZAC root sequences are cyclically shifted to obtain N designated sequences, and K is not less than The natural number of 1.
  • the K first root parameters and the K unit cyclic shift values carried in the parameter frame are the SR generation parameters required by each terminal of the N terminals, and the parameter frame may be a management frame, etc., for example,
  • the parameter frame may be obtained by adding a ZAC domain in a management frame such as a Beacon frame, an Association Response frame, and a Reassociation Response frame.
  • the ZAC domain may include K first root parameters, K. Units are cyclically shifted and so on.
  • the parameter frame may further carry K first time offset values, and the K first time offset values are in one-to-one correspondence with the K first root parameters, and for each of the K first time offset values a first time offset value, where the first time offset value is used to indicate a time at which the terminal that generates the SR by using the first root parameter corresponding to the first time offset value sends the SR, and the first time offset value
  • the indicated time is the time from the first time offset value to the time when the SR challenge frame is received. Since the AP sends the SR query frame to the N terminals at the same time, the N terminals will receive the SR query frame at the same time.
  • the N terminals If the N terminals generate the SR by using the same first root parameter, under the indication of the first time offset value corresponding to the first root parameter, multiple terminals of the N terminals that have uplink data to be sent are Sending the SR to the AP at the same time; or, if the first time offset value corresponding to the first parameter used by the N terminals to generate the SR is the same, then under the indication of the first time offset value, A plurality of terminals that have uplink data to be sent in the N terminals will send the SR to the AP at the same time. At this time, the AP can determine that there are uplink data to be sent in multiple terminals at one time, thereby improving the determining efficiency.
  • N designated sequences can be obtained, and the K first CAZAC root sequences can be set in advance, for example, the K first CAZAC root sequences can be Zadoff-Chu.
  • the (ZC) sequence, the Frank sequence, the Chirp sequence, the Pseudo-Noise (PN) sequence, and the like are not limited in the embodiment of the present invention.
  • each of the two specified sequences of the N designated sequences are not related to each other, and the N designated sequences are in one-to-one correspondence with the N terminals, and for each of the N terminals, the terminal corresponds to
  • the specified sequence is obtained by cyclically shifting a first CAZAC root sequence of the K first CAZAC root sequences to a first cyclic shift value corresponding to the terminal, and the first cyclic shift value corresponding to the terminal may be generated based on the generated
  • the unit cyclic shift value corresponding to the first parameter of the first CAZAC root sequence is obtained.
  • the two sequences are not related to each other, which means that the number of correlations between the two sequences is zero.
  • the number of correlations between the x sequence and the y sequence When the number of correlations between the x sequence and the y sequence is 0, it indicates that the x sequence and the y sequence are not related to each other.
  • the number of correlations between the x sequence and the y sequence is 1, the x sequence and the y sequence are indicated. the same.
  • the second mode carrying the N second root parameters and the N second cyclic shift values in the SR query frame, the N second root parameters, the N second cyclic shift values, and the N terminals one by one
  • each of the N second root parameters is used to generate a second CAZAC root sequence of the corresponding terminal
  • the second CAZAC root sequence of each of the N terminals can be cyclically shifted Get the corresponding specified sequence.
  • the second root parameter and the second cyclic shift value corresponding to the terminal carried in the SR query frame are the SR generation parameters required by the terminal, and the The specified sequence corresponding to the terminal is obtained by cyclically shifting the second CAZAC root sequence of the terminal to the second cyclic shift value corresponding to the terminal.
  • the SR query frame may further carry N second time offset values, the N second time offset values are in one-to-one correspondence with the N terminals, and each of the N second time offset values is second.
  • the time offset value is used to indicate the time when the corresponding terminal sends the SR, and for each of the N terminals, the time indicated by the second time offset value corresponding to the terminal is the time of receiving the SR query frame. The time from the second time offset value corresponding to the terminal.
  • the SR query frame can be obtained by expanding the Trigger frame, and the format of the Trigger frame can be as shown in FIG. 4C.
  • the format of each user information (User Info) field in the Trigger frame may be as shown in FIG. 4D.
  • the User Info field may include an AID field and a Trigger Dependent User Info field, and the AID field may include a terminal.
  • the AID, Trigger Dependent User Info field may include a second parameter corresponding to the terminal, a second cyclic shift value, a second time offset value, and the like.
  • the third mode carrying the N third root parameters in the SR query frame, the N third root parameters are in one-to-one correspondence with the N terminals, and each of the N third root parameters is used for the third root parameter. A specified sequence corresponding to the corresponding terminal is generated.
  • the third root parameter corresponding to the terminal carried in the SR query frame is an SR generation parameter required by the terminal.
  • the N query time frames may also carry N second time offset values.
  • the SR query frame can be obtained by expanding the Trigger frame, and the format of the Trigger frame can be as shown in FIG. 4C.
  • the format of each User Info field in the Trigger frame may be as shown in FIG. 4D.
  • the User Info field may include an AID field and a Trigger Dependent User Info field, and the AID field may include the AID of the terminal, and the Trigger Dependent User Info field may include The third parameter corresponding to the terminal, the second time offset value, and the like.
  • the fourth mode carrying the fourth parameter and the N third cyclic shift values in the SR query frame, the N third cyclic shift values are in one-to-one correspondence with the N terminals, and the fourth parameter is used to generate The third CAZAC root sequence, after the third CAZAC root sequence is cyclically shifted, can obtain N designated sequences.
  • the fourth root parameter carried in the SR query frame and the third cyclic shift value corresponding to the terminal are the SR generation parameters required by the terminal, and the The specified sequence corresponding to the terminal is obtained by cyclically shifting the third CAZAC root sequence to the third cyclic shift value corresponding to the terminal.
  • the N query time frames may also carry N second time offset values.
  • the SR query frame can be obtained by expanding the Trigger frame, and the format of the Trigger frame can be as shown in FIG. 4C.
  • the format of the Common Info field in the Trigger frame may be as shown in FIG. 4E, and the fourth root parameter may be included in the Trigger Dependent Common Info field included in the Common Info field.
  • the format of each User Info field in the Trigger frame may be as shown in FIG. 4D.
  • the User Info field may include an AID field and a Trigger Dependent User Info field, and the AID field may include the AID of the terminal, and the Trigger Dependent User Info field may include The third cyclic shift value, the second time offset value, and the like corresponding to the terminal.
  • any one of the N terminals may receive the SR query frame by using the following steps 402-404, and based on the received The SR query frame sends the SR of the terminal to the AP.
  • Step 402 When the terminal receives the SR query frame sent by the AP, and the AID of the N terminals included in the SR query frame includes the AID of the terminal, it is determined whether there is uplink data to be sent locally.
  • the AID of the N terminals carried in the SR query frame includes the AID of the terminal, it may be determined that the terminal includes the terminal, and if there is uplink data to be sent in the terminal, Then, the SR of the terminal needs to be sent to the AP, so the terminal needs to determine whether there is uplink data to be sent locally.
  • Step 403 When the terminal has local uplink data to be sent, the SR of the terminal is generated.
  • the terminal When the terminal has the uplink data to be sent locally, the terminal needs to send the SR of the terminal to the AP, so that the AP knows that there is uplink data to be sent in the terminal based on the SR sent by the terminal, so the terminal at this time
  • the SR of the terminal needs to be generated, and the SR of the terminal is a specified sequence corresponding to the terminal in the N designated sequences.
  • the AP sends the SR generation parameter to the N terminals, and the operation of the terminal to generate the SR of the terminal may be implemented in the following four manners.
  • the AID of the terminal is 8 in the AID of the N terminals, 8 is determined as the number of cyclic shifts; and for the first first root parameter of the K first root parameters, the first is determined.
  • the number of sequences that can be obtained after the first CAZAC root sequence generated by the first parameter is cyclically shifted by the corresponding unit cyclic shift value; assuming that the number of the sequence is 5, the number of cyclic shifts is 8 If the number of the sequence is greater than 5, the value 3 obtained by subtracting the number of cyclic shifts 8 from the number of the sequence 5 is determined as the number of cyclic shifts, and for the second first root parameter of the K first root parameters.
  • the cyclic shift number 3 is multiplied by the unit cyclic shift value corresponding to the second first root parameter to obtain a first cyclic shift value; Generating a first CAZAC root sequence by one parameter; cyclically shifting the generated first CAZAC root sequence After the first cyclic shift value, to obtain the terminal SR.
  • the first manner of generating the SR of the terminal at this time may be replaced by the following operation: determining the terminal Position of the AID in the AID of the N terminals; multiplying the arrangement position by the unit cyclic shift value to obtain a first cyclic shift value; generating a first CAZAC root sequence based on the first root parameter; After the first CAZAC root sequence cyclically shifts the first cyclic shift value, the SR of the terminal is obtained.
  • the second mode when the SR query frame carries N second root parameters and N second cyclic shift values, a second CAZAC root sequence is generated based on the second root parameter corresponding to the terminal; After the CAZAC root sequence cyclically shifts the second cyclic shift value corresponding to the terminal, the SR of the terminal is obtained.
  • the third mode when the SR query frame carries N third root parameters, the SR of the terminal is generated based on the third root parameter corresponding to the terminal.
  • the fourth mode when the fourth query parameter carries the fourth parameter and the N third cyclic shift values, the third CAZAC root sequence is generated based on the fourth root parameter; and the generated third CAZAC root sequence is cyclically shifted After the third cyclic shift value corresponding to the terminal, the SR of the terminal is obtained.
  • Step 404 The terminal sends the SR of the terminal to the AP.
  • the terminal may use the first time when generating the SR.
  • the time indicated by the first time offset value corresponding to one parameter sends the SR of the terminal to the AP.
  • the terminal may The terminal SR is sent to the AP at the time indicated by the second time offset value corresponding to the terminal.
  • the terminal can quickly send the SR of the terminal to the AP, and consume less channel resources in the SR transmission process of the terminal. .
  • any one of the N terminals may receive the SR query frame through the foregoing steps 402-404, and send the SR of the terminal to the AP based on the received SR query frame. Then, the AP may receive the SRs sent by the M terminals of the N terminals by using the following steps 405-407, and determine whether each of the M terminals is determined based on the SRs sent by the M terminals. There is uplink data to be sent. Where M is a natural number not less than 1 and not more than N.
  • Step 405 The AP receives the SR sent by the M terminals of the N terminals.
  • the SR generation parameter is sent by the first mode in the foregoing step 401, and the M terminals generate the SR by using the same first root parameter, or when the SR generation parameter is passed through the foregoing step 401.
  • the first mode is sent, and the first time offset value corresponding to the first parameter used when the M terminals generate the SR is the same, or when the SR generation parameter is the second mode in the foregoing step 401,
  • the third mode or the fourth mode is sent, and the second time offset values corresponding to the M terminals are the same, the SRs sent by the M terminals are received at the same time.
  • the SRs sent by the two terminals of the M terminals are not related to each other, the SRs sent by the M terminals do not interfere with each other, so that the AP can ensure that the AP quickly and accurately The SRs sent by the M terminals are received.
  • Step 406 The AP performs a correlation operation on the specified sequence of the N specified sequence and the SR sent by the M terminals to determine whether the specified sequence is included in the SR sent by the M terminals. .
  • the specified sequence is related to the SR sent by the M terminals, that is, the number of correlations between the specified sequence and the SRs sent by the M terminals is determined.
  • the number of correlations between the specified sequence and the SRs sent by the M terminals is 1, it is determined that the specified sequence is included in the SR sent by the M terminals.
  • the number of correlations between the specified sequence and the SRs sent by the M terminals is not 1, it is determined that the designated sequence is not included in the SR sent by the M terminals.
  • the embodiment of the present invention does not need to demodulate the SRs sent by the M terminals, and only needs to directly perform the correlation between the SRs sent by the M terminals and the specified sequence, so as to quickly determine the SRs sent by the M terminals. Whether or not the specified sequence is included, thereby not only saving the processing resources of the AP, but also improving the efficiency of the judgment.
  • the SRs sent by the M terminals are received at the same time, the SRs sent by the M terminals are superimposed into a new sequence, and the new sequence includes components of the SRs sent by each of the M terminals. If the SR sent by one of the M terminals is the same as the specified sequence, if the new sequence includes the component of the SR transmitted by each of the M terminals, the designated sequence and the new sequence The number of correlations between the two is still 1. In other words, in the case that the SRs sent by the M terminals are received at the same time, the embodiment of the present invention can accurately determine whether the designated sequence is included in the SR sent by the M terminals, thereby improving the subsequent determination of the AP by the AP. Whether there is accuracy of uplink data to be transmitted in each of the M terminals.
  • Step 407 When the specified sequence is included in the SR sent by the M terminals, the AP determines that there is uplink data to be sent in the terminal corresponding to the specified sequence.
  • the SR sent by the terminal to the AP is equivalent to the uplink sent by the terminal to the AP, where the AP determines that there is uplink data to be sent in the terminal, based on the SR sent by the terminal corresponding to the specified sequence.
  • the data scheduling request that is, the SR sent by the terminal to the AP is used to request the AP to schedule the uplink data of the terminal. Therefore, after determining that there is uplink data to be sent in the terminal, the AP may further add the AID of the terminal to the scheduling list, so that the AP may schedule the uplink data of the terminal in time based on the scheduling list. The transmission delay of the uplink data of the terminal is reduced.
  • the AP may send an SR query frame to the N terminals associated with the AP.
  • the terminal receives the SR query frame, and the AID of the N terminals carried in the SR query frame includes the AID of the terminal, it may be determined that the terminal includes the terminal, and if the terminal exists locally to be sent For the uplink data, the SR of the terminal may be generated, and the SR of the terminal is sent to the AP. Since the SR of the terminal is only a sequence and does not include other additional data, the terminal can quickly send the SR of the terminal to the AP by consuming less channel resources.
  • the AP When the AP receives the SRs sent by the M terminals of the N terminals, it is not necessary to demodulate the SRs sent by the M terminals, and only needs to specify a sequence for each of the stored N designated sequences.
  • the specified sequence is related to the SRs sent by the M terminals, so that the specified sequence can be quickly determined in the SR sent by the M terminals, thereby saving the processing resources of the AP and improving the judgment efficiency.
  • the AP may determine that the uplink data to be sent exists in the terminal corresponding to the specified sequence, thereby implementing the AP to the terminal that has the uplink data to be sent. The fast knowledge is obtained, thereby ensuring timely scheduling of the uplink data of the terminal by the AP, and reducing the transmission delay of the uplink data of the terminal.
  • FIG. 5A is a schematic structural diagram of an apparatus for scheduling an uplink data scheduling request according to an embodiment of the present invention.
  • the apparatus may be implemented as part or all of an AP by software, hardware, or a combination of the two.
  • the AP may be the AP shown in FIG. .
  • the apparatus includes a transmitting module 501, a receiving module 502, a determining module 503, and a first determining module 504.
  • the sending module 501 is configured to perform step 401 in the embodiment of FIG. 4A;
  • the receiving module 502 is configured to perform step 405 in the embodiment of FIG. 4A;
  • the determining module 503 is configured to perform step 406 in the embodiment of FIG. 4A;
  • the first determining module 504 is configured to perform step 407 in the embodiment of FIG. 4A.
  • the SRs sent by the M terminals are received at the same time.
  • the apparatus further includes a second determining module 505 and a selecting module 506.
  • a second determining module 505 configured to determine, in all terminals associated with the AP, other terminals than the terminal identified by the AID included in the stored scheduling list;
  • the selection module 506 is configured to select N terminals from other terminals.
  • the apparatus further includes a broadcast module 507.
  • the broadcast module 507 is configured to perform the first mode in step 401 in the embodiment of FIG. 4A.
  • the SR query frame further carries N second root parameters and N second cyclic shift values, and the N second root parameters and the N second cyclic shift values are in one-to-one correspondence with the N terminals.
  • Each of the N second root parameters is used to generate a second CAZAC root sequence of the corresponding terminal, and the second CAZAC root sequence of each of the N terminals is cyclically shifted to obtain a corresponding Specify the sequence.
  • the SR query frame further carries N third root parameters, and the N third root parameters are in one-to-one correspondence with the N terminals, and each of the N third root parameters is used to generate a corresponding The specified sequence corresponding to the terminal.
  • the SR query frame further carries a fourth parameter and N third cyclic shift values, the N third cyclic shift values are corresponding to the N terminals, and the fourth parameter is used to generate the third
  • the CAZAC root sequence after the third CAZAC root sequence is cyclically shifted, can obtain N designated sequences.
  • the SR query frame may be sent to the N terminals associated with the AP, so that any one of the N terminals receives the SR query frame and returns to the SR. Since the SR is only a sequence and does not contain other additional data, the terminal can quickly return to the SR by consuming less channel resources.
  • the terminal When receiving the SRs sent by the M terminals of the N terminals, it is not necessary to demodulate the SRs sent by the M terminals, and only the designated sequence is specified for each of the stored N designated sequences. By performing related operations on the SRs sent by the M terminals, it is possible to quickly determine whether the specified sequence is included in the SRs sent by the M terminals, thereby saving processing resources and improving the efficiency of the determination.
  • the specified sequence when included in the SR sent by the M terminals, it may be determined that the uplink data to be sent exists in the terminal corresponding to the specified sequence, thereby realizing fast knowledge of the terminal having the uplink data to be sent, and further The subsequent scheduling of the uplink data of the terminal is ensured, and the transmission delay of the uplink data of the terminal is reduced.
  • FIG. 6A is a schematic structural diagram of an apparatus for scheduling an uplink data scheduling request according to an embodiment of the present invention.
  • the apparatus may be implemented as part or all of a terminal by software, hardware, or a combination of the two.
  • the terminal may be the terminal shown in FIG. .
  • the apparatus includes a first receiving module 601, a generating module 602, and a transmitting module 603.
  • the first receiving module 601 and the generating module 602 are configured to perform step 402 and step 403 in the embodiment of FIG. 4A;
  • the sending module 603 is configured to perform step 404 in the embodiment of FIG. 4A.
  • the apparatus further includes a second receiving module 604.
  • the second receiving module 604 is configured to receive a parameter frame sent by the AP, where the parameter frame carries K first root parameters and K unit cyclic shift values, and K first root parameters and K unit cyclic shift values are one by one
  • K first parameters are used to generate K first constant envelope zero autocorrelation CAZAC root sequences
  • K first CAZAC root sequences can be cyclically shifted to obtain N designated sequences
  • K is not less than 1. Natural number;
  • the generating module 602 includes a first determining unit 6021, a second determining unit 6022, a determining unit 6023, a triggering unit 6024, a calculating unit 6025, a first generating unit 6026, and a first shifting unit 6027.
  • the first determining unit 6021, the second determining unit 6022, the determining unit 6023, the triggering unit 6024, the calculating unit 6025, the first generating unit 6026 and the first shifting unit 6027 are configured to perform the step 403 in the embodiment of FIG. 4A.
  • the SR query frame further carries N second root parameters and N second cyclic shift values, and the N second root parameters and the N second cyclic shift values are in one-to-one correspondence with the N terminals.
  • Each of the N second root parameters is used to generate a second CAZAC root sequence of the corresponding terminal, and the second CAZAC root sequence of each of the N terminals is cyclically shifted to obtain a corresponding Specified sequence
  • the generation module 602 includes a second generation unit 6028 and a second shift unit 6029.
  • the second generating unit 6028 and the second shifting unit 6029 are configured to perform the second mode in step 403 in the embodiment of FIG. 4A.
  • the SR query frame further carries N third root parameters, and the N third root parameters are in one-to-one correspondence with the N terminals, and each of the N third root parameters is used to generate a corresponding The specified sequence corresponding to the terminal;
  • the generation module 602 includes a third generation unit 6030.
  • the third generating unit 6030 is configured to perform the third mode in step 403 in the embodiment of FIG. 4A.
  • the SR query frame further carries a fourth parameter and N third cyclic shift values, the N third cyclic shift values are corresponding to the N terminals, and the fourth parameter is used to generate the third
  • the CAZAC root sequence after the third CAZAC root sequence is cyclically shifted, can obtain N designated sequences;
  • the generation module 602 includes a fourth generation unit 6031 and a third shift unit 6032.
  • the fourth generating unit 6031 and the third shifting unit 6032 are configured to perform the fourth mode in step 403 in the embodiment of FIG. 4A.
  • the SR query frame when the SR query frame is received, and the AID of the N terminals carried in the SR query frame includes the AID of the terminal, it may be determined that the N terminal includes the terminal, and if If there is uplink data to be sent, the SR of the terminal may be generated, and the SR of the terminal is sent to the AP. Since the SR of the terminal is only one sequence and does not include other additional data, the SR of the terminal can be quickly sent to the AP by consuming less channel resources.
  • the AP After receiving the SR of the terminal, the AP can quickly determine the uplink data to be sent in the terminal based on the SR of the terminal, thereby ensuring that the AP subsequently schedules uplink data of the terminal in time, thereby reducing the time.
  • the transmission delay of the uplink data of the terminal After receiving the SR of the terminal, the AP can quickly determine the uplink data to be sent in the terminal based on the SR of the terminal, thereby ensuring that the AP subsequently schedules uplink data of the terminal in time, thereby reducing the time. The transmission delay of the uplink data of the terminal.
  • the uplink data scheduling requesting device provided by the foregoing embodiment is only illustrated by the foregoing division of each functional module. In actual applications, the foregoing functions may be assigned different functions according to requirements. The module is completed, dividing the internal structure of the device into different functional modules to perform all or part of the functions described above.
  • the uplink data scheduling requesting apparatus and the uplink data scheduling requesting method are provided in the same embodiment. For details, refer to the method embodiment, and details are not described herein again.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a digital versatile disc (DVD)), or a semiconductor medium (for example, a solid state disk (SSD)). )Wait.
  • a magnetic medium for example, a floppy disk, a hard disk, a magnetic tape
  • an optical medium for example, a digital versatile disc (DVD)
  • DVD digital versatile disc
  • SSD solid state disk

Landscapes

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

Abstract

L'invention concerne un procédé et un dispositif de programmation et de demande de données de liaison montante, appartenant au domaine technique des communications. Le procédé consiste à : envoyer une trame de demande SR à N terminaux associés à un AP, la trame de demande SR contenant des AID des N terminaux ; recevoir des SR envoyées par M terminaux parmi les N terminaux ; pour chaque séquence spécifiée parmi les N séquences spécifiées stockées, exécuter une opération pertinente sur la séquence spécifiée et les SR envoyées par les M terminaux, de sorte à déterminer si les SR envoyées par les M terminaux comprennent la séquence spécifiée, la N séquence spécifiée correspondant aux N terminaux sur une base biunivoque, et toutes les deux séquences spécifiées parmi les N séquences spécifiées étant mutuellement non pertinentes ; et lorsque les SR envoyées par les M terminaux comprennent la séquence spécifiée, déterminer que des données de liaison montante devant être envoyées existent dans un terminal correspondant à la séquence spécifiée. La présente invention permet à l'AP de savoir rapidement sur quel terminal des données de liaison montante devant être envoyées existent. L'AP peut ainsi programmer les données de liaison montante du terminal d'une manière opportune.
PCT/CN2018/077208 2017-03-15 2018-02-26 Procédé et dispositif de programmation et de demande de données de liaison montante Ceased WO2018166344A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710154086.7 2017-03-15
CN201710154086.7A CN108633082B (zh) 2017-03-15 2017-03-15 上行数据调度请求方法及装置

Publications (1)

Publication Number Publication Date
WO2018166344A1 true WO2018166344A1 (fr) 2018-09-20

Family

ID=63522769

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/077208 Ceased WO2018166344A1 (fr) 2017-03-15 2018-02-26 Procédé et dispositif de programmation et de demande de données de liaison montante

Country Status (2)

Country Link
CN (1) CN108633082B (fr)
WO (1) WO2018166344A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111130726B (zh) 2018-10-31 2022-06-24 华为技术有限公司 一种上行资源请求的通信处理方法和相关设备

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080080472A1 (en) * 2006-10-03 2008-04-03 Pierre Bertrand Efficient Scheduling Request Channel for Wireless Networks
CN103561049A (zh) * 2013-09-05 2014-02-05 乐视网信息技术（北京）股份有限公司 一种处理终端调度请求的方法、系统及装置
WO2015054859A1 (fr) * 2013-10-17 2015-04-23 华为技术有限公司 Procédé, dispositif et équipement de réseau de transmission de données d'utilisateur

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101132628A (zh) * 2006-08-21 2008-02-27 北京三星通信技术研究有限公司 用于语音业务的调度请求传输方法及设备
KR20090006708A (ko) * 2007-07-12 2009-01-15 엘지전자 주식회사 스케줄링 요청 신호 전송 방법
PL2428091T3 (pl) * 2009-05-05 2016-06-30 Ericsson Telefon Ab L M Obsługa wyzwolenia żądania planowania
CN102790972B (zh) * 2011-05-18 2015-01-14 普天信息技术研究院有限公司 一种基于zc序列生成资源请求信道的空中信号的方法及装置
CN103220680A (zh) * 2012-01-20 2013-07-24 华为技术有限公司 一种实现调度请求的方法、装置和系统
US9450721B2 (en) * 2012-03-24 2016-09-20 Lg Electronics Inc. Method and apparatus for transmitting and receiving reference signal in wireless communication system
CN104684093A (zh) * 2014-12-30 2015-06-03 同济大学 基于cdm方式发送多个上行调度请求的传输方法和系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080080472A1 (en) * 2006-10-03 2008-04-03 Pierre Bertrand Efficient Scheduling Request Channel for Wireless Networks
CN103561049A (zh) * 2013-09-05 2014-02-05 乐视网信息技术（北京）股份有限公司 一种处理终端调度请求的方法、系统及装置
WO2015054859A1 (fr) * 2013-10-17 2015-04-23 华为技术有限公司 Procédé, dispositif et équipement de réseau de transmission de données d'utilisateur

Also Published As

Publication number Publication date
CN108633082B (zh) 2020-10-16
CN108633082A (zh) 2018-10-09

Similar Documents

Publication Publication Date Title
WO2018127239A1 (fr) Procédé et terminal d'accès aléatoire
JP2018152895A (ja) アップリンクおよびダウンリンク伝送のｗｌａｎ・ｏｆｄｍａ設計のためのシステムおよび方法
JP2023543828A (ja) パワー制御方法、装置及び端末機器
CN111586793B (zh) 一种通信方法、设备及计算机可读存储介质
US20150222527A1 (en) Method and system for implementing a priority for access points
CN108617005A (zh) 一种低功耗远距离组网方法
CN114246012B (zh) 一种确定随机接入资源的方法及装置
CN112449425B (zh) 一种通信方法和装置
KR20160035024A (ko) Wlan에서 ofdma 리소스 관리를 위한 시스템 및 방법
GB2490963A (en) Terminals in CSMA-CA group share seeds for pseudo-random back-off generation and maintain table of all group members' waiting times
WO2023134580A1 (fr) Procédés de transmission d'informations, appareil, terminal et dispositif côté réseau
WO2019095783A1 (fr) Procédé d'association, procédé d'instruction, et dispositif pour bloc de synchronisation et message de signalisation de planification de radiomessagerie
CN116528367A (zh) 信息传输方法、装置、网络侧设备及终端
CN112136350B (zh) 资源配置方法及装置
WO2020143808A1 (fr) Procédé et dispositif de transmission sans licence
WO2023083304A1 (fr) Procédé d'accès aléatoire, terminal et dispositif côté réseau
WO2018166344A1 (fr) Procédé et dispositif de programmation et de demande de données de liaison montante
CN114980340A (zh) 基于LoRa星型自组网络的多模式时隙分配方法及系统
JP2025504312A (ja) Ｕｅ間協調のための明示的要求設計
CN116489672A (zh) 设备感知方法及装置
WO2024061244A1 (fr) Procédé et appareil de détermination d'identifiant de processus harq, dispositif et support de stockage
JP2021082926A5 (fr)
CN115412504A (zh) 资源抢占的方法、装置及系统
KR102382700B1 (ko) 통신 장치 및 이의 패킷 전송 방법
CN115134048B (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: 18766840

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18766840

Country of ref document: EP

Kind code of ref document: A1