CN109195228B - Lead code distribution method for machine type communication random access process - Google Patents
Lead code distribution method for machine type communication random access process Download PDFInfo
- Publication number
- CN109195228B CN109195228B CN201811295923.9A CN201811295923A CN109195228B CN 109195228 B CN109195228 B CN 109195228B CN 201811295923 A CN201811295923 A CN 201811295923A CN 109195228 B CN109195228 B CN 109195228B
- Authority
- CN
- China
- Prior art keywords
- mtc
- access
- preamble
- random access
- preambles
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 238000004891 communication Methods 0.000 title claims abstract description 24
- 230000008569 process Effects 0.000 title claims abstract description 18
- 238000009826 distribution Methods 0.000 title claims abstract description 14
- 230000007246 mechanism Effects 0.000 claims abstract description 18
- 238000005457 optimization Methods 0.000 claims description 9
- 238000013468 resource allocation Methods 0.000 claims description 9
- 230000036961 partial effect Effects 0.000 claims description 5
- 239000000126 substance Substances 0.000 claims description 4
- 230000002860 competitive effect Effects 0.000 claims description 3
- 238000009795 derivation Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 238000011160 research Methods 0.000 abstract description 14
- 238000010586 diagram Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 7
- 238000000638 solvent extraction Methods 0.000 description 7
- 238000004458 analytical method Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 230000007423 decrease Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 1
- 239000003054 catalyst Substances 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- 230000000670 limiting effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000002829 reductive effect Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 230000001225 therapeutic effect Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a lead code distribution method in a machine type communication random access process, which comprises the following steps: s1: establishing a lead code distribution mechanism and an urn model; s2: defining the probability of access idle and/or access success and/or access conflict according to the model; s3: finding an optimal number of preambles
According to the optimal preamble number
Preamble allocation is performed. The method is combined with an urn model and a game theory, aims at the maximum access success probability, and researches an optimal lead code distribution strategy when H2H and MTC are accessed in a mixed mode and the number of terminals is given.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a preamble allocation method in a random access process of machine type communication.
Background
Machine Type Communications (MTC) is defined as machine-to-machine (M2M) communications for data transmission through a cellular network, that is, mobile M2M communications or cellular network M2M communications well known in academia and industry, and its application fields include smart grid, smart transportation, smart home, remote measurement, wireless sensor network, etc., and are an essential component of emerging internet of things and future ubiquitous networks. The wide industrial application means a huge amount of MTC terminals. The Cisco and Ericsson research reports indicate that: by 2015 and 2020, MTC terminals will reach 250 and 500 billion respectively, and the total amount of MTC terminals will be 4-6 times the total amount of H2H (human to human) terminals compared to the population numbers of 72 and 80 billion. The research report of 3GPP (the 3rd generation partner project) also indicates that: the number of the MTC terminals in a single cell can reach 3.5 ten thousand, which is 10-30 times of the number of the H2H terminals in the single cell. When a large-scale MTC terminal initiates a communication request to a bearer network, the instantaneous burstiness thereof will cause severe congestion or traffic overload of the network, and currently, designing an access control mechanism and a resource allocation strategy that are adapted to the characteristics is a hot research direction of MTC.
Traffic overload caused by synchronous network access of massive MTC terminals affects various parts of a network including a radio access network, a core network and a control plane. The random access process is an initial access process of communication between a terminal and a network, is a decisive link for ensuring the establishment of communication, is very important in the design and performance analysis of an access control mechanism, and is widely concerned by standardization organizations and academic circles. As important participants in this field, 3GPP proposes the following six candidate research directions: access class barring mechanism (access class barring); secondly, MTC dedicated random access resources (separate RACH resources for MTC); dynamic allocation of random access resources (RACH resources); an MTC-specific back-off scheme (MTC); admission mechanism (slotted access) in the controlled slot; sixth, dynamic wake-up mechanism (pull based scheme). The above candidate directions provide good reference for the design of the MTC overload control mechanism, however, at present, only (i), (v) and (sixty) have mature engineering schemes approved by 3 GPP. Prior art 1(Tauhidul Islam M, Taha A E M, Akl S.A surface of Access Management Techniques in Machine types Communications [ J ]. IEEE Communications major, 2014,52(4):74-81.) and prior art 2(Laya A, Alonso L, Alonso-Zarate J. is the Random Access Channel of LTE and LTE-A surface for M2M Communications: A surface of Alternatives [ J ]. IEEE Communications surfaces & Tutorials 2014,16(1):4-16.) have shown a comprehensive result of the study in this field: research achievements except 3GPP can be classified into the above categories, or a certain category of candidate directions are improved independently, or a combination of the certain category of candidate research directions is improved; secondly, there are more optimization and performance analysis on Media Access Control (MAC) flows, but relatively few research on random access resource allocation. Prior art 3 (wangwei. preamble management and backoff algorithm [ D ] in LTE random access, beijing university of transportation, 2009.) analyzes access collision and success probability of a preamble management scheme based on resource sharing and reservation in a pure H2H service scenario. In the prior art 4 (Ki-Dong Lee, san Kim and Byung Yi, Throughput composite of Random Access Methods for M2M Service Over LTE Networks [ A ]. IEEE GLOBECOM Workshops [ C ]. Houston, USA,2011: 373-. However, neither of prior art 3 and 4 gives an optimal allocation of shared resources. In prior art 5(Pang Y, Chao S, Lin G, et al. network Access for M2M/H2H Hybrid Systems: A Game therapeutic application [ J ]. IEEE Communications Letters, Early Access.) a Game theory is applied, and a load balancing strategy when H2H and MTC are accessed in a Hybrid manner and share a fixed resource ratio is analyzed with a maximum throughput target, but the inverse problem is not researched. In the prior art 6(Kim D, Kim W, An S.adaptive random access channel preamble in LTE [ A ]. IEEE Wireless Communications and Mobile Computing Conference [ C ]. Sardinia, Italy,2013:814-819.) a resource sharing scheme based on the proportion of common users and exclusive users in a pure H2H service scene is analyzed, and adaptive resource allocation can be realized by estimating the number of the two types of users in real time. However, the access collision and success probability are solved by the throughput calculation method of the research multi-reference ALOHA system, on one hand, the influence and the effect of the number of terminals and the number of resources are not reflected, on the other hand, the analysis is limited by the poisson arrival process, and the method is difficult to popularize to an MTC application scenario with non-poisson characteristics.
In order to relieve the bearing pressure of a wireless access network when a large amount of MTC accesses the network and perfect the research on random access resource allocation in a 3GPP candidate direction, the invention provides a leader code allocation method in a machine type communication random access process.
Disclosure of Invention
In view of the above defects in the prior art, an object of the present invention is to provide a preamble allocation method for a random access procedure of machine type communication, which combines a vat model and a game theory, and researches an optimal preamble allocation strategy for a hybrid access of H2H and MTC with a given number of terminals, with a goal of maximum access success probability.
The invention is realized by the technical scheme, a lead code distribution method of machine type communication random access process comprises the following steps:
s1: establishing a lead code distribution mechanism and an urn model;
s2: defining the probability of access idle and/or access success and/or access conflict according to the model;
s3: finding an optimal number of preambles
According to the optimal preamble number
Preamble allocation is performed.
Further, the specific process of establishing the preamble allocation mechanism and the vat model in step S1 is as follows:
s11: setting the number of preamble codes used for competitive random access in each random access time slot as m, the number of users initiating random access application as n, wherein the n users randomly select m preamble codes, and when more than two users select the same preamble code, conflict is generated;
s12: equating m lead codes to m undifferentiated vats, equating n users to n undifferentiated balls, and randomly throwing the n balls into the m vats;
s13: observing the number of balls in each vat, wherein vats without balls correspond to idle lead codes, vats with 1 ball correspond to lead codes which are successfully applied, and vats with more than 2 balls correspond to conflicting lead codes;
s14: let Mr(n, m) represents the number of vats with r balls, the average of which can be expressed as:
wherein, E [ M0(n,m)]Indicating the number of idle preambles, E [ M ]1(n,m)]Number of preambles indicating successful access, EMr≥2(n,m)]Number of preambles indicating collision, rE [ M ]r(n,m)]The number of users in the corresponding vat is indicated.
Further, when E [ M ] is obtainedr(n,m)]Then, if the station is at the user's angle, the probabilities of successful access and access collision can be respectively expressed as:
wherein the content of the first and second substances,
further, when E [ M ] is obtainedr(n,m)]Then, if the station is at the angle of the preamble or the base station, the probabilities of access idle, access success and access collision can be respectively expressed as:
wherein the content of the first and second substances,
further, the preamble allocation procedure in step S3 includes:
the H2H terminal and the MTC terminal share m preambles and perform resource allocation according to the H2H and MTC number ratio, that is:
where m denotes the total number of preambles used for contention random access, mMTCAnd mH2HRespectively representing allocation to MTC and HNumber of preambles of 2H terminals;
when MTC monopolizes part of lead code, the method obtains
The optimization model of (2) is:
max PsU(nH2H,m-mMTC)+PsU(nMTC,mMTC) (5)；
when MTC shares partial preamble with H2H, the derivation
The optimization model of (2) is:
due to the adoption of the technical scheme, the invention has the following advantages: the method is combined with an urn model and a game theory, aims at the maximum access success probability, and researches an optimal lead code distribution strategy when H2H and MTC are accessed in a mixed mode and the number of terminals is given. The direct relation between the number of users and the number of resources is established according to the strategy, the method can be popularized to the allocation of random access time slots and control channels, and the statistical characteristics that the conditions are average and different services can be integrated are adopted, so that the method has strong popularization.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention.
Drawings
The drawings of the invention are illustrated as follows:
fig. 1 is a flowchart illustrating a preamble allocation method in a random access procedure of machine-type communication.
Fig. 2a shows an MTC exclusive part preamble partitioning scheme.
Fig. 2b shows that MTC and H2H share part of preamble partition.
FIG. 3 shows an optimal number of preambles
Existence schematic of the optimal solution.
FIG. 4 is an optimal number of preambles
And nMTCAnd nH2HSchematic diagram of the relationship of (1).
FIG. 5 shows that when nH2HP for different preamble partitioning schemes when equal to 5sUCompare the figures.
FIG. 6 shows that when n isH2HP for different preamble partitioning schemes when 10sUCompare the figures.
FIG. 7 shows that when n isH2HP for different preamble partitioning schemes when 10iBCompare the figures.
Detailed Description
The invention is further illustrated by the following figures and examples.
Examples, as shown in fig. 1 to 3; a lead code distribution method of machine type communication random access process includes:
s1: establishing a lead code distribution mechanism and an urn model;
s2: defining the probability of access idle and/or access success and/or access conflict according to the model;
s3: finding an optimal number of preambles
According to the optimal preamble number
Preamble allocation is performed.
In a classical cellular network (e.g., GSM, UMTS, LTE, etc.), the random access procedure can be divided into two modes, contention and non-contention. In the non-contention mode, the base station allocates the reserved preamble to a specific terminal (such as a terminal requiring cell handover), thereby avoiding random access collision. Since non-contention random access is collision-free when the reserved preambles are larger than a certain number of users, the present invention focuses mainly on preamble allocation at the time of contention random access.
In the contention mode, all terminals randomly select the preamble, and when a plurality of terminals select the same preamble for random access, a random access collision is generated, that is, when a plurality of terminals select to transmit the same preamble in the same random access slot, a collision is generated. The number of preamble codes used for competitive random access in each random access time slot is set as m, the number of users initiating random access application is set as n, the n users randomly select the m preamble codes, and when more than two users select the same preamble code, conflict is generated. This process can be directly linked to the problem of immigration (Occupancy issues) in the vat model: the method comprises the steps of enabling m lead codes to be equivalent to m undifferentiated vats, enabling n users to be equivalent to n undifferentiated balls, randomly throwing the n balls into the m vats (namely, occupying each vat by the probability of 1/m), observing the number of the balls in each vat, enabling vats without balls to correspond to idle lead codes, enabling vats with 1 ball to correspond to lead codes which are successfully applied, and enabling vats with more than 2 balls to correspond to conflicting lead codes.
From the relevant conclusions of the vat model immigration problem it can be seen that: let Mr(n, m) represents the number of vats with r balls, the average of which can be expressed as:
by analogy with the contention random access preamble transmission process and the problem of the presence of the ping-pong model, it can be known that: e [ M ]0(n,m)]Indicating the number of idle preambles, E [ M ]1(n,m)]Number of preambles indicating successful access, EMr≥2(n,m)]Number of preambles indicating collision, rE [ M ]r(n,m)]The number of users in the corresponding vat is indicated.
Defining the probability of access idle and/or access success and/or access conflict according to the model;
when obtaining E [ M ]r(n,m)]Then, if the station is in the angle of the user and the preamble, there will be two defining ways of access success/collision probability.
wherein, PsUProbability of successful access from station to user, PcUProbability of access collision for a station at a user angle; and is
wherein, PiBProbability of access to idle for preamble or base station angle, PsBProbability of successful access for preamble or base station angle, PcBProbability of access collision for a station at a user angle; and is
Considering that most of the existing research results are analyzed from the user perspective and the resource idle rate is less considered, the invention firstly refers to definition 1 and takes P as PsUThe maximum optimal resource allocation strategy of the lead code during target analysis H2H and MTC hybrid access is provided; the resource vacancy rate of the optimal allocation strategy is then analyzed with reference to definition 2, and the effectiveness thereof is further evaluated.
As shown in fig. 2, fig. 2 shows two Preamble partitioning (Preamble Split) manners proposed by 3GPP, where m represents the total number of preambles used for contention random access, and m isMTCAnd mH2HIndicating the number of preambles allocated to MTC and H2H terminals, respectively. Fig. 2a shows MTC exclusive partial preamble, and fig. 2b shows MTC sharing partial preamble with H2H. The main contribution of the invention is to solve two mechanisms when the number of H2H and MTC terminals is givenOptimal number of preambles down-allocated to MTC
And compare its performance with the two simplest classes of preamble allocation mechanisms. The two types of comparison schemes do not perform resource division, namely that m lead codes are shared by H2H and MTC, and resource allocation is performed according to the quantity ratio of H2H to MTC, namely that:
when MTC monopolizes part of lead code, the method obtains
The optimization model of (2) is:
max PsU(nH2H,m-mMTC)+PsU(nMTC,mMTC) (5)；
even though the total access success probability is the greatest for the white and gray areas. Number of users n of white area and gray area due to MTC monopolizing the preamble of gray area1And n2Are each nH2HAnd nMTC。
When MTC shares partial preamble with H2H, the derivation
The optimization model of (2) is:
since MTC shares the gray area with H2H, the number of users n of the white area and the gray area1And n2Are each nH2HmH2HM and nH2HmMTC/m+nMTC。
Comparing (5) and (6) shows that: the difference between the two methods is that the calculation methods of the number of users in the white area and the number of users in the gray area are different, and the white area and the gray area have equivalent conversion relation, so that the optimization of any distribution method can be completed.
Substituting the formula (2) into the formula (5) and then utilizing the Lagrange method to obtain the product
However, this involves solving a non-linear high-order power function, which makes it difficult to provide an analytical solution. However, using the following limit theorem, an approximate solution can be given: if n, m → ∞ and nm-1→λ＜∞，
Thus, P can be obtainedsU→ exp (-lambda), and substituting it into (7) can be obtained
The lagrange equation of (a) is:
the invention has given H2H and MTC mixed access and given terminal number, in PsUMaximum target optimal preamble allocation strategy. Compared with a solution method based on the ALOHA protocol and the Poisson hypothesis, the strategy establishes a direct relation between the number of the users and the number of the terminals, and leaves the option of the arrival process of the customers to researchers, namely the strategy does not carry out the calculation on nH2HAnd nMTCWhich kind of random process is adopted for limitation, once nH2HAnd nMTCAfter the statistical characteristics are determined, the equations (1) - (3) can be solved again by using the conditional probability and the conditional average, so that the application range of the method is wider.
As shown in fig. 3 to 7, the present invention also gives specific numerical analysis. Under the protocol framework of the LTE/LTE-A of the next generation mobile communication system, a base station periodically provides random access time slots, the period can be flexibly adjusted between 1ms and 20ms, each cell in each access time slot has 64 mutually orthogonal lead codes, and the lead codes compete for each otherContention and non-contention random access share 64 preambles. In order to evaluate the bearing pressure of a random access channel (PRACH) when the MTC accesses the network, the 3GPP proposes to analyze a 5ms random access period and a contention and non-contention preamble ratio of 54/10, that is, m is 54; n isH2HAnd nMTCThe value range of (A) is generally in the range of 5 to 30.
FIG. 3 demonstrates the equilibrium point sum of equation (5)
Existence of an optimal solution. Let n beH2HFig. 3 shows the difference n as 10MTCWhen H2H and the probability of successful access of the MTC terminal are 5,10,15, it can be found that: 1) increase mMTCThe probability of successful access of H2H is reduced, the probability of successful access of MTC is increased, and the two are a pair of irreconcilable indexes; 2) at the equilibrium point, the probability of successful access of the two is equal, and an equilibrium solution of the formula (5) is formed, and the solution is the equilibrium solution
3) With nMTCIn the case of the increase in the number of,
the number of MTC terminals to be allocated to an MTC needs to be increased, which is not linear, however, nMTCThe larger the increment, the smaller the increment, and the stable value is finally approached, and the phenomenon can be obtained by observing the slope change of each curve in the graph.
FIG. 4 depicts the difference nMTCAnd nH2HWhen the temperature of the water is higher than the set temperature,
the values of (a) can be found as follows: 1) with nMTCIn the case of the increase in the number of,
will increase and increment with nMTCThe increase of (a) gradually decreases and finally approaches a stable value, which is consistent with the conclusion of fig. 3; 2) when n isMTCIs equal to nH2HH2H andthe MTC divides the lead codes into 54 equally, and each lead code occupies 27 lead codes; 3) with nH2HIn the case of the increase in the number of,
will decrease by an amount corresponding to nH2HThe variation is almost linear because the three curves in fig. 3 are almost equally spaced.
FIGS. 5 and 6 depict the equation when n isH2H5 and nH2HWhen 10, equations (5), (6) and P without three mechanisms for resource partitioningsUIt can be found that: 1) p for optimal resource partitioningsUMaximum, proportional division, and minimum resource division because
The process of searching for a balanced solution exists in the process of solving the number of users integrating H2H and MTC; 2) when n is, howeverMTCLess frequently, PsUIs not much improved, and has the advantage of only nMTCThe method can be slowly embodied when the size is larger, and the method just caters to the application scene of a large number of MTC terminals; 3) when the number of MTC terminals is 5-8 times of H2H, PsUThe lifting amount of the catalyst can reach 5 to 10 percent.
FIG. 7 shows nH2HThe preamble idle rate of the above three mechanisms can be found as 10: 1) the resource vacancy rate of the proportional division is the lowest, the resource division is not performed for times, and the optimal division is the highest, namely the optimal division fully utilizes the residual lead code resource of H2H to serve the MTC; 2) this also means that the access success probability is increased, and higher resource idle rate is inevitably used as a cost, when the two conflicting indexes are processed, the selection of the total amount m is crucial, and decreasing m can make the resource idle rates of the three mechanisms approach and decrease continuously, but inevitably decreases PsUTherefore, the network optimization needs to be set correspondingly according to specific situations or a dynamic allocation mechanism of m is established.
The method is combined with an urn model and a game theory, aims at the maximum access success probability, and researches an optimal lead code distribution strategy when H2H and MTC are accessed in a mixed mode and the number of terminals is given. Numerical simulation shows that: when the number of the MTC terminals is large, lead code division is necessary, and the advantages of an optimal strategy are obvious; when the number of the MTC terminals is 5-8 times that of the H2H terminals, the access success probability can be improved by 5% -10% through the optimal strategy. The model built can be generalized to optimal allocation of random access slots. The related conclusion can provide reference for the dynamic resource allocation strategy under the massive MTC scene.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting the same, and although the present invention is described in detail with reference to the above embodiments, those of ordinary skill in the art should understand that: modifications and equivalents may be made to the embodiments of the invention without departing from the spirit and scope of the invention, which is to be covered by the claims.
Claims (1)
1. A preamble allocation method for random access procedure of machine type communication is characterized in that the method comprises the following steps:
s1: establishing a lead code distribution mechanism and an urn model;
s2: defining the probability of access idle and/or access success and/or access conflict according to the model;
s3: finding an optimal number of preambles
According to the optimal preamble number
Lead code distribution is carried out;
the specific process of establishing the preamble allocation mechanism and the vat model in the step S1 is as follows:
s11: setting the number of preamble codes used for competitive random access in each random access time slot as m, the number of users initiating random access application as n, wherein the n users randomly select m preamble codes, and when more than two users select the same preamble code, conflict is generated;
s12: equating m lead codes to m undifferentiated vats, equating n users to n undifferentiated balls, and randomly throwing the n balls into the m vats;
s13: observing the number of balls in each vat, wherein vats without balls correspond to idle lead codes, vats with 1 ball correspond to lead codes which are successfully applied, and vats with more than 2 balls correspond to conflicting lead codes;
s14: let Mr(n, m) represents the number of vats with r balls, the average of which can be expressed as:
wherein, E [ M0(n，m)]Indicating the number of idle preambles, E [ M ]1(n，m)]Number of preambles indicating successful access, EMr≥2(n，m)]Number of preambles indicating collision, rE [ M ]r(n，m)]Then the number of users in the corresponding vat is indicated;
when obtaining E [ M ]r(n，m)]Then, if the station is at the user's angle, the probabilities of successful access and access collision can be respectively expressed as:
wherein the content of the first and second substances,
when obtaining E [ M ]r(n，m)]Then, if the station is at the angle of the preamble or the base station, the probabilities of access idle, access success and access collision can be respectively expressed as:
wherein the content of the first and second substances,
the preamble allocation procedure in step S3 includes:
the H2H terminal and the MTC terminal share m preambles and perform resource allocation according to the H2H and MTC number ratio, that is:
where m denotes the total number of preambles used for contention random access, mMTCAnd mH2HRespectively representing the number of preambles allocated to MTC and H2H terminals;
when MTC monopolizes part of lead code, the method obtains
The optimization model of (2) is:
max PsU(nH2H，m-mMTC)+PsU(nMTC，mMTC) (5)；
number of users n of white area and gray area due to MTC monopolizing the preamble of gray area1And n2Are each nH2HAnd nMTC；
When MTC shares partial preamble with H2H, the derivation
The optimization model of (2) is:
since MTC shares the gray area with H2H, the number of users n of the white area and the gray area1And n2Are each nH2HmH2HM and nH2HmMTC/m+nMTC。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811295923.9A CN109195228B (en) | 2018-11-01 | 2018-11-01 | Lead code distribution method for machine type communication random access process |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811295923.9A CN109195228B (en) | 2018-11-01 | 2018-11-01 | Lead code distribution method for machine type communication random access process |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109195228A CN109195228A (en) | 2019-01-11 |
| CN109195228B true CN109195228B (en) | 2021-05-11 |
Family
ID=64941322
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811295923.9A Active CN109195228B (en) | 2018-11-01 | 2018-11-01 | Lead code distribution method for machine type communication random access process |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109195228B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111294775B (en) * | 2020-02-10 | 2021-04-20 | 西安交通大学 | Resource allocation method based on H2H dynamic characteristics in large-scale MTC and H2H coexistence scene |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106993335A (en) * | 2016-01-21 | 2017-07-28 | 中兴通讯股份有限公司 | Lead code sending, receiving method, device, user equipment and base station |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10321488B2 (en) * | 2016-05-27 | 2019-06-11 | Ecole Polytechnique Federale De Lausanne (Epfl) | CSMA/CA in time and frequency domains |
-
2018
- 2018-11-01 CN CN201811295923.9A patent/CN109195228B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106993335A (en) * | 2016-01-21 | 2017-07-28 | 中兴通讯股份有限公司 | Lead code sending, receiving method, device, user equipment and base station |
Non-Patent Citations (3)
| Title |
|---|
| M2M Service Platforms: Survey, Issues, and Enabling Technologies;J.Kim等;《IEEE Communications Surveys & Tutorials》;20131023;第16卷(第1期);第61-76页 * |
| 一种面向时延敏感M2M业务的Tree-splitting随机接入冲突解决算法;卢晶晶等;《中国科技论文》;20160831;第11卷(第8期);第843-848+864页 * |
| 改进的多信道S-ALOHA暂态性能分析办法及其应用;简鑫等;《电子与信息学报》;20160831;第38卷(第8期);第三部分 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109195228A (en) | 2019-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jiang et al. | Analyzing random access collisions in massive IoT networks | |
| Duan et al. | D-ACB: Adaptive congestion control algorithm for bursty M2M traffic in LTE networks | |
| Zhang et al. | QoE driven decentralized spectrum sharing in 5G networks: Potential game approach | |
| Oh et al. | Joint access control and resource allocation for concurrent and massive access of M2M devices | |
| Vilgelm et al. | LATMAPA: Load-adaptive throughput-maximizing preamble allocation for prioritization in 5G random access | |
| Morvari et al. | Two-stage resource allocation for random access M2M communications in LTE network | |
| CN104185248A (en) | Hierarchy-based heterogeneous network joint access control method | |
| CN104507038B (en) | The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks | |
| Ozera et al. | A WLAN triage testbed based on fuzzy logic and its performance evaluation for different number of clients and throughput parameter | |
| Zhan et al. | Access delay optimization of M2M communications in LTE networks | |
| Pacheco-Paramo et al. | Delay-aware dynamic access control for mMTC in wireless networks using deep reinforcement learning | |
| CN109195228B (en) | Lead code distribution method for machine type communication random access process | |
| Lee et al. | Recycling random access opportunities with secondary access class barring | |
| He et al. | Traffic‐aware overload control scheme in 5G ultra‐dense M2M networks | |
| Vikhrova et al. | Enhanced radio access procedure in sliced 5G networks | |
| Abera et al. | Learning based access class barring for massive machine type communication random access congestion control in LTE-A networks | |
| Moon et al. | Adaptive access class barring for machine-type communications in LTE-A | |
| Hwang et al. | Dynamic RACH preamble allocation scheme | |
| Ouaissa et al. | Performance analysis of random access mechanisms for machine type communications in LTE networks | |
| Kocak et al. | Fuzzy logic-based performance improvement on MAC layer in wireless local area networks | |
| Vilgelm et al. | On the resource consumption of M2M random access: Efficiency and pareto optimality | |
| Xing et al. | A novel distributed queuing-based random access protocol for narrowband-IoT | |
| Yan et al. | Improved throughput stabilizing scheme for group paging in mMTC: A traffic scattering perspective | |
| Inaba et al. | A testbed for admission control in WLANs: effects of RSSI on connection keep-alive time | |
| Althumali et al. | Dynamic tree-splitting algorithm for massive random access of M2M communications in IoT networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |