CN103369683A - OFDMA wireless multi-hop network resource allocation method based on graph theory - Google Patents
OFDMA wireless multi-hop network resource allocation method based on graph theory Download PDFInfo
- Publication number
- CN103369683A CN103369683A CN2013102965476A CN201310296547A CN103369683A CN 103369683 A CN103369683 A CN 103369683A CN 2013102965476 A CN2013102965476 A CN 2013102965476A CN 201310296547 A CN201310296547 A CN 201310296547A CN 103369683 A CN103369683 A CN 103369683A
- Authority
- CN
- China
- Prior art keywords
- link
- subcarrier
- centerdot
- matrix
- transmission rate
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an OFDMA wireless multi-hop network resource allocation method based on a graph theory. The OFDMA wireless multi-hop network resource allocation method based on the graph theory mainly solves the problem that the use ratio of resources is low when link subcarrier allocation is carried out in the prior art. The OFDMA wireless multi-hop network resource allocation method based on the graph theory comprises the steps that (1) a topological graph of a wireless multi-hop network is generated, a service route matrix is generated according to the topological graph and service flow in the graph, rates required by all links are acquired, the number of subcarriers required by each link is calculated according to single carrier rates, subcarriers of the links are respectively pre-allocated according to a coloring theory to acquire a combinatorial link matrix; (2) through a repeated Hungary algorithm, the subcarriers are allocated to each line combination of the combinational matrix, rates of the subcarriers on each link of each line combination are added to acquire the transmission rate of each line combination, and the transmission rates of all line combinations are added to acquire a total transmission rate. The OFDMA wireless multi-hop network resource allocation method based on the graph theory achieves the reuse of frequency resources and the optimum allocation of the carriers, ensures that all links are not interrupted with each other, and has the advantages of being high in resource use ratio.
Description
Technical field
The invention belongs to communication technical field, the resource that further relates in the OFDMA wireless multi-hop system is distributed, and can be used for to the problem of link assignment subcarrier.
Background technology
In the OFDMA radio honeycomb communication system, because number of links is usually less than sub-carrier number waiting for transmission, and the distribution of different sub carrier on different links can produce certain rate gain.The allocative decision of limited sub-carrier resources has a great impact the performance of system.Existing resource allocation methods mainly contains: equitable proportion method, Hungary Algorithm, max methods.
Patent " sub-carrier wave distribution method of the multi-carrier wireless communications system " (number of patent application 200510115002 of Siemens's application, publication number CN1972266A) in, sub-carrier wave distribution method in a kind of multi-carrier wireless communications system is disclosed, the steps include: that (1) is divided into sub-band with the subcarrier that system has along frequency axis, every sub-frequency bands is by being arranged in order along frequency axis, and comprises at least the subcarrier that a system has.(2) the wireless channel impulse response power on the described sub-band is measured; (3) the control node in the system is that user terminal in the described system distributes the sub-band for it according to the measured value of described wireless channel impulse response power.Finally assigned.The deficiency of the method is: because the control node monitors the wireless channel impulse response power on the sub-band of user terminal use, in the larger situation of traffic carrying capacity, need frequently allocated channel, this supervision is consumes resources very, and the resource utilization of this situation also has much room for improvement.
Document [1] Fanglei Sun, Mingli You, Jin Liu, Pinging Wen, Shaoquan Wu " Joint Frequency-spatial Resource Allocation with Bipartite Matching in OFDM-MIMO Systerms " be the middle equitable proportion method that proposes (978-1-4244-2517-4/09.2009IEEE).Its basic thought of equitable proportion method is to utilize the formula that provides in the paper, determine the proportionality coefficient of each link, then with the rate matrix of subcarrier and link proportionally coefficient be converted into square formation, utilize at last Hungary Algorithm finally to distribute, but the determining of its proportionality coefficient only is confined to matrix element greater than 1 situation, according to document [2] Ioannis G.Fraimis, Stavros A.Kotsopoulos " QoS-Based Proportional Fair Allocation Algorithm for OFDMA Wireless Cellular Systerms " (IEEE COMMUNICATIONS LETTERS, VOL.15, NO.10, the method of the definite link rate matrix that proposes OCTOBER2011)], can obtain the link rate matrix element all less than 1 situation, this moment, the equitable proportion method was just inapplicable, and owing to according to proportionality coefficient matrix is converted into square formation, the scale that has increased matrix will be so that computation complexity increases, and resource utilization is not high yet.
The resource that above algorithm all is based under the single-hop systems is distributed, and does not consider channeling and problem of co-channel interference under the multihop system.
Summary of the invention
The object of the invention is to overcome the deficiency of above-mentioned prior art, propose a kind of OFDMA wireless multi-hop networks resource allocation methods based on graph theory, to guarantee that in the non-interfering situation of all links the recycling sub-carrier resources improves resource utilization.
Realize that basic ideas of the present invention are: to every link assignment subcarrier the time, utilize the painted method of graph theory to distribute, so that not disturbed between the link, and the recycling sub-carrier resources.
For achieving the above object, the present invention is achieved as follows:
(1) produce topological diagram G (V, E) based on the OFDMA wireless multi-hop network according to node and link, according to network topological diagram and Business Stream, produce professional route matrix R, wherein, V is the vertex set of figure, and E is the limit set of figure,
Described vertex set V comprises 1 base station, a d relay station and m portable terminal in the multihop network, d 〉=1, and m 〉=1, each portable terminal produces an oriented Business Stream, and the needed minimum-rate of each Business Stream is h
i, 1≤i≤m;
Described limit set E comprises the l bar link in the multihop network, l 〉=2;
(2) number of every needed subcarrier of link of calculating:
2a) according to the needed minimum-rate h of each Business Stream
iWith professional route matrix R, calculate every needed transmission rate v of link
i, 1≤i≤l;
2b) utilize shannon formula to calculate single carrier average transmission rate q, with every desired transmission rate v of link
iDivided by single carrier average transmission rate q, draw every needed number of sub carrier wave n of link
i, 1≤i≤l;
(3) according to every needed number of sub carrier wave n of link
iWith the disturbed condition of adjacent link, utilize painted theory that link is carried out subcarrier preassignment setting, to obtain link combinations matrix g:
3a) subcarrier of s OFDM is numbered: c
1, c
2C
s
3b) according to the number n of the subcarrier of article one link needs
1, with subcarrier c
1,
Distribute to this link;
3c) according to the number n of the subcarrier of second link needs
2, from subcarrier c
1Begin to this link assignment, be about to subcarrier c
1,
Distribute to the second link; Disturb if exist between second link and article one link, then from the subcarrier that is not yet assigned to article one link, press the order of subcarrier sequence number, distribute successively n for the second link
2Individual subcarrier, i.e. subcarrier
3d) the like, give remaining link assignment subcarrier, at every turn all from subcarrier c
1Begin to distribute, if other had distributed the link of subcarrier that this link is had interference, the subcarrier of then distributing on other link is no longer participated in distribution, namely from remaining subcarrier, press the order of subcarrier sequence number, satisfy the subcarrier of needed number for this link assignment, guarantee that the number of sub carrier wave that distributes on all links meets the demands;
After 3e) preassignment arranges end, by the label of every link and the subcarrier setting of every link assignment, obtain link combinations matrix g, the every column element among this combinatorial matrix g represents to reuse the link label of same carrier wave;
(4) use repeatedly Hungary Algorithm with each the row combination to combinatorial matrix g of s sub-allocation of carriers, speed addition with the subcarrier on each link in each row combination, obtain the transmission rate of each row combination among the combinatorial matrix g, with the transmission rate addition of all row combinations, obtain overall transmission rate again.
The present invention compared with prior art has the following advantages:
The first, among the present invention, used different subcarriers between the adjacent link, and when in the same link, distributing a plurality of subcarrier, different between a plurality of subcarriers that are assigned with, like this, just the frequency-assignment problem of complexity can be converted into colorability problem.
The second, the present invention obtains the link combinations matrix by link being carried out subcarrier preassignment setting, can determine can be with the combination of the link of same subcarrier, so that subcarrier can be repeated to utilize, take full advantage of given frequency resource, and effectively reduced interference problem.
The present invention is described in further detail below in conjunction with accompanying drawing and embodiment.
Description of drawings
Fig. 1 is realization flow figure of the present invention;
Fig. 2 is the wireless multi-hop network topological diagram among the present invention;
Fig. 3 is throughput performance analogous diagram of the present invention;
Fig. 4 is statistic property analogous diagram of the present invention.
Embodiment
With reference to Fig. 1, performing step of the present invention is as follows:
In this example, by 1 base station, 6 relay stations, 4 portable terminals and 12 links produce the wireless multi-hop network topological diagram, and to relay station, relay station arrives portable terminal by link connection again by link connection in the base station, Business Stream transmits at link, and the topological diagram of generation as shown in Figure 2;
According to network topological diagram and the Business Stream of Fig. 2, the professional route matrix R of generation is as follows:
4 row of R represent respectively 4 Business Streams, and 12 row represent respectively 12 links, and matrix element is that 1 expression Business Stream transmits at corresponding link, and matrix element is that 0 this Business Stream of expression is not through this link;
The minimum-rate that the 1-4 Business Stream is set to be needed is respectively h
1=18.0kbps, h
2=9.0kbps, h
3=5.0kbps, h
4=13.0kbps.
2a) according to 1-4 Business Stream respectively minimum-rate and the professional route matrix R of needs, calculate every needed transmission rate v of link
i, 1≤i≤12, namely all elements with every delegation of professional route matrix R all multiply by the needed minimum-rate h of Business Stream corresponding to this row
i, 1≤i≤4 obtain a new matrix; Each row all elements addition that again will this new matrix, the value that obtains is exactly every needed transmission rate v of link
i, 1≤i≤l.
With 12 needed transmission rate v of links difference
iIt is as follows to form matrix v:
v＝[18?18?18?13?14?9?9?13?13?5?5?9]
Be v
1=18kbps, v
2=18kbps, v
3=18kbps, v
4=13kbps, v
5=14kbps, v
6=9kbps, v
7=9kbps, v
8=13kbps, v
9=13kbps, v
10=5kbps, v
11=5kbps, v
12=9kbps;
2b) the average signal-to-noise ratio γ of link is set
0Be 15dB, bandwidth B is 2kHz, and channel bit error rate BER is 10
-5To 10
-4
2c) according to shannon formula q=Blog
2(1+ γ
0), the average transmission rate q that calculates single carrier is 8kbps, with every desired transmission rate v of link
iDivided by single carrier average transmission rate q, draw 12 needed number of sub carrier wave n of link
iThe matrix n that forms is as follows:
n＝[3?3?3?2?2?2?2?2?2?1?1?2]
Be n
1=3, n
2=3, n
3=3, n
4=2, n
5=2, n
6=2, n
7=2, n
8=2, n
9=2, n
10=1, n
11=1, n
12=2.
3a) subcarrier of s OFDM is numbered: c
1, c
2C
s
3b) according to the number 3 of the subcarrier of article one link needs, with subcarrier c
1, c
2, c
3Distribute to this link;
3c) according to the number 3 of the subcarrier of second link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, exist between article one link and the second link and disturb, distributed to three subcarrier c of article one link
1, c
2, c
3Can not reallocate to the second link, so from the subcarrier that is not yet assigned to article one link, press the order of subcarrier sequence number, distribute successively 3 subcarriers, i.e. subcarrier c for the second link
4, c
5, c
6
3d) according to the number 3 of the subcarrier of the 3rd link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, there is interference between second link and the 3rd link, distributed to the subcarrier of second link and can not reallocate to the 3rd link, so from the subcarrier that is not yet assigned to the second link, press the order of subcarrier sequence number, distribute successively 3 subcarriers, i.e. subcarrier c for the second link
1, c
2, c
3
3e) according to the number 2 of the subcarrier of the 4th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article one, there is interference between link and the 4th link, distributed to the subcarrier of article one link and can not reallocate to the 4th link, so from the subcarrier that is not yet assigned to article one link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 4th link
4, c
5
3f) according to the number 2 of the subcarrier of the 5th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article one, there are interference in link and the 4th link respectively and between the 5th link, distributed to the subcarrier of article one link and the 4th link and can not reallocate to the 5th link, so from the subcarrier that is not yet assigned to article one link and the 4th link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 5th link
6, c
7
3g) according to the number 2 of the subcarrier of the 6th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article one, there are interference in link, second link and the 5th link respectively and between the 6th link, having distributed to the subcarrier of article one link, second link and the 5th link can not reallocate to the 6th link, so from the subcarrier that is not yet assigned to article one link, second link and the 5th link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 6th link
8, c
9
3h) according to the number 2 of the subcarrier of the 7th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article one, there are interference in link, second link and the 6th link respectively and between the 7th link, having distributed to the subcarrier of article one link, second link and the 6th link can not reallocate to the 7th link, so from the subcarrier that is not yet assigned to article one link, second link and the 6th link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 7th link
7, c
10
3i) according to the number 2 of the subcarrier of the 8th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article four, there is interference between link and the 8th link, distributed to the subcarrier of the 4th link and can not reallocate to the 8th link, so from the subcarrier that is not yet assigned to the 4th link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 8th link
1, c
2
3j) according to the number 2 of the subcarrier of the 9th link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article eight, there is interference between link and the 9th link, distributed to the subcarrier of the 8th link and can not reallocate to the 9th link, so from the subcarrier that is not yet assigned to the 8th link, press the order of subcarrier sequence number, distribute successively 2 subcarriers, i.e. subcarrier c for the 9th link
3, c
4
3k) according to the number 1 of the subcarrier of the tenth link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article five, there are interference in link, the 6th link and the 7th link respectively and between the tenth link, having distributed to the subcarrier of the 5th link, the 6th link and the 7th link can not reallocate to the tenth link, so from the subcarrier that is not yet assigned to the 5th link, the 6th link and the 7th link, press the order of subcarrier sequence number, give 1 subcarrier of the tenth link assignment, i.e. subcarrier c
1
3l) according to the number 1 of the subcarrier of the 11 link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article seven, there are interference in link and the tenth link respectively and between the 11 link, distributed to the subcarrier of the 7th link and the tenth link and can not reallocate to the 11 link, so from the subcarrier that is not yet assigned to the 7th link and the tenth link, press the order of subcarrier sequence number, give 1 subcarrier of the 11 link assignment, i.e. subcarrier c
2
3m) according to the number 2 of the subcarrier of the 12 link needs, and as can be seen from Figure 2, in the link of allocation of subcarriers, article seven, there are interference in link, the tenth link and the 11 link respectively and between the 12 link, having distributed to the subcarrier of the 7th link, the tenth link and the 11 link can not reallocate to the 12 link, so from the subcarrier that is not yet assigned to the 7th link, the tenth link and the 11 link, press the order of subcarrier sequence number, distribute successively 2 subcarriers for the 12 link, i.e. subcarrier c
3, c
4
After 3n) preassignment arranged end, by the label of every link and the subcarrier of every link assignment, it was as follows to obtain link combinations matrix g:
Every row among this combinatorial matrix g consist of a combination, and every column element represents to reuse the link label of same carrier wave, that is:
First row represents link 1,3, and 8,10 can use same subcarrier, and they consist of the first combination;
Secondary series represents link 1,3, and 8,11 can use same subcarrier, and they consist of the second combination;
The 5th tabulation shows that link 2,4 can use same subcarrier, and they consist of the 5th combination;
The 6th tabulation shows that link 2,5 can use same subcarrier, and they consist of the 6th combination;
The 7th tabulation shows that link 5,7 can use same subcarrier, and they consist of the 7th combination;
The 8th tabulation shows that link 6 can use a subcarrier, and it consists of the 8th combination;
The 9th tabulation shows that link 6 can use a subcarrier, and it consists of the 9th combination;
The tenth tabulation shows that link 7 can use a subcarrier, and it consists of the tenth combination;
As can be known, because link 1 needs 3 subcarriers, so link label 1 has occurred 3 times altogether from combinatorial matrix g; Because link 2 needs 3 subcarriers, so link label 2 occurs 3 times altogether, and exists between link 1 and the link 2 and disturb, so link label 2 and link label 1 are scarcely in same row make up; In like manner, the number of the subcarrier that the number of times that other link label occurs in combinatorial matrix g and respective link are required equates, disturbs if exist between other link, and then their corresponding link labels can not occur in same row combination simultaneously.
4a) structure allocation matrix A
10 * sAs follows:
Wherein, line number is the row number 10 among the combinatorial matrix g, and columns is the total number s of subcarrier, each the element a in the allocation matrix
Ij, 1≤i≤10,1≤j≤s represents the transmission rate of each subcarrier in the respective link combination, namely is assigned to the speed sum of subcarrier on the corresponding link of this row link label of row combination; Wherein, the speed of each subcarrier on each link is produced by emulation;
4b) from all subcarriers, find out but be not limited to 10 subcarriers, distribute to each the row combination among the combinatorial matrix g, so that it is maximum to assign to speed sums of the subcarrier in these row combinations;
The subcarrier that has neither part nor lot in distribution is distributed: if the subcarrier number that has neither part nor lot in distribution is greater than 10, in these subcarriers of then never participating in the distribution, find out 10 subcarriers, distribute to each the row combination among the combinatorial matrix g, so that it is maximum to assign to the speed sum of the subcarrier in these row combinations; So repeatedly, until the subcarrier number that has neither part nor lot in distribution less than 10;
If have neither part nor lot in the subcarrier number of distribution less than 10, then these subcarriers are distributed to the part rows combination among the combinatorial matrix g, so that it is maximum to assign to the speed sum of the subcarrier in the part rows combination, so far, all subcarriers assign, and have also obtained total transmission rate.
Below in conjunction with Fig. 3 and Fig. 4 effect of the present invention is described in detail.
1. simulated conditions
The speed of subcarrier on every link is exactly link gain, produces the gain of all subcarriers on respective link at every turn, and forms the link gain matrix, and link gain matrix of every generation just carries out an emulation; Produce 20 times the link gain matrix, carry out altogether 20 emulation, for the link gain matrix of each generation, calculate the transmission rate that distributes behind the subcarrier; With the maximum in all transmission rates and the minimum value speed range as statistic property emulation, count transmission rate cumulative distribution function (CDF) value of distinct methods.
2. emulation content and interpretation of result
Emulation 1: respectively the present invention and existing painted transmission rate in conjunction with Random assignment method and pre-ratio method are carried out emulation, namely to the link gain matrix of each generation, calculate the transmission rate after three kinds of methods distribute subcarrier, obtain the throughput of system of three kinds of methods, result such as Fig. 3.
As seen from Figure 3, throughput of system of the present invention is larger than painted throughput of system in conjunction with Random assignment method and pre-ratio method, although the painted rate requirement that can satisfy all links in conjunction with the Random assignment algorithm, guarantee each user's communication quality, but because be Random assignment, do not consider resource for the relation between the link capacity, resource is not distributed to best link, caused the loss of resource, thereby its throughput descends.And pre-ratio method is not considered the situation of frequency recycling, and resource utilization is low, so its corresponding throughput of system is not good yet.
Emulation 2: with the maximum in all transmission rates in the emulation 1 and the minimum value speed range as statistic property emulation, count the transmission rate cumulative distribution function CDF value of distinct methods, the result as shown in Figure 4.
As can be seen from Figure 4, the power system capacity that the present invention can access is distributed between 950～1000 (kbps) mostly, and the painted power system capacity that obtains in conjunction with the Random assignment method is between 650～700 (kbps), and the power system capacity that pre-ratio method obtains is between 250～350 (kbps).Therefore, performance of the present invention is more excellent.
Claims (5)
1. the OFDMA wireless multi-hop networks resource allocation methods based on graph theory comprises the steps:
(1) produce topological diagram G (V, E) based on the OFDMA wireless multi-hop network according to node and link, according to network topological diagram and Business Stream, produce professional route matrix R, wherein, V is the vertex set of figure, and E is the limit set of figure;
Described vertex set V comprises 1 base station, a d relay station and m portable terminal in the multihop network, d 〉=1, and m 〉=1, each portable terminal produces an oriented Business Stream, and the needed minimum-rate of each Business Stream is h
i, 1≤i≤m;
Described limit set E comprises the l bar link in the multihop network, l 〉=2;
(2) number of every needed subcarrier of link of calculating:
2a) according to the needed minimum-rate h of each Business Stream
iWith professional route matrix R, calculate every needed transmission rate v of link
i, 1≤i≤l;
2b) utilize shannon formula to calculate single carrier average transmission rate q, with every desired transmission rate v of link
iDivided by single carrier average transmission rate q, draw every needed number of sub carrier wave n of link
i, 1≤i≤l;
(3) according to every needed number of sub carrier wave n of link
iWith the disturbed condition of adjacent link, utilize painted theory that link is carried out subcarrier preassignment setting, to obtain link combinations matrix g:
3a) subcarrier of s OFDM is numbered: c
1, c
2C
s
3b) according to the number n of the subcarrier of article one link needs
1, with subcarrier c
1,
Distribute to this link;
3c) according to the number n of the subcarrier of second link needs
2, from subcarrier c
1Begin to this link assignment, be about to subcarrier c
1,
Distribute to the second link; Disturb if exist between second link and article one link, then from the subcarrier that is not yet assigned to article one link, press the order of subcarrier sequence number, distribute successively n for the second link
2Individual subcarrier, i.e. subcarrier
3d) the like, give remaining link assignment subcarrier, at every turn all from subcarrier c
1Begin to distribute, if other had distributed the link of subcarrier that this link is had interference, the subcarrier of then distributing on other link is no longer participated in distribution, namely from remaining subcarrier, press the order of subcarrier sequence number, satisfy the subcarrier of needed number for this link assignment, guarantee that the number of sub carrier wave that distributes on all links meets the demands;
After 3e) preassignment arranges end, by the label of every link and the subcarrier setting of every link assignment, obtain link combinations matrix g, the every column element among this combinatorial matrix g represents to reuse the link label of same carrier wave;
(4) use repeatedly Hungary Algorithm with each the row combination to combinatorial matrix g of s sub-allocation of carriers, speed addition with the subcarrier on each link in each row combination, obtain the transmission rate of each row combination among the combinatorial matrix g, with the transmission rate addition of all row combinations, obtain overall transmission rate again.
2. the OFDMA wireless multi-hop networks resource allocation methods based on graph theory according to claim 1, it is characterized in that, topological diagram in the described step (1), refer to the base station by link connection to relay station, relay station arrives portable terminal, the route that Business Stream transmits at link by link connection again.
3. the OFDMA wireless multi-hop networks resource allocation methods based on graph theory according to claim 1 is characterized in that step 2a) the needed transmission rate v of every link of described calculating
i, 1≤i≤l is that all elements with every delegation of professional route matrix R all multiply by the needed minimum-rate h of Business Stream corresponding to this row
i, 1≤i≤m obtains a new matrix; Each row all elements addition that again will this new matrix, the value that obtains is exactly every needed transmission rate v of link
i, 1≤i≤l.
4. the OFDMA wireless multi-hop networks resource allocation methods based on graph theory according to claim 1 is characterized in that step 2b) the described shannon formula calculating single carrier average transmission rate q that utilizes, its formula is as follows:
q＝Blog
2(1+γ
0)
Wherein, B represents bandwidth, γ
0The expression average signal-to-noise ratio.
5. the OFDMA wireless multi-hop networks resource allocation methods based on graph theory according to claim 1 is characterized in that, the described usefulness of step (4) repeatedly Hungary Algorithm is carried out each the row combination to combinatorial matrix g of s sub-allocation of carriers as follows:
4a) structure allocation matrix A
T * sAs follows:
Wherein, line number is the row number t among the combinatorial matrix g, and columns is the total number s of subcarrier, each the element a in the allocation matrix
Ij, 1≤i≤t, 1≤j≤s represents the transmission rate of each subcarrier in the respective link combination;
4b) from s subcarrier, find out t subcarrier, distribute to each the row combination among the combinatorial matrix g, so that it is maximum to assign to the speed sum of the subcarrier in these row combinations;
4c) subcarrier that has neither part nor lot in distribution is distributed: if the subcarrier number that has neither part nor lot in distribution is greater than t, in these subcarriers of then never participating in the distribution, find out t subcarrier, distribute to each the row combination among the combinatorial matrix g, so that it is maximum to assign to the speed sum of the subcarrier in these row combinations; So repeatedly, until the subcarrier number that has neither part nor lot in distribution less than t;
If 4d) have neither part nor lot in the subcarrier number of distribution less than t, then these subcarriers are distributed to the part rows combination among the combinatorial matrix g, so that it is maximum to assign to the speed sum of the subcarrier in the part rows combination, so far, s sub-allocation of carriers is complete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310296547.6A CN103369683B (en) | 2013-07-13 | 2013-07-13 | Based on the OFDMA wireless multi-hop networks resource allocation methods of graph theory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310296547.6A CN103369683B (en) | 2013-07-13 | 2013-07-13 | Based on the OFDMA wireless multi-hop networks resource allocation methods of graph theory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103369683A true CN103369683A (en) | 2013-10-23 |
| CN103369683B CN103369683B (en) | 2016-03-02 |
Family
ID=49369948
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310296547.6A Expired - Fee Related CN103369683B (en) | 2013-07-13 | 2013-07-13 | Based on the OFDMA wireless multi-hop networks resource allocation methods of graph theory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103369683B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105228249A (en) * | 2015-08-21 | 2016-01-06 | 上海华为技术有限公司 | A kind of sub-carrier wave distribution method, relevant apparatus and base station |
| CN105407487A (en) * | 2015-10-28 | 2016-03-16 | 中国电子科技集团公司第五十四研究所 | Link rate maximization method based on channel allocation in cognitive radio system |
| CN111060104A (en) * | 2019-12-13 | 2020-04-24 | 杭州昕华信息科技有限公司 | Method, device, medium and equipment for determining inspection area of robot |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101610580A (en) * | 2008-06-16 | 2009-12-23 | 华为技术有限公司 | The resource allocation methods of junction network and base station |
| CN103117976A (en) * | 2012-12-14 | 2013-05-22 | 西安电子科技大学 | Wireless resource distribution method based on relative clustering |
-
2013
- 2013-07-13 CN CN201310296547.6A patent/CN103369683B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101610580A (en) * | 2008-06-16 | 2009-12-23 | 华为技术有限公司 | The resource allocation methods of junction network and base station |
| CN103117976A (en) * | 2012-12-14 | 2013-05-22 | 西安电子科技大学 | Wireless resource distribution method based on relative clustering |
Non-Patent Citations (2)
| Title |
|---|
| FANGLEI SUN等: "Joint Frequency-spatial Resource Allocation with Bipartite Matching in OFDM-MIMO Systems", 《VTC2009》 * |
| 刘英挺等: "无线区域网单小区中下行链路的子信道分配", 《北京邮电大学学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105228249A (en) * | 2015-08-21 | 2016-01-06 | 上海华为技术有限公司 | A kind of sub-carrier wave distribution method, relevant apparatus and base station |
| CN105228249B (en) * | 2015-08-21 | 2018-11-20 | 上海华为技术有限公司 | A kind of sub-carrier wave distribution method, relevant apparatus and base station |
| CN105407487A (en) * | 2015-10-28 | 2016-03-16 | 中国电子科技集团公司第五十四研究所 | Link rate maximization method based on channel allocation in cognitive radio system |
| CN105407487B (en) * | 2015-10-28 | 2018-09-14 | 中国电子科技集团公司第五十四研究所 | Link rate maximization approach based on channel distribution in cognitive radio system |
| CN111060104A (en) * | 2019-12-13 | 2020-04-24 | 杭州昕华信息科技有限公司 | Method, device, medium and equipment for determining inspection area of robot |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103369683B (en) | 2016-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102355670B (en) | Multichannel wireless mesh network channel distribution method | |
| CN102664855B (en) | Orthogonal frequency division multiplexing (OFDM)-based channel assignment method in two-layer network | |
| CN102098746B (en) | Multi-cell resource allocation method introducing mobile resource reserve mechanism | |
| CN101682581B (en) | Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system | |
| CN102612149B (en) | Wireless resource distribution method for relay cell, base station and system | |
| CN104660394A (en) | Spectrum resource allocation method based on utility function and price mechanism | |
| Liu et al. | Energy-efficient resource allocation in full-duplex relaying networks | |
| CN102638872A (en) | Relay selection method based on load balancing in cooperation relay network | |
| CN102098792B (en) | Service quality-based resource round-robin scheduling method | |
| CN103596120A (en) | D2D communication method in macro cell and small cell heterogeneous network | |
| CN101998612B (en) | Resource distribution method and device for two-hop multi-relay orthogonal frequency division multiplexing system | |
| CN102291842A (en) | Virtual MIMO pairing method taking user QoS into account | |
| CN102984736B (en) | Optimizing method for wireless ubiquitous heterogeneous network resources | |
| CN105874858B (en) | The channel multiplexing method and device of multi-transceiver configuration method, multi-transceiver | |
| CN103369683B (en) | Based on the OFDMA wireless multi-hop networks resource allocation methods of graph theory | |
| CN103619066B (en) | Method for distributing downlink interference mitigation based on distributed channel | |
| CN102811490A (en) | MISO-OFDM (Multiple-Input Single-Output-Orthogonal Frequency Division Multiplexing) downlink resource distribution method based on energy efficiency | |
| CN102255840B (en) | Demodulation method and device | |
| Kumar et al. | A delay efficient MAC and packet scheduler for heterogeneous M2M uplink | |
| Olexandr et al. | Slot allocation model and data burst scheduling in downlink WiMAX technology | |
| Hao et al. | Graph-based resource allocation for device-to-device communications aided cellular network | |
| CN107852708A (en) | System and method for carrying out radio resources allocation across multiple resource dimensions | |
| CN106385274B (en) | Method and device for pilot frequency distribution in large-scale MIMO system | |
| CN101800998B (en) | Method for distributing dynamic resources of relay participating in scheduling in orthogonal frequency division multiple access (OFDMA) system | |
| Yaacoub et al. | On using relays with carrier aggregation for planning 5G networks supporting M2M traffic |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160302 Termination date: 20210713 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |