WO2011097906A1 - 协作资源调度及协作通信的方法、装置及系统 - Google Patents

协作资源调度及协作通信的方法、装置及系统 Download PDF

Info

Publication number
WO2011097906A1
WO2011097906A1 PCT/CN2010/078710 CN2010078710W WO2011097906A1 WO 2011097906 A1 WO2011097906 A1 WO 2011097906A1 CN 2010078710 W CN2010078710 W CN 2010078710W WO 2011097906 A1 WO2011097906 A1 WO 2011097906A1
Authority
WO
WIPO (PCT)
Prior art keywords
cooperative
statistical information
user
base station
cluster
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.)
Ceased
Application number
PCT/CN2010/078710
Other languages
English (en)
French (fr)
Inventor
张弓
杨讯
何诚
潘璐伽
丰大洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP10845576A priority Critical patent/EP2437559A4/en
Priority to BRPI1011575A priority patent/BRPI1011575A2/pt
Publication of WO2011097906A1 publication Critical patent/WO2011097906A1/zh
Priority to US13/339,171 priority patent/US9294960B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices

Definitions

  • the present invention relates to mobile communication technologies, and in particular, to a method, device and system for cooperative resource scheduling and cooperative communication.
  • Co-MIMO Cooperative MIMO
  • BSs base stations
  • MSs mobile terminals
  • the wireless environment can be continuously adjusted through SDMA (Space Division Multiple Access) to provide a good downlink signal for each user.
  • SDMA Space Division Multiple Access
  • this advanced base station performance can be used to increase base station coverage, reduce network cost, increase system capacity, and ultimately improve frequency utilization.
  • SDMA can be compatible with any spatial modulation method or frequency band, so it has great practical value.
  • the SDMA after the base station cooperation can effectively overcome the interference problem at the edge of the cell, and the interference becomes a useful signal, which can further improve the spectrum efficiency.
  • Base station cooperation is generally defined as the sharing of data between base stations and joint operations, and channel information can be shared, partially shared, or not shared. Base station cooperation brings more overhead to the network while bringing huge gains.
  • Cluster Defined as a cooperative base station group that participates in shared data and joint computing.
  • the size of the cluster in the network depends on the capacity of the backhaul (backhaul) in the network and the computing power of the cluster.
  • the base station clustering scheme in the current network such as fixed cluster partitioning and dynamic cluster partitioning, requires a large signaling overhead, so that the overall performance loss of the network is relatively large compared to the global cooperation, and the overall performance of the network is not high.
  • a method for collaborative resource scheduling includes:
  • the network center controller obtains statistical information of all users under its jurisdiction in a first time period; and performs base station cooperative cluster division according to the statistical information;
  • a method of collaborative communication including:
  • the base station performs cooperative communication with other base stations in the cooperative cluster.
  • a cooperative communication system includes a base station and a network center controller, wherein:
  • the base station collects statistical information of the user in the first time period, and sends the statistics to the network center controller, and after receiving the first time period, receives the collaborative cluster division result sent by the network center controller, and according to the The division result is cooperatively communicated with other base stations in the cooperative cluster;
  • the network center controller is configured to: obtain and calculate user statistical information in a first time period, perform base station cooperative cluster division according to the statistical information, and send the division result of the cooperative cluster to the corresponding base station.
  • a network center controller comprising:
  • An information collecting unit configured to obtain statistical information of all users under its jurisdiction during the first time period
  • a cooperative cluster dividing unit configured to perform cooperative clustering of base stations according to the statistical information to obtain a cooperative cluster Divide the results
  • a sending unit configured to send the collaborative cluster division result to the base station.
  • a base station comprising:
  • a statistical information processing unit configured to collect statistical information of the user in the first time period and send the statistical information to the network center controller
  • a clustering receiving unit configured to receive, after the end of the first time period, the information sent by the central controller according to the statistical information
  • a communication unit configured to perform cooperative communication with other base stations in the cooperative cluster according to the cooperative cluster division result.
  • the solution of the embodiment of the present invention updates the cluster division according to the statistical information of the user in the first time period, which can improve the fairness of the system user, reduce the system signaling overhead, and reduce the implementation difficulty of the entire system.
  • FIG. 1 is a structural diagram of a cooperative MIMO system according to an embodiment of the present invention.
  • 2a is a flowchart of a method for cooperative resource scheduling according to an embodiment of the present invention.
  • FIG. 2b is a flowchart of a method for cooperative communication according to an embodiment of the present invention.
  • FIG. 3 is a structural diagram of an embodiment of a three-layer network architecture according to an embodiment of the present invention.
  • FIG. 4 is a structural diagram of an embodiment of a layer 2 network architecture according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a network center controller according to an embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of a base station according to an embodiment of the present invention.
  • Embodiments of the present invention provide a method and apparatus for resource scheduling and cooperative communication in cooperative communication.
  • a collaborative resource scheduling method disclosed in the embodiment of the present invention includes:
  • S201 Network Center Controller obtains statistics for all users under its jurisdiction during the first time period Information
  • the S203 network center controller performs the cooperative cluster division of the base station according to the statistical information
  • the S205 network center controller sends the cooperative cluster division result to the base station.
  • the cooperative clustering result is used by the base station to perform coordinated resource allocation according to statistical information of users in the collaborative cluster in a second time period.
  • a method for cooperative communication disclosed in an embodiment of the present invention is performed by a base station, where the method includes:
  • S211 collects statistics of the user in the first time period and sends the statistics to the network center controller
  • S215 performs cooperative communication with other base stations in the cooperative cluster according to the cooperative cluster division result. Further, in the second time period, the coordinated resource allocation is performed according to the statistical information of the user in the collaborative cluster, and the base station performs cooperative communication with other base stations in the cooperative cluster according to the result of the coordinated resource allocation.
  • the solution of the embodiment of the present invention updates the cluster division according to the statistical information of the user in the first time period, which can improve the fairness of the system user, reduce the system signaling overhead, and reduce the implementation difficulty of the entire system.
  • Embodiments of the present invention simultaneously disclose a cooperative communication system that schedules communication resources and completes cooperative communication.
  • the system includes a base station and a network center controller.
  • the base station collects statistical information of the user in the first time period, and sends the statistics to the network center controller, and after receiving the first time period, receives the collaborative cluster division result sent by the network center controller, and according to the The partitioning result is cooperatively communicated with other base stations in the cooperative cluster.
  • the network center controller is configured to obtain and calculate user statistical information in a first time period, perform cooperative cluster division of the base station according to the statistical information, and send the division result of the cooperative cluster to the corresponding base station.
  • the coordinated resource allocation is performed according to the statistical information of the user in the collaborative cluster, and the base station performs cooperative communication with other base stations in the cooperative cluster according to the result of the coordinated resource allocation.
  • the solution of the embodiment of the present invention updates the cluster division according to the statistical information of the user in the first time period. It can improve the fairness of system users, reduce system signaling overhead, and reduce the difficulty of implementing the entire system.
  • a method for scheduling and completing cooperative communication in a first time period: each base station counts and updates information of all users, and reports to the central processor. The information of all its users, and then the central processor decides how to divide the cluster according to all the user information. Each base station re-allocates and schedules resources for the users in the cluster according to the cluster in which it is located, returns after enough time, repeats all the above. step.
  • the base station re-shares the data information according to the new cluster partition, and also includes the real-time channel information if necessary; the base station controller schedules the user, and determines the communication mode and the resources in the cluster.
  • the base station updates the average information of the recorded users. After the resource allocation is completed, the base station and other base stations in the cluster perform cooperative communication with the user.
  • the first time period is much larger than the second time period.
  • the first time period is defined as ⁇ ⁇
  • the second time period is T s
  • T p N p T s , N p ?
  • the network center controller is a logical unit that can be physically a separate central controller entity or can be completed by an existing network unit.
  • the first layer is a base station (BS), and the base stations can perform cooperative communication between the base stations.
  • the second layer is a Base Station Controller (BSC) that optimizes and shares data within the collaborative cluster.
  • the third layer is the Central Station (CS), which calculates and determines the division of the cooperative cluster.
  • Each base station periodically feeds back all its user queues or related statistical information to the BSC, and then the BSC sends the received information sent by the base station it manages to the network center controller.
  • the network center controller performs the division of the base station cooperative cluster according to the current overall queue or related statistical information. Potential function.
  • Performing cooperative clustering of the base station according to the statistical information may include performing the cooperative division according to a principle that the potential function of the overall queue information is the smallest or the sum of the potential functions of the user queue information is the smallest.
  • the potential function is used in the process of clustering, but the calculation of the potential function can be performed at the network center controller or at the base station. Therefore, the collected statistical information can be the queue length or the potential function of each user. If the potential function of the queue length is calculated by the network center controller, then the queue length of the user sent by the receiving base station is sufficient.
  • Performing cooperative clustering of the base station according to the statistical information may include calculating a gradient of the utility function of the average rate of all users, obtaining a probability of occurrence of each cluster division result according to the obtained gradient, and determining the selected cooperative cluster division according to the probability.
  • Cluster partitioning is applied to the gradient of the utility function of the time average rate, where the user's time average rate is the average of the user's data rate over time.
  • the gradient of the utility function of the time average rate can be calculated by the base station, and the function can also be used to calculate the gradient of the utility function that obtains the average rate.
  • the statistical information may include the network center controller transmitting the divided cooperative cluster division result to the base station controller, and the base station controller updates the base station information managed by the base station according to the new cooperative cluster division result. Then, the base station controller notifies the base station managed by the cooperative cluster division result, and the base station performs data sharing and information interaction in the cooperative cluster to complete the allocation of the cooperative resources. Finally, the base stations in each cooperative cluster provide cooperation services for users (UEs).
  • UEs users
  • the first layer is a base station (BS), and each terminal can perform cooperative communication with the terminal user.
  • the second layer calculates and determines the collaborative clustering for the Network Central Controller (CS).
  • Each base station periodically feeds back all its user queues or related statistics to the network center controller.
  • the network center controller divides the cooperative cluster of the base station according to the current statistical state of all users, and updates the cluster division information according to the new cooperative cluster division result, and updates the managed base station information.
  • the network center controller notifies all base stations of the new cluster division result.
  • Each base station performs corresponding data sharing and information interaction in the cooperative cluster to complete the allocation of the collaborative resources.
  • the base stations in each of the cooperative clusters provide cooperative services for the users (UEs).
  • the process of partitioning cooperative clusters in a Layer 2 network architecture is basically the same as that of a Layer 3 network.
  • the process of specific potential clustering is as follows:
  • the central controller updates the queue length of all its users with T p as the time unit, and selects the cluster division of all base stations in the next time unit ⁇ ⁇ according to the overall situation of the current queue.
  • each base station simultaneously feeds back the potential function of the queue state or queue state of all its users to the central controller; the central controller calculates the potential function of the entire network according to the current overall queue state, and selects according to the obtained potential function. Optimal clustering; the central controller notifies the clustering information There are base stations.
  • the base station cooperates with other base stations in the cluster, at each time:
  • the base station can share data and channel information with other base stations in its cooperating cluster, and the sharing can be done at the base station controller or shared to a certain base station (primary base station). Channel information can also be shared. And combined precoding in downlink communication, and joint detection in uplink communication.
  • the potential function is used as a parameter to allocate power to users in the cluster according to the principle of waterfilling. If the power allocation within the cluster is able to reach the Nash Equilibrium between the clusters, the delay of the entire network can be reduced to a minimum.
  • the potential function of the user can be updated every second time period.
  • the queue information of the user is counted, and the cluster division is selected according to the potential function of the queue information; for the purpose of maximizing the average utility function, the average rate of the user is counted, according to the average rate utility.
  • the gradient of the function updates the cluster partitioning probability and selects the cluster partitioning according to the probability.
  • the second time period updates (can be real-time) the user's potential function, and the user power allocation is adjusted according to the difference of the potential functions.
  • the utility function in the second time period, the utility function of the cooperative cluster is maximized, and the users in the cluster are jointly selected with other base stations in the cooperative cluster, and only the users in the cluster are updated in the second time period.
  • the statistical average rate but this data is not used to adjust the resource allocation of cooperative communication within the cluster.
  • real-time information (such as real-time channel information) is also defined as statistics for the second time period, so this information is needed for each second time period to recalculate the precoding matrix, user selection, power allocation, and so on.
  • the gradient of the utility function or the time-averaged rate utility function is as follows:
  • the central controller updates the gradient of the utility function of all user average rates with T p as the time unit, and uses this gradient to calculate all cluster partitions.
  • the probability of occurrence, and the clustering of all base stations in the next time unit ⁇ ⁇ is selected according to the obtained probability:
  • each base station at the same time feedback to the central controller related information of the average rate of all users; the base station controller calculates a gradient of the entire network utility function of utility function according to the current overall average rate related information, and uses this gradient update cluster
  • the probability of occurrence of the partition is selected according to the obtained probability, and the base station controller notifies all the base stations of the cluster division information.
  • the base station cooperates with other base stations in the cluster in the T D time, at each T s time:
  • the base station shares data and channel information with other base stations in the cluster (the channel information may not be shared); to maximize the utility function of the current cluster, and jointly select the users in the cluster with the base stations in all the clusters; and in the downlink communication Joint precoding, joint detection is used in uplink communication; in downlink communication, power is allocated to users in the cluster according to the principle of waterfilling.
  • the base station or user needs to update the user's own average rate of information at each time.
  • the coordinated cluster division of the base station may be performed according to the statistical information, and the set of the cooperative cluster partitioning result is stored, and then the cooperative cluster partitioning result is selected and the cooperative cluster partitioning result is sent to Base station.
  • the central controller stores all the clustering selections in the network, and may also be a partial clustering selection. The selection can be based on the minimum delay or the maximum utility function.
  • the network center controller 50 includes: an information collecting unit 501, a cooperative cluster dividing unit 503, and a sending unit 505.
  • the information collecting unit 501 is configured to obtain statistical information of all users under its jurisdiction during the first time period;
  • the cooperative cluster dividing unit 503 is configured to obtain a cooperative cluster partitioning result by performing cooperative clustering of the base station according to the statistical information.
  • the cooperative clustering result is used by the base station to perform coordinated resource allocation according to the statistical information of the user in the collaboration cluster in the second time period.
  • the sending unit 505 is configured to send the cooperative cluster division result to the base station.
  • the statistical information obtained by the information collection unit 501 includes a potential function of the queue length of the user.
  • the cooperative cluster dividing unit 503 performs the cooperative division based on the principle that the potential function of the overall queue information is the smallest or the sum of the potential functions of the respective user queue information is the smallest.
  • the statistical information obtained by the information gathering unit 501 includes a gradient of the utility function of the time average rate of the user.
  • the cooperative cluster dividing unit 503 calculates a gradient of the utility function of the average rate of all users, obtains the probability of occurrence of each cooperative clustering result based on the obtained gradient, and determines the selected cooperative clustering according to the probability.
  • the network center controller may further include a storage unit 507, configured to store, according to the statistical information, a set of cooperative cluster division results after performing cooperative cluster division of the base station.
  • Selection unit 509, for The cooperative cluster division result is selected from the storage unit 507, and the selected cluster division result is transmitted to the base station by the sending unit 505.
  • the embodiment of the present invention further provides a base station.
  • the base station 60 includes: a statistical information processing unit 601, configured to collect statistical information of a user in a first time period and send the information to the network center controller 50. ;
  • the cluster division receiving unit 603 is configured to receive, after the end of the first time period, the cooperative cluster division result determined by the central controller 50 according to the statistical information;
  • the resource allocation unit 605 is configured to perform, according to the collaborative clustering result, the coordinated resource allocation according to the statistical information of the user in the collaborative cluster in the second time period;
  • the communication unit 607 is configured to perform cooperative communication with other base stations in the cooperative cluster after the resource allocation is completed.
  • the statistical information processed by the statistical information processing unit 601 includes a potential function of the queue length of the user, and the resource allocation unit 605 updates the potential function of the queue length of the user in the second time period, according to the difference between the potential functions. Adjust user power allocation.
  • the statistical information processed by the statistical information processing unit 601 includes a potential function of the queue length of the user, and the resource allocation unit 605 updates the potential function of the queue length of the user in a second time period, according to the potential function. The difference adjusts the user power allocation.
  • the communication device of the embodiment of the present invention updates the cluster division in the first time period, and the dynamic clustering mode of the resource allocation in the cluster in the second time period can improve the transmission rate and the user experience for the users at the cluster edge, and improve the fairness of the system user. Moreover, the system signaling overhead can be reduced, the computing tasks are separated, and the implementation difficulty of the entire system is reduced.
  • the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Description

