CN1874587A - Frequency allocation method of immobile relay cellular network combined with coloring up points and edges - Google Patents
Frequency allocation method of immobile relay cellular network combined with coloring up points and edges Download PDFInfo
- Publication number
- CN1874587A CN1874587A CNA2006100279814A CN200610027981A CN1874587A CN 1874587 A CN1874587 A CN 1874587A CN A2006100279814 A CNA2006100279814 A CN A2006100279814A CN 200610027981 A CN200610027981 A CN 200610027981A CN 1874587 A CN1874587 A CN 1874587A
- Authority
- CN
- China
- Prior art keywords
- frequency
- point
- fixed relay
- painted
- algorithm
- 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
Abstract
The method comprises: 1) according to the colouring constraint condition, making calculation in an algorithm of graphical colouring to get the frequency allocation result of base station; 2) getting states of all three adjacent fixed relays, and with the intermediate colouring node, replacing and recording the location information and the frequency consumption information; according to the edge-coloring frequency constraint condition and the relay frequency location constraint condition, making the colouring in an algorithm of edge-coloring for the edge-coloring graph to get the frequency resources allocation result of each fixed relay.
Description
Technical field
The present invention relates to a kind of method of wireless communication technology field, concrete is a kind of frequency allocation method of fixed relay cellular network binding site edge coloring.
Background technology
Frequency is a resource valuable in the radio communication, when the network planning, how to handle Frequency Distribution well and has crucial meaning to improve frequency spectrum resource efficient.In this field, many researchers' a quantum jump is exactly that the coloring problem in the graph theory has been introduced.In case after the wireless network in the whole planning was abstracted into a graph model, conclusion, algorithm in a lot of graph theory coloring problems can successfully be applied in this network, have significantly reduced the complexity in the frequency assignment procedure.The fixed relay network is a wireless network architecture of studying suitable focus recently.He is a kind of improvement to the legacy cellular net, by in a cellular network, adds the via node of fixed position, improves the coverage of sub-district, reduces the sub-district power consumption, and reduces cutting off rate.
Find by prior art documents, the researcher of Carleton university (Huining Hu.Performance Analysis of Cellular Networks with Digital Fixed Relays[D] .Ottawa, Ontario:Carleton University, 2003. (introduce the performance evaluation of digital fixed relay in the Cellular Networks, Canada, Montreal, Kai Erdun university Master's thesis 2003) there is the network topology of 6 fixed relay regular distribution a sub-district of Ti Chuing, this trunking plan after deliberation with analysis, save power and improve the spectrum efficiency aspect, compare with legacy network and improve a lot.Aspect frequency spectrum planning, document Huining Hu.Performance Analysis of Cellular Networks with Digital FixedRelays[D] .Ottawa, Ontario:Carleton University, 2003 (introduce the performance evaluation of digital fixed relay in the Cellular Networks, Canada, Montreal, Kai Erdun university Master's thesis 2003) provided simple frequency allocative decision under the Carleton fixed relay, yet, this frequency scheme is only considered the multiplexing maximum distance frequency principle under the regular distribution, does not consider any actual landform factor and radio wave propagation characteristic.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, a kind of frequency allocation method of fixed relay cellular network binding site edge coloring is provided, makes it on the basis of existing technology, can take into account factors such as complex-terrain effectively, meanwhile, also guaranteed quite high computational efficiency.This is that the traditional stains scheme is beyond one's reach in the fixed relay net.
The present invention is achieved by the following technical solutions, and the present invention uses the assigning process of 3 steps, attempted the modified model frequency allocation algorithm that uses painted frequency allocation method of point and edge coloring frequency allocation method to combine first.The method concrete steps are as follows:
The first step: carry out the painted algorithm computation of point of figure according to putting painted constraints, obtain the Frequency Distribution result of base station;
Second step: obtain the situation of all 3 adjacent fixed relayings, replace with the intermediate colored node, record position and frequency consume information;
The 3rd step: according to edge coloring frequency constraint condition and relaying Frequency Distribution constraints, it is painted that the opposite side color-patch map carries out the edge coloring algorithm of figure, obtains the frequency resource allocation result of each fixed relay.
The described painted algorithm computation of point of carrying out figure according to the painted constraints of point, obtain the Frequency Distribution result of base station, be meant: under the known situation of the cartographic information of cellular network, base station location and path loss, according to the painted constraints of point, the point of application colouring algorithm obtains the pigmentable set of each base station, the frequency sets that promptly is assigned to.
Described point of application colouring algorithm obtains the pigmentable set of each base station, be meant: use the painted algorithm of typical point to solve the frequency-assignment problem of base station, the wireless network modeling is become a simple graph G (V, E), vertex v among the set V is represented a transmitting station in the network, limit e=(v1 among the set E, v2) represented the connection of adjacent 2 transmitting stations, when putting painted allocation algorithm, analyze the frequency constraint problem of whole network, constraints is: the constraint of cochannel frequency distance, the adjacency channel frequency distance restraint, frequency distance constraint and frequency constraint problem, the figure vertex coloring algorithm model of cochannel frequency distance constraint, being found the solution by the DL algorithm, is that the DL algorithm of painted order solves with the degree descending.
The described situation of obtaining all 3 adjacent fixed relayings, replace with the intermediate colored node, be meant: search for whole fixed relay network, belong to 3 adjacent fixed relayings under 3 different base stations, distance was less than 1/2 o'clock of the base station covering radius, these 3 fixed relay of mark are one group, are that the leg-of-mutton central point that the summit is formed replaces this 3 fixed relay with these 3 fixed relay, and this point is as the intermediate colored point.
Described is that the leg-of-mutton central point that the summit is formed replaces this 3 fixed relay with these 3 fixed relay, be meant: 3 fixed relay information forming are all recorded on this intermediate colored point, its antenna and emission situation, the antenna and the emission situation that are equal to fixed relay, it and each base station, with the path loss of each other intermediate colored points, need recomputate and record.
The described situation of obtaining all 3 adjacent fixed relayings, replace with the intermediate colored node, be meant: on the position, distance between 3 fixed relay between 3 adjacent cells is quite near, participate in the fixed relay Frequency Distribution so regard these 3 fixed relay as a point, after obtaining the Frequency Distribution result of base station, information in the former scene is scanned, obtain the situation of all 3 adjacent fixed relayings, replace with the intermediate colored node, record position and frequency consume information, to all known base station and intermediate point, make up edge coloring figure, use the edge coloring algorithm then, finish Frequency Distribution whole cellular system.
Described according to edge coloring frequency constraint condition and relaying Frequency Distribution constraints, it is painted that the opposite side color-patch map carries out the edge coloring algorithm of figure, be meant: finished intermediate colored point obtain with the information completion after, the base station of whole scene and intermediate colored point, be configured to the edge coloring distribution diagram, edge coloring frequency constraint condition is: during edge coloring, adjacent edge must with different colors, relaying Frequency Distribution constraints is: during the relaying Frequency Distribution, the this edge that intermediate colored point links to each other with the base station, must with the color different with the base station.
It is painted that described opposite side color-patch map carries out the edge coloring algorithm of figure, be meant: adopting heuritic approach, is beginning to spend maximum summit, earlier painted each bar limit that it is connected, and then with this point adjacent degree maximum vertex be second the order, the not painted limit of painted each bar that it is connected.
Compared with prior art, when the present invention carries out frequency planning at the cellular network to fixed relay, adopted the difference of base station cell and fixed relay to come, the technology of Fen Peiing has realized the simplification that whole allocation process is implemented sequentially.The present invention also when fixed relay is carried out Frequency Distribution, has adopted improved edge coloring algorithm, and 3 contiguous fixed relay in the scope of permissible error, are put with intermediate colored and to be replaced, and has simplified the complexity of colouring algorithm so significantly.And the present invention has also fully taken into account the different terrain factor of base station and fixed relay transmitting station, has remedied in the fixed relay cellular network blank of frequency allocation algorithm comprehensively and effectively.
Embodiment
The present invention mainly utilizes the relaying fixed-site, and less these characteristics of repeat transmitted power during channeling, with edge coloring and painted combining of point, these 2 kinds of algorithms respectively in the frequency of dividing fixed launching pad with divide fixedly the advantage of the frequency of distribution link and be dissolved in the new algorithm, through what finish after the part change.
The painted algorithm of point of figure involved in the present invention, be meant with the wireless network modeling become a simple graph G (V, E).The vertex v of set among the V represent transmitting station in the network, and (v1 v2) has represented the connection of adjacent 2 transmitting stations to gather limit e=among the E.When putting painted allocation algorithm, analyze the frequency constraint problem of whole network.Constraints in the distribution mainly can have problems such as the constraint of cochannel frequency distance, adjacency channel frequency distance restraint, frequency distance constraint and frequency constraint.The mathematics of the painted algorithm of point is summarized as: ask one and distribute A:V-〉F; Satisfy u, v ∈ V, u ≠ v, D (u, v)＜d
0, d0=1 then | A (u)-A (v) | ≠ 0, maxA (V)=max{A (v) | v ∈ V}.If F is optional frequency color set, max represents to find the solution the branch span minimum that mixes colours.The figure vertex coloring algorithm model of FD-CCAP can be found the solution by the DL algorithm, and it is the DL algorithm of painted order that the present invention has adopted with the degree descending.
When if constraints is more complicated, such as d0＞1, to the distribution of this figure, still can find suitable simple heuritic approach to approach (FD-ACAP), though what conclusion neither be optimum, this process still is very efficiently, particularly under the situation of summit negligible amounts.
In the present invention, under the known situation of the cartographic information of cellular network, base station location and path loss, the interference figure that draws according to the painted cochannel frequency distance constraints of point, is found the solution by the DL algorithm, is that the DL algorithm of painted order solves with the degree descending.
The edge coloring algorithm of figure involved in the present invention is meant the wireless network modeling to be become a simple graph G (V E), mainly applies to have directional transmissions, has in the frequency allocation plan of " space division multiple access ".Vertex v among the set V is represented a transmitting station in the network, and when existing directional transmissions to concern between two transmitting stations, then the vertex v 1 of corresponding transmitting station links to each other with straight line between the v2, and this straight line is called incidence edge.The set of all incidence edges is represented with E.The mathematics of edge coloring is summarized as: ask one and distribute A:E-〉F; Satisfy e
i, e
j∈ E, i ≠ j, D* (i, j)＜d
1Then | A (e
i)-A (e
j) | ≠ 0, maxA (E)=max{A (e) | after the e ∈ E} modelling, frequency-assignment problem just is converted into and how uses limited color set to carry out painted to every limit of figure among the G.The simplest constraints is reasonable edge coloring, it refer to figure G (V, E) in the color of all incidence edges on any one summit different, i.e. the situation of d1=1.
Rationally edge coloring is by the constraint of 1964Vizing theorem, and the minimum of simple graph is managed to make do chromatic number x '=Δ, Δ+1.And exist the result that a lot of well accepted heuritic approaches draw suboptimum equally.The heuritic approach that the present invention adopts is specially: to spend maximum summit is beginning, painted each bar limit that it is connected earlier, and then with the adjacent degree maximum vertex of this point be second order, the not painted limit of painted each bar that it is connected.
The colouring that the present invention can the painted order of degree of employing limit transmits, but the constraints of edge coloring is different slightly with classics: adjacent edge must with different colors, relaying Frequency Distribution constraints is: during the relaying Frequency Distribution, the this edge that intermediate colored point links to each other with the base station, must with the color different with the base station.
The frequency allocation plan that the present invention is designed, main innovate point is:
1) Frequency Distribution divided for 2 steps carried out:
Carry out the frequency resource allocation between the cell base station earlier, and then carry out the frequency resource allocation of each via node.Adopt the main reason of such allocation step to be the simple of operating process.Related base station frequency resource allocation in the first step be the case that a typical case uses the painted algorithm of point just can solve, and the number of spots that relates to is few, so sub-optimal algorithm is moved quick and stablized.
Finished at the base station frequency spectrum under the situation of distribution, the frequency limitation of fixed relay has also just fixed.In fact, in planning with when designing the whole 2-of having and jumping the cellular network of fixed relay, the frequency limitation of fixed relay also is the frequency planning that submits to upper-level BTS.So once, subordinate's allocation algorithm also is very clear.
2) use intermediate position points to represent 3 adjacent fixed relay:
Because the transmitting power of fixed relay is less, the scope of influence is also less.On the position, the distance between 3 fixed relay between 3 adjacent cells is quite near, so the present invention attempts regarding these 3 fixed relay as fixed relay Frequency Distribution that a point participated in for the 2nd step.The present invention is to replacing 3 adjacent fixed relayings with intermediate position points, the error of being brought has been carried out the analysis on the numerical value.Theoretic Error Calculation is very simple, if the multiplexing coefficient of sub-district is 4, the decay factor of radio transmission is 4, and then error is less than 1.17%.If calculate the error that actual diverse location may be caused by the environment difference, the worst error of interference coefficient is in 5%.
In Carleton fixed relay scheme, use that intermediate position points brings 5% with interior mushing error, the probability that influences follow-up fixed relay Frequency Distribution result is very low.Representative point of 3 the simple one-tenth of node, the benefit of being brought is fairly obvious.Greatly reduce the complexity of system, the number of spots that participates in the edge coloring distribution is original (1/3).This is the important assurance efficiently of follow-up heuritic approach.
For this reason, the present invention has designed the following process that obtains intermediate colored point: search for whole fixed relay network, belong to 3 adjacent fixed relayings under 3 different base stations, distance was less than 1/2 o'clock of the base station covering radius, these 3 fixed relay of mark are one group, with these 3 fixed relay is that the leg-of-mutton central point that the summit is formed replaces this 3 fixed relay, and this point is as the intermediate colored point.
3) on the Frequency Distribution of relaying, introduce the edge coloring algorithm:
The present invention goes on foot second with innovating, in the frequency assignment procedure between the fixed relay, proposes to introduce the idea of edge coloring algorithm.Use the reason of this algorithm to be, the position of fixed relay node is fixed, and regular 3 different azimuth that are positioned at intermediate position points, and fixed relay all has transmitting power very little in addition, only influences its characteristics in a zone on every side.
After introducing edge coloring, the conventional point colouring algorithm is readily solved in the new generation frequency constraint problem in the face of the fixed relay network.According to the constraint qualification of edge coloring, have two incidence edges of common node, can't be by with same color.This condition has directly solved in the same sub-district, and the different fixing relaying can't take the problem of same channel resource.In addition, though not in same sub-district, the via node that the geographical position is close, also be subjected to edge coloring constraint and can't be by with same color.
The edge coloring algorithm also has characteristics: but the dynamic adjustment of the color enabled condition by the summit can change the frequency planning of whole scene easily.That is to say, in the dynamic frequency resource allocation of via node, leave simply dealt method.This makes the Frequency Distribution of fixed relay network become very flexible, has made things convenient for the more exploitation of complex frequency allocative decision.
Specific implementation of the present invention is divided into following 7 operations:
1) obtain scene information, cartographic information, available frequency resources information, and the resource of concrete fixed relay etc. consumes quantity information.
2), set up the some color-patch map A that only has the base station with extract relevant in the information with the base station.Calculate the path consume information of each sub-district, write on the weight on limit, A is perfect the some color-patch map.
3) this figure is carried out algorithm computation according to the painted constraints of generic point, obtain the Frequency Distribution result of base station.
4) obtain after the Frequency Distribution result of base station the information in the former scene being scanned, obtain the situation of all 3 adjacent fixed relayings, replace with the intermediate colored node.Record position and frequency consume information.
5), make up edge coloring figure B to all known base station and intermediate point.
6) according to edge coloring frequency constraint condition and relaying Frequency Distribution constraints, it is painted that opposite side color-patch map B carries out algorithm.Obtain the frequency resource allocation result of each fixed relay.
7) check whole flow process, finish whole frequency assignment procedure.
Content in conjunction with the inventive method provides following examples:
Present embodiment adopts in the scene of imitative Manhattan.This area, imitative Manhattan scene is made up of 440*410 ground map grid, has the base-station node of 19 distributions, the fixed relay node of the individual distribution of 114 (19*6).In the present embodiment, distribute 42 kinds of optional frequencies altogether, every kind of frequency replaces with different colors.Each base station all can be assigned to 6 different frequencies, each fixed relay energy and can only be assigned with 3 different frequencies.Present embodiment utilizes known geographical locations and antenna height, with OKUMURA_HATA+dual slope propagation model calculating path loss value, before the painted and edge coloring of point, according to the path loss values between having a few, ignore the less path of influence, construct a color-patch map and edge coloring figure then.Present embodiment adopts the DL algorithm of degree of falling order, carries out the algorithm of a color-patch map paintedly, and present embodiment adopts the heuritic approach of degree of falling order, and the algorithm that carries out the opposite side color-patch map is painted.End product is delivered to the wireless 2-of COBWeb Network Simulator with2-hop Fixed Relaying Nodes Scheme and is jumped the test of having carried out performance on the relay system analog platform.This platform is extensive fixed relay scene simulation platform, and whole system is configured under the FDD mode of operation, the Mobility model of Random Walk+Markov.When the power control of open system not and adaptation function, test obtains: jump the obvious quality improvement that SINR is all arranged in (travelling carriage is to the link of fixed relay) and second jumping (fixed relay is to the link of base station) first.
Claims (8)
1, a kind of frequency allocation method of fixed relay cellular network binding site edge coloring, its characteristics are that concrete steps are as follows:
The first step: carry out the painted algorithm computation of point of figure according to putting painted constraints, obtain the Frequency Distribution result of base station;
Second step: obtain the situation of all 3 adjacent fixed relayings, replace with the intermediate colored node, record position and frequency consume information;
The 3rd step: according to edge coloring frequency constraint condition and relaying Frequency Distribution constraints, it is painted that the opposite side color-patch map carries out the edge coloring algorithm of figure, obtains the frequency resource allocation result of each fixed relay.
2, the frequency allocation method of fixed relay cellular network binding site edge coloring according to claim 1, it is characterized in that, the described painted algorithm computation of point of carrying out figure according to the painted constraints of point, obtain the Frequency Distribution result of base station, be meant: under the known situation of the cartographic information of cellular network, base station location and path loss, according to the painted constraints of point, the point of application colouring algorithm obtains the pigmentable set of each base station, the frequency sets that promptly is assigned to.
3, the frequency allocation method of fixed relay cellular network binding site edge coloring according to claim 2, it is characterized in that, described point of application colouring algorithm obtains the pigmentable set of each base station, be meant: use the painted algorithm of typical point to solve the frequency-assignment problem of base station, the wireless network modeling is become a simple graph G (V, E), vertex v among the set V is represented a transmitting station in the network, limit e=(v1 among the set E, v2) represented the connection of adjacent 2 transmitting stations, when putting painted allocation algorithm, analyze the frequency constraint problem of whole network, constraints is: the constraint of cochannel frequency distance, the adjacency channel frequency distance restraint, frequency distance constraint and frequency constraint problem, the figure vertex coloring algorithm model of cochannel frequency distance constraint, being found the solution by the DL algorithm, is that the DL algorithm of painted order solves with the degree descending.
4, the frequency allocation method of fixed relay cellular network binding site edge coloring according to claim 1, it is characterized in that, the described situation of obtaining all 3 adjacent fixed relayings, replace with the intermediate colored node, be meant: search for whole fixed relay network, belong to 3 adjacent fixed relayings under 3 different base stations, distance was less than 1/2 o'clock of the base station covering radius, these 3 fixed relay of mark are one group, with these 3 fixed relay is that the leg-of-mutton central point that the summit is formed replaces this 3 fixed relay, and this point is as the intermediate colored point.
5, the frequency allocation method of fixed relay cellular network binding site edge coloring according to claim 4, it is characterized in that, described is that the leg-of-mutton central point that the summit is formed replaces this 3 fixed relay with these 3 fixed relay, be meant: 3 fixed relay information forming are all recorded on this intermediate colored point, its antenna and emission situation, the antenna and the emission situation that are equal to fixed relay, it and each base station, path loss with other each intermediate colored point need recomputate and record.
6, frequency allocation method according to claim 1 or 4 described fixed relay cellular network binding site edge colorings, it is characterized in that: the described situation of obtaining all 3 adjacent fixed relayings, replace with the intermediate colored node, be meant: on the position, distance between 3 fixed relay between 3 adjacent cells is quite near, participate in the fixed relay Frequency Distribution so regard these 3 fixed relay as a point, after obtaining the Frequency Distribution result of base station, information in the former scene is scanned, obtain the situation of all 3 adjacent fixed relayings, replace with the intermediate colored node, record position and frequency consume information, to all known base station and intermediate point, make up edge coloring figure, use the edge coloring algorithm then, finish Frequency Distribution whole cellular system.
7, the frequency allocation method of fixed relay cellular network binding site edge coloring according to claim 1, it is characterized in that, described according to edge coloring frequency constraint condition and relaying Frequency Distribution constraints, it is painted that the opposite side color-patch map carries out the edge coloring algorithm of figure, be meant: finished intermediate colored point obtain with the information completion after, the base station of whole scene and intermediate colored point, be configured to the edge coloring distribution diagram, edge coloring frequency constraint condition is: during edge coloring, adjacent edge must with different colors, relaying Frequency Distribution constraints is: during the relaying Frequency Distribution, the this edge that intermediate colored point links to each other with the base station, must with the color different with the base station.
8, according to the frequency allocation method of claim 1 or 7 described fixed relay cellular network binding site edge colorings, it is characterized in that, it is painted that described opposite side color-patch map carries out the edge coloring algorithm of figure, be meant: adopt heuritic approach, to spend maximum summit is beginning, first painted each bar limit that it is connected, and then with the adjacent degree maximum vertex of this point be second order, the not painted limit of painted each bar that it is connected.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100279814A CN100401831C (en) | 2006-06-22 | 2006-06-22 | Frequency allocation method of immobile relay cellular network combined with coloring up points and edges |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100279814A CN100401831C (en) | 2006-06-22 | 2006-06-22 | Frequency allocation method of immobile relay cellular network combined with coloring up points and edges |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1874587A true CN1874587A (en) | 2006-12-06 |
| CN100401831C CN100401831C (en) | 2008-07-09 |
Family
ID=37484793
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100279814A Expired - Fee Related CN100401831C (en) | 2006-06-22 | 2006-06-22 | Frequency allocation method of immobile relay cellular network combined with coloring up points and edges |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100401831C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101964775A (en) * | 2010-10-28 | 2011-02-02 | 中国科学技术大学 | Interference suppression method of OFDMA relay cellular system |
| CN102065437A (en) * | 2010-12-10 | 2011-05-18 | 中国电子科技集团公司第三十研究所 | Graph coloring-based wireless frequency allocation working method |
| CN102960012A (en) * | 2010-07-09 | 2013-03-06 | 阿尔卡特朗讯 | Method of operating a base station and base station |
| CN104540140A (en) * | 2015-01-09 | 2015-04-22 | 桂林电子科技大学 | Dynamic frequency assignment method of wireless communication network |
-
2006
- 2006-06-22 CN CNB2006100279814A patent/CN100401831C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102960012A (en) * | 2010-07-09 | 2013-03-06 | 阿尔卡特朗讯 | Method of operating a base station and base station |
| CN102960012B (en) * | 2010-07-09 | 2016-06-08 | 阿尔卡特朗讯 | The method of operation base station and base station |
| US9408089B2 (en) | 2010-07-09 | 2016-08-02 | Alcatel Lucent | Method of operating a base station and base station |
| CN101964775A (en) * | 2010-10-28 | 2011-02-02 | 中国科学技术大学 | Interference suppression method of OFDMA relay cellular system |
| CN102065437A (en) * | 2010-12-10 | 2011-05-18 | 中国电子科技集团公司第三十研究所 | Graph coloring-based wireless frequency allocation working method |
| CN104540140A (en) * | 2015-01-09 | 2015-04-22 | 桂林电子科技大学 | Dynamic frequency assignment method of wireless communication network |
| CN104540140B (en) * | 2015-01-09 | 2017-11-24 | 桂林电子科技大学 | A kind of dynamic frequency allocation method of wireless communication networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100401831C (en) | 2008-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tombaz et al. | Impact of backhauling power consumption on the deployment of heterogeneous mobile networks | |
| Malesinska | Graph-theoretical models for frequency assignment problems | |
| EP3451731A1 (en) | Cell clustering method, spectrum overlapping multiplexing method based on method, and device thereof | |
| CN1874587A (en) | Frequency allocation method of immobile relay cellular network combined with coloring up points and edges | |
| CN102984716A (en) | Production method for ENB configuration file of TD-LTE system | |
| CN102880975A (en) | Bidding game method based on load balancing in VANET | |
| CN104159314B (en) | The distributed energy saving resources distribution method of heterogeneous network | |
| CN106209336B (en) | A kind of resource allocation methods in software definition mobile network | |
| CN107205237A (en) | The optimization method and device of a kind of network structure | |
| Khan et al. | Unsupervised clustering for 5G network planning assisted by real data | |
| US10291481B2 (en) | Modelling apparatus and method | |
| CN110493793B (en) | Method and system for planning new station building based on capacity LTE | |
| Singh et al. | Dynamic frequency resource allocation in heterogeneous cellular networks | |
| Berrocal-Plaza et al. | Artificial bee colony algorithm applied to WiMAX network planning problem | |
| CN109561436A (en) | A kind of method, equipment and the device of physical-layer cell identifier PCI optimization | |
| Garcia et al. | An iterative heuristic approach for channel and power allocation in wireless networks | |
| CN109474908B (en) | Task-driven-based aviation ad hoc network method | |
| Barillaro et al. | Comparison of heuristic approaches to PCI planning for Quantum Computers | |
| CN103945388B (en) | A kind of user access network method based on genetic algorithm in heterogeneous network | |
| CN102186253B (en) | Resource configuration method for family base station | |
| Zhou et al. | Virtualized resource sharing in cloud radio access networks: An auction approach | |
| Sivarambabu et al. | EEHC approach for latency minimization in 3D network architecture using 5G+ with UAVs | |
| Tiwana et al. | Statistical learning for automated RRM: Application to eUTRAN mobility | |
| CN108551664A (en) | A kind of vehicle-mounted heterogeneous network resource collaboration optimization method based on graph theory | |
| Wang et al. | Optimization deployment of wl-mesh network with base-station in nature environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080709 Termination date: 20110622 |