# US 2019/0357233 A1 · Ue-centric clustering and efficient scheduling for comp > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0357233 A1 - Document ID: US20190357233A1 - Status: Published application - Kind: A1 - Application number: 16/415,895 - Filed: 2019-05-17 - Published: 2019-11-21 - Earliest claimed: 2018-05-21 - Assignees: QUALCOMM Incorporated - Applicants: QUALCOMM Incorporated - Inventors: Mostafa KHOSHNEVISAN; Peerapol TINNAKORNSRISUPHAP; Farhad MESHKATI; Junyi LI - Web page: https://patentgrep.com/patent/US20190357233A1 ## CPC - H04B 7/024: Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems - H04W 72/121: for groups of terminals or users - H04L 1/0003: {by switching between different modulation schemes} - H04L 1/1809: Selective-repeat protocols - H04L 1/1893: {Physical mapping arrangements (physical resource mapping in general H04L5/00)} - H04L 5/0035: {Resource allocation in a cooperative multipoint environment} - H04L 5/0062: {Avoidance of ingress interference, e.g. ham radio channels} - H04W 72/1263: Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows - H04W 72/54: based on quality criteria - H04L 5/001: {the frequencies being arranged in component carriers} - H04L 5/0048: {Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091)} - H04B: TRANSMISSION - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Certain aspects of the present disclosure provide techniques for user equipment (UE)-centric clustering and efficient scheduling for coordinated multipoint (CoMP). A method for UE-centric clustering and central scheduling includes determining a UE conflict graph. Vertices in the UE conflict graph are UEs for which there is a transmission and edges between vertices are UEs that have a scheduling conflict. The method includes transmitting signaling to schedule the UEs with resources for the transmission based on the UE conflict graph. A method for UE-centric clustering and cluster scheduling includes determining a cluster graph. Vertices in the cluster graph are CoMP clusters for one or more UEs for which there is a transmission and edges between vertices are CoMP clusters that have a scheduling conflict. The method includes transmitting signaling to assign resources to the CoMP clusters based on the cluster graph. ## Claims ### Claim 1 A method by a scheduling device, comprising: determining a user equipment (UE) conflict graph, wherein vertices in the UE conflict graph correspond to UEs for which there is a transmission and edges between vertices in the UE conflict graph correspond to UEs that have a scheduling conflict; and scheduling one or more of the UEs for transmission based on the UE conflict graph. ### Claim 2 (depends on 1) The method of claim 1, wherein determining the UE conflict graph includes determining the vertices by determining UEs for which there is data to be scheduled for at least one of: a downlink joint transmission to the UEs or an uplink transmission from the UEs for joint reception. ### Claim 3 (depends on 1) The method of claim 1, wherein: the scheduling device comprises a central entity, and scheduling the one or more of the UEs comprises sending scheduling information to at least one of: the one or more of the UEs or one or more transmission points (TPs) serving the one or more of the UEs. ### Claim 4 (depends on 1) The method of claim 1, wherein determining the UE conflict graph comprises: determining one or more coordinated multipoint (CoMP) clusters to which the one or more of the UEs belong, each CoMP cluster including one or more transmission points (TPs), and determining that UEs have a scheduling conflict based on at least one of: whether the CoMP clusters to which the UEs belong have at least one common TP or whether the TPs in at least one of the CoMP clusters to which one of the UEs belongs is configured to mute for interference management of one or more of the other UEs. ### Claim 5 (depends on 4) The method of claim 4, further comprising receiving backhaul information from one or more the TPs in the one or more CoMP clusters, wherein the determination of the UE conflict graph is based on the backhaul information. ### Claim 6 (depends on 4) The method of claim 4, wherein the one or more CoMP clusters comprise UE-centric CoMP clusters, each UE-centric CoMP cluster including one or more TPs having a strongest signal quality with respect to the UEs served by the TPs. ### Claim 7 (depends on 6) The method of claim 6, wherein each UE-centric CoMP cluster includes TPs having a signal quality, with respect to the UEs served by the TPs, that is above a threshold, wherein the threshold comprise a first threshold for an initial transmission and a second threshold for a retransmission. ### Claim 8 (depends on 7) The method of claim 7, wherein the second threshold is lower than the first threshold. ### Claim 9 (depends on 1) The method of claim 1, wherein scheduling the one or more of the UEs for transmission based on the UE conflict graph includes scheduling a set of UEs for simultaneous transmission in a same resource block (RB) only when the set of UEs is an independent set of UEs, the independent set of UEs including only UEs that do not have an edge between them in the UE conflict graph. ### Claim 10 (depends on 9) The method of claim 9, wherein the independent set of UEs is scheduled further only when the set of UEs is not a subset of another independent set of UEs in the UE conflict graph. ### Claim 11 (depends on 1) The method of claim 1, further comprising: determining an ordering of the UEs in the UE conflict graph; and determining a set of resource blocks (RBs) available for scheduling. ### Claim 12 (depends on 11) The method of claim 11, wherein the ordering is based on an associated delay budget of the transmission for the UE. ### Claim 13 (depends on 11) The method of claim 11, wherein scheduling the one or more of the UEs for transmission based on the UE conflict graph comprises: for each of the RBs available for scheduling, maintaining a list of the UEs that can be assigned the RB; and iteratively performing in descending order: determining a modulation and coding scheme (MCS) and a number of RBs for a first UE in the ordering; assigning the number of RBs for the first UE from the RBs including the first UE in the list for the RB; and for each of the assigned RBs, removing the first UE and all UEs having an edge in the UE conflict graph with the first UE from the list of the UEs that can be assigned the RB. ### Claim 14 (depends on 11) The method of claim 11, wherein scheduling the one or more of the UEs for transmission based on the UE conflict graph comprises: determining a maximum independent set (MIS) of UEs by iteratively performing, until no UEs remain in the ordering: selecting a next UE in the ordering to schedule for transmission, and excluding from the ordering all UEs having an edge in the UE conflict graph with the selected UE; and scheduling the MIS of UEs for simultaneous downlink transmission on the same RBs by: determining a modulation and coding scheme (MCS) and a number of RBs for each of the UEs in the MIS of UEs; determining a maximum of the determined number of RBs; and allocating the determined maximum number of RBs to each of the UEs in the MIS of UEs. ### Claim 15 (depends on 14) The method of claim 14, further comprising updating the MCS for the UEs in the MIS of UEs based on the allocated maximum number of RBs. ### Claim 16 (depends on 14) The method of claim 14, further comprising: excluding the MIS of UEs from the ordering and excluding the allocated RBs from the available RBs; and iteratively performing, until all of the UEs are scheduled: determining another one or more MISs of UEs, scheduling the one or more other MISs of UEs, excluding the one or more MISs from the ordering, and excluding the allocated RBs from the available RBs. ### Claim 17 A method by a central entity, comprising: determining a cluster graph, wherein vertices in the cluster graph correspond to one or more coordinated multipoint (CoMP) clusters for one or more user equipment (UE) for which there is a transmission and edges between vertices in the cluster graph correspond to CoMP clusters that have a scheduling conflict, wherein each CoMP cluster includes one or more transmission points (TPs); and assigning resources to one or more of the CoMP clusters based on the cluster graph. ### Claim 18 (depends on 17) The method of claim 17, wherein determining the cluster graph includes determining the vertices by determining CoMP clusters for which there is data to be scheduled for at least one of: a downlink joint transmission to one or more of the UEs or an uplink transmission from one or more of the UEs for joint reception. ### Claim 19 (depends on 17) The method of claim 17, wherein assigning resources to the one or more of the CoMP clusters based on the cluster graph comprises assigning orthogonal resources to CoMP clusters that have an edge between them in the cluster graph. ### Claim 20 (depends on 17) The method of claim 17, wherein determining the cluster graph includes: merging a first CoMP cluster for a first UE when the first CoMP cluster is a subset of a second CoMP cluster for a second UE; and including only a vertex corresponding to the merged CoMP cluster in the cluster graph. ### Claim 21 (depends on 17) The method of claim 17, wherein determining the cluster graph includes determining CoMP clusters that have a scheduling conflict based on at least one of: whether the CoMP clusters include at least one common TP or whether at least one of the TPs in the CoMP clusters is configured to perform muting for interference management of one or more UEs in another CoMP cluster. ### Claim 22 (depends on 17) The method of claim 17, further comprising receiving backhaul information from one or more of the TPs in the one or more of the CoMP clusters, wherein the determination of the cluster graph is based on the backhaul information. ### Claim 23 (depends on 17) The method of claim 17, wherein the CoMP clusters comprise UE-centric CoMP clusters, each UE-centric CoMP cluster including TPs having a signal quality with respect to the UEs served by the TPs that satisfies a threshold. ### Claim 24 An apparatus, comprising: means for determining a user equipment (UE) conflict graph, wherein vertices in the UE conflict graph correspond to UEs for which there is a transmission and edges between vertices in the UE conflict graph correspond to UEs that have a scheduling conflict; and means for scheduling one or more of the UEs for transmission based on the UE conflict graph. ### Claim 25 (depends on 24) The apparatus of claim 24, further comprising: means for determining an ordering of the UEs in the UE conflict graph; and means for determining a set of resource blocks (RBs) available for scheduling. ### Claim 26 (depends on 25) The apparatus of claim 25, wherein scheduling the one or more of the UEs for transmission based on the UE conflict graph comprises: for each of the RBs available for scheduling, maintaining a list of the UEs that can be assigned the RB; and iteratively performing in descending order: determining a modulation and coding scheme (MCS) and a number of RBs for a first UE in the ordering; assigning the number of RBs for the first UE from the RBs including the first UE in the list for the RB; and for each of the assigned RBs, removing the first UE and all UEs having an edge in the UE conflict graph with the first UE from the list of the UEs that can be assigned the RB. ### Claim 27 (depends on 25) The apparatus of claim 25, wherein scheduling the one or more of the UEs for transmission based on the UE conflict graph comprises: determining a maximum independent set (MIS) of UEs by iteratively performing, until no UEs remain in the ordering: selecting a next UE in the ordering to schedule for transmission, and excluding from the ordering all UEs having an edge in the UE conflict graph with the selected UE; and scheduling the MIS of UEs for simultaneous downlink transmission on the same RBs by: determining a modulation and coding scheme (MCS) and a number of RBs for each of the UEs in the MIS of UEs; determining a maximum of the determined number of RBs; and allocating the determined maximum number of RBs to each of the UEs in the MIS of UEs. ### Claim 28 An apparatus, comprising: means for determining a cluster graph, wherein vertices in the cluster graph correspond to one or more coordinated multipoint (CoMP) clusters for one or more user equipment (UE) for which there is a transmission and edges between vertices in the cluster graph correspond to CoMP clusters that have a scheduling conflict, wherein each CoMP cluster includes one or more transmission points (TPs); and means for assigning resources to one or more of the CoMP clusters based on the cluster graph. ### Claim 29 (depends on 28) The apparatus of claim 28, wherein the means for assigning resources to the one or more of the CoMP clusters based on the cluster graph comprises means for assigning orthogonal resources to CoMP clusters that have an edge between them in the cluster graph. ### Claim 30 (depends on 28) The method of claim 28, wherein the means for determining the cluster graph includes means for determining CoMP clusters that have a scheduling conflict based on at least one of: whether the CoMP clusters include at least one common TP or whether at least one of the TPs in the CoMP clusters is configured to perform muting for interference management of one or more UEs in another CoMP cluster.