WO2016206284A1

WO2016206284A1 - Heterogeneous priority-based random access method, device, apparatus and system

Info

Publication number: WO2016206284A1
Application number: PCT/CN2015/094417
Authority: WO
Inventors: 韩霄; 蓝洲; 李云波
Original assignee: 华为技术有限公司
Priority date: 2015-06-24
Filing date: 2015-11-12
Publication date: 2016-12-29
Also published as: CN107637135A; CN107637135B

Abstract

Disclosed in embodiments of the present invention are a heterogeneous priority-based random access method, device, apparatus and system. An access point updates network information according to known access information, and the network information is sent to a terminal, such that the terminal computes a heterogeneous priority level of itself according to the network information and local information of the terminal, and determines an access according to the heterogeneous priority level. The heterogeneous priority level of the terminal is computed by combining the network information and the local information of the terminal. Therefore, a heterogeneous priority level of individual terminal are not the same but related to network information of an access point and local information of said terminal. The heterogeneous priority level computed and obtained by incorporating local information of a terminal can ensure relative fairness among terminals, and prevent a terminal from waiting in a system for a long time and yet still unable to obtain an access channel resource via contention. Therefore, a delay violation probability can correspondingly drop, and QoS requirements for different priority levels can be guaranteed while reducing a collision probability.

Description

Random access method, device, device and system based on heterogeneous priority

This application is required to be submitted to the State Intellectual Property Office of China on June 24, 2015, the application number is PCT/CN2015/082239, and the invention name is “a random access method, device, device and system based on heterogeneous priority”. The priority of the PCT International Application, the entire contents of which is incorporated herein by reference.

Technical field

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.

Background technique

With the rapid development of wireless communication technologies, in order to better share channel resources, it is necessary to continuously optimize the medium access control (English: Media Access Control, MAC for short) protocol. According to different media access modes, 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.

Among the above three types of MAC protocols, 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.

In order to reduce the collision probability of the contention-based random access MAC protocol, some techniques for carrier sensing and random backoff based on the contention-based random access MAC protocol have been studied in the prior art, such as dynamic access category restriction (English: Dynamic: Access Class barring, referred to as: Dynamic ACB) algorithm. In the algorithm, the access point dynamically updates the ACB factor based on the number of previous collisions, and sends the ACB factor p _s to the terminal. After receiving the ACB factor p _s , the terminal performs the connection based on the ACB factor p _s . Into the decision. The algorithm can dynamically control the number of randomly accessed terminals and reduce the probability of collision.

However, since all terminals perform random access decisions based on the same ACB factor p _s , all terminals have the same probability of accessing channel resources, and each terminal that accesses is absolutely fair, so some terminals may be backlogged. In the system, the access channel resources are still not competing for a long time, so delays (English: Delay Violation) cause information loss (such as packet loss, etc.), and the probability of all terminals accessing channel resources is If the services of different priorities are not treated differently, the quality of service (English: Quality of Service, QoS for short) cannot be met.

Summary of the invention

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. .

To solve the above technical problem, the embodiment of the present invention provides the following technical solutions:

A heterogeneous priority based random access method, comprising:

Updating network information according to known access information; 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;

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:

Receiving network information 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 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;

Calculating the heterogeneous priority according to the network information and the local information of the terminal, and performing access decision according to the heterogeneous priority of the network; the heterogeneous priority includes: heterogeneous access category restricting ACB factor or heterogeneous Competition window.

A random access device based on heterogeneous priority, comprising:

And 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.

As can be seen from the above, the heterogeneous priority-based random access method provided by the present application, 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. In this way, 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.

DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any inventive labor.

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;

2 is a method for updating network information according to known access information according to an embodiment of the present application Schematic diagram of the process;

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.

FIG. 15 is a schematic structural diagram of a heterogeneous priority based random access system according to the present application.

detailed description

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.

Take Wireless Local Area Network (WLAN) as an example. Currently, the standard adopted by WLAN is IEEE (English: Institute of Electrical and Electronics Engineers) 802.11 series. 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). , English: Access Point) and non-access point class sites (English: NoneAccess Point Station, referred to as: 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. Specifically, the AP may be a terminal device or a network device with a WiFi (English: Wireless Fidelity) chip. Optionally, 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.

A 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. For example: 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. Optionally, 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.

In the embodiment of the present application, an access point class site AP is referred to as an access point, and a non-access point class site Non-AP STA is referred to as a terminal, and multiple terminals are generally associated with one access point, and 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.

The technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. The embodiments are merely a part of the embodiments of the invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

The solution of the present application will be described in detail below with reference to the accompanying drawings:

FIG. 1b is a schematic flowchart diagram of an embodiment of a heterogeneous priority-based random access method according to the present application.

As shown in FIG. 1b, 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.

In the embodiment of the present application, 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:

among them,

C ₀ is the expected value of the number of collisions of the terminal, and 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.

In the embodiment of the present application, 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. For a trigger frame, it can be a physical layer trigger frame or a MAC layer trigger frame.

For the physical 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.

For the MAC layer trigger frame, it 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.

In addition, 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:

Table 1

In Table 1, whether the corresponding network information is transmitted is indicated by 0 or 1 of 1 bit, or is used to indicate whether the corresponding network information is used for the subsequent access scheme. If it is 1, it means yes; if it is 0, it means no.

The heterogeneous priority-based random access method provided by the application, 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. In this way, 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.

Further, referring to 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.

On the basis of the foregoing embodiment, 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. The expected estimated value of the number of terminals entering the channel resource, including: if C _s-1 ≥ μ ₁ C ₀ , then θ:= θ+1,

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. The expected estimated value of the number of terminals entering the channel resource, including: if C _s-1 ≤ μ ₂ C ₀ , then θ: =0,

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 The number of terminals is updated to obtain an estimated value of the number of terminals accessing the network and a desired estimated value of the number of terminals accessing the channel resources by the backlogged terminal, including: if μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , then θ: =0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ ₁ C ₀ is the first threshold value, μ ₁ is a threshold parameter of the first threshold value, and μ ₂ C ₀ is The second threshold value, μ ₂ is a threshold parameter of the second threshold value,

with

The estimated value of the number of terminals that need to access the network in the preset time period before the current time, and the expected estimated value of the number of terminals that access the channel resource in the preset time period before the current time, respectively.

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, and λ is the average reaching rate of the terminal; The s, the network information, and the initial values of the θ are respectively:

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.

On the basis of the foregoing embodiment, 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 S112: 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. Estimates, including: If C _s-1 ≥ μ ₁ C ₀ , then θ:=θ+1,

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. The estimated value includes: if C _s-1 ≤ μ ₂ C ₀ , then θ: =0,

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 The number of terminals is updated to estimate the number of terminals that need to access the network and the estimated number of terminals to be backed up, including: if μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , then θ: =0,

with

The estimated value of the number of terminals that need to access the network in the preset time period before the current time, and the estimated value of the number of terminals that are backlogged in the preset time period before the current time, respectively.

with

Separately

with

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.

On the basis of the foregoing embodiment, when 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 backlog terminal, 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. The expected estimated value of the number of terminals entering the channel resource, including: if C _s-1 ≥ μ ₁ C ₀ , then θ:= θ+1,

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. The expected estimated value of the number of terminals of the channel resource includes: if C _s-1 ≤ μ ₂ C ₀ , then θ: =0,

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 The number of terminals updates the isomorphic access class to limit the estimated value of the ACB factor and the expected estimate of the number of terminals accessing the channel resources by the backlogged terminal, including: if μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , then θ: =0,

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

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.

On the basis of the foregoing embodiment, 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 S132: 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 number of terminals that are backlogged. Estimates, including: If C _s-1 ≥ μ ₁ C ₀ , then θ:=θ+1,

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;

Step S134: 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 limit ACB factor, and reduce the number of terminals that are backlogged. Estimated values, including: If C _s-1 ≤ μ ₂ C ₀ , then θ: =0,

Step S135: 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 isomorphic access class to limit the estimated value of the ACB factor and the estimated number of terminals to be backlogged, including: if μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , then θ:=0,

An estimated value of the number of terminals that are backlogged in the preset time period before the current time,

with

Separately

with

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.

On the basis of the foregoing embodiment, when the network information includes an estimated value of the isomorphic contention window and a desired estimated value of the number of terminals of the access channel resource obtained by the backlogged terminal, 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. The expected estimated value of the number of terminals includes: θ:=θ+1 if C _s-1 ≥μ ₁ C ₀ ,

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. The expected estimate of the number of terminals, including: If C _s-1 ≤ μ ₂ C ₀ , then θ: =0,

Step S145: 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 expected estimate of the number of terminals accessing the channel resources by the backlogged terminal, including: if μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , Then θ:=0,

The estimated value of the isomorphic competition window within the preset time period before the current time,

with

Separately

with

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.

On the basis of the foregoing embodiment, 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 S152: 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 competition window, and increase the estimated value of the number of terminals that are backlogged. Including: If C _s-1 ≥μ ₁ C ₀ , then θ:=θ+1,

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 ≤ μ ₂ C ₀ , 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 μ ₂ C ₀ <C _s-1 <μ ₁ C ₀ , then

with

Separately

with

FIG. 8 is a schematic flowchart diagram of another embodiment of a heterogeneous priority-based random access method according to the present application.

Referring to FIG. 8, 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.

among them,

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. The estimated value, the estimated number of terminals to be backlogged, the isomorphic access category limit the estimated value of the ACB factor, and the estimated value of the isomorphic contention window.

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 specific indication method of the access scheme indication information may be, but is not limited to, the manner shown in Table 2 below:

Table 2

In Table 2, whether the corresponding network information is transmitted is indicated by 0 or 1 of 1 bit, or is used to indicate whether the corresponding network information is used for the subsequent access scheme. If it is 1, it means yes; if it is 0, it means no.

The heterogeneous priority-based random access method provided by the application, 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. After receiving the changed channel resource information, 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.

Moreover, when the access channel resource changes, 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. After the changed channel resource information, 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.

As shown in FIG. 9, 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.

among them,

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 heterogeneous priority-based random access method provided by the present application, 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. In this way, 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.

As shown in FIG. 10, 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. .

among them,

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 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. In this way, 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.

FIG. 11 is a schematic flowchart diagram of still another heterogeneous priority-based random access method according to the present application.

Referring to FIG. 11, 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.

among them,

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.

In the embodiment of the present application, 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:

(1) 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 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:

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;

Specifically, including:

or,

Or,

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

When less than the optimal number of accesses, p _n2,s with 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;

When it is greater than or equal to the optimal number of accesses, p _{n2, s} is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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.

Here, 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.

(2) 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 that are backlogged, where the local information includes the time when the terminal is backlogged,

Specifically, including:

Or,

or,

The heterogeneous ACB factor p _n2,ss for the terminal attempting to access for the first time: an estimate of the number of terminals that are backlogged during the preset time period before the current time

Decrease and decrease;

Specifically, including:

(3) when 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,

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 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;

Specifically, including:

or,

or,

Decrease and decrease;

Specifically, including:

(4) when 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,

Specifically, including:

or,

or,

Decrease and decrease;

Specifically, including:

(5) when 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,

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;

Specifically, including:

or,

or,

Decrease and decrease;

Specifically, including:

(6) 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, 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:

Specifically, including:

or,

or,

Decrease and decrease;

Specifically, including:

(7) 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, where the local information includes the service to which the terminal belongs. Priority,

p _n,s =aAC _n ;

Where p _n1,s is the heterogeneous ACB factor of the terminal, AC _n is the priority of the service to which the terminal belongs, and a is a constant.

(8) 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 that are backlogged, where the local information includes the priority of the service to which the terminal belongs,

p _n,s =aAC _n ;

(9) 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 access channel resources, where the local information includes information in the buffer Waiting time,

When the waiting time BD _n of the information in the buffer does not exceed the delay threshold, 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;

Specifically, including:

Where p _n1,s is the heterogeneous ACB factor of the terminal, S ^max is the delay threshold, and a is a constant.

(10) 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 that are backlogged, where the local information includes a waiting time of information in the buffer,

Specifically, including:

(11) 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, where the local information includes the time when the terminal is backlogged. When the waiting time of the information in the buffer and the priority of the service to which the terminal belongs,

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;

Specifically, including:

Or,

or,

The heterogeneous access class restriction 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

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 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;

Specifically, including:

Where 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 For the delay threshold, a is a constant.

(12) 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 that are backlogged, the local information includes a time when the terminal is backlogged, and a waiting time of information in the buffer. When the priority of the service to which the terminal belongs,

Specifically, including:

or,

or,

The heterogeneous access class restriction factor p _n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are accumulated in the preset time period before the current time

Specifically, including:

(13) when 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,

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; When the back time b _n,s exceeds the delay threshold, p _n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

or,

Specifically, including:

(14) when the network information includes an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, 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,

Specifically, including:

or,

Or,

The heterogeneous access category restriction factor p _n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are backlogged during the preset time period before the current time When less than the optimal number of accesses, p _n2,s with the optimal number of accesses and the number

Specifically, including:

(15) when 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,

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; When the back time b _n,s exceeds the delay threshold, p _n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

or,

Specifically, including:

(16) 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, the local information includes a time when the terminal is backlogged, and a waiting time of information in the buffer. When the priority of the service to which the terminal belongs,

Specifically, including:

or,

or,

The heterogeneous access category restriction factor p _n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are backlogged during the preset time period before the current time

Specifically, including:

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. In this case, the access decision is made according to its own heterogeneous priority, including:

Generating a random number X, 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.

When the heterogeneous priority is a heterogeneous ACB factor, 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.

As shown in FIG. 12, 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.

In the embodiment of the present application, 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.

among them,

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.

In the embodiment of the present application, 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:

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 ∞;

Specifically, including:

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

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 ∞;

Specifically, including:

Where CW _n1,s is the heterogeneous contention window of the backlogged terminal, CW _n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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.

Specifically, including:

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

Increase as the increase

Specifically, including:

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 ∞;

Specifically, including:

Increase as the increase

Specifically, including:

Specifically, including:

Increase as the increase

Specifically, including:

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 ∞;

Specifically, including:

Increase as the increase

Specifically, including:

Specifically, including:

Increase as the increase

Specifically, including:

Among them, CW _{n1, s} is a heterogeneous competition window of the terminal, AC _n is the priority of the service to which the terminal belongs, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.

When the waiting time BD _n of the information in the buffer does not exceed the delay threshold, 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 ∞:

Specifically, including:

Where CW _n1,s is the heterogeneous contention window of the terminal, S ^max is the delay threshold, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.

Specifically, including:

Among them, CW _{n1, s} is the heterogeneous contention window of the terminal, S ^max is the delay threshold, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.

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 ∞;

Specifically, including:

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;

Specifically, including:

Where CW _n1,s is the heterogeneous contention window of the backlogged terminal, CW _n2,s 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.

Specifically, including:

Specifically, including:

Where CW _n1,s is the heterogeneous contention window of the backlogged terminal, CW _n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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.

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 ∞;

Specifically, including:

Specifically, including:

Specifically, including:

Specifically, including:

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

Specifically, including:

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

Specifically, including:

(16) 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, 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,

Specifically, including:

Specifically, including:

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. In this case, 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.

or,

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.

or,

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 Retreat.

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.

When the heterogeneous priority is a heterogeneous contention window, 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.

Referring to FIG. 13, 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.

It should be noted that the 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. For the entire technical solution, the functions of the respective modules may be specifically implemented according to the method in the foregoing method embodiment. For 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.

Referring to FIG. 14, 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.

It should be noted that the 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.

Referring to Figure 15, 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 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:

among them,

C ₀ is an expected value of the number of collisions of the terminal, M is the number of access channel resources, and 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;

It should be noted that the 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. For the specific implementation process, refer to the related description in the foregoing embodiment, and details are not described herein again.

For the convenience of description, the above devices are described as being separately divided into various modules by function. Of course, the functions of each module can be implemented in the same software or software and/or hardware when implementing the present application.

The various embodiments in the specification are described in a progressive manner, and the same or similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for a device or system embodiment, since it is substantially similar to the method embodiment, the description is relatively simple, and the relevant portions can be referred to the description of the method embodiment. The apparatus and system embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, ie It can be located in one place or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. In this field The technicians can understand and implement without any creative work.

A person skilled in the art will further appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software or a combination of both, in order to clearly illustrate the hardware and software. Interchangeability, the composition and steps of the various examples have been generally described in terms of function in the above description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods for implementing the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

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.

The above description of the disclosed embodiments enables those skilled in the art to make or use the invention. Various modifications to these embodiments are obvious to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Therefore, the present invention is not to be limited to the embodiments shown herein, but the scope of the invention is to be accorded

Claims

A random access method based on heterogeneous priority, characterized in that it comprises:

Updating network information according to known access information; 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;

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.
The method according to claim 1, wherein the known access information comprises any one or more of the following: the number of collisions of the terminal in the preset time period before the current time, and the preset before the current time. The expected number of terminals successfully accessed during the time period and the number of collisions of the terminal;

The expected value of the number of collisions of the terminal is calculated according to the number of access channel resources, including:

among them,
C 0 is the expected value of the number of collisions of the terminal, and M is the number of access channel resources.
The method according to claim 2, wherein when said network information comprises an estimated value of the number of terminals requiring access to the network and a desired estimated value of the number of terminals accessing the channel resources by the backlogged terminal And updating the network information according to the known access information, including:

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 to obtain access channel resources. The expected estimate of the number of terminals includes: θ:=θ+1 if C s-1 ≥μ 1 C 0 ,

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, the estimated value of the number of terminals that need to access the network is reduced, and the terminal that is backlogged obtains the access channel resource. The expected estimate of the number of terminals, including: If C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time Updating an estimated value of the number of terminals that need to access the network and a desired estimated value of the number of terminals accessing the channel resource by the backlogged terminal, including: if μ 2 C 0 <C s-1 <μ 1 C 0 , Then θ:=0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 2 C 0 is The second threshold value, μ 2 is a threshold parameter of the second threshold value,
with
The estimated value of the number of terminals that need to access the network in the preset time period before the current time, and the expected estimated value of the number of terminals that access the channel resource in the preset time period before the current time, respectively.
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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method according to claim 2, wherein when the network information includes an estimated value of a number of terminals that need to access the network and an estimated value of the number of terminals to be backlogged, the according to the known access information Update network information, including:

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 estimated number of terminals that are backlogged. , including: if C s-1 ≥ μ 1 C 0 , then θ:=θ+1,

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, the estimated value of the number of terminals that need to access the network is reduced, and the estimated number of terminals that are backlogged is reduced. , including: if C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time The estimated value of the number of terminals that need to access the network and the estimated number of terminals that are backlogged include: if μ 2 C 0 <C s-1 <μ 1 C 0 , then θ:=0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 2 C 0 is The second threshold value, μ 2 is a threshold parameter of the second threshold value,
with
The estimated value of the number of terminals that need to access the network in the preset time period before the current time, and the estimated value of the number of terminals that are backlogged in the preset time period before the current time, respectively.
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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method according to claim 2, wherein when said network information includes an estimated value of a homogeneous ACB factor and a desired estimated value of a number of terminals of the access channel resource obtained by the backlogged terminal, Update network information based on known access information, including:

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 class restriction ACB factor, and increase the accumulated terminal to obtain the access channel resource. The expected estimate of the number of terminals includes: θ:=θ+1 if C s-1 ≥μ 1 C 0 ,

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 class restriction ACB factor, and reduce the obtained terminal channel resource by the backlogged terminal. The expected estimate of the number of terminals, including: If C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time Updating the isomorphic access class limits the estimated value of the ACB factor and the expected estimate of the number of terminals accessing the channel resources by the backlogged terminal, including: if μ 2 C 0 <C s-1 <μ 1 C 0 , Then θ:=0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method of claim 2 wherein said network information comprises isomorphism When the estimated value of the ACB factor and the estimated number of terminals are backed up, the updating the network information according to the known access information includes:

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 estimated number of terminals that are backlogged. , including: if C s-1 ≥ μ 1 C 0 , then θ:=θ+1,

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 limit ACB factor, and reduce the estimated value of the number of terminals that are backlogged, Including: If C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time Updating the isomorphic access category limits the estimated value of the ACB factor and the estimated number of terminals to be backlogged, including: if μ 2 C 0 <C s-1 <μ 1 C 0 , then θ:=0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 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,
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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method according to claim 2, wherein when said 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, Update network information based on known access information, including:

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 homogeneous contention window, and increase the number of terminals that obtain the access channel resource by the backlogged terminal. Expected estimates, including: If C s-1 ≥ μ 1 C 0 , then θ:=θ+1,

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, the estimated value of the homogeneous contention window is reduced, and the terminal that obtains the access channel resource by the backlogged terminal is reduced. The expected value of the number includes: if C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time Updating the estimated value of the isomorphic contention window and the expected estimate of the number of terminals accessing the channel resources by the backlogged terminal, including: if μ 2 C 0 <C s-1 <μ 1 C 0 , then θ: =0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 2 C 0 is The second threshold value, μ 2 is a threshold parameter of the second threshold value,
The estimated value of the isomorphic competition window 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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method according to claim 2, wherein 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, the updating the network information according to the known access information ,include:

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 competition window, and increase the estimated value of the number of terminals to be backlogged, including: C s-1 ≥μ 1 C 0 , then θ:=θ+1,

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, the estimated value of the isomorphic competition window is reduced, and the estimated value of the accumulated number of terminals is reduced, including : If C s-1 ≤ μ 2 C 0 , then θ: =0,

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, the number of successfully accessed terminals according to the preset time period before the current time Updating 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 θ:=0,

Where s is the count value of the number of access rounds, θ is the acceleration tracking factor, μ 1 C 0 is the first threshold value, μ 1 is a threshold parameter of the first threshold value, and μ 2 C 0 is The second threshold value, μ 2 is a threshold parameter of the second threshold value,
The estimated value of the isomorphic competition window within the preset time period before the current time,
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, and λ is the average reaching rate of the terminal; The initial values of the s, the network information, and the θ are: s: =0,

θ: =0.
The method according to claim 1, wherein the local information comprises a combination of any one or more of the following: a time at which the terminal is backlogged, a priority of a service to which the terminal belongs, and a waiting time for information in the buffer.
The method of claim 1 further comprising:

When the access channel resource changes, the changed channel resource information is sent to the terminal, so that after receiving the changed channel resource information, the terminal performs the connection according to its heterogeneous priority level and the changed channel resource information. Into the decision;

The access channel resource includes a combination of any one or more of the following: a subchannel resource, a different access slot resource, and a random access preamble resource;

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.
A random access method based on heterogeneous priority, characterized in that it comprises:

Receiving network information 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 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;

Calculating the heterogeneous priority according to the network information and the local information of the terminal, and performing access decision according to the heterogeneous priority of the network; the heterogeneous priority includes: heterogeneous access category restricting ACB factor or heterogeneous Competition window.
The method according to claim 11, wherein the known access information comprises a combination of any one or more of the following: a collision time of the terminal within a preset time period before the current time The number of terminals successfully accessed in the preset time period before the current time and the expected number of collision times of the terminal;

The expected value of the number of collisions of the terminal is calculated according to the number of access channel resources, including:

among them,
C 0 is the expected value of the number of collisions of the terminal, and M is the number of access channel resources.
The method according to claim 11, wherein the local information comprises a combination of any one or more of the following: a time at which the terminal is backlogged, a priority of a service to which the terminal belongs, and a waiting time for information in the buffer.
The method according to claim 13, wherein 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 access channel resources, The local information includes a time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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;

Specifically, including:

or,

Or,

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
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method according to claim 13, wherein 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 that are backlogged, the local information includes that the terminal is backlogged. Time, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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;

Specifically, including:

Or,

or,

The heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time: an estimate of the number of terminals that are backlogged during the preset time period before the current time
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method according to claim 13, wherein said network information comprises an estimated value of a homogeneous ACB factor and a desired estimated value of a number of terminals of the access channel resource obtained by the backlogged terminal, said local The information includes the time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 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;

Specifically, including:

or,

or,

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
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, said local information includes a time at which the terminal is backlogged, and When the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 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;

Specifically, including:

or,

or,

The heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time: an estimate of the number of terminals that are backlogged during the preset time period before the current time
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method of claim 13 wherein said network information comprises an estimated value of a homogeneous contention window and a desired estimate of the number of terminals accessing the channel resource by the backlogged terminal, said local The information includes the time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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;

Specifically, including:

or,

or,

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
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, said local information comprises a terminal When the backlog priority includes the heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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;

Specifically, including:

or,

or,

The heterogeneous ACB factor p n2,ss for the terminal attempting to access for the first time: an estimate of the number of terminals that are backlogged during the preset time period before the current time
When less than the optimal number of accesses, p n2,s with 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;
When it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 method according to claim 13, wherein 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 access channel resources, The local information includes a priority of a service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

p n,s =aAC n ;

Where p n1,s is the heterogeneous ACB factor of the terminal, AC n is the priority of the service to which the terminal belongs, and a is a constant.
The method according to claim 13, wherein 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 that are backlogged, the local information includes a service to which the terminal belongs. Priority, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

p n,s =aAC n ;

Where p n1,s is the heterogeneous ACB factor of the terminal, AC n is the priority of the service to which the terminal belongs, and a is a constant.
The method according to claim 13, wherein 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 access channel resources, The local information includes a waiting time of information in the buffer, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

When the waiting time BD n of the information in the buffer does not exceed the delay threshold, 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;

Specifically, including:

Where p n1,s is the heterogeneous ACB factor of the terminal, S max is the delay threshold, and a is a constant.
The method according to claim 13, wherein when said network information comprises an estimated value of a number of terminals requiring access to the network and an estimated value of the number of terminals to be backlogged, said local information comprises in a buffer Waiting time for information, and when the heterogeneous priority includes a heterogeneous ACB factor,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

When the waiting time BD n of the information in the buffer does not exceed the delay threshold, 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;

Specifically, including:

Where p n1,s is the heterogeneous ACB factor of the terminal, S max is the delay threshold, and a is a constant.
The method according to claim 13, wherein 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 access channel resources, The local information includes a time when the terminal is backlogged, a waiting time of information in the buffer, and a priority of a service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

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;

Specifically, including:

or,

or,

The heterogeneous access class restriction 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
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method of claim 13 wherein said network information comprises An estimated value of the number of terminals to be connected to the network and an estimated value of the number of terminals to be backlogged, the local information including the time when the terminal is backlogged, the waiting time of the information in the buffer, and the priority of the service to which the terminal belongs. And when the heterogeneous priority includes a heterogeneous ACB factor,

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;

Specifically, including:

or,

or,

The heterogeneous access class restriction factor p n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are accumulated in the preset time period before the current time
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method according to claim 13, wherein said network information comprises an estimated value of a homogeneous ACB factor and a desired estimated value of a number of terminals of the access channel resource obtained by the backlogged terminal, said local The information includes the time when the terminal is backlogged, the waiting time of the information in the buffer, and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

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; When the back time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

Or,

The heterogeneous access class restriction 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
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, said local information includes a time at which the terminal is backlogged, buffering The waiting time of the information in the zone and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

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; When the back time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

or,

The heterogeneous access category restriction factor p n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are backlogged during the preset time period before the current time
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method of claim 13 wherein said network information comprises an estimated value of a homogeneous contention window and a desired estimate of the number of terminals accessing the channel resource by the backlogged terminal, said local The information includes the time when the terminal is backlogged, and the waiting time of the information in the buffer. And the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

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; When the back time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

or,

The heterogeneous access class restriction 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
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, said local information includes time at which the terminal is backlogged, buffering The waiting time of the information in the zone and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous ACB factor,

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; When the back time b n,s exceeds the delay threshold, p n1,s is a minimum value close to 0 or 0;

Specifically, including:

or,

Or,

The heterogeneous access category restriction factor p n2,s for the terminal attempting to access for the first time: an estimated number of terminals that are backlogged during the preset time period before the current time
When less than the optimal number of accesses, p 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 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 it is greater than or equal to the optimal number of accesses, p n2, s is a minimum value that is close to 0 or 0;

Specifically, including:

Where 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 For the delay threshold, a is a constant.
The method according to any one of claims 14 to 29, wherein the access decision is made according to its own heterogeneous priority, including:

Generating a random number X that satisfies a uniform distribution of (0, 1) and compares the size of the X with the heterogeneous ACB factor;

If the X is smaller than the heterogeneous ACB factor, access is performed, and an access channel resource is randomly selected to send 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 method according to claim 13, wherein 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 access channel resources, The local information includes a time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous contention window,

Calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, include:

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 ∞;

Specifically, including:

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.
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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein 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 that are backlogged, the local information includes that the terminal is backlogged. Time, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein said network information comprises an estimated value of a homogeneous ACB factor and a desired estimated value of a number of terminals of the access channel resource obtained by the backlogged terminal, said local The information includes the time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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.
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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, said local information includes a time at which the terminal is backlogged, and When the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method of claim 13 wherein said network information comprises an estimated value of a homogeneous contention window and a desired estimate of the number of terminals accessing the channel resource by the backlogged terminal, said local The information includes the time when the terminal is backlogged, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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.
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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, said local information includes a time at which the terminal is backlogged, and When the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein 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 access channel resources, The local information includes a priority of a service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

Among them, CW n1, s is a heterogeneous competition window of the terminal, AC n is the priority of the service to which the terminal belongs, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.
The method according to claim 13, wherein 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 that are backlogged, the local information includes a service to which the terminal belongs. Priority, and when the heterogeneous priority includes a heterogeneous contention window,

Calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, include:

Among them, CW n1, s is a heterogeneous competition window of the terminal, AC n is the priority of the service to which the terminal belongs, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.
The method according to claim 13, wherein 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 access channel resources, The local information includes a waiting time of information in the buffer, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

When the waiting time BD n of the information in the buffer does not exceed the delay threshold, 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 ∞:

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the terminal, S max is the delay threshold, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.
The method according to claim 13, wherein when said network information comprises an estimated value of a number of terminals requiring access to the network and an estimated value of the number of terminals to be backlogged, said local information comprises in a buffer Waiting time for information, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

When the waiting time BD n of the information in the buffer does not exceed the delay threshold, 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 ∞:

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the terminal, S max is the delay threshold, and the symbol <*> indicates that the value in the angle brackets is rounded off, and a is a constant.
The method according to claim 13, wherein 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 access channel resources, The local information includes a time when the terminal is backlogged, a waiting time of the information in the buffer, and a priority of the service to which the terminal belongs, and the heterogeneous priority includes a heterogeneous contention window.

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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.
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 greater than or equal to the optimal number of accesses, CW n2,s is a maximum value or ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein 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 that are backlogged, the local information includes that the terminal is backlogged. Time, the waiting time of the information in the buffer, and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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. The increase 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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein said network information comprises an estimated value of a homogeneous ACB factor and a desired estimated value of a number of terminals of the access channel resource obtained by the backlogged terminal, said local The information includes the time when the terminal is backlogged, the waiting time of the information in the buffer, and the priority of the service to which the terminal belongs, and the heterogeneous priority includes a heterogeneous contention window.

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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.
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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous ACB factor and an estimated value of the number of terminals to be backlogged, said local information includes a time at which the terminal is backlogged, buffering The waiting time of the information in the area and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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 ∞;

Specifically, including:

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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method of claim 13 wherein said network information comprises an estimated value of a homogeneous contention window and a desired estimate of the number of terminals accessing the channel resource by the backlogged terminal, said local The information includes the time when the terminal is backlogged, the waiting time of the information in the buffer, and the priority of the service to which the terminal belongs, and the heterogeneous priority includes a heterogeneous contention window.

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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

Specifically, including:

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.
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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to claim 13, wherein when said network information comprises an estimated value of a homogeneous contention window and an estimated value of the number of terminals to be backlogged, said local information includes time at which the terminal is backlogged, buffering The waiting time of the information in the area and the priority of the service to which the terminal belongs, and when the heterogeneous priority includes a heterogeneous contention window,

The calculating the heterogeneous priority of the network according to the network information and the local information of the terminal, including:

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

Specifically, including:

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 ∞;

Specifically, including:

Where CW n1,s is the heterogeneous contention window of the backlogged terminal, CW n2,s is the heterogeneous contention window of the terminal attempting to access for the first time, and 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 method according to any one of claims 31 to 46, wherein the access decision is made according to its own heterogeneous priority, including:

Randomly selecting an integer from the set {0,...CW n,s } as the backoff value;

If the selected backoff value is 0, an access channel resource is randomly selected for access;

Otherwise, exit the access.
The method of claim 11 further comprising:

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, accessing according to the heterogeneous priority level and the changed channel resource information decision making;

The access channel resource includes a combination of any one or more of the following: a subchannel resource, a different access slot resource, and a random access preamble resource;

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.
A random access device based on heterogeneous priority, characterized in that it comprises:

And 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 the random access device of claim 49.
A random access device based on heterogeneous priority, characterized in that it comprises:

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 the random access device of claim 51.
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 more 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, and a backend of the backlogged terminal Estimates of the number, isomorphic access categories, estimates of the ACB factor, and estimates of the isomorphic contention window;

The heterogeneous priorities include: heterogeneous access categories limit ACB factors or heterogeneous contention windows.
The system according to claim 53, wherein the known access information comprises any one or more of the following: a number of collisions of the terminal in a preset time period before the current time, and a preset before the current time The expected number of terminals successfully accessed during the time period and the number of collisions of the terminal;

The expected value of the number of collisions of the terminal is calculated according to the number of access channel resources, including:

among them,
C 0 is the expected value of the number of collisions of the terminal, and M is the number of access channel resources.
The system according to claim 53, wherein said local information comprises any one or more of the following: a time at which the terminal is backlogged, a priority of a service to which the terminal belongs, and a waiting time for information in the buffer.
The system of claim 53 wherein:

The access point 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 And the changed channel resource information is used for access decision;

The terminal 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 changed channel resource information for access decision;

The access channel resource includes a combination of any one or more of the following: a subchannel resource, a different access slot resource, and a random access preamble resource;

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.