CN107249206A - A kind of WAP system of selection with resource allocation optimization effect - Google Patents
A kind of WAP system of selection with resource allocation optimization effect Download PDFInfo
- Publication number
- CN107249206A CN107249206A CN201710559628.9A CN201710559628A CN107249206A CN 107249206 A CN107249206 A CN 107249206A CN 201710559628 A CN201710559628 A CN 201710559628A CN 107249206 A CN107249206 A CN 107249206A
- Authority
- CN
- China
- Prior art keywords
- msub
- mrow
- mfrac
- access point
- access
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
- H04W48/10—Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W48/00—Access restriction; Network selection; Access point selection
- H04W48/20—Selecting an access point
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of WAP system of selection with resource allocation optimization effect, in the method, WAP controls the probability found at first by new user by changing the broadcast cycle of itself；User only responds the broadcast message received at first, and accesses corresponding WAP.WAP determines broadcast cycle according to current number of service subscribers；Current number of service subscribers is more, represent that the access point is busier, then broadcast cycle is bigger, the probability selected by new user is lower, so as to make new user access more idle WAP as much as possible, reasonable distribution Internet resources between neighbouring access point are realized, the purpose of network service quality is improved.Present invention offer is a kind of can to improve the WAP system of selection with resource allocation optimization effect of the idle access point probability of user's selection.
Description
Technical field
The present invention relates to wireless communication field, especially a kind of WAP system of selection.
Background technology
The popularization of the smart machines such as development and mobile phone, flat board with multimedia communication technology, the pressure that Cellular Networks are born
Power is also growing day by day.And the deficient and high capital cost of frequency spectrum resource largely limits the further expansion of Cellular Networks
Hold, therefore in order to adapt to the mobile data flow of blast growth, it is necessary to look for another way.
Data distribution is a kind of effective means for alleviating Cellular Networks pressure.For residence network, mobile network has
With high costs, the shortcomings of Bandwidth-Constrained is serious, data distribution can be by mobile data flow shunt to its based on residence network
In his network, so as to reduce cellular traffic and improve network service quality.Until 2016, the public wireless in global range connects
Access point total amount has reached 94,000,000, it was predicted that this numeral will increase about 6 times by 2021, reaches 5.416 hundred million.It is so high
The WAP distribution means of density us and are likely to while being in the coverage of multiple WAPs, therefore
How to be chosen to for a problem.Ideally, it is intended that the reasonable load traffic of each WAP, lead to
Chang Eryan, the load condition of WAP is opaque for user, and often separate between multiple WAPs, nothing
Method carries out active negotiation, and this causes user to there is blindness when selecting WAP, so as to cause Internet resources to distribute
It is unreasonable.Therefore, a kind of rational WAP system of selection is significant to solving this problem.
The content of the invention
In order to solve the network money that the user of existing WAP system of selection blindly selects WAP and caused
The deficiency of source unreasonable distribution, the present invention provide it is a kind of can improve the idle access point probability of user's selection carry resource allocation
The WAP system of selection of effect of optimization.
The technical solution adopted for the present invention to solve the technical problems is：
A kind of WAP system of selection with resource allocation optimization effect, comprises the following steps：
1) there is N number of access point in the range of, each access point is { U in the number of users that current time is serviced1,
U2,...,UN, separate between access point, without information interchange, each access point periodically sends broadcast message, broadcast
Cycle is { T1,T2,...,TN}；
Etc. 2) broadcast message that new user response to be accessed is received at first, and access corresponding access point；For resource
Distribution considers that the minimum access point of the number of users that new user should select current time to service as far as possible is accessed by control
The broadcast cycle of point, thus it is possible to vary the probability that broadcast is received at first, the i.e. selected probability of the access point；
3) broadcast message is begun listening for the broadcast message for receiving each access point from new user, there is delay, be designated as { t1,
t2,...,tN, actual delay is D=min { t1,t2,...tN}；
4) number of users { U of each access point current time service1,U2,...,UNAnd broadcast cycle { T1,T2,...,TN}
Between there is quantitative relationship, can meet setting index request on the premise of, as far as possible reduce delay D, the quantitative relationship
The process for being modeled and calculating is：
For n-th of access point, its corresponding access delay is in interval [0, Tn] on obey and be uniformly distributed, probability density letter
Number is,
When a-th and b-th of access point are competed with one another for, access a is calculated, the probability of b access points is, it is necessary to be divided into
Ta＜ TbAnd Ta＞ TbTwo kinds of situation discussion；Work as Ta＜ TbWhen, the probability of access a access points is
Work as Ta＞ TbWhen, the probability of selection a access points is
Similarly obtain selecting the probability of b access points, arrangement is obtained,
It is required that number of users often increases by 1, with mutually being competed before not increasing, its access probability is P, 0 ＜ P ＜ 0.5, that is, is added
Following restrictive condition：
Ub=Ua+1 (6)
Formula (5) is deformed,
Therefore, active user's quantity { U1,U2,...,UNAnd broadcast cycle { T1,T2,...,TNBetween exist it is following quantitative
Relation,
Wherein, T0On the basis of the broadcast cycle of broadcast cycle, i.e. active user's quantity when being 0, calculate access now and prolong
Expect late, be designated as { D1,D2,...,DN, then
And now access probability value is the maximum under the conditions of limitation, therefore TnFor the minimum value under the conditions of limitation, DnFor
Minimum value under restrictive condition, so as to obtain, actual delay D expectation is also the minimum value under this index, has reached expection
Target.
Obtained by formula (9) (10) analysis, by increasing P, the effect that access point is selected can be made more preferably, cost is actually to prolong
Slow D expectation increase.Therefore, it is necessary to be carried out between access point Selection effect and the extra access delay caused during actual use
Balance, determines a suitable P value.
The present invention technical concept be：Because the load condition of WAP is opaque generally for user, and it is different
Information interchange is generally not present between WAP, it is impossible to carry out active negotiation, causes user when selecting WAP
There is blindness.And the presence of oneself is informed user by access point by way of periodic broadcast, by entering to broadcast cycle
Row control, thus it is possible to vary user receives the probability of its broadcast message at first.Cycle is bigger, and the probability found at first by user is got over
It is low.Using this feature, the broadcast cycle of busy access point can be increased, make the access point that user has found at first all be as far as possible
The access point of relative free.For a user, it is only necessary to first broadcast message that response is received, it is possible to have greater probability
The access point of access more free time.
Beneficial effects of the present invention are mainly manifested in：1st, the resource to multiple WAPs in scope has been carried out rationally
Distribution, improves the quality of wireless service；2nd, to WAP and user both sides all without bringing overhead；3rd, increase
The broadcast cycle of big busy access point, the effect with certain reduction energy consumption.
Brief description of the drawings
Fig. 1 is the wireless access point selection system schematic of the inventive method.
Embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings.
Reference picture 1, a kind of WAP system of selection with resource allocation optimization effect is wirelessly connect existing
Realized on the basis of access point cut-in method, the WAP system of selection comprises the following steps：
1) there is N number of access point in the range of, each access point is { U in the number of users that current time is serviced1,
U2,...,UN, it is separate between access point, without information interchange.Each access point periodically sends broadcast message, broadcasts
Cycle is { T1,T2,...,TN}；
Etc. 2) broadcast message that new user response to be accessed is received at first, and access corresponding access point.For resource
Distribution considers that the minimum access point of the number of users that new user should select current time to service as far as possible is accessed by control
The broadcast cycle of point, thus it is possible to vary the probability that broadcast is received at first, the i.e. selected probability of the access point；
3) broadcast message is begun listening for the broadcast message for receiving each access point from new user, there is delay, be designated as { t1,
t2,...,tN, actual delay is D=min { t1,t2,...tN}；
4) number of users { U of each access point current time service1,U2,...,UNAnd broadcast cycle { T1,T2,...,TN}
Between certainly exist a kind of quantitative relationship, can on the premise of certain index request is met, as far as possible reduce delay D.To this
Quantitative relationship is modeled and calculated：
For n-th of access point, its corresponding access delay is in interval [0, Tn] on obey and be uniformly distributed, probability density letter
Number is,
When a-th and b-th of access point are competed with one another for, access a is calculated, the probability of b access points is, it is necessary to be divided into
Ta＜ TbAnd Ta＞ TbTwo kinds of situation discussion.Work as Ta＜ TbWhen, the probability of access a access points is
Work as Ta＞ TbWhen, the probability of selection a access points is
It can similarly obtain selecting the probability of b access points, arrangement is obtained,
Certain index request is added on the basis of the above, it is desirable to which number of users often increases by 1, it is preceding mutually competing with not increasing
Strive, its access probability is P, 0 ＜ P ＜ 0.5, that is, adds following restrictive condition,
Ub=Ua+1 (6)
Formula (5) is deformed,
Therefore, active user's quantity { U1,U2,...,UNAnd broadcast cycle { T1,T2,...,TNBetween exist it is following quantitative
Relation,
Wherein, T0On the basis of broadcast cycle, i.e. active user's quantity be 0 when broadcast cycle.The access calculated now is prolonged
Expect late, be designated as { D1,D2,...,DN, then
And now access probability value is the maximum under the conditions of limitation, therefore TnFor the minimum value under the conditions of limitation, DnFor
Minimum value under restrictive condition.So as to obtain, actual delay D expectation is also the minimum value under this index, has reached expection
Target.Obtained by formula (9) (10) analysis, by increasing P, the effect that access point is selected can be made more preferably, cost is actually to prolong
Slow D expectation increase.
, it is necessary to determine parameter P according to performance indications in the method for present embodiment.Performance indications include：Access point is
The number of users of service often increases by 1, with not increasing preceding competition, the acceptable selected probability P of highestmax；Opened from user
Beginning listening broadcast, receives access point to user and broadcasts acceptable maximum average retardation Dmax。
It can be obtained by formula (9) (10),
In order that delay DnMaximum is got, it is necessary to which the number of service subscribers of access point is got into maximum, even Un=
Umax.(11) formula is changed into,
Wherein UmaxAnd T0For determination value.By P=Pmax(12) formula is brought into, if obtaining D'max≤Dmax, then P now is taken
It is worth the parameter for system.If obtaining D'max＞ Dmax, then it represents that given performance indications can not be met.
The present embodiment has carried out reasonable distribution to the resource of multiple WAPs in scope, improves wireless service
Quality, it is to avoid WAP unnecessary network resources waste, and to WAP and user both sides all without bringing
Overhead.Simultaneously as the present embodiment determines systematic parameter according to performance indications, different need can be well adapted for
Ask, with considerable flexibility.Finally, due to the broadcast cycle of busy access point be increased, also with certain reduction energy consumption
Effect.
Claims (1)
1. a kind of WAP system of selection with resource allocation optimization effect, it is characterised in that：Methods described include with
Lower step：
1) there is N number of access point in the range of, each access point is { U in the number of users that current time is serviced1,U2,...,
UN, separate between access point, without information interchange, each access point periodically sends broadcast message, and broadcast cycle is
{T1,T2,...,TN}；
Etc. 2) broadcast message that new user response to be accessed is received at first, and access corresponding access point；For resource allocation
Consider, the minimum access point of the number of users that new user should select current time to service as far as possible, by controlling access point
Broadcast cycle, thus it is possible to vary the probability that broadcast is received at first, the i.e. selected probability of the access point；
3) broadcast message is begun listening for the broadcast message for receiving each access point from new user, there is delay, be designated as { t1,
t2,...,tN, actual delay is D=min { t1,t2,...tN}；
4) number of users { U of each access point current time service1,U2,...,UNAnd broadcast cycle { T1,T2,...,TNBetween
There is quantitative relationship, delay D can be reduced as far as possible on the premise of setting index request is met, the quantitative relationship is carried out
Modeling and the process calculated are：
For n-th of access point, its corresponding access delay is in interval [0, Tn] on obey and be uniformly distributed, probability density function is,
<mrow>
<msub>
<mi>s</mi>
<mi>n</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<msub>
<mi>T</mi>
<mi>n</mi>
</msub>
</mfrac>
<mo>,</mo>
<mn>0</mn>
<mo><</mo>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo><</mo>
<msub>
<mi>T</mi>
<mi>n</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
When a-th and b-th of access point are competed with one another for, access a is calculated, the probability of b access points is, it is necessary to be divided into Ta＜
TbAnd Ta＞ TbTwo kinds of situation discussion；Work as Ta＜ TbWhen, the probability of access a access points is
<mrow>
<msub>
<mi>P</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<msubsup>
<mo>&Integral;</mo>
<mn>0</mn>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
</msubsup>
<msub>
<mi>s</mi>
<mi>a</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>a</mi>
</msub>
<mo>)</mo>
</mrow>
<msubsup>
<mo>&Integral;</mo>
<msub>
<mi>t</mi>
<mi>a</mi>
</msub>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</msubsup>
<msub>
<mi>s</mi>
<mi>b</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>dt</mi>
<mi>b</mi>
</msub>
<msub>
<mi>dt</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
Work as Ta＞ TbWhen, the probability of selection a access points is
<mrow>
<msub>
<mi>P</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<msubsup>
<mo>&Integral;</mo>
<mn>0</mn>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</msubsup>
<msub>
<mi>s</mi>
<mi>a</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>a</mi>
</msub>
<mo>)</mo>
</mrow>
<msubsup>
<mo>&Integral;</mo>
<msub>
<mi>t</mi>
<mi>a</mi>
</msub>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</msubsup>
<msub>
<mi>s</mi>
<mi>b</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>b</mi>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>dt</mi>
<mi>b</mi>
</msub>
<msub>
<mi>dt</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
Similarly obtain selecting the probability of b access points, arrangement is obtained,
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>P</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mo><</mo>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>P</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mo>></mo>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>P</mi>
<mi>b</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mo><</mo>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<msub>
<mi>P</mi>
<mi>b</mi>
</msub>
<mo>=</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
</mrow>
</mfrac>
<mo>,</mo>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mo>></mo>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>5</mn>
<mo>)</mo>
</mrow>
</mrow>
It is required that number of users often increases by 1, with mutually being competed before not increasing, its access probability is P, 0 ＜ P ＜ 0.5, that is, is added as follows
Restrictive condition：
Ub=Ua+1 (6)
<mrow>
<msub>
<mi>P</mi>
<mi>b</mi>
</msub>
<mo>=</mo>
<mfrac>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mrow>
<mn>2</mn>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
</mrow>
</mfrac>
<mo>=</mo>
<mi>P</mi>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
Formula (5) is deformed,
<mrow>
<msub>
<mi>T</mi>
<mi>b</mi>
</msub>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mn>2</mn>
<mi>P</mi>
</mrow>
</mfrac>
<msub>
<mi>T</mi>
<mi>a</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
</mrow>
Therefore, active user's quantity { U1,U2,...,UNAnd broadcast cycle { T1,T2,...,TNBetween there is following quantitative close
System,
<mrow>
<msub>
<mi>T</mi>
<mi>n</mi>
</msub>
<mo>=</mo>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mrow>
<mn>2</mn>
<mi>P</mi>
</mrow>
</mfrac>
<mo>)</mo>
</mrow>
<msub>
<mi>U</mi>
<mi>n</mi>
</msub>
</msup>
<msub>
<mi>T</mi>
<mn>0</mn>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, T0On the basis of the broadcast cycle of broadcast cycle, i.e. active user's quantity when being 0, calculate access delay phase now
Hope, be designated as { D1,D2,...,DN, then
<mrow>
<msub>
<mi>D</mi>
<mi>n</mi>
</msub>
<mo>=</mo>
<mi>E</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mn>1</mn>
<mn>2</mn>
</mfrac>
<msub>
<mi>T</mi>
<mi>n</mi>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
And now access probability value is the maximum under the conditions of limitation, therefore TnFor the minimum value under the conditions of limitation, DnFor limitation
Under the conditions of minimum value, so as to obtain, actual delay D expectation is also the minimum value under this index, has reached expected mesh
Mark.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710559628.9A CN107249206B (en) | 2017-07-11 | 2017-07-11 | Wireless access point selection method with resource allocation optimization effect |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710559628.9A CN107249206B (en) | 2017-07-11 | 2017-07-11 | Wireless access point selection method with resource allocation optimization effect |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107249206A true CN107249206A (en) | 2017-10-13 |
| CN107249206B CN107249206B (en) | 2020-08-18 |
Family
ID=60015150
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710559628.9A Active CN107249206B (en) | 2017-07-11 | 2017-07-11 | Wireless access point selection method with resource allocation optimization effect |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107249206B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379719A (en) * | 2018-11-26 | 2019-02-22 | 努比亚技术有限公司 | A kind of application program broadcast processing method, equipment and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102131235A (en) * | 2010-01-15 | 2011-07-20 | 西门子公司 | Load balancing method in radio communication system |
| EP3021618A1 (en) * | 2014-11-14 | 2016-05-18 | BlackBerry Limited | Power saving for tight coupled interworking |
-
2017
- 2017-07-11 CN CN201710559628.9A patent/CN107249206B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102131235A (en) * | 2010-01-15 | 2011-07-20 | 西门子公司 | Load balancing method in radio communication system |
| EP3021618A1 (en) * | 2014-11-14 | 2016-05-18 | BlackBerry Limited | Power saving for tight coupled interworking |
Non-Patent Citations (2)
| Title |
|---|
| YUAN WU: "《Energy-Efficient Distributed User Scheduling in Relay-Assisted Cellular Networks》", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 * |
| 武航: "《无线网络功率最小化的分布式中继选择方法》", 《传感技术学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109379719A (en) * | 2018-11-26 | 2019-02-22 | 努比亚技术有限公司 | A kind of application program broadcast processing method, equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107249206B (en) | 2020-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110381549A (en) | Selection method, network element device and the computer storage medium of terminal work mode | |
| CN102264110B (en) | Based on changing method and the system of wireless resource distribution database | |
| CN101345973A (en) | Method and system for network optimization and regulation through community cluster in communication network | |
| CN102083077B (en) | Baseband pool shared resource distribution method and device | |
| CN103391597B (en) | The connection control method of a kind of multi-module mobile terminal, device and base station | |
| CN101626598B (en) | Method and system for managing transmission resource | |
| CN102083140B (en) | Method and device for balanced configuration of wireless channel | |
| CN101674680A (en) | Method and device for allocating bands and base station | |
| CN103596288A (en) | Method and system for LTE system to have access to cognitive spectrum | |
| CN101110659B (en) | Method for distributing subdistrict frequency band and network appliance thereof | |
| US9713054B2 (en) | Communication terminal and method for communicating data | |
| CN102355736B (en) | Method and device of determining and packet scheduling of thresholds for invocation | |
| CN101835241A (en) | Access control method, core network and wireless network controller | |
| CN104540178A (en) | Joint spectrum handoff and power distribution method of cognitive heterogeneous network | |
| CN107249206A (en) | A kind of WAP system of selection with resource allocation optimization effect | |
| CN102111888B (en) | Channel allocation method and device and system | |
| CN103813384B (en) | Method and device for balancing business in wireless network cell set | |
| CN102067644A (en) | Global operator license prioritizing and distribution | |
| CN102196498B (en) | High speed carrier load allocation method | |
| CN103458520A (en) | Allocation method and device of uplink frequency domain resources | |
| CN103796276A (en) | Method and system for shortening call establishment time delay | |
| CN103906241B (en) | A kind of method and device for carrying out channel resource allocation | |
| CN103096388A (en) | Method and device of temporary block flow (TBF) resource allocation | |
| CN101925181B (en) | Method and device for scheduling multi-carrier system | |
| CN102083215A (en) | Packet data channel configuring method and device |
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 |