协作资源调度及协作通信的方法、 装置及系统 技术领域
本发明涉及移动通信技术， 特别涉及一种协作资源调度及协作通信的方 法、 装置及系统。
背景技术
协作 MIMO ( Co-MIMO )技术已经被视为 IMT- Advanced标准的一项关键 物理层技术。在全局范围内频率复用的蜂窝系统中， 小区间干扰已经成为限制 移动通信性能的主要因素， 而 Co-MIMO的基本思想则是协调多个基站的信号 传输， 以减轻蜂窝间干扰。如图 1所示， 在 Co-MIMO系统中， 多个基站（ BS ) 将同时协作的为多个移动终端 （MS )提供通信服务。
在基站中， 可以通过 SDMA ( Spatial Division Multiple Access , 空分多址） 不断调整无线环境， 为每位用户提供优质的下行链路信号。 在网络中， 这种先 进的基站性能可以用来增加基站覆盖范围， 降低网络成本， 提高系统容量， 最 终达到提高频率利用的目的。 SDMA 可以与任何空间调制方式或频段兼容， 因此具有巨大的实用价值。 基站协作以后的 SDMA因为能有效克服蜂窝边缘 的干扰问题， 将干扰变为有用信号， 能进一步提高频谱效率。 通常将基站协作 定义为基站之间数据的共享以及联合运算，信道信息可以共享、部分共享或者 不共享。基站协作在带来巨大增益的同时将开销更多的放到网络端， 这也为现 有蜂窝网络带来了一些新的问题： 整个网络的协作可以完全利用干扰，但其复 杂度随用户数的指数增长， 并且网络及用户资源调度的信令开销太高； 而且协 作网络始终存在边缘效应， 扩展性始终是一个问题。
按簇（cluster )为单位， 将簇内基站协作， 能够有效的解决上述问题。 簇 定义为参与共享数据和联合计算的协作基站群。网络中簇的大小取决于网络中 backhaul (回程）的容量以及簇的运算能力。 而当前的网络中的基站分簇方案， 如固定的簇划分和动态的簇划分等，都需要很大的信令开销， 以致于网络整体 性能损失相对于全局协作较大， 网络的整体性能不高。 发明内容 本发明实施例提供一种协作资源调度方法、装置及系统， 以提高网络的整 体性能。
一种协作资源调度的方法， 包括：
网络中心控制器获得其所管辖的所有用户在第一时间周期内的统计信息； 根据所述统计信息进行基站协作簇划分；
向基站发送所述协作簇划分结果。
一种协作通信的方法， 包括：
在第一时间周期内， 统计所属用户的统计信息并向网络中心控制器发送； 所述第一时间周期结束后，接收所述中心控制器发送的根据所述统计信息 确定的协作簇划分结果；
根据协作簇划分结果， 基站与协作簇内其它基站进行协作通信。
一种协作通信系统， 包括基站及网络中心控制器， 其中：
所述基站在第一时间周期内统计所属用户的统计信息，并向所述网络中心 控制器发送，在第一时间周期结束后，接收所述网络中心控制器发送的协作簇 划分结果并依据所述划分结果与该协作簇内其它基站进行协作通信；
所述网络中心控制器： 用于获得和计算第一时间周期内的用户统计信息， 根据所述统计信息进行基站协作簇划分，并将协作簇的划分结果发送到相应基 站。
一种网络中心控制器， 包括：
信息收集单元，用于获得其所管辖的所有用户在第一时间周期内的统计信 息；
协作簇划分单元，用于根据所述统计信息进行基站协作簇划分获得协作簇 划分结果；
发送单元， 用于向基站发送所述协作簇划分结果。
一种基站， 包括：
统计信息处理单元，用于在第一时间周期内统计所属用户的统计信息并向 网络中心控制器发送；
簇划分接收单元， 用于所述第一时间周期结束后，接收所述中心控制器发 送的才艮据所述统计信息确定的；
通信单元，用于根据所述协作簇划分结果与协作簇内其它基站进行协作通 信。
本发明实施例的方案在第一时间周期内根据用户的统计信息更新簇划分， 能够提高系统用户的公平性的同时， 降低系统信令开销， 降低了整个系统的实 现难度。
附图说明
图 1 为本发明实施例提供的一种协作 MIMO系统的结构图。
图 2a为本发明实施例一种协作资源调度的方法流程图。
图 2b 为本发明实施例一种协作通信的方法流程图。
图 3 为本发明实施例三层网络架构实施例的架构图。
图 4 为本发明实施例二层网络架构实施例的架构图。
图 5 为本发明实施例网络中心控制器的结构示意图。
图 6 为本发明实施例基站的结构示意图。
具体实施方式
本发明实施例提供协作通信中资源调度与协作通信的方法及装置。
如图 2a所示， 本发明实施例揭示的一种协作资源调度方法， 该方法包括：
S201 网络中心控制器获得其所管辖的所有用户在第一时间周期内的统计 信息；
S203 网络中心控制器才艮据所述统计信息进行基站的协作簇划分；
S205网络中心控制器向基站发送所述协作簇划分结果。
所述协作簇划分结果用于所述基站在第二时间周期内根据该协作簇内所 属用户的统计信息进行协作资源分配。
如图 2b所示， 本发明实施例揭示的一种协作通信的方法， 由基站完成， 该方法包括：
S211 在第一时间周期内， 统计所属用户的统计信息并向网络中心控制器 发送；
S213 所述第一时间周期结束后， 接收所述中心控制器发送的根据所述统 计信息确定的协作簇划分结果；
S215根据协作簇划分结果， 基站与协作簇内其它基站进行协作通信。 进一步，在第二时间周期内根据该协作簇内所属用户的统计信息进行协作 资源分配， 基站再根据协作资源分配的结果与协作簇内其它基站进行协作通 信。
本发明实施例的方案在第一时间周期内根据用户的统计信息更新簇划分， 能够提高系统用户的公平性的同时， 降低系统信令开销， 降低了整个系统的实 现难度。
本发明实施例同时揭露一协作通信系统，该系统对通信资源进行调度并完 成协作通信。 该系统包括包括基站及网络中心控制器。 其中， 所述基站在第一 时间周期内统计所属用户的统计信息， 并向网络中心控制器发送，在第一时间 周期结束后，接收所述网络中心控制器发送的协作簇划分结果并依据所述划分 结果与该协作簇内其它基站进行协作通信。所述网络中心控制器用于获得和计 算第一时间周期内的用户统计信息，根据统计信息进行基站的协作簇划分， 并 将协作簇的划分结果发送到相应基站。
进一步，在第二时间周期内根据该协作簇内所属用户的统计信息进行协作 资源分配， 基站再根据协作资源分配的结果与协作簇内其它基站进行协作通 信。
本发明实施例的方案在第一时间周期内根据用户的统计信息更新簇划分， 能够提高系统用户的公平性的同时， 降低系统信令开销， 降低了整个系统的实 现难度。
本发明的又一实施例，继续揭示一种通信资源进行调度并完成协作通信的 方法， 在该实施例中在第一时间周期内： 各基站统计和更新所有用户的信息， 向中心处理器汇报其所有用户的信息，然后中心处理器根据所有的用户信息决 定如何划分簇，各基站重新根据自己所在的簇，为簇内的用户分配和调度资源， 在足够多个时刻之后返回， 重复以上所有步骤。在该实施例中在在第二时间周 期内：基站根据新的簇划分重新共享数据信息，如有需要也包括实时信道信息； 基站控制器调度用户， 并决定通信方式以及在本簇内的资源分配； 基站更新记 录录的用户的平均信息。 完成资源的分配以后，基站和簇内的其他基站对用户 进行协作通信。 实例中， 第一时间周期远大于第二时间周期。 定义第一时间周 期为 Τρ ,第二时间周期为 Ts， 则 Tp=NpTs， Np ? 1。
在具体的实施过程中， 可以设计三层网络架构或和两层网络架构。其中网 络中心控制器一种逻辑单元， 物理上可以是独立的中心控制器实体，也可以由 现有网络单元完成其功能。
如图 3所示， 为三层网络架构实施例。 其中第一层为基站 （Base Station, BS )，各基站之间可以对终端用户进行协作通信。 第二层为基站控制器（Base Station Controller, BSC )，在协作簇内进行优化并共享数据。 第三层为网络中心 控制器（Central Station,CS )， 计算和决定协作簇的划分。各基站周期性向 BSC 反馈其所有用户队列或者相关统计信息， 之后 BSC将接收到的其所管理的基 站发送的信息发送给网络中心控制器。网络中心控制器根据当前的总体队列或 相关统计信息进行基站协作簇的划分。 势函数。根据统计信息进行基站的协作簇划分可以包括根据总体队列信息的势 函数最小或者为各用户队列信息的势函数之和最小的原则进行所述协作划分。 划分簇的过程中用到的是势函数， 但是势函数的计算可以在网络中心控制器， 也可以在基站。 所以， 收集的统计信息可以是队列长度， 也可以是各用户的势 函数。如果队列长度的势函数是由网络中心控制器计算的， 那么接收基站发送 的用户的队列长度即可。 用函数或者时间平均速率的效用函数的梯度。根据统计信息进行基站的协作簇 划分可以包括计算所有用户的平均速率的效用函数的梯度，根据获得的梯度获 得各簇划分结果出现的概率，依据该概率确定选择协作簇划分。簇划分应用的 是时间平均速率的效用函数的梯度，这里用户的时间平均速率是指用户的数据 速率在时间上的平均值。 时间平均速率的效用函数的梯度可以由基站计算，也 用函数都可以计算获得间平均速率的效用函数的梯度。所以统计信息可以包括 网络中心控制器将划分的协作簇划分结果发送给基站控制器，基站控制器 根据新的协作簇划分结果更新其所管理的基站信息。然后基站控制器将协作簇 划分结果通知其所管理的基站，基站在协作簇内进行数据共享和信息交互， 完 成协作资源的分配。 最后各协作簇内的基站为用户 （UE )提供协作服务。
如图 4， 为二层网络架构实施例。 其中第一层为基站（Base Station, BS ) , 各基站之间可以对终端用户进行协作通信。 第二层为网络中心控制器（ Central Station, CS )计算和决定协作簇划分。 各基站周期性的向网络中心控制器反馈 其所有用户队列或相关统计信息。网络中心控制器根据当前所有用户的总体统 计状态划分基站的协作簇，才艮据新的协作簇划分结果更新簇划分信息， 并更新 所管理的基站信息。 网络中心控制器将新的簇划分结果通知所有基站。各基站 在协作簇内进行相应的数据共享及信息交互， 完成协作资源的分配。最后各协 作簇内的基站为用户 （UE )提供协作服务。 在二层网络架构中协作簇的划分 过程与三层网络基本相同。 的势函数则具体的簇划分的过程如下：
中心控制器以 Tp为时间单位， 更新其所有用户的队列长度， 并根据当前队 列的总体情况选择下一个时间单位 Τρ内所有基站的簇划分。
在 τρ时刻，各基站同时向中心控制器反馈其所有用户的队列状态或队列状 态的势函数； 中心控制器根据当前的总体队列状态计算整个网络的势函数，根 据得到的势函数选择与其对应的最佳簇划分；中心控制器将簇划分信息通知所 有基站。
基站与簇内其他基站协作通信， 在每个 1时间：
基站可以与其所在协作簇内的其他基站共享数据以及信道信息，该共享可 以在基站控制器完成， 也可以是共享到某个基站（主基站）。 信道信息也可以 不共享。 并在下行通信中联合预编码， 上行通信中采用联合检测。 在下行通信 中， 以势函数为参量根据注水 (waterfilling)原理为簇内用户分配功率。 如果簇 内的功率分配能够在簇间达到纳什均衡点 （Nash Equilibrium ), 则整个网络的 延时能降低到最小值。
此外，如果由用户计算自身的势函数， 可以在每个第二时间周期更新自身 的势函数。
在具体的实例中， 以时延最小化为目的， 统计用户的队列信息， 根据队列 信息的势函数选择簇划分； 以平均效用函数最大化为目的， 则统计用户的平均 速率，根据平均速率效用函数的梯度，更新簇划分概率，根据概率选择簇划分。
对于时延的情况， 根据簇内用户的队列变化， 第二时间周期更新（可以实 时）用户的势函数，根据势函数之差调整用户功率分配。对于效用函数的情况， 在第二时间周期以使所述协作簇的效用函数最大为目标，与所述协作簇内的其 它基站联合选择簇内用户，在第二时间周期内只是更新簇内用户的统计平均速 率； 但该数据并不用于调整簇内协作通信的资源分配。 这里是把实时信息（比 如实时信道信息 )也定义为第二时间周期的统计信息，所以每一个第二时间周 期都会需要这些信息来重新计算预编码矩阵、 用户选择、 功率分配等等。 效用函数或者时间平均速率的效用函数的梯度则具体的簇划分的过程如下： 中心控制器以 Tp为时间单位， 更新其所有用户平均速率的效用函数的梯 度， 用此梯度计算所有簇划分的出现概率， 并根据得到的概率选择下一个时间 单位 Τρ内所有基站的簇划分：
在 Τρ时刻，各基站同时向中心控制器反馈其所有用户的平均速率的相关信 息；基站控制器根据当前的总体平均速率相关信息的效用函数计算整个网络效 用函数的梯度， 并用此梯度更新簇划分的出现概率，根据得到的概率选择与其 对应的最佳簇划分； 基站控制器将簇划分信息通知所有基站。 基站在 TD时间内与簇内其他基站协作通信， 在每个 Ts时间：
基站与其所在的簇内其他基站共享数据以及信道信息（信道信息也可以不 共享）； 以令当前簇的效用函数最大为目标， 与所有簇内的基站联合选择簇内 用户；并在下行通信中联合预编码，上行通信中采用联合检测；在下行通信中， 根据注水 (waterfilling)原理为簇内用户分配功率。
此外，在每个 1时间基站或者用户需要更新该用户自身平均速率的相关信 息。
作为本发明实施例的进一步处理，还可以根据所述统计信息进行基站的协 作簇划分后存储所述协作簇划分结果的集，然后从中选择协作簇划分结果并将 所述协作簇划分结果发送到基站。例如在中心控制器储存有该网络中所有的簇 划分选择， 也可以是存有部分的簇划分选择。选取可以是根据延时最小或者效 用函数最大来选择。
本发明实施例提供一网络中心控制器， 如图 5所示， 网络中心控制器 50 包括： 信息收集单元 501， 协作簇划分单元 503， 发送单元 505。
信息收集单元 501， 用于获得其所管辖的所有用户在第一时间周期内的统 计信息；
协作簇划分单元 503， 用于才艮据所述统计信息进行基站的协作簇划分获得 协作簇划分结果。其中所述协作簇划分结果用于所述基站在第二时间周期内根 据该协作簇内所属用户的统计信息进行协作资源分配。
发送单元 505， 用于向基站发送所述协作簇划分结果。
在一种实现中，信息收集单元 501获得的统计信息包括所述用户的队列长 度的势函数。协作簇划分单元 503根据总体队列信息的势函数最小或者为各用 户队列信息的势函数之和最小的原则进行所述协作划分。在另一种实现中，信 息收集单元 501获得的统计信息包括用户的时间平均速率的效用函数的梯度。 协作簇划分单元 503计算所有用户的平均速率的效用函数的梯度，根据所述获 得的梯度获得各协作簇划分结果出现的概率，依据所述概率确定选择协作簇划 分。
进一步， 网络中心控制器还可以包括存储单元 507， 用于存储根据所述统 计信息进行基站的协作簇划分后的协作簇划分结果的集。 选择单元 509， 用于 从所述存储单元 507中选择所述协作簇划分结果，选择出的簇划分结果通过所 述发送单元 505向所述基站发送。
同时本发明的实施例还提供一种基站， 如图 6所示， 基站 60包括： 统计信息处理单元 601， 用于在第一时间周期内统计所属用户的统计信息 并向网络中心控制器 50发送；
簇划分接收单元 603， 用于所述第一时间周期结束后， 接收所述中心控制 器 50发送的根据所述统计信息确定的协作簇划分结果；
资源分配单元 605， 用于根据协作簇划分结果， 在第二时间周期内根据该 协作簇内所属用户的统计信息进行协作资源分配；
通信单元 607， 用于所述资源分配完成后与协作簇内其它基站进行协作通 信。
在实施中，统计信息处理单元 601处理的统计信息包括所述用户的队列长 度的势函数，资源分配单元 605在第二时间周期内更新用户的队列长度的势函 数， 根据所述势函数之差调整用户功率分配。
在另一种实施中，统计信息处理单元 601处理的统计信息包括所述用户的 队列长度的势函数，资源分配单元 605第二时间周期内更新用户的队列长度的 势函数， 根据所述势函数之差调整用户功率分配。
本发明实施例的通信装置在第一时间周期更新簇划分，第二时间周期簇内 资源分配的动态分簇方式能够给簇边缘的用户提升传输速率和用户体验，提高 系统用户的公平性的同时， 又能降低系统信令开销， 将运算任务分开， 降低了 整个系统的实现难度。
本领域普通技术人员可以理解实现上述实施例方法中的全部或部分流程， 是可以通过计算机程序来指令相关的硬件来完成，所述的程序可存储于一计算 机可读取存储介质中，该程序在执行时，可包括如上述各方法的实施例的流程。 其中，所述的存储介质可为磁碟、光盘、只读存储记忆体（ Read-Only Memory, ROM )或随机存储记忆体 ( Random Access Memory, RAM )等。

