CN106792807B - A kind of broad sense interference model and distributed ABS time slots cut-in method - Google Patents
A kind of broad sense interference model and distributed ABS time slots cut-in method Download PDFInfo
- Publication number
- CN106792807B CN106792807B CN201611112846.XA CN201611112846A CN106792807B CN 106792807 B CN106792807 B CN 106792807B CN 201611112846 A CN201611112846 A CN 201611112846A CN 106792807 B CN106792807 B CN 106792807B
- Authority
- CN
- China
- Prior art keywords
- user
- neighbours
- time slot
- interference
- mrow
- 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.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
- H04J11/0023—Interference mitigation or co-ordination
- H04J11/005—Interference mitigation or co-ordination of intercell interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of broad sense interference model and distributed ABS time slots cut-in method.Base station in network is divided into the neighbours of different stage by the broad sense interference model according to distance, and the interference to caused by different stage neighbours assigns different weights, and the joint interference level that certain base station is subject to is accumulated interference sum caused by neighbours at different levels.Methods described step is as follows：Betting model is built, participant is all micro-base stations i.e. user in network；Based on the broad sense interference model, other users are divided into the neighbours of different stage by user；Each user randomly chooses a time slot access, and the interference level being currently subject to is calculated according to the time slot of other users access situation, calculates all utility functions for having access to time slot and bringing；In next time slot, user's selection brings the time slot of optimum utility function to access；Slot selection is circulated, until the Slot selection of all users realizes convergence.The present invention can more accurately portray the complex jamming relation between microcellulor.
Description
Technical field
The invention belongs to wireless communication technology field, and in particular to a kind of broad sense interference model and distributed ABS time slots
Cut-in method.
Background technology
With the development of wireless communication technology, heterogeneous network due to having the advantages that a wide range of, low-power consumption, load balancing,
By the widely studied of people.Conventional heterogeneous network is made up of the micro-base station under multiple macro base stations and its coverage, therefore net
There can be serious interference problem in network.For this problem, 3GPP proposes almost blank subframe ((Almost Blank
Subframe, ABS) technology, i.e. macro base station silence portion time, micro-base station is during this period to heavily disturbed in non-ABS
User is scheduled (bibliography R1-104968, " Summary of The Description of Candidate eICIC
Solutions,”contribution at 3GPP meeting in Madrid,Spain,Aug.2010.).Therefore, in ABS
Cross-layer interference can avoid completely, microcellulor only by same layer interference influenceed.It there is now optimization of the scholar's research on ABS
Problem (bibliography L.Jiang and M.Lei, " Resource Allocation for eICIC Scheme in
Heterogeneous Networks”,in Proc.2012 PIMRC,pp.448-453；D.Sung and J.Baras,
“Utility-based Almost Blank Subframe Optimization in Heterogeneous Cellular
Networks ", in Proc.2014 Globecom, pp.3622-3627.), mostly for ABS length, ratio setting and
User's scheduling of a certain base station in ABS.However, pertinent literature does not carry out deep spy to the interference problem between micro-base station
Study carefully, and problems can not be ignored in dense network, because it is in ABS while defeated with keeping pouring in work as two adjacent base stations, mutually
Interference between phase is inevitable.How by ABS access problem optimization, reduce micro-base station between interference, from
And improving network performance has Research Significance.
It is traditional optimization of network performance problem that network throughput, which maximizes,.However, needed entirely due to solving problems
Net information, it is difficult to it is resolved in large scale network, therefore considers whether to exist and only need local message, while can also be excellent
Change the method for the whole network handling capacity.It there is now part document and solve problem (bibliography C.Lacatus and from this angle
D.Popescu,“Adaptive Interference Avoidance for Dynamic Wireless Systems:A
Game-theoretic Approach,”IEEE J.Sel.Topics Signal Process.,vol.1,no.1,pp.189-
202,2007；Y.Xu,J.Wang,Q.Wu,et al.,“Opportunistic Spectrum Access in Cognitive
Radio Networks:Global Optimization Using Local Interaction Games,”IEEE
J.Sel.Topics Signal Process.,vol.2,no.6,pp.180-194,2012.).Two documents are thought in network
Existing interference is lower, and the overall handling capacity of network is higher, and network performance is better.Meanwhile correlative study person proposes that neighbours' is general
Read, the base station of severe jamming will be caused to be defined as the neighbours of the base station to certain base station, remaining base station is then defined as non-neighbours, adjacent
Interference is considered as identical caused by residence, and non-neighbours, which are then considered as, not to be interfered.However, such binary interference model is not accurate enough
, because disturbing equally very strong, and the accumulated interference that non-neighbor base stations are brought caused by non-neighbours positioned at neighbours edge
Also bring along the influence that can not be ignored.
The content of the invention
It is an object of the invention to provide a kind of broad sense that can be reduced network association interference level, improve network throughput
Interference model and distributed ABS time slots cut-in method.
The technical solution for realizing the object of the invention is：
A kind of broad sense interference model, is portrayed the interference between microcellulor as follows：All base stations in network, according to away from
From distance remaining base station is divided into multi-level neighbours；Assign interference caused by different stage neighbours to different weights,
The value of weight is directly proportional to the height of rank；The joint interference level that each base station is subject to is that accumulation caused by neighbours at different levels is dry
Disturb sum, i.e., weight and the neighbours' number sum of products of neighbours at different levels.
A kind of distributed ABS time slots cut-in method based on the broad sense interference model, comprises the following steps：
Step 1, time slot access problem being modeled as betting model, the participant of game is all micro-base stations in network, with
Under be expressed as user；
Step 2, based on the broad sense interference model, other users are divided into by the user in network according to the distance of distance
The neighbours of different stage；
Step 3, each user randomly chooses a time slot and accessed, and accesses situation according to the time slot of other users and calculate
The interference level being currently subject to, using optimal response algorithm, user calculates all utility functions for having access to time slot and bringing；
Step 4, in next time slot, user, which selects to minimize in all accessible time slots to disturb, brings optimum utility
The time slot access of function；
Step 5, circulation step 4 carries out Slot selection, until the Slot selection of all users realizes convergence.
Further, time slot access problem is modeled as betting model described in step 1, the betting model is defined as：
Betting model GaIn include four parts, wherein, S={ 1,2 ..., S } be participate in game user collection
Close, TnIt is user n accessible channel policy space,Respectively user n main neighbours and secondary neighbours, unIt is to use
Family n utility function.
Further, optimal response algorithm is utilized described in step 3, user calculates all effectiveness for having access to time slot and bringing
Function, it is specific as follows：
It is I to define the interference level that any user's time slot access is subject ton, and InDefinition such as formula (1) shown in：
Wherein, α0,…,αkFor the weight of neighbours' annoyance level of different stage, tn、tmIt is user n and its neighbours m respectively
Slot selection, dnmIt is the distance between user m and n；Take α0=1, It is user n main neighbours' door
Range line is path-loss factor from, θ, function δ (tn,tm) meet formula (2)：
According to the influence of main neighbours and secondary neighbours, obtain：
By any user n Slot selection utility function unIt is defined as shown in formula (4)：
In formula (4), tnIt is the time slot of user n selections,It is the time slot of user n main neighbor choice,It is user n
The time slot of secondary neighbor choice, function InMeet above formula (3).
Compared with prior art, its remarkable advantage is the present invention：(1) the accumulated interference effect between base station has been taken into full account
Should, the broad sense interference model more accurate, physical significance is clear and simple to operate is proposed, can preferably be portrayed extensive, ultra dense
Collect the interference characteristic in network；(2) using the approximate inverse relation between joint interference level and network throughput, will minimize
The optimization problem of joint interference level replaces the optimization problem of maximization network handling capacity, reaches the effect for reducing amount of calculation；(3)
Optimization problem is accessed for ABS time slots, the distributed method of proposition, avoids centralization in terms of amount of calculation the defects of, therefore
Suitable for large scale network.
Brief description of the drawings
Fig. 1 is traditional binary interference model schematic diagram.
Fig. 2 is broad sense interference model schematic diagram proposed by the invention.
Fig. 3 is the interference schematic diagram between microcellulor in the embodiment of the present invention.
Fig. 4 is the network throughput performance comparision schematic diagram of model method and existing model method in the embodiment of the present invention.
Embodiment
Broad sense interference model proposed by the invention, it is intended to more accurately portrayed the interference between microcellulor.
It is inversely proportional in view of the interference between base station with distance, i.e., distance is more remote, and interference is smaller, and base station is divided according to the distance of distance
For simple neighbours in multi-level neighbours, rather than traditional interference model and non-neighbours.Most strong neighbours are interfered to be referred to as
Main neighbours, subsequent each rank neighbours are referred to as secondary neighbours, three-level neighbours, etc. successively.The interference to caused by different stage neighbours
Assign different weights, weight value it is directly proportional to the height of rank, specifically, caused by main neighbours disturb weight maximum,
Disturbed caused by lowest level neighbours minimum, it might even be possible to ignore.The joint interference level that certain base station is subject to is that neighbours at different levels make
Into accumulated interference sum, i.e., the weight of neighbours at different levels and neighbours' number sum of products.
Fig. 1 is traditional binary interference model.In the model, for any base station, other base stations are according to apart from the base station
Distance is divided into neighbours and the class of non-neighbours two.With reference to Fig. 1, the neighbours of base station 1 include base station 2,3, and base station 4~7 is base station 1
Non- neighbours.Fig. 2 is broad sense interference model proposed by the invention, and the interference between microcellulor is portrayed as follows：Network
Interior all base stations, remaining base station is divided into multi-level neighbours according to the distance of distance；It will be done caused by different stage neighbours
Disturb and assign different weights, the value of weight is directly proportional to the height of rank；The joint interference level that each base station is subject to is each
Accumulated interference sum caused by level neighbours, i.e., weight and the neighbours' number sum of products of neighbours at different levels.The basic thought of the present invention
It is that in super-intensive network, because the distance between base station is relatively near, the interference relationships between base station are complicated, traditional binary interference
Model can not be accurately portrayed the interference in network due to the accumulated interference effect between not accounting for base station, because
This needs to construct a kind of interference model that can embody accumulated interference.With reference to Fig. 2, the main neighbours of base station 1 include base station 2,3, secondary
Neighbours include base station 4,5, and base station 6,7 is the other neighbours of the even lower level of base station 1.
The present invention combines interference water based on the approximate inversely prroportional relationship between joint interference level and handling capacity with reference to calculating
The fact that flat to need local message, and the calculating of handling capacity needs global information, optimization aim is designed as to minimize the whole network
Joint interference level, to reach the target of maximization network handling capacity.Distribution of the invention based on the broad sense interference model
ABS time slot cut-in methods, comprise the following steps：
Step 1, time slot access problem being modeled as betting model, the participant of game is all micro-base stations in network, with
Under be expressed as user；
Step 2, based on the broad sense interference model, other users are divided into by the user in network according to the distance of distance
The neighbours of different stage；
Step 3, each user randomly chooses a time slot and accessed, and accesses situation according to the time slot of other users and calculate
The interference level being currently subject to, using optimal response algorithm, user calculates all utility functions for having access to time slot and bringing；
Step 4, in next time slot, user, which selects to minimize in all accessible time slots to disturb, brings optimum utility
The time slot access of function；
Step 5, circulation step 4 carries out Slot selection, until the Slot selection of all users realizes convergence.
The specific implementation of the present invention is as follows：
First, time slot access problem is modeled as betting model described in step 1, the betting model is defined as：
Betting model GaIn include four parts, wherein, S={ 1,2 ..., S } be participate in game user collection
Close, TnIt is user n accessible channel policy space,Respectively user n main neighbours and secondary neighbours, unIt is to use
Family n utility function.
2nd, optimal response algorithm is utilized described in step 3, user calculates all utility functions for having access to time slot and bringing,
It is specific as follows：
It is I to define the interference level that any user's time slot access is subject ton, and InDefinition such as formula (1) shown in：
Wherein, α0,…,αkFor the weight of neighbours' annoyance level of different stage, tn、tmIt is user n and its neighbours m respectively
Slot selection, dnmIt is the distance between user m and n；Take α0=1, It is user n main neighbours' door
Range line is path-loss factor from, θ, function δ (tn,tm) meet formula (2)：
According to the influence of main neighbours and secondary neighbours, obtain：
By any user n Slot selection utility function unIt is defined as shown in formula (4)：
In formula (4), tnIt is the time slot of user n selections,It is the time slot of user n main neighbor choice,It is user n
The time slot of secondary neighbor choice, function InMeet above formula (3).
3rd, the optimization aim of game：Slot selection is carried out by optimization aim of the utility function of formula (4), may finally be real
Shown in the optimization aim such as formula (5) that existing the whole network interference level minimizes：
Formula (5) illustrates, the game optimization aim of Slot selection for minimize the interference level of all users in network it
With.With formula (5) be optimization aim carry out Slot selection, can realize minimize user between disturb.
4th, Slot selection is carried out, completes following work：
1) initialize：Each user i ∈ S randomly choose a time slot access
2) detect：By way of self-organizing, user n is selected carry out Slot selection at random.Now, other all users
Keep current time slots selection constant, selected user n is according to all Slot selection t' of formula (4) calculatingnGetable effectiveness
Function.
3) user selects：User n selections bring the time slot of maximum utility function to be accessed.
Embodiment 1
The specific embodiment of the present invention is described below, and system emulation uses Matlab softwares, and parameter setting does not influence
It is general.The embodiment checking carry model and method validity and with convergence (Fig. 3 and Fig. 4).Scene is 68 micro- honeybees
Nest is laid in 300m × 300m network at random, path-loss factor θ=3, channel width B=10MHz, and background is made an uproar
Sound is N0=-174dBm/Hz, base station transmitting power and transmission radius are respectively 23dBm and 20m, and main neighbours' thresholding is respectively
60m, secondary neighbours' thresholding are set to 70m, 90m, 120m and 150m.
The detailed process of distributed resource optimization method proposed by the present invention based on broad sense interference model is as follows：
Step 1：Initialization：Initialize iterations k=0, each micro-base station i ∈ N to other base stations in network according to away from
It is J from threshold classificationi 0And Ji 1, and randomly choose a time slotAccess.
Step 2：Slot selection policy update：Randomly choose micro-base station n and carry out policy update, remaining base station keeps strategy not
Become.Micro-base station n calculates access different time-gap t'nInterference level corresponding to ∈ T, and the strategy of energy minimization interference level is selected,
I.e.
Step 3：Slot selection is restrained：After more times of circulation execution step 2, Slot selection realizes convergence.
Interference schematic diagrames of the Fig. 3 between microcellulor.From figure 3, it can be seen that current network microcellulor is densely distributed, base
Interference relationships between standing are complicated.It is different secondary adjacent that Fig. 4 illustrates the comparison of institute's extracting method model and conventional method model, setting
Occupy network throughput performance during thresholding, and results contrast of institute's extracting method model with optimization the whole network handling capacity for target.It is small
It is the main neighbours of specific base in circle, is the secondary neighbours of specific base in great circle.From fig. 4, it can be seen that institute's extracting method model
Had a distinct increment compared with conventional method model in terms of network throughput is optimized, the result obtained by conventional method model is about with excellent
Change the 90% of the result that the whole network handling capacity is target, and based on model method is carried, when secondary neighbours' thresholding is set to 90m, obtain
To result about to optimize the whole network handling capacity as the 97% of the result of target；Further, since institute's extracting method only needs to know office
Portion's information, rather than the whole network information, therefore convergence rate is more than to optimize speed of the whole network handling capacity as target.
To sum up, broad sense interference model proposed by the present invention takes into full account the accumulated interference effect between base station, effectively lifting
To disturbing the levels of precision portrayed between micro-base station；The method of proposition is based near between joint interference level and network throughput
Like inverse relation, while same effect is reached, the convergence rate of optimization problem is improved；Institute's extracting method has embodied simultaneously
Full distributed time slot access, avoids the defects of computationally intensive existing for centralized fashion, is more applicable for super-intensive network.
Claims (1)
1. a kind of distributed ABS time slots cut-in method based on broad sense interference model, it is characterised in that comprise the following steps：
Step 1, time slot access problem is modeled as betting model, the participant of game is all base stations, following presentation in network
For user；
Step 2, based on the broad sense interference model, other users are divided into difference by the user in network according to the distance of distance
The neighbours of rank；
The broad sense interference model, is portrayed the interference between microcellulor as follows：All base stations in network, according to distance
Remaining base station is divided into multi-level neighbours by distance；Assign interference caused by different stage neighbours to different weights, weight
Value it is directly proportional to the height of rank；The joint interference level that each base station is subject to be accumulated interference caused by neighbours at different levels it
With weight and the neighbours' number sum of products of neighbours that is, at different levels；
Step 3, each user randomly chooses a time slot and accessed, and accesses situation according to the time slot of other users and calculate currently
The interference level being subject to, using optimal response algorithm, user calculates all utility functions for having access to time slot and bringing；
Step 4, in next time slot, user, which selects to minimize in all accessible time slots to disturb, brings optimum utility function
Time slot access；
Step 5, circulation step 4 carries out Slot selection, until the Slot selection of all users realizes convergence；
Time slot access problem is modeled as betting model described in step 1, the betting model is defined as：
The betting modelIn include four parts, wherein,It is the user's set for participating in game,It is
User n accessible channel policy space,Respectively user n main neighbours and secondary neighbours, unIt is user n effect
Use function；
Optimal response algorithm is utilized described in step 3, user calculates all utility functions for having access to time slot and bringing, specifically such as
Under：
It is I to define the interference level that any user's time slot access is subject ton, and InDefinition such as formula (1) shown in：
Wherein, α0,…,αkFor the weight of neighbours' annoyance level of different stage, tn、tmIt is user n and its neighbours m time slot respectively
Selection, dnmIt is the distance between user m and n；Take α0=1,Be user n main neighbours' thresholding away from
It is path-loss factor from, θ, function δ (tn,tm) meet formula (2)：
<mrow>
<mi>&delta;</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo>,</mo>
<msub>
<mi>t</mi>
<mi>m</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo>=</mo>
<msub>
<mi>t</mi>
<mi>m</mi>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<msub>
<mi>t</mi>
<mi>n</mi>
</msub>
<mo>&NotEqual;</mo>
<msub>
<mi>t</mi>
<mi>m</mi>
</msub>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
According to the influence of main neighbours and secondary neighbours, obtain：
By any user n Slot selection utility function unIt is defined as shown in formula (4)：
In formula (4), tnIt is the time slot of user n selections,It is the time slot of user n main neighbor choice,It is user n secondary neighbour
Occupy the time slot of selection, function InMeet above formula (3).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611112846.XA CN106792807B (en) | 2016-12-07 | 2016-12-07 | A kind of broad sense interference model and distributed ABS time slots cut-in method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611112846.XA CN106792807B (en) | 2016-12-07 | 2016-12-07 | A kind of broad sense interference model and distributed ABS time slots cut-in method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106792807A CN106792807A (en) | 2017-05-31 |
| CN106792807B true CN106792807B (en) | 2018-04-03 |
Family
ID=58878603
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611112846.XA Expired - Fee Related CN106792807B (en) | 2016-12-07 | 2016-12-07 | A kind of broad sense interference model and distributed ABS time slots cut-in method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106792807B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102612037A (en) * | 2012-04-13 | 2012-07-25 | 北京邮电大学 | Dynamic clustering-based sub-band allocation method in femtocell network |
| CN105828338A (en) * | 2016-03-10 | 2016-08-03 | 京信通信技术(广州)有限公司 | Method and apparatus for realizing ABS configuration |
| CN105848296A (en) * | 2016-06-01 | 2016-08-10 | 南京邮电大学 | Stackelberg game-based resource allocation method |
-
2016
- 2016-12-07 CN CN201611112846.XA patent/CN106792807B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102612037A (en) * | 2012-04-13 | 2012-07-25 | 北京邮电大学 | Dynamic clustering-based sub-band allocation method in femtocell network |
| CN105828338A (en) * | 2016-03-10 | 2016-08-03 | 京信通信技术(广州)有限公司 | Method and apparatus for realizing ABS configuration |
| CN105848296A (en) * | 2016-06-01 | 2016-08-10 | 南京邮电大学 | Stackelberg game-based resource allocation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106792807A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106792824B (en) | Recognize heterogeneous wireless network robust resource allocation methods | |
| CN107172682A (en) | Super-intensive network radio resources distribution method based on dynamic clustering | |
| CN107070583B (en) | A kind of efficiency optimization method of heterogeneous network enhancement type district interference coordination | |
| CN107426773A (en) | Towards the distributed resource allocation method and device of efficiency in Wireless Heterogeneous Networks | |
| Liu et al. | Nash bargaining solution based user association optimization in HetNets | |
| CN104796993B (en) | Cross-layer resource allocation method based on Stackelberg games in heterogeneous network | |
| Liu et al. | Joint uplink and downlink user association for energy-efficient HetNets using Nash bargaining solution | |
| Yao et al. | Distributed ABS-slot access in dense heterogeneous networks: A potential game approach with generalized interference model | |
| CN105554771B (en) | Femto subscriber resource distribution method based on dense distribution | |
| CN104853425B (en) | A kind of Poewr control method for heterogeneous network uplink | |
| CN104080091B (en) | The Home eNodeB frequency spectrum distributing method being grouped in layered heterogeneous network based on load estimation | |
| CN103338453B (en) | A kind of dynamic spectrum access method for hierarchical wireless network network and system | |
| CN110493800A (en) | Super-intensive networking resources distribution method based on Game with Coalitions in a kind of 5G network | |
| CN107454601A (en) | The wireless dummy mapping method of inter-cell interference is considered under a kind of super-intensive environment | |
| CN105578482B (en) | A kind of honeycomb heterogeneous network resource allocation methods | |
| CN106412988A (en) | Improved weighted graph-based super dense heterogeneous network interference coordination method | |
| CN103428843B (en) | Power coordinating method integrating effectiveness of near field users and effectiveness of distant filed users | |
| CN106792807B (en) | A kind of broad sense interference model and distributed ABS time slots cut-in method | |
| Jiang et al. | Power Control via Stackelberg Game for Small‐Cell Networks | |
| CN108322271A (en) | The dynamic clustering method of customer-centric based on load | |
| CN108260132A (en) | The dispositions method of intensive isomery cellular network | |
| Hu et al. | Channel allocation scheme for ultra-dense femtocell networks: Based on coalition formation game and matching game | |
| CN104244327A (en) | Method for designing optimized pilot frequency of picocell network under layered heterogeneous environment | |
| Yuan | Research on network resource optimal allocation algorithm based on game theory | |
| CN106102151A (en) | The interference management method controlled based on channel distribution and power in family base station system |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180403 Termination date: 20181207 |