阅读说明：本技术 窄带物联网高并发接入方法、装置、计算设备及存储介质 (High-concurrency access method and device for narrow-band Internet of things, computing equipment and storage medium ) 是由 张亚男 白晓平 胡晓春 高瑜鸿 于 2019-11-27 设计创作，主要内容包括：本发明实施例涉及通信技术领域,公开了一种窄带物联网高并发接入方法、装置、计算设备及存储介质,该方法包括：根据终端的网络覆盖情况、最大容忍时延以及发起接入的等待时延计算终端的接入优先权系数；根据接入优先权系数对终端进行优先等级分组；根据优先等级分组为终端分配前导资源；对分配有前导资源的终端基于KM二分匹配的资源调度算法分配上行调度资源,并向终端发送携带有上行调度资源的随机接入响应；接收终端在上行调度资源上传输的上行信息；根据上行信息进行基于竞争的随机接入判决,确定随机接入是否成功。通过上述方式,本发明实施例能够提高终端首次接入成功率和系统容量,降低接入时延,实现上行链路容量最大化。(The embodiment of the invention relates to the technical field of communication, and discloses a high-concurrency access method, a high-concurrency access device, a high-concurrency access computing device and a high-concurrency access storage medium for a narrow-band Internet of things, wherein the method comprises the following steps of: calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerance time delay and the waiting time delay for initiating access; carrying out priority level grouping on the terminals according to the access priority coefficient; allocating a leading resource for the terminal according to the priority level grouping; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by a terminal on an uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether the random access is successful. Through the mode, the embodiment of the invention can improve the first access success rate and the system capacity of the terminal, reduce the access time delay and realize the maximization of the uplink capacity.)

1. A high concurrency access method for a narrowband Internet of things is characterized by comprising the following steps:

calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access;

performing priority level grouping on the terminal according to the access priority coefficient;

allocating a preamble resource to the terminal according to the priority level packet;

allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal;

receiving uplink information transmitted by the terminal on the uplink scheduling resource;

and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

2. The method of claim 1, wherein the calculating the access priority coefficient of the terminal according to the network coverage of the terminal, the maximum tolerable delay, and the latency of initiating access comprises:

acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal;

acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access;

and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

3. Method according to claim 2, characterized in that the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

4. The method of claim 1, wherein the prioritizing the terminals into groups according to the access priority coefficients comprises:

the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order;

initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients;

recalculating a new clustering center and comparing with the last clustering center;

if the new clustering center is the same as the last clustering center, finishing clustering;

and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

5. The method of claim 1, wherein the allocating preamble resources to the terminal according to the priority grouping comprises:

preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels;

and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

6. The method of claim 1, wherein the allocating uplink scheduling resources to the terminal allocated with preamble resources based on a KM binary matched resource scheduling algorithm comprises:

modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model;

and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

7. The method of claim 6, wherein the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ij，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijInterference noise when a terminal i occupies an uplink scheduling resource unit j to be scheduled; p is a radical of_ijAre decision variables.

8. A narrowband Internet of things high-concurrency access device, the device comprising:

the priority computing unit is used for computing an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access;

the grouping unit is used for grouping the priority levels of the terminals according to the access priority coefficient;

a preamble allocation unit, configured to allocate preamble resources to the terminal according to the priority level packet;

a resource allocation unit, configured to allocate uplink scheduling resources to the terminal to which the preamble resources are allocated based on a KM binary matching resource scheduling algorithm, and send a random access response carrying the uplink scheduling resources to the terminal;

an information receiving unit, configured to receive uplink information transmitted by the terminal on the uplink scheduling resource;

and the access judgment unit is used for carrying out random access judgment based on competition according to the uplink information and determining whether the random access is successful.

9. A computing device, comprising: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;

the memory is used for storing at least one executable instruction, and the executable instruction causes the processor to execute the steps of the narrowband internet of things high concurrent access method according to any one of claims 1 to 7.

10. A computer storage medium having stored therein at least one executable instruction to cause a processor to perform the steps of the narrowband internet of things high concurrent access method according to any of claims 1-7.

Technical Field

The embodiment of the invention relates to the technical field of communication, in particular to a high-concurrency access method and device for a narrow-band Internet of things, computing equipment and a storage medium.

Background

The Narrow-Band Internet of Things (NB-IOT) is a wireless communication technology specially oriented to The application of low-power consumption wide-coverage Internet of Things and proposed by The third Generation Partnership Project (3 GPP), can be directly deployed in The authorized frequency Band of The existing cellular network, and The Narrow-Band Internet of Things integrating The advantages of wide coverage, large connection, low power consumption, low cost and The like will certainly become an important branch of The future Internet of Things industry, and will be a strong boosting force for promoting further materialization of Internet of Things.

The NB-IOT adopts a brand-new frequency hopping preamble scheme, does not support code division multiplexing, and only supports 48 available preambles at most in each time slot under the system bandwidth of 180 KHz. The limited preamble resources greatly limit the access performance of massive terminals, and if a large number of NB-IOT terminals trigger access simultaneously, the limited preamble resources cannot process a large number of access requests simultaneously, so that access congestion occurs, the access success rate of the terminals is further seriously affected, and the access delay is increased.

Disclosure of Invention

In view of the foregoing, embodiments of the present invention provide a method, an apparatus, a computing device, and a storage medium for high concurrent access to a narrowband internet of things, which overcome or at least partially solve the above problems.

According to an aspect of an embodiment of the present invention, there is provided a method of distributing user configuration data, the method including: calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

In an optional manner, the calculating an access priority coefficient of the terminal according to a network coverage condition of the terminal, a maximum tolerable delay, and a latency of initiating access includes: acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal; acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access; and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In an alternative way, the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

In an optional manner, the performing priority grouping on the terminals according to the access priority coefficient includes: the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order; initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients; recalculating a new clustering center and comparing with the last clustering center; if the new clustering center is the same as the last clustering center, finishing clustering; and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

In an optional manner, the allocating a preamble resource to the terminal according to the priority packet includes: preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels; and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In an optional manner, the allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matching resource scheduling algorithm includes: modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model; and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

In an alternative approach, the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ij，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijInterference noise when a terminal i occupies an uplink scheduling resource unit j to be scheduled; p is a radical of_ijAre decision variables.

According to another aspect of the embodiments of the present invention, there is provided a narrowband internet of things high-concurrency access apparatus, including: the priority computing unit is used for computing an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access; the grouping unit is used for grouping the priority levels of the terminals according to the access priority coefficient; a preamble allocation unit, configured to allocate preamble resources to the terminal according to the priority level packet; a resource allocation unit, configured to allocate uplink scheduling resources to the terminal to which the preamble resources are allocated based on a KM binary matching resource scheduling algorithm, and send a random access response carrying the uplink scheduling resources to the terminal; an information receiving unit, configured to receive uplink information transmitted by the terminal on the uplink scheduling resource; and the access judgment unit is used for carrying out random access judgment based on competition according to the uplink information and determining whether the random access is successful.

According to another aspect of embodiments of the present invention, there is provided a computing device including: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication through the communication bus;

the memory is used for storing at least one executable instruction, and the executable instruction enables the processor to execute the steps of the high-concurrency access method of the narrowband Internet of things.

According to another aspect of the embodiments of the present invention, a computer storage medium is provided, where at least one executable instruction is stored in the storage medium, and the executable instruction causes the processor to execute the steps of the narrowband internet of things high concurrent access method.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.

Drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:

fig. 1 shows a flow diagram of a narrowband internet of things high-concurrency access method provided by an embodiment of the present invention;

fig. 2 shows a flowchart of step S12 of the narrowband internet of things high-concurrency access method provided by the embodiment of the present invention;

fig. 3 shows a schematic structural diagram of a narrowband internet of things high-concurrency access device provided by an embodiment of the present invention;

fig. 4 is a schematic structural diagram of a computing device provided in an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

Fig. 1 shows a flowchart of a narrowband internet of things high-concurrency access method provided by an embodiment of the present invention. The narrowband Internet of things high-concurrency access method provided by the embodiment of the invention is applied to an NB-IOT base station. As shown in fig. 1, the narrowband internet of things high-concurrency access method includes:

step S11: and calculating the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access.

Specifically, a coverage priority coefficient of the terminal is obtained according to the network coverage condition of the terminal; acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access; and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In the embodiment of the invention, the number of terminals of the internet of things needing to access the NB-IOT network is M, the set of access terminals is U ═ 1, 2, …, M, and the access priority coefficient of each terminal is calculated. For the terminal of the ith NB-IOT network to be accessed, the access priority coefficient eta is defined_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) For the loss from the base station to the current location of the terminal i, p (i) e [0, 1) is known from the formula. P_cl(i) The smaller the network coverage representing the current location of the terminal i is, the better the coverage priority coefficient p (i) is, the higher the access priority needs to be assigned.

