CN109309922B - Clustering algorithm for improving fairness of edge users - Google Patents
Clustering algorithm for improving fairness of edge users Download PDFInfo
- Publication number
- CN109309922B CN109309922B CN201811401992.3A CN201811401992A CN109309922B CN 109309922 B CN109309922 B CN 109309922B CN 201811401992 A CN201811401992 A CN 201811401992A CN 109309922 B CN109309922 B CN 109309922B
- Authority
- CN
- China
- Prior art keywords
- edge
- users
- base station
- user
- max
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a clustering algorithm for improving fairness of edge users, which marks the users; users can be classified into three types of center users, center-edge users and edge-edge users according to the received power of the users receiving the adjacent base stations; compared with the prior art, the invention adopts the cooperative base station clustering concept with the user as the center, not only suppresses the serious interference problem among cells, but also improves the access possibility of two edge users which possibly cannot access any base station, and simultaneously ensures that most of the access users of the base station are central users, thereby ensuring the access of the edge users while not reducing the network throughput.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a clustering algorithm for improving fairness of edge users.
Background
The fifth generation mobile communication system (5G) is expected to solve the problem of data transmission of mass mobile devices into the network, and in order to cope with this increasing goal, ultra-dense cells and cloud computing are considered as two key solution technologies. In the ultra-dense networking mode, the communication distance between the service base station and the user is reduced, so that the intensity of the received signal of the user side is improved. However, the neighbor cell base stations of the user are closer to the user than the common network, so that the user faces the inter-cell interference problem caused by more neighbor cell base stations, and the transmission performance of the network is reduced. The problem of inter-cell interference can be handled by combining ultra-dense networking with Cloud radio access to form a C-RAN (Cloud-Radio Access Network Cloud-radio access network) network.
In the C-RAN, all base stations are connected to a central cloud processor, and each user is connected to a plurality of base stations through a core idea centered on the user, which is called a "cluster" base station, equivalent to converting an interference base station of the user into a service base station of the user, where the central cloud processor can directly share user information to a plurality of service base stations of the user through a backhaul link, and the plurality of service base stations encode the user information through a linear precoding or beam forming technique and cooperatively transmit to the user to perform downlink interference cancellation.
For users, each user can be served by a base station cluster selected independently in a user-centric manner, each user can be expected to be associated with as many neighbor base stations as possible (base stations which are close to the user or have strong user receiving power) around, so that the neighbor base stations serve as base station cluster members of the user, while for the base stations, a large number of users are likely to be accessed, which contradicts the limited backhaul resource links of the base stations, so that the number of users which can be accessed by the base stations cannot exceed a certain threshold.
The user-centric clustering algorithm proposed in the present patent utilizes the maximum number of connectable users per base station and candidate base station clusters per user to jointly determine and implement the base station clustering process per user.
Disclosure of Invention
The present invention aims to solve the above problems and provide a clustering algorithm for improving fairness of edge users.
The invention realizes the above purpose through the following technical scheme:
the invention comprises the following steps:
step one: marking the user; users can be classified into three types of center users, center-edge users and edge-edge users according to the received power of the users receiving the adjacent base stations;
● The central user: when at least one of all received powers from the neighboring base stations is equal to or greater than delta 1 Such users are referred to as central users
● Center-edge users when the received power from neighboring base stations is less than delta 1 But at least one is greater than or equal to delta 2 Such users are referred to as center-edge users
● Edge-edge user: when the received power from the neighboring base stations is less than delta 2 Such users are referred to as edge-to-edge users;
wherein delta 1 And delta 2 Are all power thresholds, and delta 1 ＞δ 2 ；
Step two: determining an alternative base station cluster C of a user k ；
● The central user: if P l,k ≥δ 1 ，P l,k For the received power from base station l to central user k, base station l is selected as an alternative base station cluster member of user k, l e C k ；
● Center-edge user: if delta 1 ＞P l,k ≥δ 2 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k
● Edge-edge user: if delta 2 ＞P l,k ≥δ 3 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k ；
Wherein delta 3 Selecting a threshold value for an alternative base station cluster for edge-to-edge users, and delta 1 ＞δ 2 ＞δ 3 ；
And a third step of: the base station selects an access user; after each user determines the own alternative base station cluster, an access request is sent to all base stations in the alternative base station cluster; for each base station, an access request will be received for many desired access users, but due to the limited backhaul link resourcesThe maximum number of base stations which each base station can access is set as K l,max ，K l,max Representing the maximum number of users allowed to be accessed by the base station l;
● The base station checks the user type of the request access to the base station, if there is a request of the edge-edge user, the edge-edge user is directly added in the request, and the maximum access edge user quantity K is set for each base station l,edge-max The method comprises the steps of carrying out a first treatment on the surface of the In general, the number of edge-to-edge and user requests is very small, typically not exceeding K l,edge-max ；
● The number of center-edge users that the base station l can also admit is K l,edge-max -K l,edge-edge Wherein K is l,edge-edge The number of edge-to-edge users to request to join base station l;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In just K l,edge-max -K l,edge-edge The central edge users directly connect the K l,max -K l,edge-edge Personal center user and center-edge user joining; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In which the number of center-edge users is less than K l,edge-max -K l,edge-edge Let only K l,centric-edge Center-edge users, K l,edge-max -K l,edge-edge ＞K l,centric-edge Then K is needed before the power is ranked from big to small l,max -K l,edge-edge Searching for the top K with higher rank after each user l,edge-max -K l,edge-edge -K l,centric-edge The individual center-edge users join the base station l instead of the power from big to small rank K l,max -K l,edge-edge post-K in individual users l,edge-max -K l,edge-edge -K l,centric-edge A central user; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
the algorithm stops until all users send requests to the alternative cluster of base stations and all base stations establish their own access users.
The invention has the beneficial effects that:
compared with the prior art, the clustering algorithm for improving the fairness of the edge users adopts the cooperative base station clustering concept with the users as centers, so that the serious interference problem among cells is restrained, the access possibility of two types of edge users which possibly cannot access any base station is improved, and meanwhile, most of the access users of the base station are central users, so that the access of the edge users is ensured while the throughput of a network is not reduced, and the clustering algorithm has more perfect performance than the traditional algorithm.
Drawings
Fig. 1 is a schematic diagram of three types of center users, center-edge users, and edge-edge users of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings:
the clustering algorithm with the user as the center utilizes the maximum number of connectable users of each base station and candidate base station clusters of each user to jointly determine and realize the base station clustering process of each user. Suppose that each base station is connected to its own most powerful front K with request l,max Users establish a connection, most likely with edge users at a far distance from risk of connecting to no base station, as base stations are more easily connected by central users at a closer distance. In order to improve fairness of edge users accessing to a network, a clustering algorithm for improving fairness of edge users is provided, which comprises the following steps:
step one: marking the user; users can be classified into three types, namely, a center user, a center-edge user and an edge-edge user according to the received power of the users received by the neighboring base stations, as shown in fig. 1;
● The central user: when at least one of all received powers from the neighboring base stations is equal to or greater than delta 1 Such users are referred to as central users
● Center-edge users when the received power from neighboring base stations is less than delta 1 But at least one is greater than or equal to delta 2 Such users are referred to as center-edge users
● Edge-edge user: when the received power from the neighboring base stations is less than delta 2 Such users are referred to as edge-to-edge users;
wherein delta 1 And delta 2 Are all power thresholds, and delta 1 ＞δ 2 ；
Step two: determining an alternative base station cluster C of a user k ；
● The central user: if P l,k ≥δ 1 ，P l,k For the received power from base station l to central user k, base station l is selected as an alternative base station cluster member of user k, l e C k ；
● Center-edge user: if delta 1 ＞P l,k ≥δ 2 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k
● Edge-edge user: if delta 2 ＞P l,k ≥δ 3 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k ；
Wherein delta 3 Selecting a threshold value for an alternative base station cluster for edge-to-edge users, and delta 1 ＞δ 2 ＞δ 3 ；
And a third step of: the base station selects an access user; after each user determines the own alternative base station cluster, an access request is sent to all base stations in the alternative base station cluster; for each base station, access requests of many expected access users will be received, but the maximum number of base stations that each base station can access is set to K due to the limitation of backhaul link resources l,max ，K l,max Representing the maximum number of users allowed to be accessed by the base station l;
● The base station checks the user type of the request access to the base station, if there is a request of the edge-edge user, the edge-edge user is directly added in the request, and the maximum access edge user quantity K is set for each base station l,edge-max The method comprises the steps of carrying out a first treatment on the surface of the In general, the number of edge-to-edge and user requests is very small, typically not exceeding K l,edge-max ；
● The number of center-edge users that the base station l can also admit is K l,edge-max -K l,edge-edge Wherein K is l,edge-edge The number of edge-to-edge users to request to join base station l;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In just K l,edge-max -K l,edge-edge The central edge users directly connect the K l,max -K l,edge-edge Personal center user and center-edge user joining; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In which the number of center-edge users is less than K l,edge-max -K l,edge-edge Let only K l,centric-edge Center-edge users, K l,edge-max -K l,edge-edge ＞K l,centric-edge Then K is needed before the power is ranked from big to small l,max -K l,edge-edge Searching for the top K with higher rank after each user l,edge-max -K l,edge-edge -K l,centric-edge The individual center-edge users join the base station l instead of the power from big to small rank K l,max -K l,edge-edge post-K in individual users l,edge-max -K l,edge-edge -K l,centric-edge A central user; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
the algorithm stops until all users send requests to the alternative cluster of base stations and all base stations establish their own access users.
The foregoing has shown and described the basic principles and main features of the present invention and the advantages of the present invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and that the above embodiments and descriptions are merely illustrative of the principles of the present invention, and various changes and modifications may be made without departing from the spirit and scope of the invention, which is defined in the appended claims. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (1)
1. A clustering method for improving fairness of edge users, comprising the steps of:
step one: marking the user; users can be classified into three types of center users, center-edge users and edge-edge users according to the received power of the users receiving the adjacent base stations;
● The central user: when at least one of all received powers from the neighboring base stations is equal to or greater than delta 1 Such users are referred to as central users
● Center-edge users when the received power from neighboring base stations is less than delta 1 But at least one is greater than or equal to delta 2 Such users are referred to as center-edge users
● Edge-edge user: when the received power from the neighboring base stations is less than delta 2 Such users are referred to as edge-to-edge users;
wherein delta 1 And delta 2 Are all power thresholds, and delta 1 ＞δ 2 ；
Step two: determining an alternative base station cluster C of a user k ；
● The central user: if P l,k ≥δ 1 ，P l,k For the received power from base station l to central user k, base station l is selected as an alternative base station cluster member of user k, l e C k ；
● Center-edge user: if delta 1 ＞P l,k ≥δ 2 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k
● Edge-edge user: if delta 2 ＞P l,k ≥δ 3 ，P l,k For the received power of base station l to center-edge user k, base station l is selected as an alternative base station cluster member for user k, l e C k ；
Wherein delta 3 Selecting a threshold value for an alternative base station cluster for edge-to-edge users, and delta 1 ＞δ 2 ＞δ 3 ；
And a third step of: the base station selects an access user; after each user determines the own alternative base station cluster, an access request is sent to all base stations in the alternative base station cluster; for any base station, access requests of many expected access users will be received, but the maximum number of base stations that each base station can access is set to K due to the limitation of backhaul link resources l,max ，K l,max Representing the maximum number of users allowed to be accessed by the base station l;
● The base station checks the user type of the request access to the base station, if there is a request of the edge-edge user, the edge-edge user is directly added in the request, and the maximum access edge user quantity K is set for each base station l,edge-max ；
● The number of center-edge users that the base station l can also admit is K l,edge-max -K l,edge-edge Wherein K is l,edge-edge The number of edge-to-edge users to request to join base station l;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In just K l,edge-max -K l,edge-edge The central edge users directly connect the K l,max -K l,edge-edge Personal center user and center-edge user joining; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
■ If the power level in the request received by the base station is top K l,max -K l,edge-edge In which the number of center-edge users is less than K l,edge-max -K l,edge-edge Let only K l,centric-edge Center-edge users, K l,edge-max -K l,edge-edge ＞K l,centric-edge Then K is needed before the power is ranked from big to small l,max -K l,edge-edge Searching for the top K with higher rank after each user l,edge-max -K l,edge-edge -K l,centric-edge The individual center-edge users join the base station l instead of the power from big to small rank K l,max -K l,edge-edge post-K in individual users l,edge-max -K l,edge-edge -K l,centric-edge A central user; l the rest of the access users of the base station are all K with top rank of the received power l,max -K l,edge-max A central user;
until all users send requests to the alternative cluster of base stations and all base stations establish their own access users, the algorithm stops.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811401992.3A CN109309922B (en) | 2018-11-22 | 2018-11-22 | Clustering algorithm for improving fairness of edge users |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811401992.3A CN109309922B (en) | 2018-11-22 | 2018-11-22 | Clustering algorithm for improving fairness of edge users |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109309922A CN109309922A (en) | 2019-02-05 |
| CN109309922B true CN109309922B (en) | 2023-07-04 |
Family
ID=65222340
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811401992.3A Active CN109309922B (en) | 2018-11-22 | 2018-11-22 | Clustering algorithm for improving fairness of edge users |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109309922B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546934A (en) * | 2013-10-22 | 2014-01-29 | 北京航空航天大学 | User-centered interference suppression method based on cooperation of multiple base stations |
| CN103686744A (en) * | 2013-12-03 | 2014-03-26 | 北京邮电大学 | Resource allocation methods, macro base station, femto base station and communication system |
| CN104244335A (en) * | 2013-06-13 | 2014-12-24 | 索尼公司 | Interference coordination method, interference coordination device and measuring device |
| CN104954054A (en) * | 2015-04-22 | 2015-09-30 | 重庆邮电大学 | Method for eliminating cell-edge user interference of multi-cell system under C-RAN architecture |
| CN107172682A (en) * | 2017-07-10 | 2017-09-15 | 南京邮电大学 | Super-intensive network radio resources distribution method based on dynamic clustering |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9480081B2 (en) * | 2013-03-15 | 2016-10-25 | Huawei Technologies Co., Ltd. | System and method for interference cancellation using terminal cooperation |
-
2018
- 2018-11-22 CN CN201811401992.3A patent/CN109309922B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104244335A (en) * | 2013-06-13 | 2014-12-24 | 索尼公司 | Interference coordination method, interference coordination device and measuring device |
| CN103546934A (en) * | 2013-10-22 | 2014-01-29 | 北京航空航天大学 | User-centered interference suppression method based on cooperation of multiple base stations |
| CN103686744A (en) * | 2013-12-03 | 2014-03-26 | 北京邮电大学 | Resource allocation methods, macro base station, femto base station and communication system |
| CN104954054A (en) * | 2015-04-22 | 2015-09-30 | 重庆邮电大学 | Method for eliminating cell-edge user interference of multi-cell system under C-RAN architecture |
| CN107172682A (en) * | 2017-07-10 | 2017-09-15 | 南京邮电大学 | Super-intensive network radio resources distribution method based on dynamic clustering |
Non-Patent Citations (4)
| Title |
|---|
| "SG13-LS139Att1_PLEN-208".3GPP tsg_sa\WG2_Arch.2016,全文. * |
| MediaTek Inc..R1-1700156 "Interference management techniques for dynamic TDD".3GPP tsg_ran\WG1_RL1.2017,(第TSGR1_AH期),全文. * |
| 雷秋燕 ; 张治中 ; 程方 ; 胡昊南 ; .基于C-RAN的5G无线接入网架构.电信科学.2015,(第01期),全文. * |
| 黄俊伟 ; 周朋光 ; 张仁迟 ; 滕得阳 ; 徐浩 ; .超密集网络中小小区分簇和子载波分配算法.电子技术应用.2017,(第07期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109309922A (en) | 2019-02-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109474980B (en) | Wireless network resource allocation method based on deep reinforcement learning | |
| Zhu et al. | Downlink resource reuse for device-to-device communications underlaying cellular networks | |
| Liang et al. | A cluster-based energy-efficient resource management scheme for ultra-dense networks | |
| CN113411105B (en) | AP selection method of non-cell large-scale antenna system | |
| CN108063632B (en) | Energy efficiency-based cooperative resource allocation method in heterogeneous cloud access network | |
| CN107343268B (en) | Non-orthogonal multicast and unicast transmission beamforming method and system | |
| CN107911857B (en) | Multi-access method based on uplink and downlink decoupling in ultra-dense heterogeneous network | |
| Yu et al. | Interference coordination strategy based on Nash bargaining for small‐cell networks | |
| Zhang et al. | Joint C-OMA and C-NOMA wireless backhaul scheduling in heterogeneous ultra dense networks | |
| CN105959043B (en) | A kind of multi-base station cooperative transmission strategy of efficiency driving | |
| Hajijamali Arani et al. | A distributed learning–based user association for heterogeneous networks | |
| Zhang et al. | Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks | |
| Wang et al. | Performance Analysis of Location-based Base Station Cooperation for Cellular-Connected UAV Networks | |
| CN109309922B (en) | Clustering algorithm for improving fairness of edge users | |
| CN102186215B (en) | Switching method of multipoint-multiuser oriented cooperation transmission | |
| WO2015085494A1 (en) | Base station and user scheduling method | |
| Van | Optimal Interference for Device to Device Communication Underlaying Cellular Network. | |
| CN108293192B (en) | Spectrum access method and device using same | |
| Mankar et al. | Meta distribution for downlink NOMA in cellular networks with 3GPP-inspired user ranking | |
| CN104581905B (en) | A kind of method of small base station activation in cooperation HetNet | |
| WO2014067158A1 (en) | Scheduling method, device and base station | |
| Dinh et al. | Massive MIMO cognitive cooperative relaying | |
| CN108540964B (en) | Spectrum resource allocation method | |
| Wu et al. | A two-stage resource allocation for SCMA-based C-V2X networks | |
| CN107580369B (en) | The reversed TDD heterogeneous network wireless backhaul resource allocation methods of extensive 3D MIMO |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |