[go: up one dir, main page]

WO2016206284A1 - Procédé, dispositif, appareil et système d'accès aléatoire hétérogène basé sur la priorité - Google Patents

Procédé, dispositif, appareil et système d'accès aléatoire hétérogène basé sur la priorité Download PDF

Info

Publication number
WO2016206284A1
WO2016206284A1 PCT/CN2015/094417 CN2015094417W WO2016206284A1 WO 2016206284 A1 WO2016206284 A1 WO 2016206284A1 CN 2015094417 W CN2015094417 W CN 2015094417W WO 2016206284 A1 WO2016206284 A1 WO 2016206284A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
access
heterogeneous
terminals
time
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/CN2015/094417
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
Priority to CN201580080469.3A priority Critical patent/CN107637135B/zh
Publication of WO2016206284A1 publication Critical patent/WO2016206284A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery

Definitions

  • the present invention relates to the field of wireless communication technologies, and in particular, to a random access method, apparatus, device, and system based on heterogeneous priorities.
  • the medium access control (English: Media Access Control, MAC for short) protocol.
  • the MAC protocol can be divided into three categories: based on pre-allocated MAC protocol, contention-based random access MAC protocol and hybrid MAC protocol.
  • the contention-based random access MAC protocol has been the mainstream common MAC protocol.
  • the basic idea is that all terminals share the access channel, and the terminal that obtains the access channel resource is elected through a specific competition mechanism. If two or more terminals acquire the same access channel resources, a collision will occur.
  • Dynamic ACB Dynamic Access Class barring
  • the embodiments of the present invention provide a heterogeneous priority-based random access method, apparatus, device, and system, which reduce the network's delay default probability and ensure the QoS requirements of different priority services under the premise of reducing the collision probability. .
  • the embodiment of the present invention provides the following technical solutions:
  • a heterogeneous priority based random access method comprising:
  • the network information includes a combination of any one or more of the following: an estimated value of the number of terminals that need to access the network, and a number of terminals that the backlogged terminal obtains access channel resources The expected estimate, the estimated number of terminals to be backlogged, the isomorphic access class limit estimate of the ACB factor, and the estimate of the isomorphic contention window;
  • the terminal Transmitting the network information to the terminal, so that the terminal calculates its own heterogeneous priority according to the network information and the local information of the terminal, and performs access decision according to the heterogeneous priority of the terminal;
  • the heterogeneous priority includes : Heterogeneous access categories limit ACB factors or heterogeneous contention windows.
  • a heterogeneous priority based random access method comprising:
  • the network information includes any one or more of the following combinations: an estimated value of the number of terminals that need to access the network, and the backhaul terminal obtains the access channel resource The expected estimated value of the number of terminals, the estimated value of the number of terminals to be backlogged, the estimated value of the isomorphic access category limit ACB factor, and the estimated value of the isomorphic contention window;
  • the heterogeneous priority includes: heterogeneous access category restricting ACB factor or heterogeneous Competition window.
  • a random access device based on heterogeneous priority comprising:
  • an update module configured to update the network information according to the known access information;
  • the network information includes any one or more of the following combinations: an estimated value of the number of terminals that need to access the network, and the backhaul terminal obtains the access channel resource The expected estimated value of the number of terminals, the estimated value of the number of terminals to be backlogged, the estimated value of the isomorphic access category limit ACB factor, and the estimated value of the isomorphic contention window;
  • a sending module configured to send the network information to the terminal, so that the terminal calculates its own heterogeneous priority according to the network information and the local information of the terminal, and performs an access decision according to the heterogeneous priority of the terminal;
  • Heterogeneous priorities include: heterogeneous access categories that limit ACB factors or heterogeneous contention windows.
  • a heterogeneous priority based access point comprising a random access device as described above.
  • a random access device based on heterogeneous priority comprising:
  • a receiving module configured to receive network information that is updated by the access point according to the known access information;
  • the network information includes any one or more of the following combinations: an estimated value of the number of terminals that need to access the network, and a backlogged terminal Obtaining a desired estimated value of the number of terminals accessing the channel resource, an estimated value of the number of terminals to be backlogged, an estimated value of the isomorphic access class restriction ACB factor, and an estimated value of the isomorphic contention window;
  • An access module configured to calculate a heterogeneous priority according to the network information and the local information of the terminal, and perform an access decision according to the heterogeneous priority of the terminal; the heterogeneous priority includes: a heterogeneous access category Limit ACB factors or heterogeneous competition windows.
  • a heterogeneous priority based terminal comprising a random access device as described above.
  • a heterogeneous priority based random access system comprising: an access point and a terminal;
  • the access point is configured to: update the network information according to the known access information; send the network information to the terminal, so that the terminal calculates the heterogeneous priority according to the network information and the local information of the terminal, and according to the Its own heterogeneous priority for access decision;
  • the terminal is configured to: receive network information updated by the access point according to the known access information; calculate the heterogeneous priority according to the network information and the local information of the terminal, and perform access according to the heterogeneous priority of the access decision making;
  • the network information includes any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the back-end terminal obtains access channel resources, and a back-end terminal
  • the estimated value of the number, the isomorphic access category limits the estimate of the ACB factor and the estimated value of the isomorphic contention window;
  • the heterogeneous priorities include: heterogeneous access categories limit ACB factors or heterogeneous contention windows.
  • the access point updates the network information according to the known access information, and sends the network information to the terminal, so that the terminal according to the network information and
  • the local information of the terminal calculates its own heterogeneous priority and makes access decisions based on its own heterogeneous priority.
  • the heterogeneous priority of the terminal is calculated by combining the network information with the local information of the terminal, and the heterogeneous priority of each terminal is not the same, but is related to the network information of the access point and the local information of each terminal itself.
  • the heterogeneous priority calculated by combining the local information of the terminal can ensure the relative fairness between the terminals when accessing, and avoids that some terminals are accumulated in the system for a long time and still cannot compete for access channel resources.
  • the delay default probability can be reduced accordingly, and the QoS requirements of different priority services can be guaranteed under the premise of reducing the collision probability.
  • 1a is an application scenario diagram of a heterogeneous priority-based random access method according to the present application
  • FIG. 1b is a schematic flowchart diagram of an embodiment of a heterogeneous priority-based random access method according to the present application
  • FIG. 3 is a schematic flowchart of another method for updating network information according to known access information according to an embodiment of the present disclosure
  • FIG. 4 is a schematic flowchart of another method for updating network information according to known access information according to an embodiment of the present disclosure
  • FIG. 5 is a schematic flowchart of another method for updating network information according to known access information according to an embodiment of the present disclosure
  • FIG. 6 is a schematic flowchart of another method for updating network information according to known access information according to an embodiment of the present disclosure
  • FIG. 7 is a schematic flowchart of another method for updating network information according to known access information according to an embodiment of the present disclosure.
  • FIG. 8 is a schematic flowchart diagram of another embodiment of a heterogeneous priority-based random access method according to the present application.
  • FIG. 9 is a schematic flowchart diagram of another embodiment of a heterogeneous priority-based random access method according to the present application.
  • FIG. 10 is a schematic flowchart diagram of another embodiment of another heterogeneous priority-based random access method according to the present application.
  • FIG. 11 is a schematic flowchart diagram of still another heterogeneous priority-based random access method according to the present application.
  • FIG. 12 is a schematic flowchart diagram of still another heterogeneous priority-based random access method according to the present application.
  • FIG. 13 is a schematic structural diagram of a heterogeneous priority-based random access device according to the present application.
  • FIG. 14 is a schematic structural diagram of another heterogeneous priority-based random access apparatus according to the present application.
  • FIG. 15 is a schematic structural diagram of a heterogeneous priority based random access system according to the present application.
  • Embodiments of the present invention provide a random access method and system based on heterogeneous priorities.
  • the technical solution provided by the embodiment of the present invention can be applied to a wireless local area network (Wireless Local Area Network, WLAN for short), or can be applied to a communication network in which a base station communicates with a terminal.
  • WLAN Wireless Local Area Network
  • WLAN Wireless Local Area Network
  • the WLAN may include multiple basic service sets (English: Basic Service Set, BSS for short).
  • the network nodes in the basic service set are stations (English: Station, abbreviated as STA).
  • the site includes the access point class (abbreviation: AP).
  • AP access point class
  • Non-AP STA Non-AP STA
  • Each basic service set may contain one AP and multiple Non-AP STAs associated with the AP.
  • An access point class site AP is also referred to as a wireless access point, an access point, or a hotspot.
  • the AP is an access point for mobile users to enter the wired network. It is mainly deployed in the home, inside the building, and inside the campus. The typical coverage radius is tens of meters to hundreds of meters. Of course, it can also be deployed outdoors.
  • An AP is equivalent to a bridge connecting a wired network and a wireless network. Its main function is to connect the wireless network clients together and then connect the wireless network to the Ethernet.
  • the AP may be a terminal device or a network device with a WiFi (English: Wireless Fidelity) chip.
  • the AP may be a device supporting the 802.11ax system. Further, the AP may be a device supporting multiple WLAN technologies such as 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a.
  • Non-AP STA An non-access point class (English: NoneAccess Point Station, referred to as Non-AP STA), which can be a wireless communication chip, a wireless sensor, or a terminal of various wireless communication types.
  • mobile phone supporting WiFi communication function tablet computer supporting WiFi communication function, set-top box supporting WiFi communication function, smart TV supporting WiFi communication function, smart wearable device supporting WiFi communication function, and vehicle communication supporting WiFi communication function Devices and computers that support WiFi communication.
  • the non-access point class site may be a device supporting the 802.11ax standard. Further optionally, the site supports multiple WLAN formats such as 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a.
  • FIG. 1a is an application scenario diagram of a heterogeneous priority-based random access method according to the present application.
  • an access point class site AP is referred to as an access point
  • a non-access point class site Non-AP STA is referred to as a terminal
  • multiple terminals are generally associated with one access point
  • multiple The terminal selects access channel resources and accesses through the associated access point.
  • the system shown in FIG. 1a belongs to a typical WLAN deployment scenario, and includes one access point and three terminals, and the access point communicates with the terminal 1, the terminal 2, and the terminal 3, respectively.
  • FIG. 1b is a schematic flowchart diagram of an embodiment of a heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to an access point, and includes:
  • Step S100 Update network information according to known access information.
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset time period before the current time. The expected number of terminals successfully accessed and the number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resource may include, but is not limited to, any one or combination of the following: a sub-letter Channel resources, different access slot resources, and random access preamble resources.
  • the network information may include, but is not limited to, any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the backhaul terminal obtains access channel resources, Estimates of the number of backlogged terminals, isomorphic access categories limit the estimated value of the ACB factor and the estimated value of the isomorphic contention window.
  • Step S200 Send the network information to the terminal, so that the terminal calculates its own heterogeneous priority according to the network information and the local information of the terminal, and performs access decision according to its heterogeneous priority.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority may include, but is not limited to, heterogeneous access categories to limit ACB factors or heterogeneous contention windows.
  • the access point usually sends the updated network information to the terminal through the trigger frame.
  • a trigger frame it can be a physical layer trigger frame or a MAC layer trigger frame.
  • the structure is a null data packet (English: null data packet, abbreviated as: NDP) frame, only the physical layer preamble, and there is no MPDU (ie, MAC layer protocol data unit) part.
  • the physical layer trigger frame includes a traditional preamble (English: legacy preamble) and a high efficiency preamble (HE preamble), and the efficient preamble includes HE-SIG A, HE-SIG B, HE-STF, and HE. - LTF four parts.
  • the updated network information contained in the trigger frame may be, but is not limited to, HE-SIG B located in the HE preamble of the physical layer preamble.
  • the MAC layer trigger frame includes a physical layer preamble and an MPDU, wherein the MPDU further includes a MAC header (English: MAC header) and a payload (English: payload), and the updated network information included in the trigger frame may but not Limited to the payload located in the MPDU.
  • the MPDU further includes a MAC header (English: MAC header) and a payload (English: payload)
  • the updated network information included in the trigger frame may but not Limited to the payload located in the MPDU.
  • the access point may also send an access plan indication information to the terminal for indicating the access decision of the terminal.
  • the access scheme indication information may also be, but is not limited to, in the HE-SIG B of the HE preamble of the physical layer preamble of the physical layer trigger frame, or may be, but not limited to, the payload of the MPDU located in the MAC layer trigger frame.
  • the specific indication method of the access scheme indication information may be, but is not limited to, the manner shown in Table 1 below:
  • the access point updates the network information according to the known access information, and sends the network information to the terminal, so that the terminal according to the network information and the local information of the terminal Calculate its own heterogeneous priority and make access decisions based on its own heterogeneous priority.
  • the heterogeneous priority of the terminal is calculated by combining the network information with the local information of the terminal, and the heterogeneous priority of each terminal is not the same, but is related to the network information of the access point and the local information of each terminal itself.
  • the heterogeneous priority calculated by combining the local information of the terminal can ensure the relative fairness between the terminals when accessing, and avoids that some terminals are accumulated in the system for a long time and still cannot compete for access channel resources.
  • the delay default probability can be reduced accordingly, and the QoS requirements of different priority services can be guaranteed under the premise of reducing the collision probability.
  • FIG. 2 it is a schematic flowchart of a method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 when the network information includes an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals that the backhaul terminal obtains the access channel resource, step S100 includes:
  • Step S101 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S102 If the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold, increase the estimated number of terminals that need to access the network, and increase the number of terminals that are backlogged.
  • Step S103 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • Step S104 If the number of collisions of the terminal in the preset time period before the current time is less than or equal to the second threshold, reduce the estimated number of terminals that need to access the network, and reduce the number of terminals that are backlogged.
  • Step S105 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold value and greater than the second threshold value, according to the successful access in the preset time period before the current time
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal
  • FIG. 3 is a schematic flowchart diagram of another method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 when the network information includes an estimated value of the number of terminals that need to access the network and an estimated value of the number of terminals to be backlogged, step S100 includes:
  • Step S111 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S113 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • Step S114 If the number of collisions of the terminal in the preset time period before the current time is less than or equal to the second threshold, reduce the estimated number of terminals that need to access the network, and reduce the number of terminals that are backlogged.
  • Step S115 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold value and greater than the second threshold value, according to the successful access in the preset time period before the current time
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal
  • FIG. 4 is a schematic flowchart diagram of another method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 includes:
  • Step S121 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S122 If the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold, reduce the estimated value of the isomorphic access category limit ACB factor, and increase the backend of the backlogged terminal.
  • Step S123 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • Step S124 If the number of collisions of the terminal in the preset time period before the current time is less than or equal to the second threshold, increase the estimated value of the isomorphic access category restriction ACB factor, and reduce the access of the backlogged terminal.
  • Step S125 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold value and greater than the second threshold value, according to the successful access in the preset time period before the current time
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • Limiting the estimated value of the ACB factor for the isomorphic access category within the preset time period before the current time Obtaining a desired estimated value of the number of terminals accessing the channel resource for the terminal that is backlogged within the preset time period before the current time, with Separately with The adjustment parameter
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal;
  • the s, the network information, and the initial values of the ⁇ are respectively:
  • FIG. 5 is a schematic flowchart diagram of another method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 when the network information includes an estimated value of the isomorphic ACB factor and an estimated value of the number of terminals to be backlogged, step S100 includes:
  • Step S131 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S133 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • An estimated value of the number of terminals that are backlogged in the preset time period before the current time with Separately with The adjustment parameter
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal;
  • the s, the network information, and the initial values of the ⁇ are respectively:
  • FIG. 6 is a schematic flowchart diagram of another method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 includes:
  • Step S141 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S142 If the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold, increase the estimated value of the isomorphic contention window, and increase the accumulated terminal to obtain the access channel resource.
  • Step S143 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • Step S144 If the number of collisions of the terminal in the preset time period before the current time is less than or equal to the second threshold, reduce the estimated value of the homogeneous contention window, and reduce the accumulated terminal to obtain the access channel resource.
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal
  • the s, the network information, and the initial values of the ⁇ are respectively:
  • FIG. 7 is a schematic flowchart diagram of another method for updating network information according to known access information according to an embodiment of the present application.
  • step S100 when the network information includes an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, step S100 includes:
  • Step S151 determining whether the number of collisions of the terminal in the preset time period before the current time is greater than or equal to the first threshold value
  • Step S153 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold, determine whether the number of collisions of the terminal in the preset time period before the current time is greater than the second threshold;
  • Step S154 If the number of collisions of the terminal in the preset time period before the current time is less than or equal to the second threshold, reduce the estimated value of the isomorphic competition window, and reduce the estimation of the number of terminals that are backlogged. Values, including: if C s-1 ⁇ ⁇ 2 C 0 , then
  • Step S155 If the number of collisions of the terminal in the preset time period before the current time is less than the first threshold value and greater than the second threshold value, according to the successful access in the preset time period before the current time The number of terminals updates the estimated value of the isomorphic contention window and the estimated number of terminals to be backlogged, including: if ⁇ 2 C 0 ⁇ C s-1 ⁇ 1 C 0 , then
  • ⁇ is the acceleration tracking factor
  • ⁇ 1 C 0 is the first threshold value
  • ⁇ 1 is a threshold parameter of the first threshold value
  • ⁇ 2 C 0 is The second threshold value
  • ⁇ 2 is a threshold parameter of the second threshold value
  • C s-1 is the number of collisions in the preset time period before the current time
  • K s-1 is the number of successfully accessed terminals in the preset time period before the current time
  • ⁇ is the average reaching rate of the terminal
  • the s, the network information, and the initial values of the ⁇ are respectively:
  • FIG. 8 is a schematic flowchart diagram of another embodiment of a heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to an access point, and includes:
  • Step S160 Update the network information according to the known access information.
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset time period before the current time. The expected number of terminals successfully accessed and the number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resources may include, but are not limited to, any one or combination of the following: subchannel resources, different access slot resources, and random access preamble resources.
  • the network information may include, but is not limited to, any one or a combination of the following: an estimated value of the number of terminals that need to access the network, and a desired number of terminals that the backhaul terminal obtains access channel resources.
  • Step S260 Send the network information to the terminal, and send the changed channel resource information to the terminal when the access channel resource changes, so that the terminal calculates its own difference according to the network information and the local information of the terminal. Constructing a priority, and after receiving the changed channel resource information, performing an access decision according to its heterogeneous priority level and the changed channel resource information;
  • the channel resource information includes any one or a combination of the following: the number of rounds allowed for continuous access, the total number of access channel resources that allow continuous access, and the access allowed for each round of consecutive accesses. The number of channel resources and the identity of the access channel resources that are allowed to access.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority may include, but is not limited to, heterogeneous access categories to limit ACB factors or heterogeneous contention windows.
  • the access point usually sends the updated network information to the terminal through the trigger frame.
  • a trigger frame it can be a physical layer trigger frame or a MAC layer trigger frame.
  • the structure is a null data packet (English: null data packet, abbreviated as: NDP) frame, only the physical layer preamble, and there is no MPDU (ie, MAC layer protocol data unit) part.
  • the physical layer trigger frame includes a traditional preamble (English: legacy preamble) and a high efficiency preamble (HE preamble), and the efficient preamble includes HE-SIG A, HE-SIG B, HE-STF, and HE. - LTF four parts.
  • the updated network information contained in the trigger frame may be, but is not limited to, HE-SIG B located in the HE preamble of the physical layer preamble.
  • the MAC layer trigger frame includes a physical layer preamble and an MPDU, wherein the MPDU further includes a MAC header (English: MAC header) and a payload (English: payload), and the updated network information included in the trigger frame may but not Limited to the payload located in the MPDU.
  • the MPDU further includes a MAC header (English: MAC header) and a payload (English: payload)
  • the updated network information included in the trigger frame may but not Limited to the payload located in the MPDU.
  • the access point may also send an access plan indication information to the terminal for indicating the access decision of the terminal.
  • the access scheme indication information may also be, but is not limited to, in the HE-SIG B of the HE preamble of the physical layer preamble of the physical layer trigger frame, or may be, but not limited to, the payload of the MPDU located in the MAC layer trigger frame.
  • the specific indication method of the access scheme indication information may be, but is not limited to, the manner shown in Table 2 below:
  • the access point updates the network information according to the known access information, and sends the network information to the terminal, so that the terminal according to the network information and the local information of the terminal
  • the heterogeneous priority is calculated, and the changed channel resource information is sent to the terminal when the access channel resource changes, so that the terminal calculates its heterogeneous priority according to the network information and the local information of the terminal.
  • the access decision is made according to the heterogeneous priority level and the changed channel resource information. In this way, the heterogeneous priority of the terminal The level is calculated based on the network information and the local information of the terminal.
  • the heterogeneous priority of each terminal is not the same, but is related to the network information of the access point and the local information of each terminal itself, and is calculated based on the local information of the terminal.
  • the heterogeneous priority can ensure the relative fairness between the terminals when access is made, and prevent some terminals from being accumulated in the system for a long time and still cannot compete for access channel resources, which can reduce the delay accordingly.
  • Default probability and can guarantee the QoS requirements of different priority services under the premise of reducing the collision probability.
  • the access point sends the changed channel resource information to the terminal, so that the terminal calculates its heterogeneous priority according to the network information and the local information of the terminal, and receives the same.
  • the access decision is made according to the heterogeneous priority and the changed channel resource information, so that when the continuous access occurs or the access channel resources change due to other reasons, the terminal may The access decision is made according to the heterogeneous priority and the changed channel resource information, and the normal access order can be ensured when the continuous access occurs or the access channel resources change due to other reasons, which is beneficial to the system. stable.
  • FIG. 9 is a schematic flowchart diagram of another embodiment of a heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to a terminal, and includes:
  • Step S300 Receive network information updated by the access point according to known access information.
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset time period before the current time. The expected number of terminals successfully accessed and the number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resources may include, but are not limited to, any one or combination of the following: subchannel resources, different access slot resources, and random access preamble resources.
  • the network information may include, but is not limited to, any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the backhaul terminal obtains access channel resources, Estimates of the number of backlogged terminals, isomorphic access categories limit the estimated value of the ACB factor and the estimated value of the isomorphic contention window.
  • Step S400 Calculate the heterogeneous priority of the network according to the network information and the local information of the terminal, and perform access decision according to the heterogeneous priority of the terminal.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority may include, but is not limited to, heterogeneous access categories to limit ACB factors or heterogeneous contention windows.
  • the terminal receives network information updated by the access point according to the known access information, and calculates its heterogeneous priority according to the network information and the local information of the terminal, and Access decisions are made based on their own heterogeneous priorities.
  • the heterogeneous priority of the terminal is calculated by combining the network information with the local information of the terminal, and the heterogeneous priority of each terminal is not the same, but is related to the network information of the access point and the local information of each terminal itself.
  • the heterogeneous priority calculated by combining the local information of the terminal can ensure the relative fairness between the terminals when accessing, and avoids that some terminals are accumulated in the system for a long time and still cannot compete for access channel resources.
  • the delay default probability can be reduced accordingly, and the QoS requirements of different priority services can be guaranteed under the premise of reducing the collision probability.
  • FIG. 10 is a schematic flowchart diagram of another embodiment of another heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to a terminal, and includes:
  • Step S310 Receive network information updated by the access point according to the known access information, and receive the changed channel resource information that is sent by the access point when the access channel resource changes.
  • the channel resource information includes any one or a combination of the following: the number of rounds allowed for continuous access, the total number of access channel resources that allow continuous access, and the access allowed for each round of consecutive accesses. The number of channel resources and the identity of the access channel resources that are allowed to access. .
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset time period before the current time. The expected number of terminals successfully accessed and the number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resources may include, but are not limited to, any one or combination of the following: subchannel resources, different access slot resources, and random access preamble resources.
  • the network information may include, but is not limited to, any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the backhaul terminal obtains access channel resources, Estimates of the number of backlogged terminals, isomorphic access categories limit the estimated value of the ACB factor and the estimated value of the isomorphic contention window.
  • Step S410 Calculate the heterogeneous priority of the network according to the network information and the local information of the terminal, and after receiving the changed channel resource information, perform access according to the heterogeneous priority and the changed channel resource information. decision making.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority may include, but is not limited to, heterogeneous access categories to limit ACB factors or heterogeneous contention windows.
  • the heterogeneous priority-based random access method provided by the application, the terminal receives the network information updated by the access point according to the known access information, and receives the changed channel sent by the access point when the access channel resource changes.
  • the resource information is calculated according to the network information and the local information of the terminal, and after receiving the changed channel resource information, accessing according to the heterogeneous priority level and the changed channel resource information decision making.
  • the heterogeneous priority of the terminal is calculated by combining the network information and the local information of the terminal, and the heterogeneous priorities of each terminal are not the same, but are related to the access point.
  • the network information is related to the local information of each terminal.
  • the heterogeneous priority calculated by combining the local information of the terminal can ensure the relative fairness between the terminals when accessing, and prevent some terminals from being accumulated in the system. If the access channel resources are still not competing for a long time, the delay default probability can be reduced accordingly, and the QoS requirements of different priority services can be guaranteed under the premise of reducing the collision probability.
  • the access point sends the changed channel resource information to the terminal, so that the terminal calculates its heterogeneous priority according to the network information and the local information of the terminal, and receives the same.
  • the access decision is made according to the heterogeneous priority and the changed channel resource information, so that when the continuous access occurs or the access channel resources change due to other reasons, the terminal may The access decision is made according to the heterogeneous priority and the changed channel resource information, and the normal access order can be ensured when the continuous access occurs or the access channel resources change due to other reasons, which is beneficial to the system. stable.
  • FIG. 11 is a schematic flowchart diagram of still another heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to a terminal, and includes:
  • Step S301 Receive network information updated by the access point according to known access information.
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset time period before the current time. The expected number of terminals successfully accessed and the number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resources may include, but are not limited to, any one or combination of the following: subchannel resources, different access slot resources, and random access preamble resources.
  • the network information may include but is not limited to any one or a combination of the following: access is required The estimated value of the number of terminals of the network, the expected estimated value of the number of terminals accessing the channel resources by the backlogged terminal, the estimated value of the number of terminals to be backlogged, the estimated value of the ACB factor of the isomorphic access category restriction, and An estimate of the isomorphic competition window.
  • Step S401 Calculate its own heterogeneous priority according to the network information and the local information of the terminal; the heterogeneous priority includes a heterogeneous access category limiting ACB factor.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority level calculated according to the network information and the local information of the terminal is a heterogeneous access category to limit the ACB factor, and the heterogeneous access is performed according to different network information and local information.
  • the calculation method of the category restriction ACB factor is not the same.
  • the calculation methods of the heterogeneous ACB factor are respectively illustrated for different network information and local information:
  • the network information includes an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals that the back-up terminal obtains access channel resources, where the local information includes the time when the terminal is backlogged. Time,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • p n1 For the heterogeneous ACB factor p n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and increasing, and the estimated number of terminals that need to access the network within the preset time period before the current time When the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • the heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • p n2 the optimal number of accesses and the number The difference of the difference increases, and the estimated number of terminals that are attempting to access for the first time in the preset time period before the current time Decrease and decrease;
  • p n2 is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the backed up terminal refers to a terminal that has previously made an access attempt but has failed to access and still needs an access attempt;
  • the first attempted access refers to just generating information and performing The terminal of the first access attempt.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • p n1 For the heterogeneous ACB factor p n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and increasing, and the estimated number of terminals that need to access the network within the preset time period before the current time When the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the backed up terminal refers to a terminal that has previously made an access attempt but has failed to access and still needs an access attempt;
  • the first attempted access refers to just generating information and performing The terminal of the first access attempt.
  • the network information includes an estimated value of the isomorphic ACB factor and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, where the local information includes the time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous ACB factor p n1,s of the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and increasing, and the isomorphic ACB factor in the preset time period before the current time The estimated value increases and increases; when the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • the heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • p n2 the optimal number of accesses and the number The difference of the difference increases, and the estimated number of terminals that are attempting to access for the first time in the preset time period before the current time Decrease and decrease;
  • p n2 is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the network information includes an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, where the local information includes a time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous ACB factor p n1,s of the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and increasing, and the isomorphic ACB factor in the preset time period before the current time The estimated value increases and increases; when the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the network information includes an estimated value of a homogeneous contention window and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, where the local information includes a time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • p n1 For the heterogeneous ACB factor p n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and large, and with the isomorphic competition window within the preset time period before the current moment The estimated value increases and decreases; when the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • the heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • p n2 the optimal number of accesses and the number The difference of the difference increases, and the estimated number of terminals that are attempting to access for the first time in the preset time period before the current time Decrease and decrease;
  • p n2 is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the network information includes an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, where the local information includes a time when the terminal is backlogged,
  • Calculating the heterogeneous priority of the network according to the network information and the local information of the terminal include:
  • p n1 For the heterogeneous ACB factor p n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, p n1,s increases with the accumulated time b n,s Large and large, and with the isomorphic competition window within the preset time period before the current moment The estimated value increases and decreases; when the accumulated time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max It is the time delay threshold.
  • the network information includes an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals that the backhaul terminal obtains the access channel resource, where the local information includes the service to which the terminal belongs.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • p n1,s is the heterogeneous ACB factor of the terminal
  • AC n is the priority of the service to which the terminal belongs
  • a is a constant.
  • the network information includes an estimated value of the number of terminals that need to access the network and an estimated value of the number of terminals that are backlogged, where the local information includes the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • p n1,s is the heterogeneous ACB factor of the terminal
  • AC n is the priority of the service to which the terminal belongs
  • a is a constant.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous ACB factor p n,s increases as BD n increases; when the BD n exceeds the delay threshold
  • the heterogeneous access category restriction factor p n,s is a minimum value that approaches 0 or is 0;
  • p n1,s is the heterogeneous ACB factor of the terminal
  • S max is the delay threshold
  • a is a constant
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous ACB factor p n,s increases as BD n increases; when the BD n exceeds the delay threshold
  • the heterogeneous access category restriction factor p n,s is a minimum value that approaches 0 or is 0;
  • p n1,s is the heterogeneous ACB factor of the terminal
  • S max is the delay threshold
  • a is a constant
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increases and increases, with the estimated number of terminals that need to access the network within the preset time period before the current time Increases and decreases, increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; when the backlog is accumulated When b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • s is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • the local information includes a time when the terminal is backlogged, and a waiting time of information in the buffer.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increases and increases, with the estimated number of terminals that need to access the network within the preset time period before the current time Increases and decreases, increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; when the backlog is accumulated When b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • the network information includes an estimated value of the isomorphic ACB factor and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, the local information including the time at which the terminal is backlogged, the buffer When the waiting time of the information in the message and the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increasing and increasing, with the isomorphic ACB factor in the preset time period before the current time The estimated value increases, increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases;
  • p n1,s is a minimum value close to 0 or 0;
  • s is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • the local information includes a time when the terminal is backlogged, a waiting time of information in the buffer, and a terminal belongs to Priority of the business
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increasing and increasing, with the isomorphic ACB factor in the preset time period before the current time The estimated value increases, increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases;
  • p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • the network information includes an estimated value of a homogeneous contention window and a desired estimated value of a number of terminals that the backhaul terminal obtains access channel resources, the local information including a time at which the terminal is backlogged, a buffer When the waiting time of the information in the message and the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increasing and increasing, with the isomorphic competition window within the preset time period before the current time The estimated value increases and decreases, and increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases;
  • p n1,s is a minimum value close to 0 or 0;
  • s is a minimum value that is close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • the local information includes a time when the terminal is backlogged, and a waiting time of information in the buffer.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • Heterogeneous access class restriction factor p n1,s for the backlogged terminal when the accumulated time b n,s does not exceed the delay threshold, p n1,s with the accumulated time b n,s Increasing and increasing, with the isomorphic competition window within the preset time period before the current time The estimated value increases and decreases, and increases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases;
  • p n1,s is a minimum value close to 0 or 0;
  • p n1,s is the heterogeneous ACB factor of the backlogged terminal
  • p n2,s is the heterogeneous ACB factor of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • a is a constant.
  • Step S501 Perform an access decision according to its own heterogeneous priority.
  • the heterogeneous priority in the embodiment of the present application is a heterogeneous ACB factor.
  • the access decision is made according to its own heterogeneous priority, including:
  • the X conforms to a uniform distribution of (0, 1), compares the size of the X with the heterogeneous ACB factor; if the X is smaller than the heterogeneous ACB factor, then accesses, randomly selects An access channel resource sends an access frame to the access point; if the X is greater than or equal to the heterogeneous ACB factor, the access is exited.
  • the foregoing access decision method may also adopt other existing mature methods, and details are not described herein again.
  • the hidden node in the access point (English: Hidden node) increases the probability of collisions during access, and the access step in the embodiment of the present application does not need to perceive the channel, thereby avoiding the collision probability caused by the hidden node. Big problem.
  • the embodiment of the present application includes a plurality of calculation parameters and a calculation formula. It should be noted that the embodiment of the present application does not enumerate all the parameter combinations and calculation formulas, and thus other calculation methods formed by combining one or several parameters. And the calculation formula is also within the scope covered by this patent.
  • FIG. 12 is a schematic flowchart diagram of still another heterogeneous priority-based random access method according to the present application.
  • the random access method in the embodiment of the present application is applied to a terminal, including:
  • Step S302 Receive network information updated by the access point according to the known access information.
  • the known access information may include, but is not limited to, any one or a combination of the following: the number of collisions of the terminal in the preset time period before the current time, before the current time The expected number of terminals successfully accessed during the preset time period and the expected number of collisions of the terminal.
  • the expected value of the number of collisions of the terminal may include, but is not limited to, calculated according to the number of access channel resources, including:
  • C 0 is the expected value of the number of collisions of the terminal
  • M is the number of access channel resources.
  • the access channel resources may include, but are not limited to, any one or combination of the following: subchannel resources, different access slot resources, and random access preamble resources.
  • the network information may include, but is not limited to, any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the backhaul terminal obtains access channel resources, Estimates of the number of backlogged terminals, isomorphic access categories limit the estimated value of the ACB factor and the estimated value of the isomorphic contention window.
  • Step S402 Calculate its own heterogeneous priority according to the network information and local information of the terminal; the heterogeneous priority includes a heterogeneous contention window.
  • the local information may include, but is not limited to, any one or a combination of the following: a time when the terminal is backlogged, a priority of the service to which the terminal belongs, and a waiting time of information in the buffer.
  • the heterogeneous priority calculated according to the network information and the local information of the terminal is a heterogeneous contention window, and the calculation of the heterogeneous contention window is performed according to different network information and local information.
  • the methods are different. The following describes the calculation methods of the heterogeneous contention window for different network information and local information:
  • the network information includes an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals that the back-up terminal obtains access channel resources, where the local information includes the time when the terminal is backlogged. Time,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: When the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the estimated number of terminals that need to access the network in the preset time period before the current time. Increases and increases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • the heterogeneous contention window CW n2,s of the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the backed up terminal refers to a terminal that has previously made an access attempt but has failed to access and still needs an access attempt;
  • the first attempted access refers to just generating information and performing The terminal of the first access attempt.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the estimated number of terminals that need to access the network in the preset time period before the current time. Increases and increases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • Heterogeneous contention window CW n2 s for the terminal attempting to access for the first time: Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increase as the increase When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the backed up terminal refers to a terminal that has previously made an access attempt but has failed to access and still needs an access attempt;
  • the first attempted access refers to just generating information and performing The terminal of the first access attempt.
  • the network information includes an estimated value of the isomorphic ACB factor and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, where the local information includes the time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: When the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the isomorphic ACB factor in the preset time period before the current time The estimated value increases and decreases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • the heterogeneous contention window CW n2,s of the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the network information includes an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, where the local information includes a time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: When the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the isomorphic ACB factor in the preset time period before the current time The estimated value increases and decreases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • Heterogeneous contention window CW n2 s for the terminal attempting to access for the first time: Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increase as the increase When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the network information includes an estimated value of a homogeneous contention window and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, where the local information includes a time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: When the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the isomorphic competition window within the preset time period before the current moment The estimated value increases and increases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • the heterogeneous contention window CW n2,s of the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2 the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the network information includes an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, where the local information includes a time when the terminal is backlogged,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: When the accumulated time b n,s does not exceed the delay threshold, CW n1,s decreases as the backlog time increases. And the isomorphic competition window within the preset time period before the current moment The estimated value increases and increases; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • Heterogeneous contention window CW n2 s for the terminal attempting to access for the first time: Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increase as the increase When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the time delay threshold, the symbol ⁇ *> indicates rounding off the values in angle brackets.
  • the network information includes an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals that the backhaul terminal obtains the access channel resource, where the local information includes the service to which the terminal belongs.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 s is a heterogeneous competition window of the terminal
  • AC n is the priority of the service to which the terminal belongs
  • the symbol ⁇ *> indicates that the value in the angle brackets is rounded off
  • a is a constant.
  • the network information includes an estimated value of the number of terminals that need to access the network and an estimated value of the number of terminals that are backlogged, where the local information includes the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 s is a heterogeneous competition window of the terminal
  • AC n is the priority of the service to which the terminal belongs
  • the symbol ⁇ *> indicates that the value in the angle brackets is rounded off
  • a is a constant.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous contention window CW n,s decreases as the BD n increases; when the BD n exceeds the delay At the threshold, the heterogeneous contention window CW n,s is a maximum or ⁇ :
  • CW n1,s is the heterogeneous contention window of the terminal
  • S max is the delay threshold
  • ⁇ *> indicates that the value in the angle brackets is rounded off
  • a is a constant.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • the heterogeneous contention window CW n,s decreases as the BD n increases; when the BD n exceeds the delay At the threshold, the heterogeneous contention window CW n,s is a maximum or ⁇ :
  • CW n1 is the heterogeneous contention window of the terminal
  • S max is the delay threshold
  • ⁇ *> indicates that the value in the angle brackets is rounded off
  • a is a constant.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and the estimated number of terminals that need to access the network in the preset time period before the current time Increases and increases, decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; when the backlog is accumulated When b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • the heterogeneous contention window CW n2 s of the terminal attempting to access for the first time: the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased.
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2 is the heterogeneous contention window of the terminal attempting to access
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • the local information includes a time when the terminal is backlogged, and a waiting time of information in the buffer.
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and the estimated number of terminals that need to access the network in the preset time period before the current time Increases and increases, decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; when the backlog is accumulated When b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • Heterogeneous contention window CW n2,s for the terminal attempting to access for the first time Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increases and increases, decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2s is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • the network information includes an estimated value of the isomorphic ACB factor and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, the local information including the time at which the terminal is backlogged, the buffer When the waiting time of the information in the message and the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and the isomorphic ACB factor in the preset time period before the current time The estimated value decreases and decreases, and decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; When the backlog b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • the heterogeneous contention window CW n2 s of the terminal attempting to access for the first time: the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased.
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2s is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • the local information includes a time when the terminal is backlogged, a waiting time of information in the buffer, and a terminal belongs to Priority of the business
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and the isomorphic ACB factor in the preset time period before the current time The estimated value decreases and decreases, and decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; When the backlog b n,s exceeds the delay threshold, CW n1,s is a maximum value or ⁇ ;
  • Heterogeneous contention window CW n2,s for the terminal attempting to access for the first time Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increases and increases, decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2s is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • the network information includes an estimated value of a homogeneous contention window and a desired estimated value of a number of terminals that the backhaul terminal obtains access channel resources, the local information including a time at which the terminal is backlogged, a buffer When the waiting time of the information in the message and the priority of the service to which the terminal belongs,
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and increases with the increase of the estimated value of the isomorphic contention window CW s-1 in the preset time period before the current time, as the waiting time BD n of the information in the buffer increases And decreasing, and increasing with the increase of the priority AC n of the service to which the terminal belongs; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or Why
  • Heterogeneous contention window CW n2s for the terminal attempting to access for the first time the estimated value of the number of terminals accessing the channel resource obtained by the terminal that is accumulated in the preset time period before the current time
  • CW n2s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased.
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2s is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • the local information includes a time when the terminal is backlogged, a waiting time of information in the buffer, and a terminal belonging to Priority of the business
  • the calculating the heterogeneous priority of the network according to the network information and the local information of the terminal including:
  • CW n1 For the heterogeneous contention window CW n1,s of the backlogged terminal: when the accumulated time b n,s does not exceed the delay threshold, CW n1,s increases with the accumulated time b n,s Large and decreasing, and increases with the increase of the estimated value of the isomorphic contention window CW s-1 in the preset time period before the current time, as the waiting time BD n of the information in the buffer increases And decreasing, and increasing with the increase of the priority AC n of the service to which the terminal belongs; when the accumulated time b n,s exceeds the delay threshold, CW n1,s is a maximum value or Why
  • Heterogeneous contention window CW n2,s for the terminal attempting to access for the first time Estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, CW n2,s with the optimal number of accesses and the number The difference of the difference is increased, and the estimated number of terminals attempting to access for the first time in the preset time period before the current time is increased. Increases and increases, decreases as the waiting time BD n of the information in the buffer increases, and increases as the priority AC n of the service to which the terminal belongs increases; When it is greater than or equal to the optimal number of accesses, CW n2, s is a maximum value or ⁇ ;
  • CW n1,s is the heterogeneous contention window of the backlogged terminal
  • CW n2s is the heterogeneous contention window of the terminal attempting to access for the first time
  • M is the number of access channel resources
  • S max For the delay threshold, the symbol ⁇ *> indicates that the value in the angle brackets is rounded off and a is a constant.
  • Step S502 Perform an access decision according to its own heterogeneous priority.
  • the heterogeneous priority in the embodiment of the present application is a heterogeneous contention window.
  • the access decision is performed according to its heterogeneous priority, including:
  • An integer is randomly selected from the set ⁇ 0, ... CW n, s ⁇ as the backoff value; if the selected backoff value is 0, one access channel resource is randomly selected for access; otherwise, the access is exited.
  • An integer is randomly selected from the set ⁇ 0, ... CW n, s ⁇ as a backoff value; the selected backoff value is the smallest value of all terminals. After the backoff to 0, a candidate access channel resource is randomly selected for access. ; otherwise, exit access.
  • An integer is randomly selected from the set ⁇ 0, ... CW n, s ⁇ as a backoff value; in the subsequent backoff process, if the backoff is 0, an access channel resource is randomly selected for access; otherwise, the subsequent Treatment.
  • the terminal makes an access decision based on the heterogeneous contention window. If the selected backoff value is 0, the access is performed; otherwise, the access is exited. This eliminates the need to perceive the channel, thereby avoiding the problem of increased collision probability caused by hidden nodes.
  • the foregoing access decision method may also adopt other existing mature methods, and details are not described herein again.
  • the embodiment of the present application includes a plurality of calculation parameters and a calculation formula. It should be noted that the embodiment of the present application does not enumerate all the parameter combinations and calculation formulas, and therefore the group of one or several parameters. Other calculation methods and calculation formulas formed by the combination are also covered by this patent.
  • FIG. 13 is a schematic structural diagram of a heterogeneous priority based random access device according to the present application.
  • the random access device provided by the embodiment of the present application includes:
  • the updating module 1 is configured to update the network information according to the known access information;
  • the network information comprises a combination of any one or more of the following: an estimated value of the number of terminals that need to access the network, and the backhaul terminal obtains the access channel An expected estimate of the number of terminals of the resource, an estimated value of the number of terminals to be backlogged, an estimated value of the isomorphic access class limit ACB factor, and an estimated value of the isomorphic contention window;
  • the sending module 2 is configured to send the network information to the terminal, so that the terminal calculates its heterogeneous priority according to the network information and the local information of the terminal, and performs access decision according to the heterogeneous priority of the terminal;
  • the heterogeneous priorities include: heterogeneous access categories limit ACB factors or heterogeneous contention windows.
  • the present application also provides a heterogeneous priority based access point, including the random access device in FIG. 10 above.
  • heterogeneous priority-based random access device and the access point in this embodiment may use the heterogeneous priority-based random access method in the foregoing method embodiment, to implement the foregoing method embodiment.
  • the functions of the respective modules may be specifically implemented according to the method in the foregoing method embodiment.
  • the specific implementation process reference may be made to the related description in the foregoing embodiments, and details are not described herein again.
  • FIG. 14 is a schematic structural diagram of another heterogeneous priority-based random access apparatus according to the present application.
  • the random access device provided by the embodiment of the present application includes:
  • the receiving module 3 is configured to receive network information that is updated by the access point according to the known access information; the network information includes any one or more of the following combinations: an estimated value of the number of terminals that need to access the network, and a backlog
  • the terminal obtains a desired estimated value of the number of terminals accessing the channel resource, an estimated value of the number of terminals to be backlogged, an estimated value of the isomorphic access category restriction ACB factor, and an estimated value of the isomorphic contention window;
  • the access module 4 is configured to calculate its own heterogeneity according to the network information and the local information of the terminal. Priority, and access decisions are made according to their heterogeneous priorities; the heterogeneous priorities include: heterogeneous access categories limit ACB factors or heterogeneous contention windows.
  • the present application also provides a terminal based on heterogeneous priority, including the random access device in FIG. 11 above.
  • heterogeneous priority-based random access device and the terminal in this embodiment may use the heterogeneous priority-based random access method in the foregoing method embodiment, to implement all the foregoing method embodiments.
  • the technical solution, the function of each module may be specifically implemented according to the method in the foregoing method embodiment, and the specific implementation process may refer to the related description in the foregoing embodiment, and details are not described herein again.
  • FIG. 15 is a schematic structural diagram of a heterogeneous priority based random access system according to the present application.
  • the random access system provided by the embodiment of the present application includes: an access point 5 and a terminal 6;
  • the access point 5 is configured to: update the network information according to the known access information; and send the network information to the terminal, so that the terminal calculates its own heterogeneous priority according to the network information and the local information of the terminal, and Access decisions based on their own heterogeneous priorities;
  • the terminal 6 is configured to: receive network information updated by the access point according to the known access information; calculate the heterogeneous priority according to the network information and the local information of the terminal, and perform the handover according to the heterogeneous priority of the terminal. Into the decision;
  • the network information includes any one or a combination of the following: an estimated value of the number of terminals that need to access the network, a desired estimated value of the number of terminals that the back-end terminal obtains access channel resources, and a back-end terminal
  • the estimated value of the number, the isomorphic access category limits the estimate of the ACB factor and the estimated value of the isomorphic contention window;
  • the heterogeneous priorities include: heterogeneous access categories limit ACB factors or heterogeneous contention windows.
  • the known access information includes any one or more of the following combinations: the number of collisions of the terminal in the preset time period before the current time, the number of successfully accessed terminals in the preset time period before the current time, and the collision of the terminal Expected value of the number of times;
  • the expected value of the number of collisions of the terminal is calculated according to the number of access channel resources, including:
  • C 0 is an expected value of the number of collisions of the terminal
  • M is the number of access channel resources
  • the access channel resources include any one or more of the following combinations: subchannel resources, different access slot resources, and random access Enter the preamble resource.
  • the local information includes any one or more of the following combinations: the time at which the terminal is backlogged, the priority of the service to which the terminal belongs, and the waiting time for information in the buffer.
  • the access point 5 is further configured to: when the access channel resource changes, send the changed channel resource information to the terminal, so that after receiving the changed channel resource information, the terminal according to its heterogeneous priority Level and changed channel resource information for access decision;
  • the terminal 6 is further configured to: after receiving the changed channel resource information sent by the access point when the access channel resource changes, and after receiving the changed channel resource information, according to its heterogeneous priority level and The changed channel resource information is used for access decision;
  • the channel resource information includes any one or a combination of the following: the number of rounds allowed for continuous access, the total number of access channel resources that allow continuous access, and the access allowed for each round of consecutive accesses. The number of channel resources and the identity of the access channel resources that are allowed to access.
  • heterogeneous priority-based random access system in this embodiment may adopt the heterogeneous priority-based random access method in the foregoing method embodiments, and implement all the technical solutions in the foregoing method embodiments.
  • the function of each module may be specifically implemented according to the method in the foregoing method embodiment.
  • the steps of a method or algorithm described in connection with the embodiments disclosed herein can be implemented directly in hardware, a software module executed by a processor, or a combination of both.
  • the software module can be placed in random access memory (RAM), memory, read only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or technical field. Any other form of storage medium known.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne, dans des modes de réalisation, un procédé, un dispositif, un appareil et un système d'accès aléatoire hétérogène basé sur la priorité. Un point d'accès met à jour des informations de réseau en fonction d'informations d'accès connues, et les informations de réseau sont envoyées à un terminal, de telle sorte que le terminal calcule un niveau de priorité hétérogène de lui-même selon les informations de réseau et des informations locales du terminal, et détermine un accès selon le niveau de priorité hétérogène. Le niveau de priorité hétérogène du terminal est calculé en combinant les informations de réseau et les informations locales du terminal. Par conséquent, un niveau de priorité hétérogène de terminal individuel ne sont pas les mêmes mais se rapportent à des informations de réseau d'un point d'accès et des informations locales dudit terminal. Le niveau de priorité hétérogène calculé et obtenu par incorporation d'informations locales d'un terminal peut garantir une équité relative entre des terminaux, et empêcher un terminal d'attendre dans un système pour une longue durée et d'être toujours incapable d'obtenir une ressource de canal d'accès par l'intermédiaire d'un conflit d'accès. Par conséquent, une probabilité de violation de retard peut chuter en conséquence, et des exigences de qualité de service (QoS) pour différents niveaux de priorité peuvent être garantis tout en réduisant une probabilité de collision.
PCT/CN2015/094417 2015-06-24 2015-11-12 Procédé, dispositif, appareil et système d'accès aléatoire hétérogène basé sur la priorité Ceased WO2016206284A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201580080469.3A CN107637135B (zh) 2015-06-24 2015-11-12 一种基于异构优先级的随机接入方法、装置、设备及系统

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2015082239 2015-06-24
CNPCT/CN2015/082239 2015-06-24

Publications (1)

Publication Number Publication Date
WO2016206284A1 true WO2016206284A1 (fr) 2016-12-29

Family

ID=57584676

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/094417 Ceased WO2016206284A1 (fr) 2015-06-24 2015-11-12 Procédé, dispositif, appareil et système d'accès aléatoire hétérogène basé sur la priorité

Country Status (2)

Country Link
CN (1) CN107637135B (fr)
WO (1) WO2016206284A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114845338A (zh) * 2022-04-22 2022-08-02 中国科学院合肥物质科学研究院 一种面向用户接入的随机退避方法
CN117692961A (zh) * 2024-02-04 2024-03-12 北京邮电大学 低轨卫星物联网随机接入拥塞控制方法和装置

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112218384B (zh) * 2020-09-24 2022-09-20 中国科学院上海微系统与信息技术研究所 一种基于优先级的分布式队列随机接入方法
CN114245318B (zh) * 2021-08-27 2023-05-09 南京金盾公共安全技术研究院有限公司 一种基于智能眼镜的区域人员管控方法
CN115086937A (zh) * 2022-05-31 2022-09-20 江门职业技术学院 基于5g专网的应急融合通信方法、装置、设备及存储介质
CN116363832B (zh) * 2023-03-31 2024-01-05 湖南长海科技发展有限公司 一种全场景智慧病房联讯护理系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101640952A (zh) * 2009-08-31 2010-02-03 北京邮电大学 实现异构网络QoS动态映射的系统及其方法
CN102761933A (zh) * 2011-04-29 2012-10-31 中兴通讯股份有限公司 Eab处理方法及装置、接入处理方法、装置及系统
WO2013047964A1 (fr) * 2011-09-28 2013-04-04 Lg Electronics Inc. Accès aléatoire amélioré à un réseau hétérogène
CN103607777A (zh) * 2013-10-11 2014-02-26 中国人民解放军重庆通信学院 窄脉冲超宽带网络基于业务优先级的随机信道接入方法
CN103634848A (zh) * 2013-12-02 2014-03-12 哈尔滨工业大学 基于非合作博弈资源分配的3g/wlan异构网络接入控制方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100512488C (zh) * 2005-03-24 2009-07-08 华为技术有限公司 无线局域网向呈现系统提供呈现信息的方法及系统
CN102256266B (zh) * 2011-07-04 2014-06-04 重庆邮电大学 一种面向用户应用的自适应接入网络选择实现装置及方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101640952A (zh) * 2009-08-31 2010-02-03 北京邮电大学 实现异构网络QoS动态映射的系统及其方法
CN102761933A (zh) * 2011-04-29 2012-10-31 中兴通讯股份有限公司 Eab处理方法及装置、接入处理方法、装置及系统
WO2013047964A1 (fr) * 2011-09-28 2013-04-04 Lg Electronics Inc. Accès aléatoire amélioré à un réseau hétérogène
CN103607777A (zh) * 2013-10-11 2014-02-26 中国人民解放军重庆通信学院 窄脉冲超宽带网络基于业务优先级的随机信道接入方法
CN103634848A (zh) * 2013-12-02 2014-03-12 哈尔滨工业大学 基于非合作博弈资源分配的3g/wlan异构网络接入控制方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114845338A (zh) * 2022-04-22 2022-08-02 中国科学院合肥物质科学研究院 一种面向用户接入的随机退避方法
CN117692961A (zh) * 2024-02-04 2024-03-12 北京邮电大学 低轨卫星物联网随机接入拥塞控制方法和装置
CN117692961B (zh) * 2024-02-04 2024-04-26 北京邮电大学 低轨卫星物联网随机接入拥塞控制方法和装置