In the embodiment of the present invention, the maximum coupling loss refers to the maximum loss allowed from the base station to the terminal under the condition that the minimum service target of NB-IOT is met, and represents the maximum coverage capability of the system. In an NB-IOT network, the maximum coupling loss is typically 164 dB. T is_wait(i) Initiating a wait time delay for terminal i to access the NB-IOT network, T_max(i) For the maximum tolerated delay of the terminal i request access, T is known_wait(i)≤T_max(i) The closer to 1, the larger the delay priority coefficient, the closer to the maximum tolerant delay requirement of the service access network, the higher the access priority needs to be allocated to the terminal. Maximum tolerated delay T_max(i) The service types determine that different service types have difference on maximum tolerant time delay of the terminal accessing the NB-IOT network, for example, the service T of intelligent meter reading type_max(i) Longer, intelligent early warning type service T_max(i) Shorter.

The terminal access priority coefficient eta provided by the embodiment of the invention_iThe requirements of multiple services on the time delay sensitivity, unbalanced access time delay and the network coverage condition of the position of the terminal are comprehensively considered. Maximum tolerated delay T in the delay factor_max(i) Considering the requirements of different terminal service types on access priority, in order to avoid total access resourcesThe access delay is unbalanced when the access delay is distributed to a service with high requirement on delay and part of terminals averagely wait for longer delay. The embodiment of the invention simultaneously considers the waiting time delay T of the terminal access network_wait(i) For the service terminal insensitive to the time delay, if the service terminal has a longer access waiting time delay, the high access priority can be obtained. On this basis, in order to ensure that a terminal with strong coverage signals can have a higher access priority, the embodiment of the invention includes a coverage priority coefficient in the terminal access priority coefficient.

Step S12: and grouping the priority levels of the terminals according to the access priority coefficient.

In the embodiment of the invention, priority level grouping is carried out on each terminal by utilizing a K-means clustering algorithm, and n terminal equipment subsets with different access priority levels are obtained. Specifically, the access priority coefficients of a preset number n of randomly selected terminals are sorted in a descending order; initializing a clustering center based on the access priority coefficients of the preset number n of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients; recalculating a new clustering center and comparing with the last clustering center; if the new clustering center is the same as the last clustering center, finishing clustering; and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center. At this point, M terminals which need to access the NB-IOT network are divided into n groups from high to low according to the access priority coefficient.

More specifically, as shown in fig. 2, step S12 includes:

step S121: and randomly selecting the access priority coefficients of the preset number n of terminals.

The preset number n may be set as needed, and is used to set M terminals currently required to access the NB-IOT network into n groups.

Step S122: the access optimization of n terminals to be accessed to the narrowband Internet of thingsCoefficient of early weight eta_iAnd (5) sorting in a descending manner, initializing a clustering center, and storing in the set delta.

That is, the cluster center is initialized based on n terminals in the set δ, that is, the n terminals are used as the initial cluster center.

Step S123: and distributing all the rest terminals to the class where the clustering center closest to the rest terminals is located according to the similarity between the access priority coefficient and the priority coefficient of the clustering center.

And distributing the rest M-n terminals to the class which is closest to the clustering center according to the access priority coefficient, thus classifying the M terminals into the initial n groups according to the access priority coefficient.

Step S124: the new cluster center is recalculated.

Specifically, the n grouped cluster centers are recalculated, respectively, to obtain n new cluster centers.

Step S125: and comparing whether the new clustering center is the same as the last clustering center. If so, go to step S125; if not, return to step S122.

Step S126: and finishing clustering.

And when the centers of the two clustering are the same, finishing the clustering. Storing the clustering grouping results of the M terminals in a set K, and recording the clustering grouping results as K ═ K₁,K₂,…,K_nAnd n is the number of the clustered access priority groups. K₁Average access priority coefficient eta of terminals in packet_iAt the maximum, the terminals of the packet have the highest access priority level. K_nAverage access priority coefficient eta of terminals in packet_iAt a minimum, the terminal of the packet has the lowest access priority level, i.e., the packets in the set K are ranked from high to low by access priority level.

Step S13: and allocating the preamble resources to the terminal according to the priority level grouping.

Specifically, the preamble resource is preferentially allocated to a packet with a higher priority level according to the priority level; and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In the embodiment of the invention, whether the number of the available preamble resources of the current cell is greater than the highest access priority level K is compared₁Number of terminals in a packet D₁. If not, all available preamble resources are allocated to K₁Priority grouping. Otherwise, the redundant preamble resources are allocated to the next highest access priority K₂Grouping and the like. All terminals in the access priority class packet allocated with the random access preamble resource randomly select a preamble from the available preamble resources, and send a contention-based random access request RA on their corresponding Narrowband Physical Random Access Channel (NPRACH) resources.

Step S14: and allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal.

In the embodiment of the invention, the NB-IOT base station adopts an uplink scheduling resource scheduling method based on a KM binary matching algorithm for all terminals receiving the random access request to allocate uplink scheduling resources for each terminal, and sends a random access response RAR to each terminal. The uplink scheduling resource is a Narrowband Physical Uplink Shared Channel (NPUSCH) resource. The scheduling method of the NPUSCH resource unit is not specified in the 3GPP protocol standard of the NB-IOT, and the base station randomly schedules the NPUSCH resource, which causes resource waste and reduces the utilization rate and capacity of uplink resources.

In step S14, modeling the allocation of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model; and according to the optimal matching mathematical model, obtaining the optimal matching between the terminal and the uplink scheduling resource unit by using a resource scheduling algorithm of KM (K-means) binary matching.

The assignment problem is a classic operation research problem, belongs to 0-1 type integer programming, and is used for matching the most appropriate uplink scheduling resource for each terminal to be accessed into the NB-IOT network so as to enable the total capacity of an uplink to be maximum. Assuming that there are N currently available uplink scheduling resource units, the transmission rate of the uplink scheduling resource unit j occupied by the terminal i to be accessed is:

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijAnd (3) interference noise when the terminal i occupies the uplink scheduling resource unit j to be scheduled.

Defining a decision variable p_ijComprises the following steps:

it is specified that each resource unit to be scheduled can only be allocated to one terminal, each terminal can only occupy one resource unit to be scheduled, and due to different time-frequency information and quality of each resource unit, the transmission rate of each uplink of the terminal is different, so that in order to maximize the total uplink capacity, the optimal matching between the terminal and the resource unit to be scheduled needs to be realized. The best match mathematical model satisfies the following relationship:

wherein the content of the first and second substances,

determination of the optimal decision variable p by coordinated control of NB-IOT base stations_ijThe mathematical model belongs to a non-convex combination optimization problem, and the optimal solution of the problem of maximizing the uplink capacity is obtained by using a KM (Kernel-based Key) matching algorithm, namely each terminal and an uplink scheduling resource listThe best match of the element.

Step S15: and receiving uplink information transmitted by the terminal on the uplink scheduling resource.

The terminal receives a random access response RAR sent by the NB-IOT base station, wherein the random access response RAR carries uplink scheduling resources, the terminal transmits uplink information on the uplink scheduling resources distributed by the random access response RAR, and the NB-IOT base station receives the uplink information.

Step S16: and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

And the NB-IOT base station performs random access judgment based on competition according to the uplink information. And if the competition resolution is successful, the terminal is successfully accessed to the narrow-band Internet of things, and the random access request RA flow based on competition is finished. If the contention resolution timer is overtime, the terminal is indicated to be unsuccessfully accessed to the narrow-band Internet of things, the terminal executes a backoff mechanism, and performs random access request RA (random access request) again after backoff for a period of time until the number of attempts reaches the maximum number of attempts, and the terminal is determined to be failed in random access.

When random preamble and NPRACH resources are allocated to terminals of the Internet of things, under the scene that massive terminals of the Internet of things are simultaneously accessed to an NB-IOT network, network coverage conditions of the positions of the terminals, sensitivity requirements of different service terminals on time delay and waiting time delay of terminal initiated access are comprehensively considered, an access priority coefficient of each terminal is obtained, then the terminals are divided into different access grade types, and terminals with high access grade can preferentially allocate the random access preamble and NPRACH resources to carry out random access requests; the base station distributes uplink scheduling resources to all terminals receiving the random access request by adopting a NPUSCH resource scheduling algorithm based on KM binary matching; and if the terminal access conflicts, retreating for a period of time for re-access until the maximum access attempt times are reached, and judging that the terminal random access fails. Compared with the prior art, the high-concurrency access method of the narrowband Internet of things fully considers the network coverage condition of the position of the terminal, the sensitivity requirements of different service terminals on time delay and the waiting time delay of the terminal for initiating access, divides the terminal to be accessed into the NB-IOT network into different access priority classes according to the access priority coefficient, effectively avoids access conflicts and signaling congestion caused by accessing a large number of terminals into the network from the source, realizes the maximization of uplink capacity during NPUSCH resource allocation, can better improve the success rate of the first access of the terminal and the system capacity, and reduces the access time delay.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

Fig. 3 shows a schematic structural diagram of a narrowband internet of things high-concurrency access device according to an embodiment of the invention. As shown in fig. 3, the narrowband internet of things high-concurrency access device includes: a priority calculation unit 301, a grouping unit 302, a preamble allocation unit 303, a resource allocation unit 304, an information reception unit 305, and an access decision unit 306. Wherein:

the priority calculation unit 301 is configured to calculate an access priority coefficient of the terminal according to a network coverage condition of the terminal, a maximum tolerable delay, and a wait delay for initiating access; the grouping unit 302 is configured to perform priority grouping on the terminal according to the access priority coefficient; the preamble allocation unit 303 is configured to allocate preamble resources to the terminal according to the priority level packet; the resource allocation unit 304 is configured to allocate uplink scheduling resources to the terminal to which the preamble resources are allocated based on a KM binary matching resource scheduling algorithm, and send a random access response carrying the uplink scheduling resources to the terminal; an information receiving unit 305 is configured to receive uplink information transmitted by the terminal on the uplink scheduling resource; the access decision unit 306 performs contention-based random access decision according to the uplink information to determine whether random access is successful.

In an alternative manner, the priority calculation unit 301 is configured to: acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal; acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access; and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In an alternative way, the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

In an alternative manner, the grouping unit 302 is configured to: the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order; initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients; recalculating a new clustering center and comparing with the last clustering center; if the new clustering center is the same as the last clustering center, finishing clustering; and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

In an alternative manner, the preamble allocation unit 303 is configured to: preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels; and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In an alternative manner, the resource allocation unit 304 is configured to: modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model; and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

In an alternative approach, the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ii，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijInterference noise when a terminal i occupies an uplink scheduling resource unit j to be scheduled; p is a radical of_ijAre decision variables.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

The embodiment of the invention provides a nonvolatile computer storage medium, wherein at least one executable instruction is stored in the computer storage medium, and the computer executable instruction can execute the high-concurrency access method of the narrow-band Internet of things in any method embodiment.

The executable instructions may be specifically configured to cause the processor to:

calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access;

performing priority level grouping on the terminal according to the access priority coefficient;

allocating a preamble resource to the terminal according to the priority level packet;

allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal;

receiving uplink information transmitted by the terminal on the uplink scheduling resource;

and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

In an alternative, the executable instructions cause the processor to:

acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal;

acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access;

and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In an alternative way, the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

In an alternative, the executable instructions cause the processor to:

the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order;

initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients;

recalculating a new clustering center and comparing with the last clustering center;

if the new clustering center is the same as the last clustering center, finishing clustering;

and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

In an alternative, the executable instructions cause the processor to:

preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels;

and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In an alternative, the executable instructions cause the processor to:

modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model;

and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

In an alternative approach, the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ij，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijInterference noise when a terminal i occupies an uplink scheduling resource unit j to be scheduled; p is a radical of_ijAre decision variables.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

Embodiments of the present invention provide a computer program product, which includes a computer program stored on a computer storage medium, where the computer program includes program instructions, and when the program instructions are executed by a computer, the computer is caused to execute the narrowband internet of things high-concurrency access method in any of the above method embodiments.

The executable instructions may be specifically configured to cause the processor to:

calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access;

performing priority level grouping on the terminal according to the access priority coefficient;

allocating a preamble resource to the terminal according to the priority level packet;

allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal;

receiving uplink information transmitted by the terminal on the uplink scheduling resource;

and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

In an alternative, the executable instructions cause the processor to:

acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal;

acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access;

and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In an alternative way, the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

In an alternative, the executable instructions cause the processor to:

the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order;

initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients;

recalculating a new clustering center and comparing with the last clustering center;

if the new clustering center is the same as the last clustering center, finishing clustering;

and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

In an alternative, the executable instructions cause the processor to:

preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels;

and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In an alternative, the executable instructions cause the processor to:

modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model;

and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

In an alternative approach, the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ij，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijInterference noise when a terminal i occupies an uplink scheduling resource unit j to be scheduled; p is a radical of_ijAre decision variables.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

Fig. 4 is a schematic structural diagram of a computing device according to an embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the device.

As shown in fig. 4, the computing device may include: a processor (processor)402, a Communications Interface 404, a memory 406, and a Communications bus 408.

Wherein: the processor 402, communication interface 404, and memory 406 communicate with each other via a communication bus 408. A communication interface 404 for communicating with network elements of other devices, such as clients or other servers. The processor 402 is configured to execute the program 410, and may specifically execute relevant steps in the above embodiment of the narrowband internet of things high concurrent access method.

In particular, program 410 may include program code comprising computer operating instructions.

The processor 402 may be a central processing unit CPU or an application Specific Integrated circuit asic or an Integrated circuit or Integrated circuits configured to implement embodiments of the present invention. The one or each processor included in the device may be the same type of processor, such as one or each CPU; or may be different types of processors such as one or each CPU and one or each ASIC.

And a memory 406 for storing a program 410. Memory 406 may comprise high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.

The program 410 may specifically be configured to cause the processor 402 to perform the following operations:

calculating an access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating access;

performing priority level grouping on the terminal according to the access priority coefficient;

allocating a preamble resource to the terminal according to the priority level packet;

allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal;

receiving uplink information transmitted by the terminal on the uplink scheduling resource;

and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful.

In an alternative, the program 410 causes the processor to:

acquiring a coverage priority coefficient of the terminal according to the network coverage condition of the terminal;

acquiring a time delay priority coefficient of the terminal according to the maximum tolerant time delay requested to be accessed by the terminal and the waiting time delay for initiating the access;

and calculating the access priority coefficient of the terminal according to the coverage priority coefficient and the time delay priority coefficient.

In an alternative way, the access priority coefficient η of the terminal i_iThe following relation is satisfied:

η_i＝αP(i)+βT(i)，

wherein T (i) is the delay priority coefficient of the terminal i, p (i) is the coverage priority coefficient of the terminal i, α and β are weight coefficients, and α + β is 1, T_wait(i) Is the waiting time delay, T, of the terminal i_max(i) Is the maximum tolerated delay, P, of the terminal i_mcl(i) For maximum coupling loss, P_cl(i) Is the loss from the base station to the current location of the terminal i.

In an alternative, the program 410 causes the processor to:

the access priority coefficients of a preset number of randomly selected terminals are arranged in a descending order;

initializing a clustering center based on the access priority coefficients of the preset number of the terminals, and distributing all the rest terminals to the class where the clustering center is located closest to the terminals according to the access priority coefficients;

recalculating a new clustering center and comparing with the last clustering center;

if the new clustering center is the same as the last clustering center, finishing clustering;

and if the new clustering center is different from the last clustering center, repeatedly clustering and recalculating the new clustering center until the new clustering center is the same as the last clustering center.

In an alternative, the program 410 causes the processor to:

preferentially distributing the leader resources to the packets with higher priority levels according to the priority levels;

and when the number of the preamble resources is larger than the number of the terminals in the packet of the previous priority level, distributing the redundant preamble resources to the packet of the next priority level.

In an alternative, the program 410 causes the processor to:

modeling the distribution of the uplink scheduling resources as an assignment problem, and establishing an optimal matching mathematical model;

and obtaining the optimal matching between the terminal and the uplink scheduling resource unit by utilizing a resource scheduling algorithm of KM binary matching according to the optimal matching mathematical model.

In an alternative approach, the best-fit mathematical model satisfies the following relationship:

max∑_i∑_jp_ijR_ij，

wherein R is_ijOccupying the transmission rate of an uplink scheduling resource unit j for a terminal i; b is_jScheduling the frequency band width, S, of resource unit j for the uplink to be scheduled_ijScheduling the transmission power, N, of the terminal i on the uplink resource unit j to be scheduled_ijWhen terminal i occupies resource unit j to be scheduledInterference noise; p is a radical of_ijAre decision variables.

The embodiment of the invention calculates the access priority coefficient of the terminal according to the network coverage condition of the terminal, the maximum tolerant time delay and the waiting time delay for initiating the access; performing priority level grouping on the terminal according to the access priority coefficient; allocating a preamble resource to the terminal according to the priority level packet; allocating uplink scheduling resources to the terminal allocated with the preamble resources based on a KM binary matched resource scheduling algorithm, and sending a random access response carrying the uplink scheduling resources to the terminal; receiving uplink information transmitted by the terminal on the uplink scheduling resource; and carrying out random access judgment based on competition according to the uplink information to determine whether random access is successful, thereby improving the success rate of first access of the terminal and the system capacity, reducing access time delay and realizing the maximization of the uplink capacity.

The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.

In the description provided herein, numerous specific details are set forth. It is understood, however, that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the invention and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specified otherwise.