Claims

权 利 要 求
1、 一种协作资源调度的方法， 其特征在于， 所述方法包括：
网络中心控制器获得其所管辖的所有用户在第一时间周期内的统计信息； 根据所述统计信息进行基站协作簇划分；
向基站发送所述协作簇划分结果。
2、 如权利要求 1所述的方法， 其特征在于所述协作簇划分结果用于所述 基站在第二时间周期内根据该协作簇内所属用户的统计信息进行协作资源分 配。
3、 如权利要求 1所述的方法， 其特征在于，
所述统计信息包括所述用户的队列长度的势函数；
所述根据所述统计信息进行基站协作簇划分包括：根据总体队列信息的势 函数最小或者为各用户队列信息的势函数之和最小的原则进行所述协作划分。
4、 如权利要求 1所述的方法， 其特征在于， 所述统计信息包括用户的时间平均速率的效用函数的梯度；
所述根据所述统计信息进行基站协作簇划分包括：计算所有用户的平均速 率的效用函数的梯度， 根据所述获得的梯度获得各簇划分结果出现的概率， 依据所述概率确定选择协作簇划分。
5、 如权利要求 2或 3所述的方法， 其特征在于， 所述方法还包括： 根据所述统计信息进行基站协作簇划分后存储所述协作簇划分结果的集； 从中选择协作簇划分结果并将所述协作簇划分结果发送到基站。
6、 一种协作通信的方法， 其特征在于， 所述方法包括：
在第一时间周期内， 统计所属用户的统计信息并向网络中心控制器发送； 所述第一时间周期结束后，接收所述中心控制器发送的根据所述统计信息 确定的协作簇划分结果；
根据协作簇划分结果， 基站与协作簇内其它基站进行协作通信。
7、 如权利要求 6所述的方法， 其特征在于， 接收所述协作簇划分结果后 在第二时间周期内根据该协作簇内所属用户的统计信息进行协作资源分配。
8、 如权利要求 7所述的方法， 其特征在于， 所述所属用户的统计信息包 括所述用户的队列长度的势函数；第二时间周期内更新用户的队列长度的势函 数， 根据所述势函数之差调整用户功率分配。
9、 如权利要求 7所述的方法， 其特征在于， 所述所属用户的统计信息包 括时间平均速率的效用函数的梯度；在第二时间周期以使所述协作簇的效用函 数最大为目标，与所述协作簇内的其它基站联合选择簇内用户，完成资源分配。
10、 一种协作通信系统， 包括基站及网络中心控制器， 其特征在于： 所述基站在第一时间周期内统计所属用户的统计信息，并向所述网络中心 控制器发送，在第一时间周期结束后，接收所述网络中心控制器发送的协作簇 划分结果并依据所述划分结果与该协作簇内其它基站进行协作通信；
所述网络中心控制器： 用于获得和计算第一时间周期内的用户统计信息， 根据所述统计信息进行基站协作簇划分，并将协作簇的划分结果发送到相应基 站。
11、 如权利要求 10所述的系统， 其特征在于， 所述统计信息包括所述用 户的队列长度或者所述用户的队列长度的势函数；
网络中心控制器根据总体队列信息的势函数最小或者为各用户队列信息 的势函数之和最小的原则进行所述协作划分。
12、 如权利要求 10所述的系统， 其特征在于， 所述统计信息包括用户的 时间平均速率或者时间平均速率的效用函数或者时间平均速率的效用函数的 梯度；
网络中心控制器计算所有用户的平均速率的效用函数的梯度，根据所述获 得的梯度获得各簇划分结果出现的概率， 依据所述概率确定选择协作簇划分。
13、 如权利要求 10所述的系统， 其特征在于， 所述基站接收所述协作簇 划分结果后在第二时间周期内根据该协作簇内所属用户的统计信息进行协作 资源分配。
14、 一种网络中心控制器， 其特征在于， 所述基站控制器包括： 信息收集单元，用于获得其所管辖的所有用户在第一时间周期内的统计信 息；
协作簇划分单元，用于根据所述统计信息进行基站协作簇划分获得协作簇 划分结果； 发送单元， 用于向基站发送所述协作簇划分结果。
15、 如权利要求 14所述的网络中心控制器， 其特征在于， 所述协作簇划 分结果用于所述基站在第二时间周期内根据该协作簇内所属用户的统计信息 进行协作资源分配。
16、 如权利要求 14所述的网络中心控制器， 其特征在于， 所述信息收集 单元获得的统计信息包括： 所述用户的队列长度的势函数；
所述协作簇划分单元根据总体队列信息的势函数最小或者为各用户队列 信息的势函数之和最小的原则进行所述协作划分。
17、 如权利要求 14所述的网络中心控制器， 其特征在于， 所述信息收集 单元获得的统计信息包括： 用户的时间平均速率的效用函数的梯度；
所述协作簇划分单元计算所有用户的平均速率的效用函数的梯度，根据所 述获得的梯度获得各簇划分结果出现的概率，依据所述概率确定选择协作簇划 分。
18、 如权利要求 14所述的网络中心控制器， 其特征在于， 还包括： 存储单元，用于存储根据所述统计信息进行基站协作簇划分后的协作簇划 分结果的集。
19、 如权利要求 14所述的网络中心控制器， 其特征在于， 还包括： 选择单元， 用于从所述存储单元中选择所述协作簇划分结果，选择出的簇 划分结果通过所述发送单元向所述基站发送。
20、 一种基站， 其特征在于， 所述基站包括：
统计信息处理单元，用于在第一时间周期内统计所属用户的统计信息并向 网络中心控制器发送；
簇划分接收单元， 用于所述第一时间周期结束后，接收所述中心控制器发 送的才艮据所述统计信息确定的协作簇划分结果；
通信单元，用于根据所述协作簇划分结果与协作簇内其它基站进行协作通 信。
21、 如权利要求 20所述的基站， 其特征在于， 所述基站还包括： 资源分配单元， 用于根据协作簇划分结果，在第二时间周期内根据该协作 簇内所属用户的统计信息进行协作资源分配；
22、 如权利要求 20所述的基站， 其特征在于， 所述统计信息处理单元处 理的统计信息包括所述用户的队列长度的势函数；所述资源分配单元在第二时 间周期内更新用户的队列长度的势函数，根据所述势函数之差调整用户功率分 配。
23、 如权利要求 20所述的基站， 其特征在于， 所述统计信息处理单元处 理的统计信息包括所述用户的队列长度的势函数；所述资源分配单元第二时间 周期内更新用户的队列长度的势函数， 根据所述势函数之差调整用户功率分 配。
PCT/CN2010/078710 2010-02-11 2010-11-15 协作资源调度及协作通信的方法、装置及系统 Ceased WO2011097906A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP10845576A EP2437559A4 (en) 2010-02-11 2010-11-15 METHOD, APPARATUS AND SYSTEM FOR PROGRAMMING COLLABORATIVE RESOURCES AND PERFORMING COLLABORATIVE COMMUNICATIONS
BRPI1011575A BRPI1011575A2 (pt) 2010-02-11 2010-11-15 método, aparelho e sistema para programação de recurso cooperativo e comunicação cooperativa
US13/339,171 US9294960B2 (en) 2010-02-11 2011-12-28 Method, apparatus and system for cooperative resource scheduling and cooperative communication

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2010101137959A CN102158867B (zh) 2010-02-11 2010-02-11 协作资源调度及协作通信的方法、装置及系统
CN201010113795.9 2010-02-11

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/339,171 Continuation US9294960B2 (en) 2010-02-11 2011-12-28 Method, apparatus and system for cooperative resource scheduling and cooperative communication

Publications (1)

Publication Number Publication Date
WO2011097906A1 true WO2011097906A1 (zh) 2011-08-18

Family

ID=44367212

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/078710 Ceased WO2011097906A1 (zh) 2010-02-11 2010-11-15 协作资源调度及协作通信的方法、装置及系统

Country Status (5)

Country Link
US (1) US9294960B2 (zh)
EP (1) EP2437559A4 (zh)
CN (1) CN102158867B (zh)
BR (1) BRPI1011575A2 (zh)
WO (1) WO2011097906A1 (zh)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101644097B1 (ko) * 2010-12-21 2016-08-01 삼성전자주식회사 이웃 단말 및 대상 단말의 통신 방법
US9282568B2 (en) * 2011-11-18 2016-03-08 Futurewei Technologies, Inc. Method and system for dynamic, joint assignment of power and scheduling of users for wireless systems
EP2668813B1 (en) * 2012-01-13 2014-09-10 NEC Europe Ltd. Method for operating a wireless network, a wireless network and a device
US9497647B2 (en) * 2012-03-14 2016-11-15 Telefonaktiebolaget Lm Ericsson (Publ) Methods and devices for reporting in a cellular radio network
WO2014005152A1 (en) * 2012-06-29 2014-01-03 Huawei Technologies Co., Ltd. System and method for grouping and selecting transmission points
US9503166B2 (en) 2015-03-17 2016-11-22 Futurewei Technologies, Inc. System and method for coordinated MIMO switching (CMS) in TDD/FDD-LTE
JP6550928B2 (ja) * 2015-05-27 2019-07-31 株式会社Ｊｖｃケンウッド 管理装置、端末装置、プログラム
JP6619295B2 (ja) * 2016-05-31 2019-12-11 日本電信電話株式会社 スケジューリング装置
US11445413B2 (en) * 2017-02-14 2022-09-13 Telefonaktiebolaget Lm Ericsson (Publ) Method and network nodes to manage QoE measurement collection during relocation or handover
JP7102767B2 (ja) * 2018-02-19 2022-07-20 富士通株式会社 送信方法、基地局装置及び無線通信システム
US11032370B2 (en) * 2018-11-14 2021-06-08 Toyota Jidosha Kabushiki Kaisha Wireless communications in a vehicular macro cloud
CN111615141B (zh) * 2019-04-09 2022-04-22 维沃移动通信有限公司 测量方法、测量配置方法、终端和网络设备
CN111586875B (zh) * 2020-04-27 2021-10-29 浙江大学 一种用于5g基站的下行时频资源调度方法和系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1964511A (zh) * 2005-11-08 2007-05-16 华为技术有限公司 无线通讯系统及对应的数据转发方法
CN101141776A (zh) * 2007-10-09 2008-03-12 华为技术有限公司 一种网络资源规划的方法和装置
CN101389115A (zh) * 2008-11-07 2009-03-18 北京工业大学 一种多小区基站动态成簇的协作通信方法
CN101877918A (zh) * 2009-04-30 2010-11-03 清华大学 移动通信中基站动态分簇的设备和方法

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040018849A1 (en) * 2002-07-23 2004-01-29 Schiff Leornard N. Queue length-based data transmission for wireless communication
US6985439B2 (en) * 2002-10-25 2006-01-10 Telefonaktiebolaget Lm Ericsson (Publ) System and method for wireless network admission control based on quality of service
US7702353B2 (en) 2005-12-27 2010-04-20 Nortel Networks Limited Transmit power allocation in a distributed MIMO system
US20070280175A1 (en) * 2006-06-01 2007-12-06 Fang-Chen Cheng Coordinating transmission scheduling among multiple base stations
US20080298486A1 (en) 2007-06-04 2008-12-04 Nec Laboratories America, Inc. Multi-cell interference mitigation via coordinated scheduling and power allocation in downlink odma networks
US8190165B2 (en) * 2007-09-21 2012-05-29 Future Wei Technologies, Inc. System and method for utility-based scheduling for space division multiple access (SDMA) on an uplink of a wireless communications network
FR2930856B1 (fr) * 2008-04-30 2010-06-18 Commissariat Energie Atomique Systeme de telecommunication multi-acces a strategie de retransmission de paquets adaptee
US8391206B2 (en) * 2008-08-07 2013-03-05 Alcatel Lucent Method of joint resource allocation and clustering of base stations
US8498647B2 (en) * 2008-08-28 2013-07-30 Qualcomm Incorporated Distributed downlink coordinated multi-point (CoMP) framework
US8675511B2 (en) * 2008-12-10 2014-03-18 Qualcomm Incorporated List elimination for distributed downlink coordinated multi-point (CoMP) framework
US8902808B2 (en) * 2011-05-06 2014-12-02 Blinq Wireless Inc. Interference mitigation with scheduling and dynamic power spectrum allocation for wireless networks

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1964511A (zh) * 2005-11-08 2007-05-16 华为技术有限公司 无线通讯系统及对应的数据转发方法
CN101141776A (zh) * 2007-10-09 2008-03-12 华为技术有限公司 一种网络资源规划的方法和装置
CN101389115A (zh) * 2008-11-07 2009-03-18 北京工业大学 一种多小区基站动态成簇的协作通信方法
CN101877918A (zh) * 2009-04-30 2010-11-03 清华大学 移动通信中基站动态分簇的设备和方法

Also Published As

Publication number Publication date
EP2437559A4 (en) 2012-04-11
EP2437559A1 (en) 2012-04-04
CN102158867B (zh) 2013-04-17
CN102158867A (zh) 2011-08-17
US20120230264A1 (en) 2012-09-13
US9294960B2 (en) 2016-03-22
BRPI1011575A2 (pt) 2016-03-15

Similar Documents

Publication Publication Date Title
WO2011097906A1 (zh) 协作资源调度及协作通信的方法、装置及系统
Ning et al. Mobile edge computing-enabled 5G vehicular networks: Toward the integration of communication and computing
US12082006B2 (en) Method and device for O-RAN-based performance optimization and configuration
CN110493826B (zh) 一种基于深度强化学习的异构云无线接入网资源分配方法
CN113597799B (zh) 用于调整波束赋形简档的设备、方法和计算机可读介质
KR102208117B1 (ko) 무선 자원 관리 방법 및 이를 위한 장치
CN102088735B (zh) 子帧间的业务负荷均衡处理及小区间干扰处理方法及设备
CN114287145A (zh) 在多载波动态频谱共享下的基于强化学习的无线电接入技术间负载平衡
US20230376358A1 (en) Method and apparatus for managing load of network node
KR20120001461A (ko) 무선 네트워크에서의 송신 전력 제어 방법 및 장치
CN103298131A (zh) 利用速率区域预测向基站服务的用户调度传输资源的设备和方法
CN101951307A (zh) 在CoMP下的小区协作集的选择方法
CN107113857B (zh) 第四代无线电移动网络的调度方法和系统
EP4233423A1 (en) Resource allocation techniques for sidelink transmissions, and dynamic selecton between resource allocation techniques based on sidelink communication reliability
CN102480737B (zh) 一种协作通信的调度方法、装置和系统
WO2012106848A1 (zh) 分配多小区协作发送/接收的上行信道资源的方法和设备
CN104412647B (zh) 用于帮助解决通信系统中的边界问题的集群优化的方法
CN102647727B (zh) 一种混合协作簇的选择方法
CN104284433B (zh) 基于速率限制的异构网络每比特能量最小化资源分配方法
CN114423028A (zh) 基于多智能体深度强化学习的CoMP-NOMA协作成簇与功率分配方法
CN102158974B (zh) 协作资源调度方法、装置、基站及系统
CN114223302B (zh) 用于多用户mimo的无线电资源分配
JP2014531835A (ja) マルチポイント協調システムにおけるスケジューリング割当方法及び装置
CN114885336B (zh) 干扰协调方法、装置及存储介质
US20220312432A1 (en) Scheduling Weight Calculation for MU MIMO

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: 10845576

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2010845576

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 178/CHENP/2012

Country of ref document: IN

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: PI1011575

Country of ref document: BR

ENP Entry into the national phase

Ref document number: PI1011575

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20111229