Also Published As

Publication number Publication date
CN107637135A (zh) 2018-01-26
CN107637135B (zh) 2020-01-21

Similar Documents

Publication Publication Date Title
CN106063193B (zh) 用于确定空闲信道评估阈值的系统和方法
CN104170336B (zh) 在WiFi网络中提供差异化关联服务的系统和方法
US9648559B2 (en) Systems and methods for differentiated fast initial link setup
CN114080050B (zh) 一种信道竞争方法及相关装置
CN107113888B (zh) 基于对话前监听负载的信道接入以与wi-fi共存
CN107637135B (zh) 一种基于异构优先级的随机接入方法、装置、设备及系统
CN116744468B (zh) 多链路设备的信道接入方法及相关装置
CN104247551B (zh) 用于基本服务集关联的系统和方法
WO2015199992A1 (fr) Réglage dynamique d'un paramètre de contrôle d'accès au support dans un réseau sans fil
JP2013131834A (ja) 無線通信装置および無線通信方法
US20250212279A1 (en) Systems and methods for multi-node communication in wireless communication networks
US20160353485A1 (en) Managing medium access for wireless devices
TW201628432A (zh) Ｗｉ－ｆｉ相容通道存取（二）
WO2020179533A1 (fr) Système de communication sans fil et procédé de communication sans fil
CN114501491B (zh) 用于使用qos帧调度信息使延时和争用最小化的系统和方法
US9860851B2 (en) Managing access to transmission medium in a wireless environment
US10863546B2 (en) Apparatus and method for adaptive contention window (ACW)
CN106817193B (zh) 一种接入点通信的方法及接入点
CN102625462A (zh) 网络接入方法及其无线通信装置、基站与m2m装置
KR20250014426A (ko) 무선 네트워크 환경에서의 공간 재사용 장치 및 방법
CN110383902A (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: 15896169

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: 15896169

Country of ref document: EP

Kind code of ref document: A1