CN102833864B - Wireless resource allocation methods in a kind of multiple cell mobile communication system - Google Patents
Wireless resource allocation methods in a kind of multiple cell mobile communication system Download PDFInfo
- Publication number
- CN102833864B CN102833864B CN201210352037.1A CN201210352037A CN102833864B CN 102833864 B CN102833864 B CN 102833864B CN 201210352037 A CN201210352037 A CN 201210352037A CN 102833864 B CN102833864 B CN 102833864B
- Authority
- CN
- China
- Prior art keywords
- message
- community
- variable
- cell
- neighbor cell
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the wireless resource allocation methods in a kind of multiple cell mobile communication system, the method is: each community produces initial message; In each iterative process, according to the message of the neighbor cell received, carry out twice merging treatment, first time feasibility judge that process and second time optimality judge process, thus generate new information and send to the method for neighbor cell; The message that each community obtains after second time judgement process, if identical with the last round of message obtained after judging for the second time to process, then carries out the method for inference process.Wireless resource allocation methods in multiple cell mobile communication system provided by the invention, for whole multi-cell system, can make the benefit function value of system reach optimum; For each community, only need and neighbor cell exchange message, do not need certain central control unit to coordinate.
Description
Technical field
The present invention relates to moving communicating field, the wireless resource allocation methods particularly in a kind of multiple cell mobile communication system.
Background technology
In multiple cell mobile communication system, owing to interfering with each other, same Radio Resource can not be reused in neighbor cell.N number of community is included, for given Radio Resource, with x in supposing the system
i=1 or 0 represents i-th community or can prohibit the use this Radio Resource, then the optimal assignment problem of this Radio Resource can be modeled as the bigit planning problem with following form:
max w
1x
1+...+w
ix
i+...+w
Nx
N
S.t.x
i+ x
k≤ 1, k ∈ N
i(formula 1)
x
i∈{0,1},1≤i≤N
Wherein w
ithe weight of ShiiGe community, N
iit is the neighbor set of cell i.Wherein, the selection of weight has a variety of method, such as can the user number of direct proportion in community, or direct proportion is in total throughput requirement of community, etc.
In Modern Mobile Communications Systems, owing to have employed compressed structure, allocation of radio resources process has distributed feature, and namely in system, neither one can grasp the central control entity of global information, therefore needs a kind of distributed method solving bigit planning of energy.At present in the document of moving communicating field, still lack the distributed method that effectively can solve binary quadratic program as shown in formula 1.
Summary of the invention
Goal of the invention: in order to solve the distributed problem solving allocation of radio resources in multiple cell mobile communication system, the invention provides the wireless resource allocation methods in a kind of multiple cell mobile communication system.
Technical scheme: the invention provides the wireless resource allocation methods in a kind of multiple cell mobile communication system, utilizes the method for loop iteration to obtain multiple communities distributed Radio Resource and distributes, specifically have following steps:
Step 1: each community produces initial message, initialized message m
iin include two message elements, be respectively x
i=1 and x
i=0, i.e. m
i={ x
i=1, x
i=0}, wherein, m
ibeing the message that i-th community produces, is the set of the message element of different value, x
ithe initial message variable of Wei Yu i-th community, x
ican only value be 0 or 1, x
i=0 represents that i-th community prohibits the use Radio Resource, x
i=1 represents that i-th community can use Radio Resource, i=1 ..., N, N are community sum.
Step 2: each community receives the message m of all neighbor cell j
j={ (x
k=a
j, k, t, x
k∈ V
j), 1≤t≤T
j, wherein j ∈ N
i, N
ithe neighbor set of cell i, V
jbe and message m
jthe variables collection of association, T
jit is message m
jin the sum of message element, x
kfor the message variable of kGe community, a
j, k, tthe value of the variable that in the j of neighbor cell, t message element ZhongkGe community is associated, k=1 ..., N, a
j, k, tvalue be 0 or 1.
Step 3: the message coalescing of neighbor cell that each community will receive, its method is: all message m received
j(j ∈ N
i) in, from adjacent community, select a message element (x respectively
k=a
j, k, t, x
k∈ V
j), if there is no neighbor cell g and the h of cell i, at corresponding two message element (x
u=a
g, u, p, x
u∈ V
g) and (x
v=a
h, v, q, x
v∈ V
h) in, there is variable x
smake a
g, s, p≠ a
h, s, q, just just these message elements can be merged into a message element (x
k=a
j, k, t, x
k∈ V
j, j ∈ N
i), all message elements obtained after merging form new message
corresponding variables collection
for all message m
jvariables collection V
jmerging, wherein, V
g, V
hthe variables collection associated in the message of neighbor cell g with h respectively, x
u, x
vbe respectively the message variable in g and h of neighbor cell, x
sfor the message variable when u equals v, p and q represents the message element of selection; When each community is again by message
with message { x
i=1, x
i=0}, according to identical compatible rule merging, obtains message
corresponding variables collection
for set
with set { x
imerging.
Step 4: each community is to merging the message obtained in step 3
carry out twice judgement and process, wherein, first time judges that the method for process is: to message
in each message element, with variable x
irelevant institute's Prescribed Properties is tested, and deletes the message element not meeting constraints, obtains message
second time judges that the method for process is: in message
in, if there are two different message element (x
j=a
j, t,
) and (x
j=a
j, s,
), make all neighbor cell j for cell i have a
j, t=0 and a
i, t=0 and a
j, s=0 and a
i, s=1, just wherein meeting a
i, tthe message element of=0 is deleted, and meeting a
i, sthe element of=1 retains, and obtains message
wherein x
jfor the message variable of neighbor cell j, a
j, tand a
j, sbe expressed as the value of the message variable of neighbor cell j in t and s message element.
Step 5: the message that step 4 obtains by each community
send to all neighbor cell j, then infer the value of oneself, its method is: if the message that epicycle obtains
with the last round of message obtained
not identical, then do not infer; If identical, each community is by message
in each message element bring Objective benefits function w into
1x
1+ ...+w
nx
nin calculate, it is the allocation of radio resources situation of each community that peek is worth maximum one, wherein, w
ithe weight of ShiiGe community; Finally, the calculating of a new round from step 2.
Because in multiple cell mobile communication system, owing to interfering with each other, same Radio Resource can not be reused in neighbor cell, so the constraints of step 4 is x
i+ x
j≤ 1, wherein j is the neighbor cell of cell i.
Beneficial effect: wireless resource allocation methods in multiple cell mobile communication system of the present invention, for whole multi-cell system, can make the Objective benefits function value of system reach optimum; For each community, only need and neighbor cell exchange message, do not need certain central control unit to coordinate.
Accompanying drawing illustrates:
Fig. 1 is workflow diagram of the present invention;
Fig. 2 is 7 the cell communication systems figure that the present invention relates to.
Embodiment:
Below for 7 communities, provide embodiment, to help to understand content of the present invention.As shown in Figure 2, all there is communication link between all neighbor cells.In these 7 cell communication systems, consider the allocation of radio resources problem being modeled as following binary integer programming:
max 3x
1+4x
2+5x
3+5x
4+6x
5+4x
6+4x
7
S.t.x
i+ x
i ± 1≤ 1,1≤i≤7 (formula 2)
x
i=0 or 1,1≤i≤7
Wherein 3x
1+ 4x
2+ 5x
3+ 5x
4+ 6x
5+ 4x
6+ 4x
7for Objective benefits function, each variable x
iwith x
jadjacent.
Method provided by the present invention mainly each community, constantly from all neighbor cell receipt messages, also constantly sends message to all neighbor cells simultaneously, and infers x at message exchange procedure
ishould value be 0 or 1.
Operating process is below for community 1.
Step 1: initial message.The so-called message produced by cell i, just refers to and comprises x
iin the set of the value of interior part or all of message variable, use m
irepresent.When initial, because cell i does not receive the message of any adjacent variable, so can only message m be produced
i={ (x
i=0), (x
i=1) }.
In step 1, each community will produce initial message as shown in table 1.
Table 1
Step 2: receipt message, cell i is received from neighbor cell m
jmessage.
In step 2, community 1 will receive from the message m of community 2 with community 7
2={ (x
2=0), (x
2=1) } and m
7={ (x
7=0), (x
7=1) }; Community 2 will receive from the message m of community 1 with community 3
1={ (x
1=0), (x
1=1) } and m
3={ (x
3=0), (x
3=1) }; The rest may be inferred.
Step 3: merge message.Cell i is first by the message m of all neighbor cells
jmerge.The method merging message is: all message m received
j(j ∈ N
i) in, from adjacent community, select a message element (x respectively
k=a
j, k, t, x
k∈ V
j), if there is no neighbor cell g and the h of cell i, at corresponding two message element (x
u=a
g, u, p, x
u∈ V
g) and (x
v=a
h, v, q, x
v∈ V
h) in, there is variable x
smake a
g, s, p≠ a
h, s, q, just just these message elements can be merged into a message element (x
k=a
j, k, t, x
k∈ V
j, j ∈ N
i), all message elements obtained after merging form new message
corresponding variables collection
for all message m
jvariables collection V
jmerging, wherein, V
g, V
hthe variables collection associated in the message of neighbor cell g with h respectively, x
u, x
vbe respectively the message variable in g and h of neighbor cell, x
sfor the message variable when u equals v, p and q represents the message element of selection; When each community is again by message
with message { x
i=1, x
i=0}, according to identical compatible rule merging, obtains message
corresponding variables collection
for set
with set { x
imerging.
In step 3, community 1 first will message m
2with m
7merge into
as previously mentioned, message m
2with m
7in the information that comprises be respectively m
2={ (x
2=0), (x
2=1) } and m
7={ (x
7=0), (x
7=1) }.Due to message m
2and m
7common variable is not had, so can merge in involved variable.According to the method merging message, as shown in table 2, variable (x can be obtained after merging
2, x
7) four groups of values, be designated as
next, then by message
with the initial message { (x of community 1
1=0), (x
1=1) } merge.Due to (x
2, x
7) and (x
1) there is no common variable, so the variable-value in these two message also can merge yet.According to the method merging message, after merging, variable (x can be obtained
2, x
7, x
1) eight groups of values, be designated as
This merging process can represent by the form of table 3.The operation of all the other communities is all similar.
Table 2
Table 3
Step 4: previous step is obtained
in all variable-values carry out twice judgement process.The method that first time judges is as follows: to message
in each message element, with variable x
irelevant institute's Prescribed Properties is tested, and deletes the message element not meeting constraints, obtains message
second time judges that the method for process is: in message
in, if there are two different message element (x
j=a
j, t,
) and (x
j=a
j, s,
), make all neighbor cell j for cell i have a
j, t=0 and a
i, t=0 and a
j, s=0 and a
i, s=1, just wherein meeting a
i, tthe message element of=0 is deleted, and meeting a
i, sthe element of=1 retains, and obtains message
wherein x
jfor the message variable of neighbor cell j, a
j, tand a
j, sbe expressed as the value of the message variable of neighbor cell j in t and s message element.
Because in multiple cell mobile communication system, owing to interfering with each other, same Radio Resource can not be reused in neighbor cell, so in step 4, community 1 with variable x
1relevant institute's Prescribed Properties is x
1+ x
2≤ 1 and x
1+ x
7≤ 1, according to constraints, previous step is obtained
in often group variable-value judge.Judged result is as shown in table 4, and wherein " √ " represents this group variable-value and meet these two constraints, and "×" representative can not meet these two constraints simultaneously, obtains
in have five groups of variable-values.Next, the message that simultaneously can meet these two constraintss carries out second time judgement again, due to the distribution in order to Radio Resource can be optimized, if three adjacent communities all prohibit the use Radio Resource will cause the waste of resource, so by three adjacent community assignment be all zero message delete, concrete methods of realizing is: in message
in, if there are two different message element (x
j=a
j, t,
) and (x
j=a
j, s,
), make all neighbor cell j for cell i have a
j, t=0 and a
i, t=0 and a
j, s=0 and a
i, s=1, just wherein meeting a
i, tthe message element of=0 is deleted, and meeting a
i, sthe element of=1 retains, and obtains message
wherein x
jfor the message variable of neighbor cell j, a
j, tand a
j, sbe expressed as the value of the message variable of neighbor cell j in t and s message element, as shown in table 5, therefore, after step 4, obtain
in only have four groups of variable-values.The operation of all the other communities is all similar.
Table 4
| X 2 | X 7 | X 1 | First time judges |
| 0 | 0 | 0 | √ |
| 0 | 0 | 1 | √ |
| 0 | 1 | 0 | √ |
| 0 | 1 | 1 | × |
| 1 | 0 | 0 | √ |
| 1 | 0 | 1 | × |
| 1 | 1 | 0 | √ |
| 1 | 1 | 1 | × |
Table 5
| X 2 | X 7 | X 1 | Second time judges |
| 0 | 0 | 0 | × |
| 0 | 0 | 1 | √ |
| 0 | 1 | 0 | √ |
| 1 | 0 | 0 | √ |
| 1 | 1 | 0 | √ |
Step 5: give out information and judge.First, cell i will
as message m
iup-to-date value, send to all neighbor cells.Then, cell i will infer the value of oneself.Note m
ithe message variable set related to is V
iif, the message m that epicycle produces
iwith the message m of last round of generation
iidentical, and V
i={ x
1..., x
n, then in message m
imiddle selection one message element, makes Objective benefits function w
1x
1+ ...+w
nx
nvalue is maximum, then the value of this group message is the allocation of radio resources situation of each community; If not identical, then the calculating of a new round from step 2.
In steps of 5, community 1 will
send to all neighbor cells 2 and community 7 as message, then go to step the computational process of 2 beginning new rounds.The operation of all the other communities is all similar.The message m that in this example, all 7 communities send to neighbor cell in epicycle is given in table 6
igathering of (1≤i≤7).
Table 6
So far, all variablees all go to step 2, repeat above steps, start the computational process of a new round.What describe in table 2-table 6 is first round iteration.
Second takes turns iteration.In step 2, community 1 will receive from the message m of community 2 with community 7
2with m
7, message value provides in table 6.In step 3, community 1 first will message m
2with m
7merge into
and then by message
with message { (x
1=0), (x
1=1) } merge into
its value provides in table 7.In step 4, community 1 with variable x
1relevant institute's Prescribed Properties, it is right to obtain
in often group variable-value carry out first time judge, obtain eight groups of variable-values, as shown in table 8, community 1 to often organize variable-value carry out second time judgement, obtain
in have seven groups of variable-values, as shown in table 8.In steps of 5, community 1 will
all neighbor cells 2 and community 7 is sent to as message.Gathering of the message that in this example, all 7 communities send to neighbor cell is given in table 9.
Table 7
| X 1 | X 2 | X 3 | X 6 | X 7 |
| 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
Table 8
| X 1 | X 2 | X 3 | X 6 | X 7 | First time judges | Second time judges |
| 0 | 1 | 0 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 1 | 0 | √ | √ |
| 0 | 0 | 1 | 0 | 1 | √ | √ |
| 0 | 0 | 1 | 1 | 0 | √ | × |
| 1 | 0 | 0 | 0 | 0 | √ | √ |
| 1 | 0 | 0 | 1 | 0 | √ | √ |
| 1 | 0 | 1 | 0 | 0 | √ | √ |
| 1 | 0 | 1 | 1 | 0 | √ | √ |
Table 9
Third round iteration.In step 2, community 1 will receive from the message m of community 2 with community 7
2with m
7, message value provides in table 9.In step 3, community 1 first will message m
2with m
7merge into
and then by message
with message { (x
1=0), (x
1=1) } merge into
its value provides in table 10.In step s 4 which, community 1 with variable x
1relevant institute's Prescribed Properties, it is right to obtain
in often group variable-value carry out first time judge, obtain 12 groups of variable-values, as shown in table 11.Second time judgement is carried out to often organizing variable-value in community 1, obtains
in have 12 groups of variable-values, as shown in table 11.In steps of 5, community 1 will
all neighbor cells 2 and community 7 is sent to as message.Give gathering of the message that in this example, all 7 communities send to neighbor cell in table 12.
Table 10
| X 1 | X 2 | X 3 | X 4 | X 5 | X 6 | X 7 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| 0 | 0 | 1 | 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 |
Table 11
| X 1 | X 2 | X 3 | X 4 | X 5 | X 6 | X 7 | First time judges | Second time judges |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | √ | √ |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | √ | √ |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 | √ | √ |
| 1 | 0 | 0 | 1 | 1 | 0 | 0 | √ | √ |
| 0 | 0 | 1 | 0 | 0 | 0 | 1 | √ | √ |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 0 | 0 | 1 | 0 | √ | √ |
| 0 | 1 | 0 | 1 | 0 | 1 | 0 | √ | √ |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 1 | 0 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 1 | 1 | 0 | 1 | √ | √ |
Table 12
Fourth round iteration.In step 2, community 1 will receive from the message m of community 2 with community 7
2with m
7, message value provides in table 12.In step 3, community 1 first will message m
2with m
7merge into
and then by message
with message { (x
1=0), (x
1=1) } merge into
its value provides in table 13.In step 4, community 1 with variable x
1relevant institute's Prescribed Properties, it is right to obtain
in often group variable-value carry out first time judge, obtain seven groups of variable-values, as shown in table 14.Second time judgement is carried out to often organizing variable-value in community 1, obtains
in have seven groups of variable-values, as shown in table 14.In steps of 5, community 1 will
all neighbor cells 2 and community 7 is sent to as message.Gathering of the message that in this example, all 7 communities send to neighbor cell is given in table 15.
Table 12
| X 1 | X 2 | X 3 | X 4 | X 5 | X 6 | X 7 |
| 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 |
Table 13
| X 1 | X 2 | X 3 | X 4 | X 5 | X 6 | X 7 | First time judges | Second time judges |
| 0 | 1 | 0 | 1 | 0 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 0 | 1 | 0 | 1 | √ | √ |
| 0 | 1 | 0 | 1 | 0 | 1 | 0 | √ | √ |
| 0 | 0 | 1 | 0 | 1 | 0 | 1 | √ | √ |
| 1 | 0 | 1 | 0 | 0 | 1 | 0 | √ | √ |
| 1 | 0 | 0 | 1 | 0 | 1 | 0 | √ | √ |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | √ | √ |
Table 15
5th takes turns iteration.After step 2-4, the message of generation is identical with the message produced in fourth round iterative process, and V
1comprise all 7 variablees, community 1 will infer oneself value in steps of 5.According to table 15, in message m
1comprise seven groups of values.Target function 3x is brought into by often organizing value
1+ 4x
2+ 5x
3+ 5x
4+ 6x
5+ 4x
6+ 4x
7in, one group of value wherein makes target function value be the distribution condition of each cell radio resource to the maximum, is (x in this example
1, x
2, x
3, x
4, x
5, x
6, x
7)=(0,0,1,0,1,0,1).Therefore, community 1 infers that the value of oneself is x
1=0.The operation of all the other communities is all similar, and its small area 2 infers that the value of oneself is x
2=0, community 3 infers that the value of oneself is x
3=1, community 4 infers that the value of oneself is x
4=0, community 5 infers that the value of oneself is x
5=1, community 6 infers that the value of oneself is x
6=0, community 7 infers that the value of oneself is x
7=1.Iteration afterwards will with the 5th to take turns iteration identical.
Claims (2)
1. the wireless resource allocation methods in multiple cell mobile communication system, is characterized in that: obtain multiple communities distributed Radio Resource by the method for loop iteration and distribute, have following steps:
Step 1: each community produces initial message, initialized message m
iin include two message elements, be respectively x
i=1 and x
i=0, i.e. m
i={ (x
i=0), (x
i=1) }, wherein, m
ibeing the message that i-th community produces, is the set of the message element of different value, x
ibe the initial message variable of the i-th community, x
ican only value be 0 or 1, x
i=0 represents that i-th community prohibits the use Radio Resource, x
i=1 represents that i-th community can use Radio Resource, i=1 ..., N, N are community sum;
Step 2: each community receives the message m of all neighbor cell j
j={ (x
k=a
j, k, t, x
k∈ V
j), 1≤t≤T
j, wherein j ∈ N
i, N
ithe neighbor set of cell i, V
jbe and message m
jthe variables collection of association, T
jit is message m
jin the sum of message element, x
kfor the message variable of kGe community, a
j, k, tthe value of the variable that in the j of neighbor cell, t message element ZhongkGe community is associated, k=1 ..., N, a
j, k, tvalue be 0 or 1;
Step 3: the message coalescing of neighbor cell that each community will receive, its method is: all message m received
jin, wherein j ∈ N
i, from adjacent community, select a message element (x respectively
k=a
j, k, t, x
k∈ V
j), if there is no neighbor cell g and the h of cell i, at corresponding two message element (x
u=a
g, u, p, x
u∈ V
g) and (x
v=a
h, v, q, x
v∈ V
h) in, there is variable x
smake a
g, s, p≠ a
h, s, q, then these message elements are merged into a message element (x
k=a
j, k, t, x
k∈ V
j, j ∈ N
i), all message elements obtained after merging form new message m
i 1, corresponding variables collection V
i 1for all message m
jvariables collection V
jmerging, wherein, V
g, V
hthe variables collection associated in the message of neighbor cell g with h respectively, x
u, x
vbe respectively the message variable in g and h of neighbor cell, x
sfor the message variable when u equals v, p and q represents the message element of selection; Each community is again by message m
i 1with message { x
i=1, x
i=0}, according to identical compatible rule merging, obtains message m
i 2, corresponding variables collection V
i 2for set V
i 1with set { x
imerging;
Step 4: each community is to merging the message m obtained in step 3
i 2carry out twice judgement and process, wherein, first time judges that the method for process is: to message m
i 2in each message element, with variable x
irelevant institute's Prescribed Properties is tested, and deletes the message element not meeting constraints, obtains message m
i 3; Second time judges that the method for process is: in message m
i 3in, if there are two different message element (x
j=a
j,t, x
j∈ V
i 2) and (x
j=a
j,s, x
j∈ V
i 2), make all neighbor cell j for cell i have a
j,t=0 and a
i,t=0 and a
j,s=0 and a
i,s=1, just wherein meeting a
i,tthe message element of=0 is deleted, and meeting a
i,sthe element of=1 retains, and obtains message m
i 4, wherein x
jfor the message variable of neighbor cell j, a
j,tand a
j,sbe expressed as the value of the message variable of neighbor cell j in t and s message element;
Step 5: the message m that step 4 obtains by each community
i 4send to all neighbor cell j, then infer the value of oneself, its method is: if the message m that epicycle obtains
i 4with the last round of message m obtained
i 4not identical, then do not infer; If identical, each community is by message m
i 4in each message element bring Objective benefits function w into
1x
1+ ...+w
ix
i+ ...+w
nx
nin calculate, get and make the value of the maximum message of Objective benefits function value be the allocation of radio resources situation of each community, wherein, w
ithe weight of ShiiGe community; Finally, the calculating of a new round from step 2.
2. the wireless resource allocation methods in a kind of multiple cell mobile communication system according to claim 1, is characterized in that: the constraints in described step 4 is: x
i+ x
j≤ 1, wherein cell i and j are adjacent.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210352037.1A CN102833864B (en) | 2012-09-20 | 2012-09-20 | Wireless resource allocation methods in a kind of multiple cell mobile communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210352037.1A CN102833864B (en) | 2012-09-20 | 2012-09-20 | Wireless resource allocation methods in a kind of multiple cell mobile communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102833864A CN102833864A (en) | 2012-12-19 |
| CN102833864B true CN102833864B (en) | 2015-10-07 |
Family
ID=47336765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210352037.1A Expired - Fee Related CN102833864B (en) | 2012-09-20 | 2012-09-20 | Wireless resource allocation methods in a kind of multiple cell mobile communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102833864B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103648173A (en) * | 2013-12-06 | 2014-03-19 | 镇江坤泉电子科技有限公司 | 4G OFDM wireless network opportunistic scheduling based on total-benefit maximization |
| CN106302170B (en) * | 2016-09-22 | 2019-06-18 | 东南大学 | A kind of resource allocation methods of wireless cloud computing system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968489B (en) * | 2006-06-23 | 2011-09-14 | 华为技术有限公司 | Resource allocation method and system |
-
2012
- 2012-09-20 CN CN201210352037.1A patent/CN102833864B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN102833864A (en) | 2012-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sengupta et al. | Multi-objective node deployment in WSNs: In search of an optimal trade-off among coverage, lifetime, energy consumption, and connectivity | |
| CN102149171B (en) | Method and device for selecting network based on converged heterogeneous radio access network | |
| CN101472339B (en) | Method for coordinating district interference | |
| CN104684095B (en) | Resource allocation methods based on genetic operation in a kind of heterogeneous network converged scene | |
| CN107770874B (en) | Clustering method and sub-channel allocation method in ultra-dense network | |
| CN105334493B (en) | A kind of indoor orientation method based on WLAN | |
| CN109121105A (en) | Operator's competition slice intensified learning method based on Markov Game | |
| Chen et al. | Q-learning based bidding algorithm for spectrum auction in cognitive radio | |
| CN102833864B (en) | Wireless resource allocation methods in a kind of multiple cell mobile communication system | |
| Bessedik et al. | An efficient hybrid multi-objective memetic algorithm for the frequency assignment problem | |
| CN104933473A (en) | City intelligent traffic dispatching method based on variable neighborhood search ant colony algorithm | |
| CN105591875A (en) | Multitask-oriented self-networking dynamic matching selection method | |
| CN101808325B (en) | Method and device for allocating frequency spectrum | |
| Wu et al. | Comprehensive cost optimization for charger deployment in multi-hop wireless charging | |
| CN105610941A (en) | Data fragment caching method based on node groups in mobile network | |
| CN103957530B (en) | The cellular network frequency spectrum distributing method of the meta-heuristic based on figure | |
| Karakostas | Bridging the gap between multi-objective optimization and spatial planning: a new post-processing methodology capturing the optimum allocation of land uses against established transportation infrastructure | |
| CN105407060A (en) | Multiple-access multi-unit distributed resource distribution method based on heterogeneous wireless network | |
| CN104333875B (en) | A kind of frequency method of adjustment and device | |
| Ahmadzadegan et al. | Leach-Centric Load Sharing Between Cluster Nodes Based on Network Node Distribution | |
| CN113395724B (en) | Mode optimization method and device for base station | |
| CN106921681B (en) | Method, network node and the system for dividing group are realized based on random fashion | |
| CN112188518B (en) | Sensor node communication optimization method and device and readable storage medium | |
| Amiri et al. | Nodes clustering using Fuzzy logic to optimize energy consumption in Mobile Ad hoc Networks (MANET) | |
| Sun et al. | Strategy proof trust management in wireless ad hoc network |
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: 20151007 Termination date: 20180920 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |