Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Cell Clustering Algorithm Based on Interference Coordination

A technology for cell clustering and interference coordination, applied in the field of information processing, it can solve the problems of inability to eliminate the strongest interference, limited average throughput gain of system throughput cells, and poor flexibility.

Active Publication Date: 2021-04-09
陕西云瑞创智科技有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, for users in different geographical locations, the interference source that causes the strongest interference to them does not necessarily come from within the cluster. Using this clustering scheme cannot eliminate the strongest interference, which will lead to overall system throughput and cell average throughput gains. Restricted; in addition, the strongest interfering cell may also change during the user's movement in the system network
Overall, the network-based clustering scheme is simple to implement but less flexible

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The present invention will be further described below:

[0021] The realization steps of grouping algorithm of the present invention:

[0022] Step 1: Calculate the sum of the weights of M users respectively where w uv Represents the interference weight between user u and user v, and M represents the number of users;

[0023] Step 2: Calculate the centroid of the entire user weight, introduce a disturbance factor d, split the centroid into two sub-nodes, and split into two groups centered on this sub-node. Then calculate all users E separately u The distance between the two child nodes, take out the smallest user N in the distance corresponding to each child node, and store them in the group respectively;

[0024] Step 3: The remaining M-N nodes in the set are assigned a node to the group every iteration, and at the same time, it is necessary to ensure that the weight sum in the group is the smallest;

[0025] Step 4: Once a new node is assigned to the group, upda...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a cell clustering algorithm based on interference coordination. Compared with the prior art, the invention is based on a user-based clustering scheme, and each user can freely select the most suitable cooperative cluster. From the user's point of view, once By becoming a cooperative cell, the interference between cells can be eliminated to the greatest extent, and a higher system throughput gain can be obtained. The idea of ​​the user grouping algorithm is to iteratively assign nodes to the cluster, to ensure that the distance increment allocated to the nodes in the group is minimized during each iteration, and to put the users with strong interference into a group for processing at the same time, and the group The interference avoidance technology based on the time domain or the frequency domain is used for inter-interference interference; the inter-cell interference coordination technology is used for intra-group interference.

Description

technical field [0001] The invention relates to the technical field of information processing, in particular to a cell clustering algorithm based on interference coordination. Background technique [0002] CoMP technology achieves higher average cell throughput and cell user edge throughput through inter-cell cooperation. However, the information sharing required for all base stations to participate in the cooperation of designated users requires a high backhaul capacity; for large-scale The complexity of the system network is very high, and it is almost difficult to realize; in addition, the main interference of users in a cell comes from a limited number of adjacent cells, and the interference generated by other cells is relatively small. In order to reduce the implementation complexity of inter-cell cooperation, the cooperation technology can be limited to a cooperation cluster composed of a limited number of base stations or access points. In fact, choosing a suitable c...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04W72/12H04W40/32H04W16/10H04J11/00
CPCH04J11/0053H04W16/10H04W40/32H04W72/121
Inventor 梁彦霞孙长印卢光跃杨武军王军选姜静何华李皓
Owner 陕西云瑞创智科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com