CN102378375A - Method and device for allocating communication resource - Google Patents
Method and device for allocating communication resource Download PDFInfo
- Publication number
- CN102378375A CN102378375A CN2010102615712A CN201010261571A CN102378375A CN 102378375 A CN102378375 A CN 102378375A CN 2010102615712 A CN2010102615712 A CN 2010102615712A CN 201010261571 A CN201010261571 A CN 201010261571A CN 102378375 A CN102378375 A CN 102378375A
- Authority
- CN
- China
- Prior art keywords
- vertex
- subcarriers
- subcarrier
- allocation information
- group
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004891 communication Methods 0.000 title claims abstract description 25
- 230000005540 biological transmission Effects 0.000 claims description 91
- 230000009365 direct transmission Effects 0.000 claims description 13
- 238000012546 transfer Methods 0.000 claims description 4
- 238000012545 processing Methods 0.000 claims description 2
- 239000000969 carrier Substances 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 8
- 230000002457 bidirectional effect Effects 0.000 description 7
- 230000001413 cellular effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 238000000354 decomposition reaction Methods 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a device for allocating a communication resource, which belong to the communication field. The method comprises the following steps that: sub-carriers in a current network are divided into sub-carrier groups, and each sub-carrier group comprises two or three sub-carriers; the sub-carrier groups are adopted as vertexes to form a vertex graph, and a maximal weight clique in the vertex graph is determined; a corresponding relation between an identity and allocation information of each user equipment (UE) corresponding to each vertex in the clique is determined, and the allocation information at least comprises a weight of a vertex and a transport mode; the vertex and the allocation information corresponding to the current UE are determined according to the corresponding relation between the identity and the allocation information of the UE corresponding to each vertex in the clique, and the sub-carrier contained by the vertex and the allocation information are allocated to the UE. The device comprises a dividing module, a first determining module, a second determining module and an allocating module. Due to the adoption of the method and the device, the network resource can be saved, and the network output can be improved.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a method and an apparatus for allocating communication resources.
Background
In a bidirectional cooperative cellular communication network, a relay node assists a base station and a UE (User Equipment) to transmit data, and when the UE transmits data, the data throughput of the network can be improved by allocating communication resources such as subcarriers to the UE, and at present, there are several methods for allocating communication resources, including:
the first method comprises the following steps: allocating resources such as subcarriers, relay nodes and the like for the UE in communication by utilizing a joint optimization scheme of subcarrier power allocation, relay selection and relay strategy selection and a Lagrange dual decomposition method;
the second method is as follows: based on the transmission protocol of FDD (Frequency Division duplex), resources such as relay nodes and subcarriers are allocated to the UE needing communication through a heuristic algorithm.
In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:
the number of subcarriers allocated to the UE in the existing method reaches four, and the UE needs four time slots to transmit data, or the subcarriers are divided into two types, i.e., uplink subcarriers and downlink subcarriers, uplink data frames of the UE can only select subcarriers from the uplink subcarriers, and downlink data frames can only select subcarriers from the downlink subcarriers, so that the existing method not only wastes network resources, but also reduces network throughput.
Disclosure of Invention
In order to save network resources and improve network throughput, the invention provides a method and a device for allocating communication resources. The technical scheme is as follows:
a method of allocating communication resources, the method comprising:
dividing each subcarrier in a current network into subcarrier groups, wherein each subcarrier group comprises two or three subcarriers;
forming a vertex map by using the subcarrier groups as vertexes, and determining a blob with the largest weight in the vertex map, wherein the blob is a set of the vertexes, and any two vertexes are connected;
determining a corresponding relation between an ID (Identity) of the UE corresponding to each vertex in the group and allocation information, wherein the allocation information at least comprises a weight value and a transmission mode of the vertex;
and determining the vertex and the distribution information corresponding to the current UE according to the corresponding relation between the ID of the UE corresponding to each vertex in the group and the distribution information, and distributing the subcarrier contained in the vertex and the distribution information to the current UE.
An apparatus for allocating communication resources, the apparatus comprising:
the system comprises a dividing module, a receiving module and a processing module, wherein the dividing module is used for dividing each subcarrier in a current network into subcarrier groups, and each subcarrier group comprises two or three subcarriers;
a first obtaining module, configured to form a vertex map by using the subcarrier groups as vertices, and determine a blob in the vertex map with a largest weight, where the blob is a set of the vertices and any two of the vertices are connected;
a second obtaining module, configured to determine a correspondence between an ID of the UE corresponding to each vertex in the group and allocation information, where the allocation information at least includes a weight value of the vertex and a transmission mode;
and the distribution module is used for determining the vertex and the distribution information corresponding to the current UE according to the corresponding relation between the ID of the UE corresponding to each vertex in the group and the distribution information, and distributing the subcarrier contained in the vertex and the distribution information to the current UE.
By forming the vertex by the subcarriers in the network, wherein the vertex comprises two or three subcarriers, when communication resources are allocated to the UE, the subcarriers in the vertex are allocated to the UE, so that the number of the subcarriers allocated to the UE is two or three, each subcarrier corresponds to one time slot, and the UE transmits data by using two or three time slots, thereby saving network resources and improving network throughput; each subcarrier in the network is formed into a vertex, and the subcarrier in each vertex in the group with the largest weight is distributed to the UE of the network, so that the network throughput is improved.
Drawings
Fig. 1 is a flowchart of a method for allocating communication resources according to embodiment 1 of the present invention;
fig. 2 is a flowchart of a method for allocating communication resources according to embodiment 2 of the present invention;
FIG. 3 is a diagram of a network architecture to which embodiment 2 of the present invention is applied;
fig. 4 is a schematic diagram of five transmission modes provided in embodiment 2 of the present invention;
FIG. 5 is a schematic view of a map provided in embodiment 2 of the present invention;
FIG. 6 is a schematic illustration of a bolus provided in example 2 of the present invention;
fig. 7 is a schematic diagram of an apparatus for allocating communication resources according to embodiment 3 of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be described in detail with reference to the accompanying drawings.
Example 1
The embodiment of the invention provides a method for allocating communication resources. In the bidirectional relay cellular network, when a UE communicates with a base station, the base station needs to allocate resources such as subcarriers to the UE. Referring to fig. 1, the method includes:
step 101: dividing each subcarrier in the current network into subcarrier groups, wherein each subcarrier group comprises two or three subcarriers;
step 102: forming a vertex map by using the subcarrier groups as each vertex, and determining a clique with the largest weight in the vertex map, wherein the clique is a set of the vertices, and any two vertices are connected;
step 103: determining a correspondence between an Identification (ID) of a User Equipment (UE) corresponding to each vertex within the clique and allocation information;
wherein, the distribution information at least comprises the weight value and the transmission mode of the top point;
step 104: and determining the vertex and the distribution information corresponding to the current UE in the network according to the corresponding relation between the ID of the UE corresponding to each vertex in the group and the distribution information, and distributing resources to the current UE to obtain the subcarrier and the distribution information included by the searched vertex.
In the embodiment of the invention, the subcarriers in the network form a vertex which comprises two or three subcarriers, and when communication resources are allocated to the UE, the subcarriers in the vertex are allocated to the UE, so that the number of the subcarriers allocated to the UE is two or three, and each subcarrier corresponds to one time slot, so that the UE transmits data by using two or three time slots, the network resources are saved, and the network throughput is improved; each subcarrier in the network is formed into a vertex, and the subcarrier in each vertex in the group with the largest weight is distributed to the UE of the network, so that the network throughput is improved.
Example 2
As shown in fig. 2, an embodiment of the present invention provides a method for allocating communication resources, including:
step 201: acquiring IDs of each subcarrier, each relay node and each UE in a current network;
the network consists of a base station, a relay node and UE. As in the network shown in fig. 3, a relay node is provided between a base station and a UE. The relay node is used for helping the base station and the UE to transmit data, and if the distance between the base station and the UE is long and a channel between the base station and the UE is weak, a data frame transmitted between the base station and the UE needs to be forwarded by the relay node; if the distance between the base station and the relay node is short and the channel between the base station and the UE is strong, the base station can directly communicate with the UE.
In this embodiment, a three-slot transmission protocol is used between the base station and the UE to transmit data frames, where the three-slot transmission protocol specifies that two or three slots are used for transmission between the base station and the UE during one-time data transmission, and each slot uses one subcarrier to transmit data. The three-slot transmission protocol specifies a data transmission mode between the base station and the UE including: a direct transmission mode, an uplink one-way relay transmission mode, a downlink one-way relay transmission mode, a multi-relay two-way relay transmission mode, and a single-relay two-way relay transmission mode.
In the direct mode shown in fig. 4(a), the base station and the UE transmit data frames in two time slots, where in the first time slot, the base station transmits a downlink data frame to the UE on subcarrier n1 and the UE receives the downlink data frame, and in the second time slot, the UE transmits an uplink data frame to the base station on subcarrier n2 and the base station receives the uplink data frame.
In the uplink unidirectional transmission mode shown in fig. 4(b), in the first time slot, the base station transmits a downlink data frame to the UE on the subcarrier n1, the UE receives the downlink data frame, in the second time slot, the UE transmits an uplink data frame to the relay node on the subcarrier n2, the relay node receives the uplink data frame, in the third time slot, the relay node transmits the uplink data frame to the base station on the subcarrier n3, and the base station receives the uplink data frame.
In the downlink unidirectional relay transmission mode shown in fig. 4(c), in the first time slot, the base station sends the downlink data frame to the relay node on the subcarrier n1, the relay node receives the downlink data frame, in the second time slot, the relay node sends the downlink data frame to the UE on the subcarrier n2, the UE receives the downlink data frame, in the third time slot, the UE directly sends the uplink data frame to the base station on the subcarrier n3, and the base station receives the uplink data frame.
In the multi-relay bidirectional transmission mode shown in fig. 4(d), in the first time slot, the base station transmits the downlink data frame to the first relay node on the subcarrier n1, the first relay node receives the downlink data frame, in the second time slot, the UE transmits the uplink data frame to the second relay node on the subcarrier n2, the second relay node receives the uplink data frame, in the third time slot, the first relay node and the second relay node respectively transmit the downlink data frame and the uplink data frame to the UE and the base station on the subcarrier n3, and the UE and the base station respectively receive the downlink data frame and the uplink data frame.
In the single-relay bidirectional relay transmission mode shown in fig. 4(e), in the first time slot, the base station transmits a downlink data frame to the relay node on subcarrier n1, the relay node receives the downlink data frame, in the second time slot, the UE transmits an uplink data frame to the relay node on subcarrier n2, the relay node receives the uplink data frame, in the third time slot, the relay node transmits the downlink data frame and the uplink data frame to the UE and the base station on subcarrier n3, and the UE and the base station receive the downlink data frame and the uplink data frame respectively.
Wherein each UE can select one of five transmission modes to communicate with the base station, and n1, n2, and n3 are any subcarriers in the network, n1 represents the subcarrier used by the UE in the first time slot, n2 represents the subcarrier used by the UE in the second time slot, and n3 represents the subcarrier used by the UE in the third time slot.
For the multi-relay two-way relay transmission mode and the single-relay two-way relay transmission mode, the relay node simultaneously sends the downlink data frame and the uplink data frame in the third time slot, so that the time of one time slot is saved, the data transmission efficiency is improved, and the network throughput is improved.
Step 202: dividing the obtained subcarriers into subcarrier groups by using each obtained subcarrier, wherein each subcarrier group comprises two subcarriers or three subcarriers, and each subcarrier group is used as a vertex;
the obtained subcarrier groups are binary subcarrier groups (n1, n2) and ternary subcarrier groups (n1, n2, n 3).
Wherein, with each subcarrier obtained, all possible combined subcarrier groups are combined. As can be seen from the above five transmission modes, each UE in the network needs two time slots or three time slots each time it communicates with the base station, and the UE and the base station need to transmit a data frame on one subcarrier in each time slot, so that two subcarriers or three subcarriers are needed each time the UE communicates with the base station.
In this embodiment, two subcarriers or three subcarriers that may be used in each time slot when each UE in the network communicates with the base station are combined into one combination, so that the subcarrier group indicates each subcarrier that the UE uses in a different time slot when the UE communicates with the base station each time. For binary subcarrier wave groups (n1, n2) the meaning is indicated that when the UE communicates directly with the base station, a data frame is transmitted on subcarrier n1 in the first slot and a data frame is transmitted on subcarrier n2 in the second slot; the meaning indicated for the group of subcarriers (n1, n2, n3) of the triplet is that when communicating between the UE and the base station through the relay node, a data frame is transmitted on subcarrier n1 in the first time slot, a data frame is transmitted on subcarrier n2 in the second time slot, and a data frame is transmitted on subcarrier n3 in the third time slot.
In this embodiment, each acquired subcarrier is grouped into a subcarrier group of all possible combinations, and each subcarrier group is taken as a vertex. Thus, when a UE is communicating with a base station, a vertex may be selected on which to transmit a data frame on a subcarrier corresponding to each time slot included in the vertex. Wherein, if the vertex selected by the UE is a binary vertex (n1, n2), the UE transmits a data frame with the base station on the subcarriers (n1, n2) included in the vertex using a direct transmission mode, i.e., transmits the data frame on the subcarrier n1 in the first time slot and transmits the data frame on the subcarrier n2 in the second time slot; if the vertex selected by the UE is a ternary vertex (n1, n2, n3), the UE may transmit a data frame with the base station on the subcarrier (n1, n2, n3) using an uplink unidirectional relay transmission mode, a downlink unidirectional relay transmission mode, a multi-relay bidirectional relay transmission mode, or a single relay bidirectional relay transmission mode, that is, the data frame is transmitted on the subcarrier n1 in the first slot, the data frame is transmitted on the subcarrier n2 in the second slot, and the data frame is transmitted on the subcarrier n3 in the third slot.
Step 203: assigning a weight value to each binary vertex and distributing UE (user equipment), taking a direct transmission mode and the weight value as distribution information of the vertex, and storing the vertex, the ID of the UE and the distribution information in a corresponding relation of the vertex, the ID of the UE and the distribution information;
specifically, for a binary vertex, the data transmission rate of each UE on two subcarriers in the vertex is calculated, the maximum rate is selected, the UE corresponding to the maximum rate is obtained, the ID of the UE is obtained, the maximum rate is used as the weight value of the vertex, the direct transmission mode and the weight value are used as the allocation information of the vertex, and the vertex, the ID of the UE and the allocation information are stored in the corresponding relationship between the vertex, the ID of the UE and the allocation information. And each binary vertex obtains the ID and the distribution information of the UE according to the same method, and stores the ID and the distribution information of the UE in the corresponding relation of the vertex and the ID of the UE.
The rate of transmitting the data frame on the subcarrier by the UE is the sum of the uplink rate and the downlink rate, the uplink rate is the rate of transmitting the uplink data frame on the subcarrier by the UE, and the downlink rate is the rate of transmitting the downlink data frame on the subcarrier by the UE.
Wherein, for a binary vertex (n1, n2), UE and assigned value can be assigned to the binary vertex according to the following formula (1);
wherein R (n1, n2) is the rate of transmitting data frames on subcarriers (n1, n2) by the UE, max is the operation of finding the maximum value, K is the ID of the UE, K is the set of all UEs of the network, d is the downlink, u is the uplink,for the downlink rate on subcarrier n1 for a UE with ID k in the first time slot,the UE with ID k is uplink rate on subcarrier n2 in the second time slot. The rate R (n1, n2) at which a UE with ID k transmits data on subcarriers (n1, n2) is equal to the downlink rate
And uplink rate
And (4) summing.
The method comprises the steps of substituting each UE in the network into the formula (1), calculating the rate of transmitting data frames on subcarriers (n1, n2) by each UE, and then obtaining the maximum rate value and the ID of the UE corresponding to the maximum rate value.
Step 204: assigning a weight to each ternary vertex, allocating UE, a relay node and a transmission mode, taking the weight, the ID of the relay node and the transmission mode as allocation information of the vertex, and storing the vertex, the ID of the UE and the allocation information in a corresponding relation between the vertex, the ID of the UE and the allocation information;
specifically, for a ternary vertex, calculating the rate of transmitting data frames by each UE in the network through different relay nodes and adopting different transmission modes on three subcarriers included in the vertex, selecting the maximum rate, obtaining the ID of the UE, the ID of the relay node, and the transmission mode corresponding to the maximum rate, taking the maximum rate as the weight value of the vertex, taking the weight value, the ID of the relay node, and the transmission mode as the allocation information of the vertex, and storing the vertex, the ID of the UE, and the allocation information in the corresponding relationship between the vertex, the ID of the UE, and the allocation information. And acquiring the ID and the distribution information of the UE of each ternary vertex according to the same method, and storing the ternary vertex, the ID and the distribution information of the UE in the corresponding relation of the vertex, the ID and the distribution information of the UE.
Wherein, for a vertex (n1, n2, n3) of a triplet, the UE, the relay node, the transmission mode, and the assigned value may be allocated to the vertex of the triplet according to the following formula (2);
wherein, R (n1, n2, n3) is a rate of transmitting data frames on subcarriers (n1, n2, n3) by UEs, max is an operation of finding a maximum value, K is a set formed by all UEs in the network, M is a set formed by all relay nodes in the network, K is any UE, R is any relay node in the network, R1 is any relay node which is not R in the network, d is downlink, u is uplink, the rate of any UE, i.e., UE with ID K, is formed by uplink rate and downlink rate, n1 is a subcarrier used by UE, i.e., UE with ID K, in the first slot, n2 is a subcarrier used by UE, i.e., UE with ID K, in the second slot, and n3 is a subcarrier used by UE, i.e., UE with ID K, in the third slot.
Wherein,
for the rate at which a UE with ID k transmits data frames on subcarriers (n1, n2, n3) through the relay node r and in uplink unidirectional relay transmission mode,
for the downlink rate on subcarrier n1 for a UE with ID k in the first time slot,
the UE ID k passes through the relay node r and uplink rate on the subcarriers (n2, n3) in the second and third slots.
Wherein,
for the rate at which a UE with ID k transmits data frames on subcarriers (n1, n2, n3) through the relay node r and in the downlink unidirectional relay transmission mode,for the downlink rate on the sub-carriers (n1, n2) for the UE with ID k passing through the relay node r and in the first and second slots,
UE ID k uplink rate on subcarrier n3 in the third time slot.
Wherein,
for the rate at which a UE with ID k transmits data frames on subcarriers (n1, n2, n3) through relay nodes r and r1 and in the multi-relay bi-directional relay transmission mode,
for the downlink rate on the sub-carriers (n1, n3) for the UE with ID k passing through the relay node r and in the first and third slots,
the UE ID k passes through the relay node r1 and uplink rate on the subcarriers (n2, n3) in the second and third slots. Wherein r is multi-relay bi-directionalThe first relay node of the relay transmission mode, r1, is the second relay node of the multi-relay bi-directional relay transmission mode.
Wherein,for the rate at which a UE with ID k transmits data frames on subcarriers (n1, n2, n3) through the relay node r and in single relay bi-directional relay transmission mode,
for the downlink rate on the sub-carriers (n1, n3) for the UE with ID k passing through the relay node r and in the first and third slots,
the UE ID k passes through the relay node r and uplink rate on the subcarriers (n2, n3) in the second and third slots.
And (2) respectively substituting the uplink one-way relay transmission mode, the downlink one-way relay transmission mode, the multi-relay two-way relay transmission mode and the single-relay two-way relay transmission mode, each relay node and each UE into the equation (2) to calculate the maximum rate, and then obtaining the relay node, the UE and the transmission mode corresponding to the maximum rate according to the equation (2).
Step 205: setting an edge between two arbitrarily intersected vertexes to connect the two vertexes, thus forming each vertex into a graph;
in the embodiment, for any two vertexes, if the subcarriers of the two vertexes in each time slot are different, the two vertexes are defined to have an intersecting relationship; for example, vertex a (1, 5, 4) and vertex B (5, 2, 1), where the subcarriers of vertices a and B in the first time slot, the second time slot, and the third time slot are all different, so that vertices a and B have an intersecting relationship; otherwise, the two vertices are defined to have a disjoint relationship, e.g., vertices C (1, 2, 4) and D (2, 2, 3), where the subcarriers of vertices C and D in the second slot are both subcarrier 2, so vertices C and D have a disjoint relationship.
For example, assuming that the following vertices are (1, 1), (3, 4, 3), (2, 2, 1), (4, 5, 2), and (2, 4), respectively, an edge is provided between two vertices arbitrarily intersecting to connect the two vertices, such as an edge is provided between vertices (1, 1) and (3, 4, 3), an edge is provided between vertices (3, 4, 3) and (2, 2, 1), and vertices (2, 2, 1) and (2, 4) all adopt subcarrier 2 in the first time slot so that an edge cannot be provided between vertices (2, 2, 1) and (2, 4); placing an edge between all the intersecting vertices results in a graph as shown in fig. 5.
Any two vertexes in the vertex diagram are intersected, namely for any two vertexes, subcarriers forming the two vertexes in the same time slot are different, so that when the subcarriers in each vertex are allocated to the UE, the situation that the same subcarrier is allocated to a plurality of UEs at the same time to generate collision is avoided.
Step 206: dividing the whole graph into one or more cliques, wherein any two vertexes in each clique are connected, namely edges are connected between any two vertexes in each clique;
the cliques are subsets of a vertex graph, any two vertexes in each clique are not connected, in addition, partial vertexes in the formed graph are not connected, the graph is divided into cliques, and subcarriers adopted by each vertex in each clique in any same time slot are different. For example, the graph shown in fig. 5 is divided into a cluster 1 and a cluster 2 as shown in fig. 6, the vertices in the cluster 1 include (1, 1), (3, 4, 3), (2, 2, 1) and (4, 5, 2), and the subcarriers employed by each vertex in any same time slot are different; the vertices within blob 2 include (1, 1), (4, 5, 2), and (2, 4), and each vertex employs a different subcarrier in any of the same time slots.
Step 207: calculating the weight of each clique, and selecting the clique with the maximum weight;
specifically, for one of the clusters, the weight value of each vertex in the cluster is found out from the corresponding relationship between the vertex, the ID of the UE and the allocation information, the weight value of each vertex is added to obtain the sum of the weight values of the cluster, and the sum of the weight values is used as the weight of the cluster; the weights of each of the other blobs are calculated in the same manner as described above, and the blob with the highest weight is selected.
It is assumed that the IDs and allocation information of the UEs whose vertices (1, 1), (3, 4, 3), (2, 2, 1), (4, 5, 2), and (2, 4) correspond to each vertex are stored in the correspondence relationship of the vertices, the IDs of the UEs, and the allocation information as shown in table 1. Here, for the binary vertex, since the UE uses the direct mode and the UE directly communicates with the base station, the UE does not need the assistance of the relay node, and therefore the ID of the relay node in the assignment information corresponding to the binary vertex in table 1 is null.
TABLE 1
| (4，5，2) |
|
1 | r1，r2 | Multi-relay two-way relay transmission mode |
| (2，4) |
|
1 | Air conditioner | Direct mode |
For example, according to vertices (1, 1), (3, 4, 3), (2, 2, 1) and (4, 5, 2) included in the group 1, finding out that the corresponding weights are respectively 2, 3, 2 and 1 from the corresponding relationship between the vertices, the IDs of the UEs and the allocation information shown in table 1, adding the weight values of each vertex to obtain the sum of the weights of the group 1 as 8, and using the sum of the weights 8 as the weight of the group 1; according to vertexes (1, 1), (4, 5, 2) and (2, 4) included in the group 2, finding out that corresponding weights are respectively 2, 1 and 1 from the corresponding relations among the vertexes, the IDs of the UEs and the allocation information shown in the table 1, adding the weight values of the vertexes to obtain the sum of the weights of the group 2 as 4, taking the sum of the weights 4 as the weight of the group 2, and selecting the group 1 with the largest weight.
In this embodiment, the formed graph may be divided into a plurality of clusters by using an existing ant colony algorithm, and a cluster with the highest weight may be selected from the plurality of clusters.
Step 208: acquiring the corresponding relation between the ID of the UE corresponding to each vertex in the group with the maximum weight and the distribution information from the corresponding relation between the vertex, the ID of the UE and the distribution information;
specifically, for any vertex in the group with the largest weight, the corresponding relationship between the ID of the UE corresponding to the vertex and the allocation information is searched from the corresponding relationship between the vertex, the ID of the UE, and the allocation information according to the vertex, and the corresponding relationship between the ID of the UE corresponding to each other vertex in the group and the allocation information is obtained in the same manner as described above.
For example, for vertex (1, 1) in the clique 1, the correspondence between the ID of the UE corresponding to vertex (1, 1) and the allocation information is searched from the correspondence between the vertex, the ID of the UE, and the allocation information shown in table 1, and the correspondence between the ID of the UE corresponding to each of the other vertices in the clique 1 and the allocation information is obtained in the same manner as described above, so that the correspondence between the ID of the UE corresponding to each of the vertices in the clique 1 and the allocation information shown in table 2 is obtained.
TABLE 2
Step 209: and aiming at the current UE in the network, searching the corresponding vertex and distribution information from the obtained corresponding relation according to the ID of the current UE, and distributing resources to the current UE to ensure that the vertex comprises the subcarrier and the distribution information.
Specifically, for any current UE in the network, according to the ID of the current UE, searching for a corresponding vertex and allocation information from the obtained correspondence, and if the searched vertex is a binary vertex and the transmission mode included in the searched allocation information is direct transmission mode information, allocating two subcarriers included in the binary vertex and a direct transmission mode to the current UE; and if the searched vertex is a ternary vertex and the searched allocation information comprises the ID and the transmission mode of the relay node, allocating the three subcarriers included in the ternary vertex, the relay node corresponding to the ID of the relay node and the transmission mode to the current UE.
If two subcarriers in the binary vertex and the direct transmission mode are allocated to the UE, the UE communicates with the base station by using the two subcarriers in a direct transmission mode; if three subcarriers included in the vertex of the triplet, the relay node, and the transmission mode are allocated to the UE, the UE transmits a data frame through the relay node using the three subcarriers and using the transmission mode.
For example, the correspondence between the ID of the UE corresponding to each vertex in the group 1 and the allocation information is shown in table 2, assuming that a certain UE in the network has an ID of UE 2, the vertex corresponding to UE ID2 is found to be (3, 4, 3) and the allocation information includes an ID of the relay node r1 and an uplink unidirectional relay transmission mode from the correspondence between the vertex shown in 2, the ID of the UE and the allocation information, the three subcarriers are allocated to the UE to be 3, 4, and 3, respectively, and the relay node having the ID of the relay node r1 and the transmission mode are the uplink unidirectional relay transmission mode.
The UE transmits the data frame by adopting an uplink unidirectional transmission relay transmission mode on the subcarriers (3, 4, 3) through the relay node with the ID r 1. And the UE uses subcarrier 3 in the first time slot, subcarrier 4 in the second time slot and subcarrier 3 in the third time slot.
Among them, it should be noted that: if a certain UE in the network does not find the corresponding vertex and the distribution information from the obtained corresponding relation according to the ID of the UE, the UE is discarded, namely, no resource is distributed to the UE.
In the embodiment of the present invention, after the maximum rate corresponding to each vertex is obtained, the maximum rate may not be used as the weight value of each vertex, and accordingly, the weight value of each vertex may be obtained according to the following method, which specifically is:
and summing the maximum rates corresponding to each vertex to obtain the rate of the whole network, calculating the ratio of the maximum rate corresponding to each vertex to the transmission rate of the whole network, and taking the ratio of each vertex as the weight of the ratio.
Wherein, after allocating the resources for the UE, the total throughput R 'in the network is as shown in the following formula'totComprises the following steps:
r (n1, n2) and R (n1, n2, n3) are shown in formulas (1) and (2), respectively,
is a binary constraint which takes on a value of 0 or 1 if ID is k*The allocated vertex of the UE is (n1, n2) and the transmission mode is the direct transmission mode a, then
Is 1, otherwise, is 0,is a binary constraint which takes on a value of 0 or 1 if ID is k*Has a vertex of (n, n2, n3) and a relay node of p*And the transmission mode is omega*Then, then
Is 1, otherwise, is 0.
In the embodiment of the invention, each subcarrier in the network is composed into binary and ternary vertexes, UE, a relay node or a transmission mode with the maximum transmission rate at each vertex is obtained, the maximum rate is taken as the weight value of the vertex, the obtained ID, the transmission mode and the weight value of the relay node are taken as the distribution information of the vertex, the ID and the distribution information of each vertex, UE are stored in the corresponding relation of the vertex, the ID of the UE and the distribution information, the intersected vertexes are combined into a graph, the group with the maximum weight is divided from the graph, the vertex and the distribution information corresponding to the UE in the network are searched from the corresponding relation of each vertex in the group, and the subcarrier and the distribution information included in the vertex are distributed to the UE. The vertex is a binary or ternary subcarrier group, and subcarriers in one vertex are allocated to the UE, so that the number of the subcarriers allocated to the UE is two or three, and the UE transmits data by using two or three time slots, thereby saving network resources and improving network throughput; forming each subcarrier in the network into a vertex, and acquiring the UE with the maximum transmission rate on the subcarrier included by the vertex, wherein the subcarrier allocated to the UE comprises the subcarrier on the vertex, so that the network throughput is improved; forming a vertex diagram by the vertexes intersected randomly, so that subcarriers of any two vertexes in the vertex diagram in the same time slot are different, and when the subcarriers are allocated to the UE, the condition that the same subcarriers are allocated to a plurality of UEs at the same time to generate collision is avoided; when two subcarriers are allocated to the UE, the transmission mode allocated to the UE is a direct transmission mode, so that the UE can directly communicate with the base station, and the transmission efficiency is improved.
Example 3
As shown in fig. 7, an apparatus for allocating communication resources is provided in the embodiment of the present invention, for example, in a bidirectional relay cellular network, when a UE communicates with a base station, the base station needs to allocate resources such as subcarriers for the UE.
The means for allocating communication resources in this embodiment may be located in the base station, or may operate as a separate device with the base station, etc. Apparatus 30 for allocating communication resources, comprising:
a dividing module 301, configured to divide each subcarrier in a current network into subcarrier groups, where each subcarrier group includes two or three subcarriers;
a first determining module 302, configured to form a vertex map with subcarrier groups as each vertex, and determine a blob with a largest weight in the formed vertex map, where the blob is a set of vertices and any two vertices are connected;
a second determining module 303, configured to determine a correspondence between an ID of the UE corresponding to each vertex in the group and allocation information, where the allocation information at least includes a weight value of the vertex and a transmission mode;
an allocating module 304, configured to determine a vertex and allocation information corresponding to the current UE according to a corresponding relationship between the ID of the UE corresponding to each vertex in the group and the allocation information, and allocate resources to the current UE as subcarriers and allocation information included in the acquired vertex.
The first obtaining module 302 includes:
a setting unit, configured to set an edge between two arbitrarily intersected vertices to obtain a vertex graph, where if subcarriers constituting the two vertices in the same time slot are different, the two vertices have an intersecting relationship;
a dividing unit configured to divide the obtained vertex map into blobs;
the calculating unit is used for calculating the sum of the weight values of each top point in each group, and taking the sum of the weight values of each top point in each group as the weight of the calculating unit;
and the selection unit is used for selecting the clique with the largest weight.
Wherein the calculation unit includes:
the searching subunit is used for searching the weight in the distribution information corresponding to each vertex according to the corresponding relation between the vertex, the ID of the UE and the distribution information;
and the summing subunit is used for adding the weight values of each top point in the group to obtain the sum of the weight values of each top point in the group, and taking the sum of the weight values as the weight of the group.
The second determining module 303 is specifically configured to obtain, from the correspondence between the vertex, the ID of the UE, and the allocation information, a correspondence between the ID of the UE corresponding to each vertex in the group and the allocation information.
Wherein, the allocating module 304 comprises:
a searching unit, configured to search, according to an ID of a current UE in a network, a corresponding vertex and allocation information from a correspondence between an ID of the UE corresponding to each vertex in the group and the allocation information;
a first allocation unit, configured to allocate, if the searched vertex includes two subcarriers, the subcarriers included in the searched vertex and the direct transfer mode information included in the searched allocation information for the UE;
and the second allocating unit is used for searching the relay node corresponding to the ID of the relay node included in the allocation information if the searched vertex includes three subcarriers, and allocating the subcarriers included in the searched vertex, the acquired relay node and the transmission mode included in the searched allocation information to the current UE.
Further, the apparatus further comprises:
an obtaining module, configured to obtain an ID and allocation information of a UE with a maximum transmission rate on a subcarrier included in a vertex;
and the storage module is used for recording the vertex, the acquired ID of the UE and the distribution information in the corresponding relation of the vertex, the ID of the UE and the distribution information.
Wherein, the acquisition module includes:
a first obtaining unit, configured to calculate, if the vertex includes two subcarriers, a rate at which each UE transmits data on the subcarriers included in the vertex, select a maximum rate, obtain an ID of the UE corresponding to the maximum rate, determine a weight value of the vertex according to the maximum rate, and use a direct transfer mode and the weight value as allocation information;
and if the vertex comprises three subcarriers, calculating the rate of transmitting data by each UE through each relay node on the subcarriers comprised by the vertex and adopting each transmission mode, selecting the maximum rate, acquiring the ID of the UE, the ID of the relay node and the transmission mode corresponding to the maximum rate, determining the weight value of the vertex according to the maximum rate, and taking the acquired ID of the relay node, the weight value and the acquired transmission mode as distribution information.
In the embodiment of the invention, each subcarrier in the current network is composed into a binary vertex and a ternary vertex, the ID and the distribution information of the UE with the maximum transmission rate on the subcarrier included by the vertex are obtained, the vertex, the ID of the UE and the distribution information are stored in the corresponding relation of the vertex, the ID of the UE and the distribution information, a group with the maximum weight is obtained according to the weight value of each vertex and each vertex, the vertex and the distribution information corresponding to the UE in the network are searched from the corresponding relation of each vertex included in the group, and the resource is distributed to the UE for the subcarrier included by the vertex and the distribution information. The vertex is a binary or ternary subcarrier group, and subcarriers in one vertex are allocated to the UE, so that the number of the subcarriers allocated to the UE is two or three, and the UE transmits data by using two or three time slots, thereby saving network resources and improving network throughput; forming each subcarrier in the network into a vertex, and acquiring the UE with the maximum transmission rate on the subcarrier included by the vertex, wherein the subcarrier allocated to the UE comprises the subcarrier on the vertex, so that the network throughput is improved; forming a vertex diagram by the vertexes intersected randomly, so that subcarriers of any two vertexes in the vertex diagram in the same time slot are different, and when the subcarriers are allocated to the UE, the condition that the same subcarriers are allocated to a plurality of UEs at the same time to generate collision is avoided; when two subcarriers are allocated to the UE, the transmission mode allocated to the UE is a direct transmission mode, so that the UE can directly communicate with the base station, and the transmission efficiency is improved.
All or part of the technical solutions provided by the above embodiments may be implemented by software programming, and the software program is stored in a readable storage medium, for example: hard disk, optical disk or floppy disk in a computer.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (12)
1. A method of allocating communication resources, the method comprising:
dividing subcarriers in a current network into subcarrier groups, wherein each subcarrier group comprises two or three subcarriers;
forming a vertex map by using the subcarrier groups as vertexes, and determining a blob with the largest weight in the vertex map, wherein the blob is a set of the vertexes, and any two vertexes are connected;
determining a corresponding relation between an identification ID of User Equipment (UE) corresponding to each vertex in the group and distribution information, wherein the distribution information at least comprises a weight value and a transmission mode of the vertex;
and determining the vertex and the distribution information corresponding to the current UE according to the corresponding relation between the ID of the UE corresponding to each vertex in the group and the distribution information, and distributing the subcarrier contained in the vertex and the distribution information to the current UE.
2. The method of claim 1, wherein the forming a vertex map by the subcarrier groups as vertices, determining a weighted blob in the vertex map comprises:
setting an edge between two arbitrarily intersected vertexes to obtain a vertex graph, wherein if subcarriers forming the two vertexes in the same time slot are different, the two vertexes have an intersected relation;
dividing the vertex graph into blobs;
calculating the sum of the weight values of each top point in the group, and taking the sum of the weight values as the weight of the group;
the blob with the largest weight is selected.
3. The method of claim 2, wherein said calculating a sum of the weights of each vertex within the clique comprises:
according to each vertex in the group, searching a weight value in the distribution information corresponding to each vertex according to the corresponding relation between the vertex, the ID of the UE and the distribution information;
and adding the weight value of each top point in the group to obtain the sum of the weight values of each top point in the group.
4. The method of claim 1, wherein determining a vertex and allocation information corresponding to a current UE according to a correspondence between an ID of the UE corresponding to each vertex in the clique and the allocation information, and allocating subcarriers included in the vertex and the allocation information to the current UE, comprises:
according to the ID of the current UE, searching the vertex and the distribution information corresponding to the current UE in the corresponding relation between the ID of the UE corresponding to each vertex in the cluster and the distribution information;
if the searched vertex comprises two subcarriers, distributing the subcarriers and the direct transmission mode information included in the searched vertex for the current UE;
if the searched vertex comprises three subcarriers, searching for a relay node of which the allocation information comprises the ID of the relay node, and allocating the subcarriers included in the searched vertex, the relay node and the transmission mode included in the searched allocation information to the current UE.
5. The method of claim 1, wherein after the dividing each subcarrier in the current network into subcarrier groups, further comprising:
acquiring the ID of the UE with the maximum transmission rate on the sub-carrier included in the vertex and the distribution information;
and recording the vertex, the ID of the UE and the distribution information in the corresponding relation of the vertex, the ID of the UE and the distribution information.
6. The method of claim 5, wherein the obtaining the ID of the UE with the highest transmission rate on the subcarriers included in the vertex and the allocation information comprises:
if the vertex comprises two subcarriers, calculating the data transmission rate of each UE on the subcarriers included by the vertex, selecting the maximum rate, obtaining the ID of the UE corresponding to the maximum rate, determining the weight value of the vertex according to the maximum rate, and taking the direct transmission mode and the weight value as the distribution information;
if the vertex comprises three subcarriers, calculating the data transmission rate of each UE on the subcarriers included by the vertex through each relay node and adopting each transmission mode, selecting the maximum rate, obtaining the ID of the UE, the ID of the relay node and the transmission mode corresponding to the maximum rate, determining the weight value of the vertex according to the maximum rate, and taking the ID of the relay node, the weight value and the transmission mode as the distribution information.
7. An apparatus for allocating communication resources, the apparatus comprising:
the system comprises a dividing module, a receiving module and a processing module, wherein the dividing module is used for dividing each subcarrier in a current network into subcarrier groups, and each subcarrier group comprises two or three subcarriers;
a first determining module, configured to form a vertex map by using the subcarrier groups as vertices, and determine a blob in the vertex map with a largest weight, where the blob is a set of the vertices and any two of the vertices are connected;
a second determining module, configured to determine a correspondence between an identification ID of a user equipment UE corresponding to each vertex in the group and allocation information, where the allocation information at least includes a weight value of the vertex and a transmission mode;
and the distribution module is used for determining the vertex and the distribution information corresponding to the current UE according to the corresponding relation between the ID of the UE corresponding to each vertex in the group and the distribution information, and distributing the subcarrier contained in the vertex and the distribution information to the current UE.
8. The apparatus of claim 7, wherein the first determining module comprises:
a setting unit, configured to set an edge between two arbitrarily intersected vertices to obtain a vertex graph, where if subcarriers forming the two vertices in the same time slot are different, the two vertices have an intersecting relationship;
a dividing unit configured to divide the vertex map into blobs;
the calculating unit is used for calculating the sum of the weight values of each top point in the group, and taking the sum of the weight values as the weight of the group;
and the selection unit is used for selecting the clique with the largest weight.
9. The apparatus of claim 8, wherein the computing unit comprises:
a searching subunit, configured to search, according to each vertex in the clique, a weight in the allocation information corresponding to each vertex according to a correspondence between the vertex, the ID of the UE, and the allocation information;
and the summing subunit is used for adding the weight values of each top point in the group to obtain the sum of the weight values of each top point in the group, and taking the sum of the weight values as the weight of the group.
10. The apparatus of claim 7, wherein the assignment module comprises:
a searching unit, configured to search, according to an ID of a current UE in the network, a corresponding vertex and allocation information in a correspondence between an ID of the UE corresponding to each vertex in the clique and the allocation information;
a first allocating unit, configured to allocate, to the current UE, the subcarriers included in the searched vertex and the direct transfer mode information included in the searched allocation information if the searched vertex includes two subcarriers;
a second allocating unit, configured to, if the found vertex includes three subcarriers, find a relay node corresponding to an ID of the relay node included in allocation information, and allocate, to the UE, the subcarriers included in the found vertex, the relay node, and a transmission mode included in the found allocation information.
11. The apparatus of claim 7, wherein the apparatus further comprises:
an obtaining module, configured to obtain an ID of a UE with a maximum transmission rate on a subcarrier included in the vertex and the allocation information;
and the storage module is used for recording the vertex, the ID of the UE and the distribution information in the corresponding relation of the vertex, the ID of the UE and the distribution information.
12. The apparatus of claim 11, wherein the acquisition module comprises:
a first obtaining unit, configured to calculate, if the vertex includes two subcarriers, a rate at which each UE transmits data on the subcarriers included in the vertex, select a maximum rate, obtain an ID of the UE corresponding to the maximum rate, determine a weight value of the vertex according to the maximum rate, and use a direct transfer mode and the weight value as the allocation information;
a second obtaining unit, configured to, if the vertex includes three subcarriers, calculate a rate at which each UE transmits data through each relay node on the subcarriers included in the vertex and in each transmission mode, select a maximum rate, obtain an ID of the UE, an ID of the relay node, and a transmission mode corresponding to the maximum rate, determine a weight value of the vertex according to the maximum rate, and use the ID of the relay node, the weight value, and the transmission mode as the allocation information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010261571.2A CN102378375B (en) | 2010-08-23 | 2010-08-23 | Method and device for allocating communication resource |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010261571.2A CN102378375B (en) | 2010-08-23 | 2010-08-23 | Method and device for allocating communication resource |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102378375A true CN102378375A (en) | 2012-03-14 |
| CN102378375B CN102378375B (en) | 2014-05-07 |
Family
ID=45796110
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010261571.2A Active CN102378375B (en) | 2010-08-23 | 2010-08-23 | Method and device for allocating communication resource |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102378375B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103368692A (en) * | 2013-07-03 | 2013-10-23 | 西安交通大学 | Self-adaption variable-time slot analog network coding strategy in two-way relay system |
| CN103957597A (en) * | 2014-03-18 | 2014-07-30 | 南京邮电大学 | Relay selection and power combined optimization method based on selective subcarrier pairing |
| CN111162890A (en) * | 2013-12-18 | 2020-05-15 | 华为技术有限公司 | System and method for WLAN OFDMA design of subcarrier group and frame formats |
| CN114528439A (en) * | 2020-11-23 | 2022-05-24 | 电科云(北京)科技有限公司 | Extremely large group enumeration method and device based on distributed system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1848832A (en) * | 2004-12-27 | 2006-10-18 | 株式会社东芝 | Radio communication apparatus and radio communication method |
| CN101023612A (en) * | 2004-09-28 | 2007-08-22 | 松下电器产业株式会社 | Multicarrier communication apparatus and multicarrier communication method |
| WO2009041069A1 (en) * | 2007-09-28 | 2009-04-02 | Panasonic Corporation | Base station device, mobile station device, communication system, channel estimation method, transmission antenna detection method, and program |
-
2010
- 2010-08-23 CN CN201010261571.2A patent/CN102378375B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101023612A (en) * | 2004-09-28 | 2007-08-22 | 松下电器产业株式会社 | Multicarrier communication apparatus and multicarrier communication method |
| CN1848832A (en) * | 2004-12-27 | 2006-10-18 | 株式会社东芝 | Radio communication apparatus and radio communication method |
| WO2009041069A1 (en) * | 2007-09-28 | 2009-04-02 | Panasonic Corporation | Base station device, mobile station device, communication system, channel estimation method, transmission antenna detection method, and program |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103368692A (en) * | 2013-07-03 | 2013-10-23 | 西安交通大学 | Self-adaption variable-time slot analog network coding strategy in two-way relay system |
| CN103368692B (en) * | 2013-07-03 | 2016-06-08 | 西安交通大学 | Adaptive strain time slot analog network coding strategy in a kind of bidirectional relay system |
| CN111162890A (en) * | 2013-12-18 | 2020-05-15 | 华为技术有限公司 | System and method for WLAN OFDMA design of subcarrier group and frame formats |
| CN111162890B (en) * | 2013-12-18 | 2024-04-12 | 华为技术有限公司 | System and method for WLAN OFDMA design of subcarrier groups and frame formats |
| CN103957597A (en) * | 2014-03-18 | 2014-07-30 | 南京邮电大学 | Relay selection and power combined optimization method based on selective subcarrier pairing |
| CN103957597B (en) * | 2014-03-18 | 2017-09-22 | 南京邮电大学 | The relay selection and power joint optimization method matched based on selective subcarrier |
| CN114528439A (en) * | 2020-11-23 | 2022-05-24 | 电科云(北京)科技有限公司 | Extremely large group enumeration method and device based on distributed system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102378375B (en) | 2014-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Qian et al. | Optimal SIC ordering and computation resource allocation in MEC-aware NOMA NB-IoT networks | |
| US11564205B2 (en) | Method and apparatus for configuring DMRS information in V2X system | |
| CN104067640B (en) | System and method for the common control channel in communication system | |
| CN110418399B (en) | NOMA-based Internet of vehicles resource allocation method | |
| US11139906B2 (en) | Wireless communication method and wireless communications apparatus | |
| CN111132342A (en) | Multi-carrier resource allocation method based on wireless power supply backscattering communication network | |
| WO2017166538A1 (en) | Electronic apparatus in wireless communication system, and communication method | |
| KR102239081B1 (en) | Data transmission method and terminal device thereof | |
| CN101641877A (en) | The sign that cochannel in the wireless communication system disturbs | |
| CN102395205B (en) | Method and system for increasing quantity of physical layer control channel resource | |
| CN104854935A (en) | Methods and apparatuses of allocating resources for device-to-device communication | |
| KR20090029902A (en) | Apparatus and method for scheduling in multi-hop relay wireless communication system | |
| WO2018126854A1 (en) | Uplink transmission method, terminal, and network-side device | |
| CN107736065A (en) | A kind of resource allocation information indicating means, base station and user equipment | |
| KR101561434B1 (en) | A method for communicating in mobile system | |
| CN102378375B (en) | Method and device for allocating communication resource | |
| CN106162921A (en) | A kind of method of Stochastic accessing, node and system | |
| Xu et al. | Resource allocation for NOMA-based V2V system | |
| CN112073974A (en) | Unauthorized spectrum edge access and anti-interference method and device for cooperative terminal communication | |
| US20110105163A1 (en) | Method for inter-cell interference management in cellular system | |
| Al-Abiad et al. | Decentralized aggregation for energy-efficient federated learning via overlapped clustering and D2D communications | |
| US20200236683A1 (en) | Device and method for associating resource information with channel metric information in wireless networks | |
| CN107404763A (en) | Down control channel space division multiple access method, device and the base station of super cell | |
| CN106877986A (en) | A kind of method and apparatus of narrowband wireless communication | |
| CN106059734A (en) | Massive MIMO system pilot frequency distribution method based on edge user interference measurement value |
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 |