CN104507038B - The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks - Google Patents

The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks Download PDF

Info

Publication number
CN104507038B
CN104507038B CN201410816294.5A CN201410816294A CN104507038B CN 104507038 B CN104507038 B CN 104507038B CN 201410816294 A CN201410816294 A CN 201410816294A CN 104507038 B CN104507038 B CN 104507038B
Authority
CN
China
Prior art keywords
mrow
msub
mfrac
msup
beta
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
Application number
CN201410816294.5A
Other languages
Chinese (zh)
Other versions
CN104507038A (en
Inventor
杜清河
李婉瑜
任品毅
孙黎
王熠晨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian Jiaotong University
Original Assignee
Xian Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian Jiaotong University filed Critical Xian Jiaotong University
Priority to CN201410816294.5A priority Critical patent/CN104507038B/en
Publication of CN104507038A publication Critical patent/CN104507038A/en
Application granted granted Critical
Publication of CN104507038B publication Critical patent/CN104507038B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access
    • H04W74/0841Random access procedures, e.g. with 4-step access with collision treatment

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Medicines Containing Antibodies Or Antigens For Use As Internal Diagnostic Agents (AREA)

Abstract

The invention discloses a kind of access overload controlling method of RAN layers in sub-clustering type M2M networks, comprise the following steps:1) each MTC device in base station is divided into by time delay sensitive type equipment and time delay insensitive equipment according to default time delay sensitivity boundary;2) base station obtains the number of users of current time slots application access, obtains corresponding pilot tone subregion when MTC device is successfully accessed total maximum and compares β*, corresponding pilot tone subregion compares β when being successfully accessed total maximum further according to MTC device*Acquisition distributes to the pilot resources number of time delay sensitive type equipment and distributes to the pilot resources number of time delay insensitive equipment;3) time delay sensitive type equipment realizes that user accesses according to the pilot resources number of distribution using ACB mechanism, and time delay insensitive equipment uses ACB mechanism accessing users according to the pilot resources number of distribution.The present invention can effectively improve MTC device access rate.

Description

The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks
Technical field
The invention belongs to M2M communication technical field, it is related to a kind of access premature beats of RAN layers in sub-clustering type M2M networks Method.
Background technology
When MTC device is disposed excessively in a certain region and the same period is more intensively accessing network, network is just Overload can be faced and possible MTC communication amount is increased sharply, and when the congestion overload of network inevitably causes unnecessary Prolong, the loss of packet, even service disruption.Overloaded for the network congestion in M2M communication, existing ACB strategies itself Underaction, it is difficult to be effectively reduced collision probability when number of users to be accessed further increases and not readily passes through adjustment phase Related parameter is realized compromise between various performances;In addition ACB strategies be only applicable to those can the equipment insensitive to time delay connect Enter and in practice the presence of delay sensitive equipment just so that ACB strategy application receive limitation.At the same time, although EAB Strategy considers time delay sensitive type equipment, but pilot resources are not realized with packet causes two class users to share fixed pilot tone money Source, this processing mode inevitably cause low priority user access unfair, in view of the above problems, it is necessary to when Prolong susceptibility as standard it is cluster structured under M2M network dynamics set pilot tone subregion ratio, connecing for MTC device is maximized with this Enter rate, but prior art is not involved with the technology of this respect.
The content of the invention
A kind of the shortcomings that it is an object of the invention to overcome above-mentioned prior art, there is provided RAN layers in sub-clustering type M2M networks Access overload controlling method, the control method can effectively improve MTC device access rate.
To reach above-mentioned purpose, the access overload controlling method of RAN layers includes in sub-clustering type M2M networks of the present invention Following steps:
1) each MTC device in base station is divided into by time delay sensitive type equipment according to default time delay sensitivity and time delay is non-quick Sense type equipment;
2) base station obtains the number of users of current time slots application access, obtains corresponding when MTC device is successfully accessed total maximum Pilot tone subregion compares β*, corresponding pilot tone subregion compares β when being successfully accessed total maximum further according to MTC device*It is quick that time delay is distributed in acquisition The pilot resources number of sense type equipment and the pilot resources number for distributing to time delay insensitive equipment;
3) time delay sensitive type equipment uses ACB mechanism accessing users according to the pilot resources number of distribution, and time delay is non-sensitive Type equipment uses ACB mechanism accessing users according to the pilot resources number of distribution.
Corresponding pilot tone subregion when MTC device is successfully accessed total maximum is obtained in step 2) and compares β*Concretely comprise the following steps:
If AsFor the time delay sensitive type number of devices of current time slots, AnFor the time delay insensitive number of devices of current time slots, AiFor the MTC device sum of current time slots, then there is As+An=Ai;If MsTo distribute to the pilot resources number of time delay sensitive type equipment Mesh, MnTo distribute to the pilot resources number of time delay insensitive equipment, c is the sum of pilot resources, and β is leading for current time slots Frequency division area ratio, then have
Ms+Mn=c (2)
Obtained by formula (1) and formula (2):
The probability P that each MTC device is successfully accesseds=e-N/P, wherein, N is the MTC device quantity of current time slots application, and P is The patterns available number of resources of current time slots application, the then total S that MTC device is successfully accessedNFor:
Wherein, fsFor the restriction factor of time delay sensitive type equipment under ACB mechanism, fnSet for time delay insensitive under ACB mechanism Standby restriction factor, formula (3) is brought into formula (4) and obtained
Then the mathematical modeling for solving maximum MTC device and being successfully accessed sum is established according to formula (5):
Establish object function, then according to object function solve formula (6) MTC device be successfully accessed it is total maximum when pair The pilot tone subregion answered compares β*
The process for establishing object function is:
Formula (5) equal sign both sides are carried out with derivation, and is 0 by the result after derivation, then is had
Abbreviation is carried out to formula (7) and obtains object function:
Work as Asfs∈ (0,1] when, then formula (6) is solved using Newton iterative according to object function, obtain MTC device and connect Enter corresponding pilot tone subregion when successfully sum is maximum and compare β*
Work as AsfsDuring ∈ (1,3), formula (6) can be expressed as the optimization problem under inequality constraints, solve the specific of formula (6) Process is:
Determine the feasible zone D of optimization problem1
Due to feasible zone D1Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
Work as Asfs∈ [3 ,+∞) when, formula (6) can be expressed as the optimization problem under inequality constraints, solve the tool of formula (6) Body process is:
Determine the feasible zone D of optimization problem2
Due to feasible zone D2Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
The invention has the advantages that:
The access overload controlling method of RAN layers is when accessing each MTC device in sub-clustering type M2M networks of the present invention, Each MTC device in base station is first divided into by time delay sensitive type equipment according to default time delay sensitivity and time delay insensitive is set It is standby, then corresponding pilot tone subregion ratio when MTC device is successfully accessed total maximum is obtained, then it is successfully accessed always according to MTC device Corresponding pilot tone subregion distributes to the pilot resources of time delay sensitive type equipment and time delay insensitive equipment than obtaining when number is maximum Number, time delay sensitive type equipment and time delay insensitive equipment use ACB mechanism according to respective pilot resources number is distributed to Accessing user, so as to effectively improve MTC device access rate, making total being successfully accessed, number of users is most, and reasonable in design, operation is simple Single, practicality is extremely strong.
Brief description of the drawings
Fig. 1 is typical M2M system architecture diagrams;
Fig. 2 is MTC device random access procedure figure;
Fig. 3 is scenario-frame design drawing;
Fig. 4 (a) is to be successfully accessed change curve of the probability with relation between two groups of restriction factors;
Fig. 4 (b) is change curve of the average access delay with relation between two groups of restriction factors;
Fig. 5 is the contrast curve that probability is successfully accessed under different restriction factors;
Fig. 6 is the contrast curve of average access delay under different restriction factors;
Fig. 7 is the contrast curve of collision probability under different restriction factors;
Fig. 8 is the contrast curve that two class users are successfully accessed probability under different restriction factors;
Fig. 9 is the contrast curve of the average access delay of two class users under different restriction factors;
Figure 10 is the contrast curve of two class user's collision probabilities under different restriction factors.
Embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings:
With reference to figure 1, typical M2M system architecture diagrams are specifically described as follows:
Consider typical M2M SNAs, include LTE-A base stations, MTC device, gateway node and between gateway Interface between base station, wherein, LTE-A base stations include macro station, Picocell base stations, Femtocell base stations and relaying section Point, and the pilot resources of user and the issue and storage of various control information are distributed in main responsible the whole network regulation and control, while often The base station of serving cell where individual equipment first will communicate with corresponding gateway node (GW), and gateway node is as in one The serving BS of cell where two equipment of node contacts;And interface S1 transmission informations are then needed between gateway and base station, Under this deployment scenario, realize that direct communication connects each other by LTE-A base stations between MTC device.
With reference to figure 2, the access procedure of MTC device is mainly what is completed in RACH channels, might as well provide RACH letters here The configuration in road and operational circumstances, RACH channels are made up of some RA time slots that can be used for transmission access request, the length of RA time slots Degree depends on Configuration Index value, is pointed out in agreement, is anticipated when Configuration Index values are 6 Taste RACH, and per 5ms, configuration once, i.e., just has that 64 orthogonal guide frequency resources are available per 5ms, wherein, 54 can be used for being based on The access of collision, and remaining 10 are then reserved for collisionless access.Pilot resources configuration cycle, MTC are used as by a time slot of 5ms Equipment goes to compete 54 pilot resources for being available for utilizing in each time slot, and each equipment for applying for access must be complete in current time slots This access request can be just completed into four step random access procedures between base station and equipment.Four of Stochastic accessing (RA) shake hands Process is as follows:
Msgl:Apply for that the MTC device of access sends pilot resources information to base station
Msg2:Base station sends RA feedback informations by PDSCH channels to corresponding MTC device
Msg3:MTC device sends " request connects " (connection request) information to base station
Msg4:Base station sends " Conflict solving " (contention resolution) information to MTC device
With reference to figure 3, the access overload controlling method of RAN layers includes following step in sub-clustering type M2M networks of the present invention Suddenly:
1) each MTC device in base station is divided into by time delay sensitive type equipment according to default time delay sensitivity and time delay is non-quick Sense type equipment;
2) base station obtains the number of users of current time slots application access, obtains corresponding when MTC device is successfully accessed total maximum Pilot tone subregion compares β*, corresponding pilot tone subregion compares β when being successfully accessed total maximum further according to MTC device*It is quick that time delay is distributed in acquisition The pilot resources number of sense type equipment and the pilot resources number for distributing to time delay insensitive equipment;
3) time delay sensitive type equipment uses ACB mechanism accessing users according to the pilot resources number of distribution, and time delay is non-sensitive Type equipment uses ACB mechanism accessing users according to the pilot resources number of distribution.
Wherein, when the time delay sensitivity of MTC device is more than or equal to default time delay sensitivity, then when the MTC device is Prolong responsive type equipment, when the time delay sensitivity of MTC device is less than default time delay sensitivity, then the MTC device is that time delay is non- Responsive type equipment;
Corresponding pilot tone subregion when MTC device is successfully accessed total maximum is obtained in step 2) and compares β*Concretely comprise the following steps:
If AsFor the time delay sensitive type number of devices of current time slots, AnFor the time delay insensitive number of devices of current time slots, AiFor the MTC device sum of current time slots, then there is As+An=Ai;If MsTo distribute to the pilot resources number of time delay sensitive type equipment Mesh, MnTo distribute to the pilot resources number of time delay insensitive equipment, c is the sum of pilot resources, and β is leading for current time slots Frequency division area ratio, then have
Ms+Mn=c (2)
Obtained by formula (1) and formula (2):
The probability P that each MTC device is successfully accesseds=e-N/P, wherein, N is the MTC device quantity of current time slots application, and P is The patterns available number of resources of current time slots application, the then total S that MTC device is successfully accessedNFor:
Wherein, fsFor the restriction factor of time delay sensitive type equipment under ACB mechanism, fnSet for time delay insensitive under ACB mechanism Standby restriction factor, formula (3) is brought into formula (4) and obtained
Then the mathematical modeling for solving maximum MTC device and being successfully accessed sum is established according to formula (5):
Establish object function, then according to object function solve formula (6) MTC device be successfully accessed it is total maximum when pair The pilot tone subregion answered compares β*
The process for establishing object function is:
Formula (5) equal sign both sides are carried out with derivation, and is 0 by the result after derivation, then is had
Abbreviation is carried out to formula (7) and obtains object function:
Work as Asfs∈ (0,1] when, then formula (6) is solved using Newton iterative according to object function, obtain MTC device and connect Enter corresponding pilot tone subregion when successfully sum is maximum and compare β*
Work as AsfsDuring ∈ (1,3), formula (6) can be expressed as the optimization problem under inequality constraints, solve the specific of formula (6) Process is:
Determine the feasible zone D of optimization problem1
Due to feasible zone D1Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
Work as Asfs∈ [3 ,+∞) when, formula (6) can be expressed as the optimization problem under inequality constraints, solve the tool of formula (6) Body process is:
Determine the feasible zone D of optimization problem2
Due to feasible zone D2Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
According to the realization mechanism of ACB strategies, it is necessary first to respectively to two parameters (restriction factor and limits in ACB mechanism Time processed) it is designed, because the design focal point of the present invention is dynamic adjustment pilot tone subregion ratio, so in order to which reduction procedure is now done Go out hypothesis below:
The limitation time of time delay sensitive type equipment is equal with the limitation time of time delay insensitive equipment, i.e. Ts=Tn;Work as quilt During limitation, the back off time of time delay sensitive type equipment and time delay insensitive equipment is as follows:
For the non-sensitive user of time delay, back off time is:
For latency sensitive user, back off time is:
Tbarred=(0.7+0.6rand) * ac_barringtime (14)
And two cluster equipment are arranged to linear relationship using the relation between the restriction factor of ACB mechanism:fn=p+qfs, its Middle fs∈ (0,1), p and q value will cause fn∈ (0,1);Fig. 4 (a) and 4 (b) are to be successfully accessed probability and average access respectively Time delay with relation between two groups of restriction factors change curve, according to being successfully accessed probability and average access delay two indices Integrated survey, we select following relation:
In summary, main realization mechanism of the invention is to attempt the pilot tone subregion ratio by each time slot of dynamic control, To optimize the equipment of each time slot access situation;The essence of this algorithm is by RACH resource Dynamic Separation ability to sub-clustering The control overloaded in structure with realization to RAN in M2M communication.
Emulation experiment
With reference to figure 5, emulated in 5MHz LTE cells, 30000 MTC devices are evenly distributed in cell, are touched Hit indicator and be arranged to 5ms, only accessing situation to user in 10s in emulation accounts for.The quantity of delay sensitive equipment and when The quantitative proportion for prolonging non-sensitive equipment is arranged to 1: 9.In addition, for two parameters in ACB strategies, delay sensitive is set in emulation It is standby as the limitation time of the non-sensitive equipment of time delay, between restriction factor meet (15) formula, and the equipment of respective cluster through limitation Random-backoff time after the factor " limitation " meets (13) and (14) formula respectively.Under above-mentioned simulating scenes, Fig. 5 shows and always connect Enter the probability of success with the change curve of restriction factor and depict traditional ACB algorithms and compare with the access rate for proposing algorithm. As can be seen that when restriction factor changes between 0.2-0.8, as restriction factor increases, access rate accordingly increases, and when limit When factor value processed is 0.9, access rate reduces, because major part user is equal under ACB mechanism when restriction factor is larger Can not be obtained by " limitation " chance access, this cause unavoidably a large number of users collide and so that access rate has declined. At the same time, the present invention, which compares, possesses higher access rate for traditional ACB mechanism, reason is that this programme is optimal by selecting Pilot tone subregion ratio come realize always access it is optimal.
Fig. 6 is the contrast curve of system average access delay under different restriction factors.As can be seen that with limitation because Son is incremented by, and average access delay constantly reduces, and travels through the average access delay of user resulting under restriction factor and locate In below 4s, this also illustrates another superiority of the present invention.At the same time, averagely connect for the more traditional ACB mechanism of the present invention Significantly reduced in terms of entering time delay.
Fig. 7 shows mean collisional probability with the change curve of restriction factor and gives traditional ACB algorithms with being carried Go out the collision rate contrast of algorithm, it is seen that, the collision rate of this programme increases with the increase of restriction factor.At the same time, originally Collision rate is slightly improved for the more traditional ACB mechanism of invention, although collision rate improves, this is lifted in systematic function Tolerance in.
Fig. 8-10 discuss respectively under different restriction factors two class users be successfully accessed probability, average access delay and The contrast curve of the aspect of mean collisional probability three.On the one hand, for sensitive equipment, from Fig. 8 and Fig. 9, with ACB machines System is compared, and it is successfully accessed probability and average access delay remains basically stable compared with ACB algorithms, and Figure 10 shows sensitive users Collision rate is remarkably decreased;On the other hand, for non-sensitive user, known by Fig. 8 and Fig. 9, than ACB strategy, its access into Work(probability is significantly increased and with the change unobvious of restriction factor, and its average access delay is remarkably decreased, in addition, Figure 10 also tables The collision rate of bright non-sensitive user has raised, and this is in the tolerance of other two performance boosts.

Claims (5)

1. the access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks, it is characterised in that comprise the following steps:
1) each MTC device in base station is divided into by time delay sensitive type equipment and time delay insensitive according to default time delay sensitivity Equipment;
2) base station obtains the number of users of current time slots application access, obtains corresponding pilot tone when MTC device is successfully accessed total maximum Subregion compares β*, corresponding pilot tone subregion compares β when being successfully accessed total maximum further according to MTC device*Time delay sensitive type is distributed in acquisition The pilot resources number of equipment and the pilot resources number for distributing to time delay insensitive equipment;
3) time delay sensitive type equipment uses ACB mechanism accessing users according to the pilot resources number of distribution, and time delay insensitive is set It is standby that ACB mechanism accessing users are used according to the pilot resources number of distribution;
Corresponding pilot tone subregion when MTC device is successfully accessed total maximum is obtained in step 2) and compares β*Concretely comprise the following steps:
If AsFor the time delay sensitive type number of devices of current time slots, AnFor the time delay insensitive number of devices of current time slots, AiFor The MTC device sum of current time slots, then have As+An=Ai;If MsTo distribute to the pilot resources number of time delay sensitive type equipment, Mn To distribute to the pilot resources number of time delay insensitive equipment, c is the sum of pilot resources, and β is the pilot tone point of current time slots Area's ratio, then have
<mrow> <mi>&amp;beta;</mi> <mo>=</mo> <mfrac> <msub> <mi>M</mi> <mi>s</mi> </msub> <msub> <mi>M</mi> <mi>n</mi> </msub> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
Ms+Mn=c (2)
Obtained by formula (1) and formula (2):
<mrow> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>M</mi> <mi>s</mi> </msub> <mo>=</mo> <mfrac> <mrow> <mi>c</mi> <mi>&amp;beta;</mi> </mrow> <mrow> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>M</mi> <mi>n</mi> </msub> <mo>=</mo> <mfrac> <mi>c</mi> <mrow> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
The probability P that each MTC device is successfully accesseds=e-N/P, wherein, N is the MTC device quantity of current time slots application, and P is current The patterns available number of resources of time slot application, the then total S that MTC device is successfully accessedNFor:
<mrow> <msub> <mi>S</mi> <mi>N</mi> </msub> <mo>=</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <msub> <mi>M</mi> <mi>s</mi> </msub> </mfrac> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> </mrow> <msub> <mi>M</mi> <mi>n</mi> </msub> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
Wherein, fsFor the restriction factor of time delay sensitive type equipment under ACB mechanism, fnFor time delay insensitive equipment under ACB mechanism Restriction factor, formula (3) is brought into formula (4) and obtained
<mrow> <msub> <mi>S</mi> <mi>N</mi> </msub> <mo>=</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mi>c</mi> <mi>&amp;beta;</mi> </mrow> </mfrac> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>c</mi> </mfrac> </mrow> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow>
Then the mathematical modeling for solving maximum MTC device and being successfully accessed sum is established according to formula (5):
<mrow> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <munder> <mi>min</mi> <mi>&amp;beta;</mi> </munder> <mo>{</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>c</mi> </mfrac> </mrow> </msup> <mo>}</mo> <mo>,</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;Element;</mo> <mo>(</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>&amp;rsqb;</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munder> <mi>max</mi> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <mo>&amp;GreaterEqual;</mo> <mn>1</mn> </mrow> </munder> <mo>{</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>c</mi> </mfrac> </mrow> </msup> <mo>}</mo> <mo>,</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;Element;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>,</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <munder> <mi>max</mi> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <mo>&amp;GreaterEqual;</mo> <mn>2</mn> </mrow> </munder> <mo>{</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> </mrow> </msup> <mo>+</mo> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mo>&amp;CenterDot;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>c</mi> </mfrac> </mrow> </msup> <mo>}</mo> <mo>,</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>&amp;Element;</mo> <mo>&amp;lsqb;</mo> <mn>3</mn> <mo>,</mo> <mo>+</mo> <mi>&amp;infin;</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow>
Establish object function, then according to object function solve formula (6) MTC device be successfully accessed it is total maximum when it is corresponding Pilot tone subregion compares β*
2. the access overload controlling method of RAN layers in sub-clustering type M2M networks according to claim 1, it is characterised in that build The process of vertical object function is:
Formula (5) equal sign both sides are carried out with derivation, and is 0 by the result after derivation, then is had
<mrow> <mfrac> <mrow> <msubsup> <mi>A</mi> <mi>s</mi> <mn>2</mn> </msubsup> <msubsup> <mi>f</mi> <mi>s</mi> <mn>2</mn> </msubsup> </mrow> <mrow> <msup> <mi>c&amp;beta;</mi> <mn>2</mn> </msup> </mrow> </mfrac> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mrow> <mi>c</mi> <mi>&amp;beta;</mi> </mrow> </mfrac> </mrow> </msup> <mo>-</mo> <mfrac> <mrow> <msubsup> <mi>A</mi> <mi>n</mi> <mn>2</mn> </msubsup> <msubsup> <mi>f</mi> <mi>n</mi> <mn>2</mn> </msubsup> </mrow> <mi>c</mi> </mfrac> <mo>&amp;times;</mo> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>c</mi> </mfrac> </mrow> </msup> <mo>&amp;equiv;</mo> <mn>0</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow>
Abbreviation is carried out to formula (7) and obtains object function:
<mrow> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mfrac> <mn>1</mn> <mi>&amp;beta;</mi> </mfrac> <mo>)</mo> </mrow> <mo>-</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>n</mi> </msub> <msub> <mi>f</mi> <mi>n</mi> </msub> </mrow> <mi>c</mi> </mfrac> <mrow> <mo>(</mo> <mn>1</mn> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> <mo>+</mo> <mn>2</mn> <mi>log</mi> <mi>&amp;beta;</mi> <mo>=</mo> <mi>log</mi> <mrow> <mo>(</mo> <mfrac> <mrow> <msubsup> <mi>A</mi> <mi>s</mi> <mn>2</mn> </msubsup> <msubsup> <mi>f</mi> <mi>s</mi> <mn>2</mn> </msubsup> </mrow> <mrow> <msubsup> <mi>A</mi> <mi>n</mi> <mn>2</mn> </msubsup> <msubsup> <mi>f</mi> <mi>n</mi> <mn>2</mn> </msubsup> </mrow> </mfrac> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
3. the access overload controlling method of RAN layers in sub-clustering type M2M networks according to claim 2, it is characterised in that when Asfs∈ (0,1] when, then according to object function using Newton iterative solve formula (6), obtain MTC device be successfully accessed it is total Corresponding pilot tone subregion compares β when number is maximum*
4. the access overload controlling method of RAN layers in sub-clustering type M2M networks according to claim 2, it is characterised in that when AsfsDuring ∈ (1,3), formula (6) can be expressed as the optimization problem under inequality constraints, and the detailed process for solving formula (6) is:
Determine the feasible zone D of optimization problem1
<mrow> <msub> <mi>D</mi> <mn>1</mn> </msub> <mo>=</mo> <mo>{</mo> <mi>&amp;beta;</mi> <mo>|</mo> <mi>&amp;beta;</mi> <mo>&amp;GreaterEqual;</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mrow> <mi>c</mi> <mo>*</mo> <mi>log</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>9</mn> <mo>)</mo> </mrow> </mrow>
Due to feasible zone D1Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
<mrow> <msup> <mi>&amp;beta;</mi> <mo>*</mo> </msup> <mo>=</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mrow> <mi>c</mi> <mo>*</mo> <mi>log</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>10</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
5. the access overload controlling method of RAN layers in sub-clustering type M2M networks according to claim 2, it is characterised in that when Asfs∈ [3 ,+∞) when, formula (6) can be expressed as the optimization problem under inequality constraints, and the detailed process for solving formula (6) is:
Determine the feasible zone D of optimization problem2
<mrow> <msub> <mi>D</mi> <mn>2</mn> </msub> <mo>=</mo> <mo>{</mo> <mi>&amp;beta;</mi> <mo>|</mo> <mi>&amp;beta;</mi> <mo>&amp;GreaterEqual;</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mrow> <mi>c</mi> <mo>*</mo> <mi>l</mi> <mi>o</mi> <mi>g</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>/</mo> <mn>2</mn> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> </mfrac> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>11</mn> <mo>)</mo> </mrow> </mrow>
Due to feasible zone D2Interior object function monotone decreasing, therefore when β takes boundary value, object function takes maximum, i.e.,
<mrow> <msup> <mi>&amp;beta;</mi> <mo>*</mo> </msup> <mo>=</mo> <mfrac> <mrow> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> <mrow> <mi>c</mi> <mo>*</mo> <mi>l</mi> <mi>o</mi> <mi>g</mi> <mrow> <mo>(</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> <mo>/</mo> <mn>2</mn> <mo>)</mo> </mrow> <mo>-</mo> <msub> <mi>A</mi> <mi>s</mi> </msub> <msub> <mi>f</mi> <mi>s</mi> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>12</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
CN201410816294.5A 2014-12-23 2014-12-23 The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks Active CN104507038B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410816294.5A CN104507038B (en) 2014-12-23 2014-12-23 The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410816294.5A CN104507038B (en) 2014-12-23 2014-12-23 The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks

Publications (2)

Publication Number Publication Date
CN104507038A CN104507038A (en) 2015-04-08
CN104507038B true CN104507038B (en) 2018-01-19

Family

ID=52948740

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410816294.5A Active CN104507038B (en) 2014-12-23 2014-12-23 The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks

Country Status (1)

Country Link
CN (1) CN104507038B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107086900B (en) * 2017-05-08 2020-04-10 中国人民解放军理工大学 M2M communication access control optimization method for handling LTE network emergency
CN108738161A (en) * 2018-04-28 2018-11-02 南京邮电大学 Accidental access method based on different delay demand device packets in a kind of machine type communication
CN109963272B (en) * 2019-04-28 2021-01-19 西安交通大学 Random access method for differentiated MTC network
CN110996326B (en) * 2019-12-17 2022-04-05 西安电子科技大学 Method for planning cluster number of MTC (machine type communication) network in resource reuse scene
CN113423146B (en) * 2021-06-21 2023-03-31 南京邮电大学 Unauthorized random access method in multi-cell large-scale MIMO system
CN115315021A (en) * 2022-08-09 2022-11-08 浙江工业大学 LSTM-AM assisted multichannel ALOHA random access method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011098992A1 (en) * 2010-02-15 2011-08-18 Telefonaktiebolaget Lm Ericsson (Publ) Access control for m2m devices
CN103069899A (en) * 2010-08-12 2013-04-24 诺基亚公司 Configuring an uplink and downlink splitting pattern for device-to-device communication under a cellular network
CN103634088A (en) * 2007-11-16 2014-03-12 高通股份有限公司 Preamble design for a wireless signal

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012148444A1 (en) * 2011-04-29 2012-11-01 Intel Corporation System and method of channel control in a wireless communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103634088A (en) * 2007-11-16 2014-03-12 高通股份有限公司 Preamble design for a wireless signal
WO2011098992A1 (en) * 2010-02-15 2011-08-18 Telefonaktiebolaget Lm Ericsson (Publ) Access control for m2m devices
CN103069899A (en) * 2010-08-12 2013-04-24 诺基亚公司 Configuring an uplink and downlink splitting pattern for device-to-device communication under a cellular network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《Prioritized Random Access with Dynamic Access Barring for RAN Overload in 3GPP LTE-A Networks》;Jen-Po Cheng and Chia-han Lee;《IEEE GLOBECOM Workshops》;20111231;正文第2-3节 *

Also Published As

Publication number Publication date
CN104507038A (en) 2015-04-08

Similar Documents

Publication Publication Date Title
CN104507038B (en) The access overload controlling method of RAN layers in a kind of sub-clustering type M2M networks
CN104737562B (en) User equipment, evolved node B and the method communicated for multicast device to equipment
CN102215094B (en) Method, system and equipment for sending and receiving uplink feedback information
Vilgelm et al. LATMAPA: Load-adaptive throughput-maximizing preamble allocation for prioritization in 5G random access
CN103354663B (en) Distributed time slot allocation disturbance coordination method in WLAN (wireless local area network)
CN103957518B (en) A kind of D2D communication means in cellular network
CN103763784A (en) Uplink access method for distribution of lead codes for distinguishing user priority in TD-LTE/TD-LTE-A system
CN103781118A (en) Heterogeneous wireless network access control and resource distribution joint method based on multiple services
CN103731837B (en) A kind of frequency spectrum resource allocation method and device
CN109905864A (en) A kind of cross-layer Resource Allocation Formula towards electric power Internet of Things
CN102355734B (en) System and method for allocating channel resource
CN103945540A (en) Processing method and device for logical channel priority
Yang et al. M2M access performance in LTE‐A system
Li et al. An RSU-coordinated synchronous multi-channel MAC scheme for vehicular ad hoc networks
CN104469848B (en) A kind of method of load balancing between isomerization access network
CN105898801B (en) A kind of load-balancing method and base station
CN106792480B (en) A kind of D2D communication resource allocation method based on cellular network
CN106851838A (en) Multiple cell D2D frequency spectrum resource allocation methods
CN107318150A (en) A kind of user of LTE U autonomous systems is resident flow
Lee et al. LSTM-based ACB scheme for machine type communications in LTE-A networks
Althumali et al. Priority-based load-adaptive preamble separation random access for QoS-differentiated services in 5G networks
CN104469849A (en) Dynamic flow distribution method based on intelligent antenna in small base station network
CN106165520B (en) It is a kind of to trigger method, base station equipment, user equipment and the system kept out of the way
Ilori et al. A random channel access scheme for massive machine devices in LTE cellular networks
Shao et al. Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant