WO2010124647A1 - 移动通信中基站动态分簇的设备和方法 - Google Patents

移动通信中基站动态分簇的设备和方法 Download PDF

Info

Publication number
WO2010124647A1
WO2010124647A1 PCT/CN2010/072341 CN2010072341W WO2010124647A1 WO 2010124647 A1 WO2010124647 A1 WO 2010124647A1 CN 2010072341 W CN2010072341 W CN 2010072341W WO 2010124647 A1 WO2010124647 A1 WO 2010124647A1
Authority
WO
WIPO (PCT)
Prior art keywords
base station
state information
channel state
clustering
base stations
Prior art date
Application number
PCT/CN2010/072341
Other languages
English (en)
French (fr)
Inventor
贾云健
藤岛坚三郎
吉内英也
杨鹏
马元琛
耿璐
周盛
牛志升
龚杰
Original Assignee
株式会社日立制作所
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 株式会社日立制作所 filed Critical 株式会社日立制作所
Priority to JP2012507596A priority Critical patent/JP5411985B2/ja
Priority to US13/266,898 priority patent/US8942757B2/en
Priority to EP10769336.8A priority patent/EP2426975A4/en
Publication of WO2010124647A1 publication Critical patent/WO2010124647A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0032Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation
    • H04L5/0035Resource allocation in a cooperative multipoint environment
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022Site diversity; Macro-diversity
    • H04B7/024Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/27Control channels or signalling for resource management between access points
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W92/00Interfaces specially adapted for wireless communication networks
    • H04W92/16Interfaces between hierarchically similar devices
    • H04W92/20Interfaces between hierarchically similar devices between access points

Definitions

  • the present invention relates to an apparatus and method for providing a service in a mobile communication network. More particularly, in a mobile communication system, a central clustering server is used for dynamic clustering of base stations, and an apparatus and method for supporting multi-base station joint services are provided.
  • the mobile communication network mentioned here is a mobile communication system supporting multi-base station joint services. Background technique
  • Coordinated multi-point transmi ssion/reception has been recognized as a very good way to extend the coverage of high-speed data services in mobile networks, improve throughput at the cell edge, and improve system average throughput. method.
  • CoMP Coordinated multi-point transmi ssion/reception
  • all the participating network nodes need to be clustered, and the network nodes in each cluster provide multipoint joint services for some terminals.
  • Figure 1 shows a simple multi-base station joint service scenario in an existing mobile network. In Fig. 1, two base stations 1 and base station 2 are combined to serve both terminal 1 and terminal 2. In practical applications, there may be more than two base stations serving more than two terminals simultaneously.
  • 3GPP is an international standards organization that has developed system architectures and standards for second and third generation mobile communication networks. These standards have been applied to networks that currently have air interfaces deployed.
  • 3GPP is working on the development of Long Term Evolution-Advanced (LTE-advanced) for the fourth-generation mobile communication network.
  • LTE-advanced Long Term Evolution-Advanced
  • ⁇ -Advanced multi-point joint transmission and reception have been Adopted for multi-base station joint services.
  • a mobile cellular network consists of at least a plurality of base stations.
  • a plurality of base stations are connected to one (a plurality of actual application) base station controllers, and the base station controller is responsible for negotiating key parameters of the multi-base station joint service.
  • the access network is responsible for connecting the base station controller and the base station to the mobile network gateway.
  • the mobile network gateway is connected to the Internet or other servers as the cut-off node of the entire mobile access network, at least responsible for the future. Information from other servers and the Internet is provided to all mobile terminals, and at the same time is responsible for at least network registration, security, billing, etc. of all mobile terminals.
  • each base station dynamically selects the best base station cluster, it needs to share a lot of data and channel state information among all base stations.
  • the communication burden between the base stations is very heavy, and complex algorithms need to be implemented in the base station for the selection of the optimal clusters.
  • a lot of information is shared between the base stations and between the base stations and the terminals in order to select the optimal base station cluster, which results in very large signaling and resource overhead, making the mobile network inefficient.
  • a static base station cluster is set in a multi-base station joint service as in Fig. 3, signaling and resource overhead can be saved.
  • the location and service channel conditions of mobile terminals in a mobile network are constantly changing, it is difficult to select a static optimal base station cluster to meet the needs of all multi-base station joint transmissions. If the base station cluster is simply set statically, the multi-base station joint service cannot be utilized, and the utilization efficiency of the air interface is improved, so that the multi-base station joint service becomes meaningless.
  • Figure 3 is an example of static clustering in an existing multi-base station federation service.
  • multiple base stations 1-30 are deployed in the network and are statically divided into multiple base station clusters, with 3 base stations in each cluster.
  • multi-base station joint service only three base stations in a certain cluster can be federated, and the cross-cluster joint service cannot be performed.
  • This has the advantage of simplifying the overhead of dynamic clustering of base stations.
  • its performance cannot be optimized.
  • a mobile terminal is at the cell edge between certain base stations within the same base station cluster, it can benefit from multi-base station joint service. Then, if a mobile terminal is at the edge of the combination of two base station clusters, for example, the neighboring cell edges of the base station 2 and the base station 4 in FIG.
  • the base station 2 and the base station 4 cannot perform multi-base station association according to the static clustering rule. Service, even if the two base stations have sufficient resources and good channel quality, the mobile terminal cannot enjoy the service. These are not conducive to optimal use of the wireless air interface resources of the base station.
  • a cluster of a plurality of wireless nodes communicates with each other to negotiate multi-node joint communication before communicating with the correspondent node, but these nodes are terminal nodes, and none of them
  • the mobile communication base station participates in clustering;
  • antenna elements from two or more base stations are used to form a multi-antenna array.
  • the present invention provides a communication control apparatus, a communication control method and system, and provides efficient multi-base station joint service in a mobile communication system by dynamic clustering. It is possible to select an optimal base station clustering according to the communication state of the terminal and each base station, and reduce signaling and resource overhead for calculating base station clustering.
  • Figure 1 is a simple multi-base station joint service scenario
  • Figure 2 shows the existing centrally controlled multi-base station joint service system framework.
  • Figure 3 is an example of static clustering in an existing multi-base station joint service
  • Figure 5 is a package format of pilot information used for channel state information estimation
  • Figure 6 is a dynamic clustering signaling flow
  • FIG. 8 is a typical signaling process of a multi-base station joint service triggered by a terminal after dynamic clustering according to the present invention.
  • FIG. 9 is a typical signaling process of a multi-base station joint service triggered by a base station after dynamic clustering according to the present invention.
  • Figure 10 is a basic format of inter-base station signaling of the present invention.
  • FIG. 11 is an X2AP field implementation example of request signaling for inter-base station negotiation joint transmission according to the present invention.
  • FIG. 12 is an X2AP field implementation example of response signaling for inter-base station negotiation joint transmission according to the present invention.
  • FIG. 13 is a single antenna base station of the present invention. Internal structure
  • Figure 14 is a diagram showing an internal structure of a multi-antenna base station of the present invention (2 antennas)
  • Figure 15 is a diagram showing the internal structure of the center clustering server of the present invention
  • Figure 16 is a flow chart of internal information of the center clustering server of the present invention
  • FIG. 17 is a diagram showing a typical structure of a channel state information table in a center clustering server of the present invention.
  • FIG. 18 is an implementation example of a channel state information table in the center clustering server of the present invention.
  • FIG. 19 is an implementation example of an interference relationship diagram for a dynamic clustering algorithm of the present invention.
  • 20 is an example of implementation of moving part of a mobile terminal in the communication control system of the present invention.
  • FIG. 21 is a channel state information table after moving of a part of mobile terminals in the communication control system of the present invention.
  • FIG. 22 is a comparison diagram of advantages of the dynamic clustering algorithm in the present invention.
  • the examples described below are based on the 3GPP LTE-A communication system.
  • the present invention can be applied to other mobile communication networks supporting multi-base station joint services.
  • the central clustering server of the present invention may be configured as a central clustering server 9 independently installed in the network, or controlled by an existing base station.
  • a base station controller 8 having a dynamic clustering function is additionally provided in the device.
  • the central clustering server mentioned includes both settings. In the present invention, upgrading a conventional base station requires supporting a basic single base station wireless service or a multi-base station joint wireless service. As shown in Fig.
  • the base station receives the channel state information vector from each terminal, transmits it to the central clustering server, or converts the channel state information into simple channel state information and transmits it to the central clustering server.
  • the central clustering server uses the channel state information of each terminal sent from each base station to cluster each base station, and transmits the clustering result to each base station.
  • the base station negotiates with other base stations in the current base station cluster according to the dynamic clustering result to implement multi-base station joint wireless service.
  • Figure 5 is an encapsulation format of pilot information for channel state information estimation.
  • base station 1 base station 1 in the figure
  • Channel status information Other air interface resources may be used for the transmission of downlink data 502.
  • an optional universal pilot identifier 503 can be added, and antenna port information 504, common pilot information 505, is added.
  • pilots -2 - 1 506 and the pilots - 2 - 2 506 for each antenna can be transmitted separately, and the terminal can use the pilot - 2 - 1 506 And the information in Pilot-2 - 506 calculates channel state information between each antenna of the multi-antenna base station.
  • the content of the pilot information is a known training sequence that is shared in advance at all terminals and base stations.
  • the terminal receives pilot information for channel estimation transmitted from a base station, the received pilot information is compared with the already shared pilot.
  • the pilot content that is often transmitted over the wireless channel will differ from the pilot content known locally to the terminal.
  • the terminal estimates the channel state information by comparing the differences.
  • the obtained channel state information includes at least a channel fading condition and a phase deflection between the terminal and the base station.
  • Figure 6 is a dynamic clustering signaling flow.
  • all terminals 1-m periodically receive pilot information from each autonomous serving base station 1-n (process 601).
  • the terminal then begins to calculate channel state information corresponding to each base station (3 ⁇ 4 represents channel state information between base station i and terminal j) (process 602).
  • the channel state information herein generally appears in a plural form. Since the calculation of the channel state information based on the pilot information is a technique well known to those skilled in the art, it will not be described in detail herein.
  • each terminal j generates its own channel state information vector and reports it to the respective primary serving base station (process 603), wherein some channel state information is 0; subsequently, all base stations report all channel state information to the central clustering server.
  • the reported channel state information may be original channel state information, or may be simple channel state information, where the simple channel state information is state information after taking the absolute value of the original channel state information;
  • the central clustering server needs to first update the channel state information table (process 605); when the dynamic clustering timer expires, perform dynamic clustering scheduling (process 606); central clustering after scheduling ends
  • the server transmits the result of the scheduling to all base stations; the base station broadcasts the status of the current cluster to all terminals in the current cell (process 608); and follows the current clustering situation when the terminal or the base station triggers the use of the multi-base station joint service (process 609) ).
  • the terminal calculates channel state information according to the pilot information periodically broadcast by each base station, and continues to provide channel state information for the next clustering.
  • Figure 7 is a dynamic clustering procedure in the central clustering server of the present invention.
  • the central clustering server (communication control device) receives all the simple channel state information from the base station, and updates the channel state information table (process 701).
  • the central clustering server forms a channel state information matrix according to the channel state information table (process 702): 11 21 nl
  • H is a summary of simple channel state information between all mobile terminals served by the base station y and the base station X. There may be many ways to aggregate this. For example:
  • the central clustering server calculates the interference coefficient of each base station to each other's main service terminals according to the channel state information matrix:
  • the interference relationship diagram is an undirected graph, wherein the number of nodes in the figure is consistent with the number of base stations participating in the dynamic clustering scheduling, and each node corresponds to one of the base stations.
  • the weight of the edge between the nodes is the interference coefficient between the two base stations.
  • All clustering parameters Li are calculated according to the number of base stations per cluster. All clusters may be arranged in an unscheduled list from clustering parameters (process 704). The calculation of the possible clustering parameters Li corresponding to a certain base station clustering can be based on the following principles:
  • w a, b is the inter-base station interference coefficient defined in (2), where one base station (a or b) belongs to the current base station cluster, and the other base station does not belong to the current base station cluster.
  • the number of base stations in each base station cluster can be set in advance in the central clustering server, or can be dynamically determined according to certain principles.
  • the basic criterion for this scheduling is that the interference coefficients between all base stations within the same base station cluster can contribute to the channel gain of the multi-base station joint service. However, if two base stations are not in the same base station cluster, the interference coefficient between them is contributed to the channel interference of the multi-base station joint service. For example, for a certain one, if the base station y and the base station X are in the same base station cluster, they can perform multi-base station joint service, then the base station y is served. All channel gains between all mobile terminals and base station X can serve as channel gain for the joint service.
  • the final base station y and the base station X are not in the same base station cluster, they cannot perform multi-base station joint service, and all channel gains between all mobile terminals and base stations X served by the base station y are combined for each of the two base stations.
  • the service is all channel interference. Therefore, the goal of dynamic base station clustering is to find an optimal clustering scheme, so that the channel interference between each base station cluster is the lowest and the channel gain is the largest.
  • the basic scheduling process is as follows:
  • the first step 705 initializing the un-clustered set E is the set of all base station nodes and the clustered base station U is an empty set ⁇ ;
  • the second step 706 select the current clustering parameter Li clustering set ⁇ check whether ⁇ /, if the result is yes, go to the third step 707, if, the result is no, go to the fifth step;
  • Step 708 Accept the cluster set currently having the smallest clustering parameter as an effective clustering
  • Step 709 Removing the cluster set currently having the smallest clustering parameter from the initial unscheduled list;
  • Step 6: 710: determining E 0> or the number of remaining base stations in the un-clustered set E is less than the currently set What is the number of base stations in the base station cluster? If the result is yes, go to the sixth step, if the result is no, go to the second step;
  • Step 7 End clustering scheduling, and send the clustering result to all base stations.
  • FIG. 8 is a typical signaling flow of a multi-base station joint service triggered by a terminal after dynamic clustering according to the present invention.
  • the base station may transmit the dynamic base station clustering result to the corresponding terminal (process 802); when the terminal decides to use the current cluster A multi-base station joint service (process 803), which will send a message to its corresponding primary serving base station to trigger a multi-base station joint service (process 804); the primary serving base station may select a related authentication process (process 805);
  • the terminal periodically reports channel state information to all the base stations in the current base station cluster to the primary serving base station (process 806); if the primary serving base station considers that the terminal can perform multi-base station joint service, the current base station cluster
  • the other base stations in the negotiation negotiate the joint transmission (process 807); if the negotiation is successful, the primary serving base station notifies the terminal of the key parameters of the joint transmission (process 808)
  • FIG. 9 is a typical signaling flow of a multi-base station joint service triggered by a base station after dynamic clustering of the present invention.
  • the base station may select to transmit the dynamic base station clustering result to the corresponding terminal (process 902); when the primary serving base station decides to use the current A multi-base station joint service of the cluster (process 903), which will send a message to its corresponding terminal to trigger a multi-base station joint service (process 904); in the process, the terminal periodically reports to the corresponding primary serving base station with the current base station cluster Channel state information between all base stations (process 905); if the primary serving base station considers that the terminal can perform multi-base station joint service, it negotiates joint transmission with other base stations in the current base station cluster (process 906); if the negotiation is successful The primary serving base station notifies the terminal of the key parameters of the joint transmission (process 907), and all base stations in the current base station cluster
  • FIG 10 is a basic format of inter-base station signaling of the present invention.
  • the signaling is an SCTP/IP packet, which can be either IPv4 or IPv6.
  • the destination address is the IPv4/IPv6 address 1002 of the target base station
  • the source address is the IPv4/IPv6 address 1003 of the source base station.
  • the general IP header 1001 is followed by the generic SCTP header 1004. Finally, it is a message body 1005 that conforms to the 3GPP X2AP protocol.
  • the information unit that must be included includes: 1) a message type unit 1101 whose value is defined by a standards organization such as 3GPP, and needs to be able to identify a multi-base station cooperation request function; 2) a corresponding terminal of the primary serving base station, the protocol identifier 1102, Identifying the direction of the primary serving base station to the target base station, which can uniquely identify one terminal; 3) the target base station identity 1103; 4) the relevant cell identity 1104 of the target base station; 5) the multiple base station joint service request type 1105 (can be started, ended 6) Requesting the reported content 1106, the field is a 32-bit sequence of bits, each bit corresponding to a message content, if a bit value is 1, it means that the target base station needs to add corresponding information in the response message (for example The first bit corresponds to the precoding option, the second bit corresponds to the output power of the joint service, the third bit corresponds to the
  • the information elements that must be provided include: 1) a message type unit 1201 whose value is defined by a standards organization such as 3GPP, and needs to be able to The multi-base station cooperation response function is identified; 2) the X2AP protocol identifier 1202 of the corresponding terminal on the primary serving base station, the identifier may uniquely identify one terminal in the direction of the primary serving base station to the target base station; 3) the X2AP protocol of the corresponding terminal on the target base station
  • the identifier 1203 is in the direction of the target base station to the primary serving base station, and can uniquely identify one terminal; 4) the related cell identifier 1204 of the target base station; 5) the multi-base station joint service request type 1205 (may be start, end, etc.) Should be the same as the content of the corresponding information element in the X2AP request message; 6)
  • the content of the response report 1206, the field is a message type unit 1201 whose value is defined by a standards organization such as 3GPP, and needs to be able to
  • the optional information may include: 1) an information reporting period 1207 between the target base station and the source base station; 2) precoding option 1208; 3) joint transmitted power 1209; 4) modulation rate 1210; 5) other optional information 1211.
  • FIG. 13 is a diagram showing the internal structure of a single antenna base station of the present invention.
  • the internal structure of the base station mainly includes a high frequency module 1322, a baseband module 1307, an upper layer signaling and control module 1308, a network interface module 1309 connected to the access network, and a multi-base station service control unit 1311 for controlling the multi-base station service and the center.
  • the high frequency module 1322 at least one physical antenna 1301, one or more high frequency multiplexing units 1302, and one or more radio frequency units 1303 are included.
  • the downstream portion of the high frequency module 1322 includes a joint precoding unit 1304, a downlink pilot generating unit 1305, at least one multi-layer mapping unit 1306, and a downlink time division control unit 1319 and a transmitting radio frequency control portion 1318.
  • the downlink portion of the high frequency module 1322 includes a joint de-precoding unit 1321, an uplink training sequence analyzing unit 1305, at least one multi-layer demapping unit 1316, and an uplink time division control unit 1320.
  • the baseband portion includes at least one channel coding and modulation module 1312 and at least one channel decoding and demodulation module 1313.
  • Fig. 14 is a diagram showing an internal configuration (2 antennas) of a multi-antenna base station in the present invention.
  • the internal structure of the base station mainly includes a high frequency module 1424, a baseband module 1410, an upper layer signaling and control module 1411, and a network interface module 1412 connected to the access network, the multi-base station service control unit 1414 is configured to control the multi-base station service and communicate with the central clustering server; the network module 1413 that communicates with the central clustering server; the channel state information matrix 1425; the precoding option 1415; Channel estimation unit 1420.
  • the high frequency module 1424 at least two physical antennas 1401 and 1402, one or more high frequency multiplexing units 1403, and one or more radio frequency units 1404 are included.
  • the downlink portion of the high frequency module 1424 includes at least one joint precoding unit 1405, at least two downlink pilot generating units 1407 and 1408, at least one multi-layer mapping unit 1409, at least one common pilot generating unit 1406, and at least two downlink time divisions.
  • the downstream portion of the high frequency module 1424 includes at least one joint precoding unit 1423, at least two uplink training sequence analyzing units 1417 and 1418, at least one multi-layer demapping unit 1419, and at least two downlink time division control units 1422.
  • the baseband portion includes at least two channel coding and modulation modules 1416 and at least two channel decoding and demodulation modules 1415.
  • FIG. 15 is a diagram showing the internal typical structure of a central clustering server, i.e., a communication control device, in the present invention.
  • the network interface includes an input l ine interface 1501 and an output l ine interface 1503.
  • the network interface further includes a receiving buffer 1502, each receiving buffer is connected to the input line interface 1502 and the internal bus 1514, sending buffers 1504, each sending buffer Both the output line interface 1503 and the internal bus 1514 are connected.
  • the internal bus 1514 is also coupled to at least a processor 1505, a program memory 1506, and a data memory 1511.
  • the program memory 1506 stores the function modules executed by the processor 1505, and at least includes: a packet sending and receiving module 1510, a clustering control module 1507 mainly controls scheduling of dynamic base station clustering, and multi-base station joint service clustering control A Signaling Module 1508 (CoMP signal ing control module), and a basic control routine 1509 are used to select to activate other modules.
  • the channel memory information table 1512 (Channel Status Information Table) newly added in the present invention and some other data information 1513 are stored in the data memory 1511.
  • the present invention incorporates a new module in program memory 1506 primarily as clustering control module 1507. Its specific tasks include:
  • the reported channel state information is updated to the channel state information table 1512; if the report from the base station is the original channel shape State information, the clustering control module 1507 needs to convert it into simple channel state information, and then store it in the channel state information table 1512;
  • the number of base stations in the cluster of the base station is configured; the number of the number of the base stations can be manually configured by the operator, or dynamically configured by other methods;
  • the clustering control module 1507 communicates with other network devices through the multi-base station joint service clustering control signaling module 1508 as shown in FIG. 6.
  • a new multi-base station federation service clustering control signaling module 1508 is added to the program memory 1506 for maintaining signaling communications with other network devices.
  • the multi-base station joint service clustering control signaling module 1508 needs to forward at least the reports from the respective base stations to the clustering control module.
  • the clustering control module 1507 also needs to send the result of the dynamic base station clustering scheduling to all the base stations.
  • the present invention incorporates a new module in the data memory 1511, mainly a channel state information table 1512.
  • the details of the table are as shown in FIG. 17, and include the terminal 1701, the information 1702 of each base station, for example, channel state information, a primary serving base station, and the like.
  • the clustering control module 1507 summarizes the reports received from the respective base stations and updates the table. At the same time, the clustering control module 1507 also uses the content in the table as a reference to perform dynamic base station clustering scheduling.
  • Figure 16 is a flow chart showing the internal information flow of the central clustering server in the present invention.
  • the periodic simple channel state information 1601 from each base station is first received by the input line interface 1501 and the input buffer 1502, and reaches the packet transmitting and receiving module 1510 via the bus 1514. Then, the packet transmission and reception module 1510 forwards the channel state information 1601 to the multi-base station joint service clustering control signaling module.
  • the information is sent to the clustering control module 1507 and then stored in the channel state information table 1512.
  • the clustering control module 1507 obtains the current channel state information 1601 from the channel state information table 1512, and then performs dynamic clustering scheduling, and hands over the base station clustering result 1602 to the multi-base station joint service.
  • the information is sent to the packet sending and receiving module 1510.
  • the output line interface 1503 and the output buffer 1504 ultimately transmit the result 1602 of the base station clustering to all base stations over the network. All data and signaling flows in the central clustering server are controlled by the processor 1505 via the basic control module 1509 and forwarded via the data or control bus 1514.
  • Figure 17 is a view showing a typical structure of a channel state information table 1512 in the center clustering server in the present invention. This table exists in the data store 1511 of the central clustering server. Each row 1706 of the channel state information table 1512 corresponds to a mobile terminal, including the identifier 1701 of the terminal, and the terminal contains a plurality of entries 1702 indicating channel information and service relationships with each base station. Each entry 1702 contains simple channel state information 1704 and a primary service relationship 1705 between the terminal and the corresponding base station.
  • each base station has only one antenna, only one terminal can be served at a time, and it is assumed that the network between the base station and the central clustering server is sufficient to support dynamic base station clustering scheduling to each time slot.
  • Figure 18 is an implementation example of the channel state information table 1512 (Fig. 17) in the center clustering server of the present invention.
  • Each row 1806 corresponds to a mobile terminal, which includes an identifier 1801 of the terminal, and the terminal contains a plurality of entries 1802 indicating channel information and service relationships with each base station.
  • Each entry 1802 contains simple channel state information 1804 and a primary service relationship 1805 between the terminal and the corresponding base station.
  • the base station 17 only serves the terminal 12. Then, according to the contents of the channel state information table 1512 of Fig. 18, the generated simple channel state information matrix is as follows:
  • FIG. 19 is an implementation example of an interference relationship diagram for a dynamic clustering algorithm in the present invention.
  • the generated interference relationship is suddenly an undirected graph.
  • Each node 1901 corresponds to one base station, and the edge 1902 between each two nodes corresponds to an interference relationship between two base stations, and the weight (weight) is the interference coefficient of the two base stations 1903.
  • the interference graph is generated by the clustering control module 1507 of the central clustering server based on the content in the current channel state information table 1512.
  • W 14 1.45 .
  • the clustering parameters of the possibility of not having a cluster of base stations are calculated as follows (in a small to large manner):
  • the central clustering server will select two base station clusters ( ⁇ 2, 3 ⁇ and ⁇ 1, 4 ⁇ .) as the final result.
  • the clustering parameters are calculated in the same way as in Figure 7.
  • the clustering possibilities generated in this way are the same, and the method chosen is the same as the method in Figure 7.
  • the clustering parameters are calculated in the same way as in Figure 7.
  • the clustering possibilities generated in this way are the same, and the method chosen is the same as the method in Figure 7.
  • the method of dynamically clustering the base station based on the channel state information mentioned in Fig. 7 of the present invention may adopt other methods.
  • the central clustering server may perform clustering according to the following methods: Step 1: The central clustering server takes all the simple channel state information from the channel state information table;
  • Step 2 summing all the terminals mainly served by each base station to the simple channel state information of other base stations (representing the simple channel state information of the base station y for all terminals in the base station X);
  • Step 3 All base stations are sorted according to the number of terminals served by the main service to form an un-clustered base station set E, and the clustered base station set U is initialized to be an empty set;
  • Step 4 For the base station cluster of the current number (assumed to be P), the base station with the largest number of primary service terminals Start, select P-1 largest base stations to form a valid base station cluster, and remove P base stations in the base station cluster from the clustered set E, and join the clustered set U;
  • Step 5 If the current un-clustered set E is an empty set or the number of remaining base stations in the current un-clustered set E is small and the number of base stations without base station clusters, go to step 6, otherwise return to step 4;
  • Step 6 End the clustering algorithm and send the clustering result to all base stations.
  • the central clustering server can also be clustered according to the following methods:
  • Step 1 The central clustering server extracts all the original channel state information from the channel state information table
  • Step 2 For each terminal, according to the channel state information of the other non-primary serving base stations, select P-1 non-primary serving base stations with the highest radio utilization rate of the multi-base station joint service for the current terminal as the temporary optimal of the current terminal.
  • Clustering When calculating the wireless utilization rate, it is necessary to first calculate the multi-base station joint service transmission matrix according to the fading and channel offset information in the original channel state information, and then calculate, according to the transmission matrix, all the base stations in the temporary cluster to serve the current terminal.
  • Wireless utilization, re-summation
  • Step 3 All base stations are formed into an un-clustered base station set E, and the clustered base station set U is initialized as an empty set, and all terminals are grouped into a terminal set W;
  • Step 4 First, extract the most optimal clustering of the temporary optimal clusters of all the terminals in the terminal set W as the current effective clustering, and delete the P base stations in the base station cluster from the unclustered set E, and join Clustering the set U, and finally deleting all terminals that select the current cluster as the temporary optimal cluster from the terminal set W;
  • Step 5 If the current un-clustered set E is an empty set, or the number of remaining base stations in the current un-clustered set E is small and the number of base stations without the base station cluster, or the terminal set W is an empty set, go to step seven, otherwise enter the step Six
  • Step 6 If it is possible to extract the clusters with the most optimal temporal clustering of all the terminals in the terminal set W, proceed to step 4, if there are two or more (assuming T), the most common temporary optimal points Cluster selection, summing the wireless utilization of each cluster selection terminal (assuming s t , t corresponds to one of the current ⁇ temporary optimal cluster selections), and extracting the largest temporary optimal cluster selection t , as the current cluster with the most overlap, go to step four;
  • Step 7 End the clustering algorithm and send the clustering result to all base stations.
  • Figure 20 is a diagram showing an implementation example after a part of the mobile terminal moves in the communication control system of the present invention.
  • Figure 21 is a table showing channel state information after movement of a part of mobile terminals in the communication control system of the present invention.
  • the channel state information table becomes the content of Fig. 21.
  • the base station 17 only serves the terminal 12, and the current base station clustering form is also the result of dynamic clustering according to the content in FIG. Then, according to the content of Figure 21 of the current channel state information table, the generated simple channel state information matrix is as follows:
  • an interference relationship diagram as shown in Fig. 19 can also be generated.
  • Figure 19 is an implementation example of an interference relationship diagram for a dynamic clustering algorithm in the present invention.
  • the generated interference relationship is suddenly an undirected graph.
  • Each node 1901 corresponds to one base station, and the edge 1902 between each two nodes corresponds to the interference relationship between the two base stations 7.
  • the weight (weight) is the interference coefficient of the two base stations.
  • the interference graph is generated by the clustering control module 1907 in the central clustering server based on the contents of the current channel state information table 1912.
  • the calculation results of all current interference coefficients 1903 in Figure 19 are as follows:
  • the clustering parameters of the probability of a certain base station cluster are calculated as follows (in a small to large manner):
  • the central clustering server will select two base station clusters ( ⁇ 1, 2 ⁇ and ⁇ 3,4 ⁇ . ) As the final result.
  • the dynamic base station clustering method in the present invention is based on the interference of the radio link between all base stations and terminals in the current network, and the clustering of the radio channel conditions of some terminals is unchanged, and the radio channel conditions of some terminals are changed, clustering The results may also be affected. Even if the location of all terminals does not change, the surrounding environment changes (for example, the temporary obscuration of some terminals is affected by the channel conditions of the relevant base stations), resulting in changes in the state of the wireless channel, clustered The result will be affected more or less. However, the dynamic base station clustering method in the present invention can always find an optimal clustering method in the current channel state.
  • Figure 22 is a comparison of the superiority of the dynamic clustering algorithm of the present invention.
  • the horizontal axis 2202 is the received signal-to-noise ratio SNR in dB
  • the vertical axis 2201 is the average capacity of the current system in units of bi t/s/Hz.
  • the theoretically optimal curve is the top one 2203.
  • the theoretical value is calculated by the Shannon channel formula:
  • the curve 2204 is the average performance of the multi-base station joint service after dynamic clustering in the present invention
  • the curve 2205 is the average performance of the multi-base station joint service at the time of static clustering
  • the curve 2206 is the average performance without using the multi-base station joint service.
  • the dynamic clustering method in the present invention has a significant improvement over the static clustering performance, and is closer to the ideal value of the theory, and the clustering algorithm is still very simple.
  • the curves 2204, 2205 and 2206 are statistical distribution results obtained after a large number of simulations in a network of a plurality of base stations and a plurality of terminals.
  • the mobile terminal of the present invention may be a mobile phone, a notebook computer having a wireless Internet access function, or another communication device having a wireless communication function.
  • the parameters used in dynamic clustering scheduling are basic channel state information reported by each terminal to the network side, and the existing terminal can support the system and method in the present invention without modification.
  • the information reported by the mobile communication base station to the central clustering server is simplified channel state information, which saves communication bandwidth.
  • the method of clustering is applicable to the size of various base station clusters.

Description

移动通信中基站动态分簇的设备和方法
技术领域
本发明涉及在移动通信网络中提供服务的设备和方法。 尤其涉及在移 动通信系统中, 利用中心分簇服务器进行基站动态分簇, 提供高效的支持 多基站联合服务的设备和方法, 这里提到的移动通信网络为支持多基站联 合服务的移动通信系统。 背景技术
多 点 联 合 传 输 / 接 收 ( Coordinated multi-point transmi ssion/reception (CoMP) ) 已经被公认为在移动网络中扩充高速数 据服务的覆盖范围、 提高小区边缘的吞吐以及提高系统平均吞吐的一个非 常好的方法。 在多点联合传输 /接收中, 需要对所有的参与协作的网络节点 进行分簇, 每个簇中的网络节点为某些终端提供多点联合服务。 图 1 是已 有的移动网络中, 简单的多基站联合服务场景。 在图 1 中, 两个基站 1和 基站 2联合起来, 同时对终端 1和终端 2进行服务。 在实际的应用中, 可 能会有多于两个的基站同时对多于两个的终端进行服务。
3GPP是一个国际标准组织, 曾经开发出第二代以及第三代移动通信网 络的系统架构和标准。 这些标准已经应用于目前已经部署空中接口的网络 上。 当前, 3GPP正在着手制定面向第四代移动通信网络的长期演进的提升 片反本 (Long Term Evolution - Advanced, LTE-advanced). 在 ΠΈ -Advanced 的标准制定过程中, 多点联合传输和接收已经被采纳用于多基站联合服务。
图 2是现有技术中中心控制的多基站联合服务系统框架。 这里以 3GPP 标准组织制定的 LTE-Advanced网络为应用实例。 这里涉及的设备和方法可 以应用于其他支持多基站联合服务的移动网络中。 在这个典型框架中, 移 动蜂窝网络至少由多个基站组成。 多个基站与一个 (实际应用中可以是多 个) 基站控制器相连, 基站控制器负责协商多基站联合服务的关键参数。 接入网负责连接基站控制器和基站与移动网络网关。 移动网络网关与因特 网或其它服务器连接, 作为整个移动接入网络的截止节点, 至少负责将来 自其他服务器和因特网的信息提供给所有的移动终端, 同时至少负责所有 移动终端的网络注册、 安全、 计费等工作。
多基站联合服务虽然有很多好处, 但是如果各个基站各自动态选择最 优基站簇, 需要在所有基站之间共享很多数据以及信道状态信息。 使得基 站之间的通信负担非常重, 同时需要在基站中实现复杂的算法用于进行最 优簇的选择。 除此之外, 为了选择最优的基站簇而在基站之间和基站与终 端之间共享很多信息, 这样会带来非常大的信令和资源开销, 从而使移动 网络很低效。
从另一个角度讲, 如果像图 3那样在多基站联合服务中设置静态的基 站簇是可以节省信令和资源开销的。 然而, 由于移动网络中移动终端的位 置和服务信道状况是不断变化的, 因此很难选择一个静态的最优的基站簇 来满足所有多基站联合传输的需要。 如果只是简单的静态设置基站簇, 无 法利用多基站联合服务, 提高空中接口的利用效率, 从而使多基站联合服 务变得没有任何意义。
图 3 是现有的多基站联合服务中静态分簇的示例。 该示例中, 网络中 部署了多个基站 1-30, 并静态分成多个基站簇, 每个簇内有 3个基站。 在 进行多基站联合服务的时候, 只有某个簇内的三个基站可以进行联合, 跨 簇联合服务无法进行。 这样做的好处是简化了基站动态分簇带来的开销。 然而, 其性能无法达到最优。 如果某个移动终端处于同一基站簇内的某几 个基站之间的小区边缘, 可以从多基站联合服务中受益。 然后, 如果某个 移动终端处于两个基站簇结合的边缘, 例如说图 3中基站 2和基站 4的相 邻的小区边缘, 由于根据静态分簇规则, 基站 2和基站 4无法进行多基站 联合服务, 即使这两个基站有足够的资源和良好的信道质量, 移动终端也 无法享受到这种服务。 这些都不利于最优的使用基站的无线空中接口资源。
总之, 在支持多基站联合传输的移动网络中, 需要一个轻量级的动态 基站分簇选择解决方案。 该解决方案一方面需要很快的找到最优的基站分 簇结果, 另一方面需要减少用于计算基站分簇的信令和资源开销。
在专利 W0 2008/157147 A1和专利 US 2008/0014884 A1中, 一个由多 个无线节点组成的簇在与对端节点通信之前互相通信协商多节点联合通 信, 但是这些节点都是终端节点, 其中没有移动通信基站参与分簇; 在专利 US2008/02060064 Al中, 来自两个或者多个基站的天线单元被 用于组成多天线阵列。 但是, 在这篇专利中, 假设基站簇已经实现建立好, 没有具体的分簇方法被提及;
在专利 US2008/003022 A3中, 两个发送节点联合起来与一个接收节点 通信, 但是没有分簇算法的具体内容; 发明内容
本发明提供一种通信控制装置、 通信控制方法及系统, 利用动态分簇 在移动通信系统中提供高效的多基站联合服务。 能够根据终端与各个基站 的通信状态选择最优的基站分簇, 减少用于计算基站分簇的信令和资源开 销。 附图说明
图 1是已有的简单的多基站联合服务场景
图 2是已有的中心控制的多基站联合服务系统框架
图 3是已有的多基站联合服务中静态分簇的示例
图 4是本发明中支持中心动态分簇的多基站联合服务系统
图 5是用于信道状态信息估计的导频信息的封装格式
图 6是动态分簇信令流程
图 7是本发明的中心分簇服务器中动态分簇流程
图 8是本发明的动态分簇之后, 终端触发的多基站联合服务的典型信令流 程
图 9是本发明的动态分簇之后, 基站触发的多基站联合服务的典型信令流 程
图 10是本发明的基站间信令的基本格式
图 11是本发明的基站间协商联合传输的请求信令的 X2AP字段实现示例 图 12是本发明的基站间协商联合传输的应答信令的 X2AP字段实现示例 图 13是本发明的单天线基站的内部结构
图 14是本发明的多天线基站的内部结构示例 (2天线)
图 15是本发明的中心分簇服务器的内部典型结构 图 16是本发明中心分簇服务器的内部信息流向图
图 17是本发明的中心分簇服务器中信道状态信息表的典型结构
图 18是本发明的中心分簇服务器中信道状态信息表的一个实现示例 图 19是本发明的用于动态分簇算法的干扰关系图的一个实现示例
图 20是本发明的通信控制系统中部分移动终端移动后的实现示例
图 21是本发明的通信控制系统中部分移动终端移动后的信道状态信息表 图 22是本发明中动态分簇算法的优越性对比图 具体实施方式
下面描述的实例是基于 3GPP LTE-A通信系统。 本发明可以被应用于其 他支持多基站联合服务的移动通信网络。
图 4是本发明的支持中心动态分簇的多基站联合服务系统框架。 是基 于图 2中的 3GPP标准组织制定的 LTE-Advanced网络的应用实例, 本发明 的中心分簇服务器的构成可以是独立设置在网络中的中心分簇服务器 9,或 者是在已有的基站控制器中附加设置了具有动态分簇功能的基站控制器 8。 在本发明中后面的叙述中, 提到的中心分簇服务器包括这两种设置情况。 本发明中, 对传统的基站进行升级, 均需要支持基本的单基站无线服务或 者多基站联合无线服务。如图 4,基站接收来自各终端的信道状态信息向量, 将其发送给中心分簇服务器, 或者把信道状态信息转换为简单信道状态信 息发送给中心分簇服务器。 中心分簇服务器利用各基站发来的各终端的信 道状态信息, 对各基站进行分簇, 并将分簇结果发送给各基站。 此外, 基 站按照该动态分簇结果与当前基站簇内的其他基站进行协商, 实现多基站 联合无线服务。
图 5是用于信道状态信息估计的导频信息的封装格式。 对于单天线基 站 (图中的基站 1 ), 需要在下行控制信道链路中周期性加入已知预定义的 导频— 1501, 终端可以使用导频— 1501 中的信息计算与该基站之间的信道状 态信息。 其他的空中接口资源可以用于下行数据 502 的传输。 对于多天线 基站 (图中的实例为两天线基站 1 和 2 ) , 可以加入可选的通用导频标识 503, 并加入天线端口信息 504, 通用导频信息 505。 此外, 针对每个天线 的导频—2—1 506和导频—2— 2 506可以分别传输,终端可以使用导频— 2—1 506 和导频—2— 2 506中的信息计算与该多天线基站的每个天线之间的信道状态 信息。
导频信息的内容是预先在所有终端和基站共享的已知训练序列。 当终 端接收到来自于某个基站发送的用于信道估计的导频信息时, 将接收到的 导频信息和已经共享的导频进行比较。 往往经过无线信道传输的导频内容 会和终端本地已知的导频内容有差别。 终端通过比较其差别估计出信道状 态信息。 得到的信道状态信息至少包含终端到基站之间的信道衰落情况和 相位偏转情况。
图 6是动态分簇信令流程。 首先所有终端 1-m周期性的接收到来自各 自主服务基站 1-n的导频信息 (过程 601 )。 然后终端开始计算对应各个基 站的信道状态信息 ¾ ( ¾代表基站 i和终端 j之间的信道状态信息) (过程 602 )。 这里的信道状态信息一般表现为复数形式, 由于根据导频信息计算 信道状态信息是本领域技术人员公知的技术, 因此在此不再详述。 接着, 每个终端 j生成自己的信道状态信息向量 并汇报给各自的主服务 基站 (过程 603 ), 其中某些信道状态信息 为 0; 随后, 所有的基站向中 心分簇服务器汇报全部信道状态信息 (过程 604), 汇报的信道状态信息可 以为原始信道状态信息, 也可以是简单的信道状态信息, 这里的简单的信 道状态信息是对原始信道状态信息取绝对值后的状态信息; 在接收到汇报 的信道状态信息后, 中心分簇服务器需要首先更新信道状态信息表 (过程 605); 在动态分簇计时器到期的时候, 进行动态分簇调度 (过程 606 ); 调 度结束后中心分簇服务器把调度的结果发送给所有的基站; 基站将当前簇 的状况广播给本小区内的所有终端 (过程 608 ); 当终端或者基站触发使用 多基站联合服务时遵从当前的分簇情况 (过程 609)。 以后, 终端根据各个 基站周期性广播的导频信息计算信道状态信息, 继续为下一次分簇提供信 道状态信息。
图 7是本发明的中心分簇服务器中动态分簇流程。中心分簇服务器(通 信控制装置) 接收到来自基站的所有的简单信道状态信息, 更新信道状态 信息表 (过程 701 )。 当需要进行分簇调度的时候, 中心分簇服务器根据信 道状态信息表组成信道状态信息矩阵 (过程 702 ) : 11 21 nl
H、 H
Figure imgf000008_0001
H 是基站 y所主服务的所有移动终端与基站 X之间的简单信道状态信息 汇总。 该汇总的方式可能有很多种。 比如:
如果针对每个多基站服务时隙进行动态分簇调度的话,
K =' 1
为当前基站 y所服务的移动终端 j与基站 X之间的信道状态信息; 如果动态分簇调度的周期为多个多基站服务时隙的话, H^可以取在这 个周期内基站 y所服务的所有移动终端与基站 X之间的信道状态信息的绝 对值的平均值或者加权平均值。
中心分簇服务器根据信道状态信息矩阵计算各基站相互间对于对方主 服务终端的干扰系数 :
Figure imgf000008_0002
并组成基站干扰关系图 (过程 703 ), 该干扰关系图为无向图, 图中节 点数目与参与动态分簇调度的基站的数目一致, 每个节点对应其中一个基 站。 节点间的边的权重为对应两个基站之间的干扰系数 。
根据每簇基站数计算所有的分簇参数 Li。 并把所有的分簇可能按分簇 参数由大到小排列为未调度列表 (过程 704)。 对应某个基站分簇可能的分 簇参数 Li的计算可以根据以下原则:
Li =∑wab (3)
ab
w a, b 为(2)中所定义的基站间干扰系数, 在这里, 其中一个基站(a或 者 b ) 属于当前基站分簇, 另外一个基站不属于当前基站分簇。
每个基站簇内的基站数可以在中心分簇服务器中事先设定, 也可以根 据某种原则动态决定。
然后开始动态分簇调度。 该调度的基本准则是在同一基站簇内的所有 基站之间的干扰系数 可以贡献为多基站联合服务的信道增益。 但是, 如 果两个基站不在同一个基站簇内的话, 它们之间的干扰系数 则贡献为多 基站联合服务的信道干扰。 例如对于某一个/ 来说, 如果基站 y与基站 X 在同一基站簇内的话, 他们可以进行多基站联合服务, 那么基站 y所主服 务的所有移动终端与基站 X之间的所有信道增益都可以作为联合服务的信 道增益。 如果最终基站 y与基站 X不在同一基站簇内的话, 他们不能进行 多基站联合服务, 基站 y所主服务的所有移动终端与基站 X之间的所有信 道增益对于这两个基站所各自进行的联合服务来说都是信道干扰。 因此, 动态基站分簇的目标就是找到最优的分簇方案, 使得每个基站簇之间的信 道干扰为最低, 信道增益为最大。
基本的调度流程如下:
第一步 705 :初始化未分簇集合 E为所有基站节点和已分簇基站集合 U为空 集合 Φ ;
第二步 706: 选择当前具有最小分簇参数 Li分簇集^ 检查是否 ί/, 如 果结果为是, 进入第三步 707, 如果, 结果为否, 进入第五步;
第三步 707 : Ε = Ε _ θ, υ = υ + θ
第四步 708: 接受当前具有最小分簇参数的分簇集 为有效分簇;
第五步 709: 从最初未调度列表中移除当前具有最小分簇参数的分簇集 ; 第六步 710: 判断 E = 0>或者未分簇集合 E中的剩余基站数目小于当前设定 的基站簇内的基站数目? 如果结果为是, 进入第六步, 如果结果为否, 转 到第二步,;
第七步 711 : 结束分簇调度, 发送分簇结果给所有的基站。
图 8是本发明的动态分簇后, 终端触发的多基站联合服务的典型信令 流程。 当在某一时刻基站动态分簇结果已经由中心分簇服务器发至所有基 站(过程 801 ),基站可将动态基站分簇结果发送给对应的终端(过程 802 ) ; 当终端决定使用当前簇的多基站联合服务 (过程 803 ), 它将向其对应的主 服务基站发送消息触发多基站联合服务 (过程 804) ; 主服务基站可选择进 行相关的鉴权等过程 (过程 805 ); 在这过程中, 终端周期性的向主服务基 站汇报与当前基站簇内所有的基站之间的信道状态信息 (过程 806 ); 主服 务基站如果认为可以对该终端进行多基站联合服务, 则与当前基站簇内的 其他基站协商联合传输 (过程 807 ); 如果协商成功, 主服务基站把联合传 输的关键参数通知给该终端 (过程 808), 当前基站簇内的所有基站根据协 商结果分配资源和进行相关的设定 (过程 809 ); 这样多基站联合服务就可 以在当前基站簇内的所有基站和对应终端之间进行 (过程 810 ); 此外, 基 站还需要向中心分簇服务器周期性的汇报简单信道状态信息用于下一次动 态分簇调度 (过程 811 )。
图 9是本发明的动态分簇之后, 基站触发的多基站联合服务的典型信 令流程。 当在某一时刻基站动态分簇结果已经由中心分簇服务器发至所有 基站 (过程 901 ), 基站可选择将动态基站分簇结果发送给对应的终端 (过 程 902 ); 当主服务基站决定使用当前簇的多基站联合服务 (过程 903 ), 它 将向其对应终端发送消息触发多基站联合服务 (过程 904) ; 在这过程中, 终端周期性的向其对应的主服务基站汇报与当前基站簇内所有的基站之间 的信道状态信息 (过程 905 ); 主服务基站如果认为可以对该终端进行多基 站联合服务, 则与当前基站簇内的其他基站协商联合传输 (过程 906 ); 如 果协商成功, 主服务基站把联合传输的关键参数通知给该终端(过程 907), 当前基站簇内的所有基站根据协商结果分配资源和进行相关的设定 (过程 908 ); 这样多基站联合服务就可以在当前基站簇内的所有基站和对应终端 之间进行 (过程 909 ); 此外, 基站还需要向中心分簇服务器周期性的汇报 简单信道状态信息用于下一次动态分簇调度 (过程 910)。
图 10是本发明的基站间信令的基本格式。 该信令为 SCTP/IP数据包, 可以是 IPv4, 也可以是 IPv6。 在通用 IP包头 1001中, 目的地址为目标基 站的 IPv4/IPv6地址 1002, 源地址为源基站的 IPv4/IPv6地址 1003。 通用 IP包头 1001后面为通用 SCTP包头 1004。 最后为符合 3GPP X2AP协议的消 息体 1005ο
图 11是本发明的基站间协商联合传输的请求信令的 Χ2ΑΡ字段 1005实 现示例。 必须具备的信息单元包括: 1) 消息类型单元 1101, 该单元的取值 由 3GPP等标准组织定义, 需要能够标识多基站协作请求功能; 2) 主服务 基站的对应终端的 Χ2ΑΡ协议标识 1102,此标识在主服务基站向目标基站的 方向, 可以唯一的标识一个终端; 3) 目标基站标识 1103; 4) 目标基站的 相关小区标识 1104; 5) 多基站联合服务请求类型 1105 (可以为开始, 结 束等等); 6) 请求汇报的内容 1106, 该字段为 32位的位序列, 每个比特对 应一个信息内容, 如果某比特数值为 1, 则表示需要目标基站在应答消息中 加入对应信息 (例如第一个比特对应预编码选项, 第二个比特对应联合服 务的输出功率, 第三个比特对应调制速率等等); 7) 目标基站与对应终端 之间的信道状态信息 1108。 可选信息可以包括: 1) 目标基站与主服务基站 之间的信息汇报周期 1107 ; 2) 其他的一些可选信息 1109。
图 12是本发明的基站间协商联合传输的应答信令的 X2AP字段 1105实 现示例. 必须具备的信息单元包括: 1) 消息类型单元 1201, 该单元的取值 由 3GPP等标准组织定义, 需要能够标识多基站协作应答功能; 2) 主服务 基站上对应终端的 X2AP协议标识 1202,此标识在主服务基站向目标基站的 方向, 可以唯一的标识一个终端; 3) 目标基站上对应终端的 X2AP协议标 识 1203, 此标识在目标基站向主服务基站的方向, 可以唯一的标识一个终 端; 4) 目标基站的相关小区标识 1204; 5) 多基站联合服务请求类型 1205 (可以为开始, 结束等等), 应该与 X2AP请求消息中的对应信息单元的内 容相同; 6) 应答汇报的内容 1206, 该字段为 32位的位序列, 每个比特对 应一个信息内容, 如果某比特数值为 1, 则表示目标基站在应答消息中加入 了对应信息, 应该与 X2AP请求消息中的对应信息单元的内容相同。 可选信 息可以包括: 1) 目标基站与源基站之间的信息汇报周期 1207 ; 2) 预编码 选项 1208; 3) 联合传输的功率 1209; 4) 调制速率 1210; 5) 其他的一些 可选信息 1211。
图 13是本发明的单天线基站的内部结构。 基站的内部结构主要包括高 频模块 1322, 基带模块 1307, 上层信令与控制模块 1308, 与接入网相连的 网络接口模块 1309,多基站服务控制单元 1311用于控制多基站服务以及与 中心分簇服务器通信; 与中心分簇服务器通信的网络模块 1310; 信道状态 信息矩阵 1312; 预编码选项 1313; 信道估计单元 1318。 在高频模块 1322 中, 至少包括一根物理天线 1301, 一个或者多个高频复用单元 1302, 一个 或者多个射频单元 1303。 高频模块 1322 的下行部分包括联合预编码单元 1304, 下行导频生成单元 1305, 至少一个多层映射单元 1306, 以及下行时 分控制单元 1319以及发送射频控制部分 1318。 高频模块 1322的下行部分 包括联合解预编码单元 1321, 上行训练序列分析单元 1305, 至少一个多层 解映射单元 1316, 以及上行时分控制单元 1320。 基带部分至少包括至少一 个信道编码与调制模块 1312和至少一个信道解码与解调模块 1313。
图 14是本发明中多天线基站的内部结构示例(2天线)。基站的内部结 构主要包括高频模块 1424, 基带模块 1410, 上层信令与控制模块 1411, 与 接入网相连的网络接口模块 1412,多基站服务控制单元 1414用于控制多基 站服务以及与中心分簇服务器通信; 与中心分簇服务器通信的网络模块 1413; 信道状态信息矩阵 1425; 预编码选项 1415; 信道估计单元 1420。 在 高频模块 1424中, 至少包括至少两根物理天线 1401和 1402, 一个或者多 个高频复用单元 1403, 一个或者多个射频单元 1404。 高频模块 1424的下 行部分包括至少一个联合预编码单元 1405, 至少两个下行导频生成单元 1407 和 1408, 至少一个多层映射单元 1409, 至少一个公共导频生成单元 1406, 至少两个下行时分控制单元 1421, 以及发送射频控制与多天线控制 部分 1416。 高频模块 1424的下行部分包括至少一个联合预编码单元 1423, 至少两个上行训练序列分析单元 1417 和 1418, 至少一个多层解映射单元 1419, 至少两个下行时分控制单元 1422。 基带部分至少包括至少两个信道 编码与调制模块 1416和至少两个信道解码与解调模块 1415。
图 15是本发明中中心分簇服务器即通信控制装置的内部典型结构。 网 络接口包括输入线接口(input l ine interface) 1501和输出线接口(output l ine interface) 1503。 同时, 网络接口还包括接收缓冲区(receiving buffer) 1502, 每个接收缓冲区都连着输入线接口 1502 和内部总线 (internal bus) 1514, 发送缓冲区(sending buffers) 1504, 每个发送缓 冲区都连着输出线接口 1503和内部总线 1514。 内部总线 1514还至少连着 处理器 (processor) 1505, 程序存储器 (program memory) 1506禾口数据存储 器(data memory) 1511。 程序存储器 1506里存放着处理器 1505执行的功 能模块, 至少包括: 包发送和接收模块 1510, 分簇控制模块 (clustering control module) 1507主要控制动态基站分簇的调度, 多基站联合服务分 簇控制信令模块 1508 (CoMP signal ing control module) , 和基本的控制 模块 (basic control routine) 1509用来选择启动其他模块。 数据存储器 1511 中存放本发明中新加入的信道状态信息表 1512 ( Channel Status Information Table ) 以及其他的一些数据信息 1513。
本发明在程序存储器 1506中加入了新的模块主要为分簇控制模块 1507。 它的具体任务包括:
1. 当收到来自各个基站的信道状态信息汇报的时候, 将汇报的信道状 态信息更新到信道状态信息表 1512中; 如果来自基站的汇报为原始信道状 态信息, 分簇控制模块 1507需要将其转换成简单信道状态信息, 然后存入 信道状态信息表 1512中;
2. 维护动态分簇调度计时器, 当该计时器到期的时候, 重新进行动态 分簇调度;
3. 配置有基站簇内的基站数目; 该数目的大小可以又运营商手 动配置, 或者通过别的方法动态配置;
4. 当进行动态分簇调度的时候, 按照图 7中所示的方法进行调 度;
5. 当调度完成后, 将调度的结果发送给所有的基站;
6. 分簇控制模块 1507通过多基站联合服务分簇控制信令模块 1508与 其他网络设备的通信方法如图 6所示。
此外, 在程序存储器 1506 中加入了新的多基站联合服务分簇控制信令 模块 1508, 用于维护与其他网络设备的信令通信。 多基站联合服务分簇控 制信令模块 1508 至少需要将来自各个基站的汇报转发到分簇控制模块
1507, 还需要将分簇控制模块 1507进行动态基站分簇调度的结果发送给 所有的基站。
本发明在数据存储器 1511 中加入了新的模块主要为信道状态信息表 1512, 该表的细节如图 17所示, 包括终端 1701、 各基站的信息 1702例如 信道状态信息、 主服务基站等。 分簇控制模块 1507在接收到来自各个基站 的汇报进行总结, 并更新该表。 同时, 分簇控制模块 1507也回以表中的内 容为参考, 进行动态基站分簇调度。
图 16是本发明中中心分簇服务器的内部信息流向图。 来自各个基站的 周期性简单信道状态信息 1601首先被输入线接口 1501和输入缓冲区 1502 接收, 通过总线 1514到达包发送和接收模块 1510。然后, 包发送和接收模 块 1510 把信道状态信息 1601 转交给多基站联合服务分簇控制信令模块
1508。 经过会话控制后, 该信息被发至分簇控制模块 1507, 之后被存储在 信道状态信息表 1512中。 当需要进行动态分簇调度的时候, 分簇控制模块 1507从信道状态信息表 1512中取得当前的信道状态信息 1601, 然后进行 动态分簇调度, 将基站分簇的结果 1602转交给多基站联合服务分簇控制信 令模块 1508。 经过会话控制, 该信息被发至包发送和接收模块 1510, 并通 过输出线接口 1503 和输出缓冲区 1504 最终通过网络将基站分簇的结果 1602发送给所有基站。 中心分簇服务器中的所有数据和信令流向都由处理 器 1505通过基本控制模块 1509来控制, 并通过数据或者控制总线 1514转 发。
图 17是本发明中中心分簇服务器中信道状态信息表 1512的典型结构。 该表存在于中心分簇服务器的数据存储器 1511当中。信道状态信息表 1512 的每一个行 1706都对应一个移动终端, 其中包括终端的标识 1701, 该终端 含有多个表项 1702 表示与每一个基站的信道信息和服务关系。 每个表项 1702都含有简单的信道状态信息 1704, 以及该终端与对应的基站的主服务 关系 1705。
在这里举一个简单的应用实例, 在实例中有 4个基站和 5个移动终端。 假设每个基站都只有一个天线, 在同一时间只能服务一个终端, 同时假设 基站和中心分簇服务器间的网络足够支持精确到每个时隙的动态基站分簇 调度。
图 18是本发明的中心分簇服务器中信道状态信息表 1512 (图 17 ) 的 一个实现示例。 每一个行 1806都对应一个移动终端, 其中包括终端的标识 1801,该终端含有多个表项 1802表示与每一个基站的信道信息和服务关系。 每个表项 1802都含有简单的信道状态信息 1804、以及该终端与对应的基站 的主服务关系 1805。
假设在某一个时隙, 基站 17只服务终端 12。 那么, 根据图 18的信道 状态信息表 1512中的内容, 生成的简单信道状态信息矩阵 如下:
2.0 0.4 0 0.9
0 2.4 0.7 0
0 0.9 2.2 0
0.8 0 1.6 2.5
根据这个矩阵, 可以生成如图 19那样的干扰关系图。 图 19是本发明 中用于动态分簇算法的干扰关系图的一个实现示例。 生成的干扰关系突为 无向图, 每个节点 1901对应一个基站, 每两个节点之间的边 1902对应两 个基站之间的干扰关系, 其权重 (weight ) 为两个基站的干扰系数 1903。 该干扰关系图由中心分簇服务器的分簇控制模块 1507根据当前信道状态信 息表 1512中的内容生成。 图 19中的所有干扰系数 1903的计算结果如下: W12 = 0.16 - W13 = 0 . W14 = 1.45 .
W23 = 1.3 . W24 = 0 . W12 = 1.45
假设每个基站簇内的基站数为 2。这样, 没种基站簇的可能性的分簇参 数 的计算如下 (按照由小到大的方式排列) :
Figure imgf000015_0001
最终按照图 7中提到的方法, 中心分簇服务器将选取两个基站簇( {2, 3} 和 {1,4} . ) 作为最终的结果。
对于更多数目(假设为 P)的基站簇, 分簇参数 的计算与图 7 中的方 法相同。 这样生成的分簇可能性有 个, 选取的方法也和图 7中的方法相 同。
对于更多数目(假设为 P)的基站簇, 分簇参数 的计算与图 7 中的方 法相同。 这样生成的分簇可能性有 个, 选取的方法也和图 7中的方法相 同。
本发明中图 7所提到的根据信道状态信息对基站进行动态分簇的方法 可以采用其它的方法。 例如, 中心分簇服务器可以根据以下方法进行分簇: 步骤一: 中心分簇服务器从信道状态信息表中取出所有的简单信道状态信 息;
步骤二: 将每一个基站中所主要服务的所有终端对于其他基站的简单信道 状态信息分别求和 ( 表示基站 y对于基站 X中的所有终端的简单信道 状态信息和);
步骤三: 把所有的基站按照所主要服务的终端数量进行排序组成未分簇基 站集合 E, 并初始化已分簇基站集合 U为空集合;
步骤四: 对于当前数目(假设为 P)的基站簇, 从主服务终端数量最多的基站 开始, 选择 P-1个最大 的基站形成有效基站簇, 并把这个基站簇内的 P 个基站从未分簇集合 E中删除, 加入已分簇集合 U;
步骤五: 如果当前未分簇集合 E为空集合或者当前未分簇集合 E中剩余的 基站数小与没基站簇的基站数, 进入步骤六, 否则回到步骤四;
步骤六: 结束分簇算法, 将分簇结果发给所有的基站。
再例如, 中心分簇服务器还可以根据以下方法进行分簇:
步骤一: 中心分簇服务器从信道状态信息表中取出所有的原始信道状态信 息;
步骤二: 针对每个终端, 根据其与其他非主服务基站的信道状态信息, 选 择对当前终端进行多基站联合服务无线利用率最高的 P-1 个非主服务基站 作为当前终端的临时最优分簇。 在计算无线利用率的时候, 需要根据原始 信道状态信息中衰落和信道偏移信息, 首先推算出多基站联合服务传输矩 阵, 然后根据传输矩阵计算该临时分簇内所有基站对当前终端进行服务的 无线利用率, 再求和;
步骤三: 把所有的基站组成未分簇基站集合 E , 并初始化已分簇基站集合 U 为空集合, 并把所有终端组成终端集合 W;
步骤四: 首先提取终端集合 W 中所有的终端的临时最优分簇重合最多的分 簇作为当前有效分簇, 并把这个基站簇内的 P个基站从未分簇集合 E中删 除, 加入已分簇集合 U, 最后把选择当前簇作为临时最优分簇的所有终端从 终端集合 W中删除;
步骤五: 如果当前未分簇集合 E为空集合, 或者当前未分簇集合 E中剩余 的基站数小与没基站簇的基站数, 或者终端集合 W为空集合, 进入步骤七, 否则进入步骤六;
步骤六: 如果可以提取终端集合 W中所有的终端的临时最优分簇重合最多 的分簇, 进入步骤四, 如果有两个和两个以上 (假设有 T个) 重合最多的 临时最优分簇选择, 把每个分簇选择对应终端的无线利用率求和 (假设为 st , t对应当前 τ个临时最优分簇选择中的一个), 提取具有最大 的临时 最优分簇选择 t, 作为当前重合最多的分簇, 进入步骤四;
步骤七: 结束分簇算法, 将分簇结果发给所有的基站。
以下讨论本发明的另一种情况, 即通信控制系统中有部分终端移动时 的情况。
图 20是本发明的通信控制系统中部分移动终端移动后的实现示例。 图 21是本发明的通信控制系统中部分移动终端移动后的信道状态信息表。
假设在某一个时隙, 上述实例中的终端 1并没有移动, 而终端 2, 终端
3和终端 4分别移动到了某个位置, 如图 20所示, 信道状态信息表就变成 如图 21的内容。 基站 17只服务终端 12, 目前的基站分簇的形式还是根据 图 18中的内容进行动态分簇的结果。那么, 根据当前信道状态信息表图 21 中的内容, 生成的简单信道状态信息矩阵 如下:
2.0 0.4 0 0.9
0.8 1.9 0.5 0.2
0.3 0 2.6 0.6
0.1 0.5 0.7 2.1
根据这个矩阵, 同样可以生成如图 19那样的干扰关系图。 图 19是本 发明中用于动态分簇算法的干扰关系图的一个实现示例。 生成的干扰关系 突为无向图, 每个节点 1901对应一个基站, 每两个节点之间的边 1902对 应两个基站 7之间的干扰关系, 其权重 (weight ) 为两个基站的干扰系数 1903。 该干扰关系图由中心分簇服务器中的分簇控制模块 1907根据当前信 道状态信息表 1912中的内容生成。 图 19中的所有当前干扰系数 1903的计 算结果如下:
W12 = 0.80; W13 = 0.09; W14 = 0.82;
W23 = 0.25; W24 = 0.29; W34 = 0.85
假设每个基站簇内的基站数为 2。这样, 某种基站簇的可能性的分簇参 数 的计算如下 (按照由小到大的方式排列) :
Figure imgf000017_0001
最终按照图 7中提到的方法, 中心分簇服务器将选取两个基站簇({ 1, 2} 和 {3,4} . ) 作为最终的结果。
因此, 在这种情形下, 即使终端 1 没有改变位置即静止状态, 动态基 站分簇仍旧被改变了。 本发明中的动态基站分簇方法基于当前网络中所有 的基站和终端之间的无线链路的干扰, 在某些终端无线信道状况不变, 同 时某些终端无线信道状况变化的时候, 分簇的结果也有可能受到影响。 即 使所有终端的位置都不变, 但是周边环境发生了变化 (比如说某些终端的 周边被临时出现的遮挡物影响到与相关基站的信道状况), 造成了无线信道 状况的变化, 分簇的结果会或多或少的受到影响。 但是, 本发明中的动态 基站分簇方法总是能找到当前信道状态下最优的分簇方法。
图 22是本发明中动态分簇算法的优越性对比。 横轴 2202是接收信噪 比 SNR, 单位是 dB, 纵轴 2201是当前系统的平均容量, 单位是 bi t/s/Hz。 图中有四条曲线, 理论上最优的曲线是最上面的一条 2203, 该理论值是由 香农信道公式计算出来:
信道容量 /频宽 = log(l +信号干扰比)。
曲线 2204是经过本发明中动态分簇之后, 进行多基站联合服务的平均 性能, 曲线 2205是静态分簇的时候多基站联合服务的平均性能, 曲线 2206 是没有使用多基站联合服务的平均性能。 可以看出,
本发明中的动态分簇方法相比静态分簇性能有明显的提升, 更加接近 理论的理想值, 同时分簇算法还很简单。 曲线 2204, 2205和 2206是在多 个基站多个终端的网络中, 进行大量仿真后得到的统计分布结果。
本发明的移动终端可以是携带电话、 或者是具有无线上网功能的笔记 本电脑、 也可以是其它具有无线通信功能的通讯设备。
本发明的优越性描述:
(1) 动态的找出当前网络中最优的基站分簇组合
(2) 动态分簇调度所利用的参数为各个终端汇报到网络侧的基本的信道状 态信息, 现有终端不用进行改动就可以支持本发明中的系统和方法
(3) 移动通信基站汇报到中心分簇服务器的信息为简化的信道状态信息, 节省了通信带宽。
(4) 所有的调度都是基于简化的实数信道状态信息进行的计算的, 且计算 的方法都是四则运算及平方运算, 计算量非常小, 且非常适合硬件实现, 使针对每个通信时隙粒度的动态分簇调度成为可能
(5) 分簇的方法对于各种基站簇的大小都适用
(6) 对现有移动通信基站和终端的改动非常小。

Claims

权 利 要 求 书
1. 一种通信控制装置, 通过网络与多个基站链接, 对所述多个基站进 行动态分簇, 使分簇的多个基站联合对移动终端提供服务, 其特征在于, 包括:
接口, 与多个基站链接, 接收来自所述各基站的关于移动终端的信道 状态信息;
存储部, 存储从所述接口接收的移动终端的信道状态信息;
控制部, 根据所述存储部存储的移动终端的信道状态信息, 对所述各 基站进行动态分簇。
2.根据权利要求 1所述的通信控制装置, 其特征在于,
所述信道状态信息是各个移动终端通过接收来自各个基站的导频信息 并计算而生成的。
3.根据权利要求 2所述的通信控制装置, 其特征在于,
所述移动终端将与各个基站的通信状态信息以信道状态信息向量的方 式发送给其主基站。
4.根据权利要求 1所述的通信控制装置, 其特征在于,
所述存储部存储有信道信息状态表, 该信道信息状态表包括移动终端 标识、 该移动终端与所有上述移动通信基站之间的信道状态信息、 该移动 终端与所有上述基站之间的主服务信息;
所述控制部, 根据所述存储部存储的移动终端的信道状态信息表, 决 定各个移动终端的最优的基站分簇。
5.根据权利要求 4所述的通信控制装置,
上述信道状态信息表中存储的信道状态信息是原始信道状态信息, 或 者是取原始信道状态信息的绝对值的简单信道状态信息。
6.根据权利要求 4所述的通信控制装置, 其特征在于,
当所述通信控制装置的接口接收到来自所述基站的信道状态信息时, 用该信息更新所述信道状态信息表。
7.根据权利要求 4所述的通信控制装置, 其特征在于,
还具有计时器, 用于决定动态分簇操作的周期;
每当所述计时器计时到期时, 所述通信控制装置的控制部进行动态基 站分簇调度。
8.根据权利要求 2所述的通信控制装置, 其特征在于,
所述基站具有一个或者多个物理天线。 所述移动终端通过所述基站的 一个或多个物理天线接收导频信息。
9. 根据权利要求 1所述的通信控制装置, 其特征在于,
还具有信令模块, 与上述基站建立通信连接, 当所述控制部对所述各 基站完成动态分簇后, 将分簇结果通知所有基站。
10. 根据权利要求 9所述的通信控制装置, 其特征在于, 当所述基站 将所述分簇结果发送给所述移动终端时, 所述移动终端向对应的主服务基 站发送消息, 触发多基站联合服务。
11. 根据权利要求 1所述的通信控制装置, 其特征在于,
每个基站分簇的基站数量被静态或动态设定。
12.—种通信系统的通信方法, 所述通信系统包括多个移动终端、 向各 个移动终端提供服务的多个基站、 对基站进行控制的通信控制装置; 所述 通信控制装置具有存储部, 存储信道信息状态表, 其特征在于: 包括以下 步骤:
所述通信控制装置接收来自所有所述基站汇报的信道状态信息, 并用该 信息更新上述信道状态信息表;
当上述动态分簇操作计时器到期的时候, 所述通信控制装置触发动态基 站分簇调度;
所述通信控制装置从上述信道状态信息表中提取所述移动终端与所述 基站的信道状态信息, 根据该信道状态信息决定对各个终端最佳的基站分 簇;
所述通信控制装置把分簇的结果发送给所有的上述基站, 并由所述基 站转发给所述移动终端;
各个基站按照上述分簇的结果对所述基站进行服务。
13. 根据权利要求 12所述的通信方法, 其特征在于,
上述通信控制装置进行动态基站分簇的方法还包括:
从上述信道状态信息表中提取相关移动终端与所有基站的信道状态信 息, 并组成信道状态信息矩阵; 根据信道状态信息矩阵中的各个元素计算每两个上述移动通信基站之 间的干扰系数, 并组成动态基站分簇图;
根据配置的上述每个基站簇内的基站数目, 得出所有分簇可能性的分 簇参数;
不断进行具有最小分簇参数的分簇, 判断其作为有效分簇的可能性, 直到所有的上述基站都属于某一个基站分簇;
把分簇的结果发送给所有的上述基站。
14. 根据权利要求 12所述的通信方法, 其特征在于,
所述信道状态信息是各个移动终端通过接收来自各个基站的导频信息 并计算而生成的。
15. 根据权利要求 12所述的通信方法, 其特征在于,
所述移动终端将与各个基站的通信状态信息以信道状态信息向量的方 式发送给其主基站。
16. 根据权利要求 12所述的通信方法, 其特征在于,
所述信道信息状态表包括移动终端标识、 该移动终端与所有上述移动 通信基站之间的信道状态信息、 该移动终端与所有上述基站之间的主服务 信息。
17. 根据权利要求 16所述的通信方法, 其特征在于,
上述信道状态信息表中存储的信道状态信息是原始信道状态信息, 或 者是取原始信道状态信息的绝对值的简单信道状态信息。
18.—种通信系统, 包括多个移动终端、 向各个移动终端提供服务的多 个基站、 对基站进行控制的通信控制装置;
所述移动终端将与各个基站的通信状态信息周期性地发送给所述基 站;
所述通信控制装置, 包括:
接口, 与多个基站链接, 接收来自所述各基站的关于移动终端的信道 状态信息;
存储部, 存储从所述接口接收的移动终端的信道状态信息;
控制部, 根据所述存储部存储的移动终端的信道状态信息, 对所述各 基站进行动态分簇。
19. 一种移动通信系统, 在服务区域内有多个对移动终端提供服务的 基站, 对一台移动终端提供服务的多个所述基站被分簇来提供服务, 其特 征在于, 所述移动通信系统被构成为: 当使某个移动终端静止地来使用该 移动终端时, 所述基站的分簇构成发生变化。
PCT/CN2010/072341 2009-04-30 2010-04-29 移动通信中基站动态分簇的设备和方法 WO2010124647A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2012507596A JP5411985B2 (ja) 2009-04-30 2010-04-29 モバイル通信における基地局動的クラスタリングの設備と方法
US13/266,898 US8942757B2 (en) 2009-04-30 2010-04-29 Device and method for base stations dynamic clustering in mobile communication
EP10769336.8A EP2426975A4 (en) 2009-04-30 2010-04-29 DEVICE AND METHOD FOR DYNAMIC BASIC STATION CLUSTERING IN MOBILE COMMUNICATION

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910132283.4A CN101877918B (zh) 2009-04-30 2009-04-30 移动通信中基站动态分簇的设备和方法
CN200910132283.4 2009-04-30

Publications (1)

Publication Number Publication Date
WO2010124647A1 true WO2010124647A1 (zh) 2010-11-04

Family

ID=43020353

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/072341 WO2010124647A1 (zh) 2009-04-30 2010-04-29 移动通信中基站动态分簇的设备和方法

Country Status (5)

Country Link
US (1) US8942757B2 (zh)
EP (1) EP2426975A4 (zh)
JP (2) JP5411985B2 (zh)
CN (1) CN101877918B (zh)
WO (1) WO2010124647A1 (zh)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2013069536A1 (ja) * 2011-11-07 2013-05-16 株式会社エヌ・ティ・ティ・ドコモ 無線通信システム、無線基地局装置、ユーザ端末及び無線通信方法
WO2013112008A1 (en) 2012-01-27 2013-08-01 Samsung Electronics Co., Ltd. Method and system for providing service in a wireless communication system
US8908602B2 (en) 2011-03-02 2014-12-09 Hitachi, Ltd. Clustering method of mobile communication and remote radio head thereof
CN104412682A (zh) * 2013-01-18 2015-03-11 华为技术有限公司 资源分配方法及装置
CN105282748A (zh) * 2014-06-06 2016-01-27 中国移动通信集团浙江有限公司 一种划分通信网络的基站簇的方法和装置
US9294960B2 (en) 2010-02-11 2016-03-22 Huawei Technologies Co., Ltd. Method, apparatus and system for cooperative resource scheduling and cooperative communication
CN105472625A (zh) * 2014-09-05 2016-04-06 中国移动通信集团公司 一种高空平台协作覆盖方法、装置及高空平台

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2483306A (en) * 2010-09-06 2012-03-07 Fujitsu Ltd Base station cooperation in a MIMO wireless communication system using inter-group interference information to improve system performance
CN102045744B (zh) * 2010-12-07 2015-11-25 华为技术有限公司 一种批量升级基站的方法和系统
CN102111840B (zh) * 2011-01-11 2013-05-01 清华大学 一种无线通信中多点协作下的基站分簇方法
CN102625458B (zh) * 2011-01-30 2017-04-19 三星电子株式会社 用于多基站多用户系统中的调度设备和调度方法
CN102170704B (zh) * 2011-05-25 2013-11-06 北京工业大学 一种上行多小区基站协作用户调度方法
US20130301423A1 (en) * 2012-05-11 2013-11-14 Alexander Sirotkin Method, system and apparatus of time-division-duplex (tdd) uplink-downlink (ul-dl) interference management
US8838119B2 (en) * 2012-06-26 2014-09-16 Futurewei Technologies, Inc. Method and system for dynamic cell configuration
CN102752740B (zh) * 2012-06-29 2015-07-22 中国联合网络通信集团有限公司 基于基站分簇架构的数据交互处理方法、设备和系统
CN103581982B (zh) * 2012-07-19 2018-02-02 华为技术有限公司 一种业务热点的检测方法、确定方法、定位方法及装置
WO2014021565A1 (ko) * 2012-07-31 2014-02-06 엘지전자 주식회사 다중 셀 기반 무선 통신 시스템에서 비주기적 채널 상태 정보의 보고 방법 및 이를 위한 장치
EP3005774B1 (en) * 2013-05-28 2017-07-12 Telefonaktiebolaget LM Ericsson (publ) Establishing cooperating clusters in cellular communications systems
CN104619024B (zh) * 2013-11-01 2019-01-04 中国移动通信集团公司 一种动态协作通信的方法、系统及设备
EP2879418A1 (en) * 2013-11-27 2015-06-03 Nokia Corporation D2d inter cluster communication and configurations
US9781610B2 (en) * 2013-12-18 2017-10-03 Qualcomm Incorporated Small cell clusters for signaling load reduction, time synchronization, KPI filtering and spectrum coordination
US9787370B2 (en) * 2014-03-31 2017-10-10 Huawei Technologies Co., Ltd. Dynamic clustering for radio coordination in a virtual network
CN104901728B (zh) * 2015-04-30 2018-01-23 西安电子科技大学 基于时间检测的动静态分簇结合策略
CN104869610B (zh) * 2015-05-12 2018-02-06 电子科技大学 一种为多个移动台选取同一组接入基站簇的方法
CN106712980B (zh) * 2015-07-17 2021-02-19 中兴通讯股份有限公司 一种网元分组方法及装置、通信系统
CN106612518A (zh) * 2015-10-26 2017-05-03 普天信息技术有限公司 一种干扰管理的方法及系统
US9538401B1 (en) * 2015-12-18 2017-01-03 Verizon Patent And Licensing Inc. Cellular network cell clustering and prediction based on network traffic patterns
US20190045583A1 (en) * 2016-02-03 2019-02-07 Nokia Solutions And Networks Oy Multiconnectivity cluster
WO2017132977A1 (zh) * 2016-02-05 2017-08-10 华为技术有限公司 一种降低系统干扰的方法及装置
CN106059734B (zh) * 2016-05-30 2019-02-26 西安科技大学 基于边缘用户干扰度量值的Massive MIMO系统导频分配方法
CN107666365B (zh) * 2016-07-28 2021-09-07 华为技术有限公司 一种csi的获取方法,服务器,终端以及ap
CN107734462A (zh) * 2016-08-10 2018-02-23 索尼公司 无线通信中的电子设备和方法
US10455484B2 (en) * 2017-02-28 2019-10-22 Qualcomm Incorporated Methods and systems for access point clustering
CN109831819B (zh) * 2019-03-06 2021-10-22 重庆邮电大学 一种基于异构蜂窝网络分簇smdp基站休眠方法
CN111901392B (zh) * 2020-07-06 2022-02-25 北京邮电大学 一种面向移动边缘计算的内容部署与分发方法及系统
CN111736516B (zh) * 2020-08-05 2020-11-17 中国人民解放军国防科技大学 多智能体系统的自主分簇控制方法和装置
WO2024035177A1 (en) * 2022-08-12 2024-02-15 Samsung Electronics Co., Ltd. Method and apparatus for handling transmission-reception points in communication system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002089356A1 (en) * 2001-05-02 2002-11-07 Strix Systems, Inc. Connection initiation in wireless networks including load balancing
CN101389115A (zh) * 2008-11-07 2009-03-18 北京工业大学 一种多小区基站动态成簇的协作通信方法
CN101415207A (zh) * 2008-12-04 2009-04-22 北京邮电大学 一种蜂窝协作中继网络中的负载均衡方法、装置和基站

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7035240B1 (en) * 2000-12-27 2006-04-25 Massachusetts Institute Of Technology Method for low-energy adaptive clustering hierarchy
US20040117226A1 (en) * 2001-03-30 2004-06-17 Jaana Laiho Method for configuring a network by defining clusters
KR100605590B1 (ko) 2004-05-10 2006-07-31 주식회사 하이닉스반도체 데이터 출력드라이버의 임피던스를 조정할 수 있는 반도체메모리 장치
US7428268B2 (en) 2004-12-07 2008-09-23 Adaptix, Inc. Cooperative MIMO in multicell wireless networks
US7623589B2 (en) 2006-07-14 2009-11-24 Intel Corporation Cooperative multiple-access using user-clustering and space-time-frequency coding techniques for higher reliability reception
US7885689B2 (en) * 2007-06-14 2011-02-08 Alcatel-Lucent Usa Inc. Suppressing interference using beamforming of uplink signals received at multiple base stations
US8576772B2 (en) 2007-06-18 2013-11-05 Intel Corporation Cooperative multiple access in wireless networks
JP5161651B2 (ja) 2008-05-16 2013-03-13 株式会社東芝 無線装置および無線装置の制御プログラム
US8391206B2 (en) * 2008-08-07 2013-03-05 Alcatel Lucent Method of joint resource allocation and clustering of base stations
CN101854199B (zh) 2009-03-31 2015-01-14 株式会社Ntt都科摩 一种无线通信中自适应协作传输的方法、系统和发射机

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002089356A1 (en) * 2001-05-02 2002-11-07 Strix Systems, Inc. Connection initiation in wireless networks including load balancing
CN101389115A (zh) * 2008-11-07 2009-03-18 北京工业大学 一种多小区基站动态成簇的协作通信方法
CN101415207A (zh) * 2008-12-04 2009-04-22 北京邮电大学 一种蜂窝协作中继网络中的负载均衡方法、装置和基站

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2426975A4 *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9294960B2 (en) 2010-02-11 2016-03-22 Huawei Technologies Co., Ltd. Method, apparatus and system for cooperative resource scheduling and cooperative communication
US8908602B2 (en) 2011-03-02 2014-12-09 Hitachi, Ltd. Clustering method of mobile communication and remote radio head thereof
WO2013069536A1 (ja) * 2011-11-07 2013-05-16 株式会社エヌ・ティ・ティ・ドコモ 無線通信システム、無線基地局装置、ユーザ端末及び無線通信方法
US9860905B2 (en) 2012-01-27 2018-01-02 Samsung Electronics Co., Ltd. Method and system for providing service in a wireless communication system
JP2015508626A (ja) * 2012-01-27 2015-03-19 サムスン エレクトロニクス カンパニー リミテッド 無線通信システムにおけるサービス提供方法及びシステム
KR20130087258A (ko) * 2012-01-27 2013-08-06 삼성전자주식회사 차세대 무선 통신 시스템에서 서비스 제공 방법 및 시스템
WO2013112008A1 (en) 2012-01-27 2013-08-01 Samsung Electronics Co., Ltd. Method and system for providing service in a wireless communication system
KR101980093B1 (ko) * 2012-01-27 2019-05-20 삼성전자주식회사 차세대 무선 통신 시스템에서 서비스 제공 방법 및 시스템
EP2807762B1 (en) * 2012-01-27 2020-12-30 Samsung Electronics Co., Ltd. Method and system for providing service in a wireless communication system
CN104412682A (zh) * 2013-01-18 2015-03-11 华为技术有限公司 资源分配方法及装置
CN105282748A (zh) * 2014-06-06 2016-01-27 中国移动通信集团浙江有限公司 一种划分通信网络的基站簇的方法和装置
CN105282748B (zh) * 2014-06-06 2018-12-07 中国移动通信集团浙江有限公司 一种划分通信网络的基站簇的方法和装置
CN105472625A (zh) * 2014-09-05 2016-04-06 中国移动通信集团公司 一种高空平台协作覆盖方法、装置及高空平台
CN105472625B (zh) * 2014-09-05 2019-03-26 中国移动通信集团公司 一种高空平台协作覆盖方法、装置及高空平台

Also Published As

Publication number Publication date
JP2014007756A (ja) 2014-01-16
US20120094710A1 (en) 2012-04-19
CN101877918A (zh) 2010-11-03
EP2426975A1 (en) 2012-03-07
JP5411985B2 (ja) 2014-02-12
JP2012525744A (ja) 2012-10-22
US8942757B2 (en) 2015-01-27
CN101877918B (zh) 2014-11-12
EP2426975A4 (en) 2015-07-08

Similar Documents

Publication Publication Date Title
WO2010124647A1 (zh) 移动通信中基站动态分簇的设备和方法
CN109412770B (zh) 通信方法及装置
JP7175903B2 (ja) L1分割アーキテクチャにおいてハイブリッドビームフォーミングを用いる複数サイトmimo通信システム
US10548024B2 (en) Cloud communication center system and method for processing data in a cloud communication system
CN103428642B (zh) 基于中继的簇内d2d多播方法
KR102543905B1 (ko) 5G Ethernet service를 제공하는 방법 및 장치
WO2010121480A1 (zh) 一种多点协作传输协作组信息的发送方法及基站
WO2015078068A1 (zh) 基于中继的簇内 d2d 多播方法
US20200195321A1 (en) Methods of wirelessly communicating with a group of devices
US11849374B2 (en) Method and device used for wireless relay communication for reporting charging information utilizing data from identity sets
WO2019154259A1 (zh) 一种基站、用户设备中的用于无线通信的方法和装置
US11284461B2 (en) Method and apparatus for controlling packet transmission for reducing latency in wireless communication system
CN114731605A (zh) 无线接入网络通信系统中经由e2接口中继服务注册事件的设备和方法
CN101594174B (zh) 支持上行网络mimo的方法及基站
US20230300936A1 (en) Method and device for wireless communication
Apostolaras et al. Evolved user equipment for collaborative wireless backhauling in next generation cellular networks
WO2021031901A1 (zh) 一种被用于无线通信的节点中的方法和装置
CN113853030A (zh) 一种被用于无线通信的方法和设备
CN113727343A (zh) 一种被用于无线通信的方法和设备
JP4966115B2 (ja) 無線通信装置
WO2022171165A1 (zh) 一种被用于中继无线通信中的方法和装置
CN101789811A (zh) 在通信系统中进行信息交互和数据处理的方法、系统和基站
WO2021027538A1 (zh) 一种被用于无线通信的节点中的方法和装置
RU2782866C2 (ru) Архитектура с агрегированием технологий для систем связи стандарта долгосрочного развития
CN114640723A (zh) 一种被用于无线通信的方法和设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 10769336

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2012507596

Country of ref document: JP

Ref document number: 2010769336

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 13266898

Country of ref document: US