WO2016045417A1 - Method, device for determining serving base station and base station - Google Patents

Method, device for determining serving base station and base station Download PDF

Info

Publication number
WO2016045417A1
WO2016045417A1 PCT/CN2015/081469 CN2015081469W WO2016045417A1 WO 2016045417 A1 WO2016045417 A1 WO 2016045417A1 CN 2015081469 W CN2015081469 W CN 2015081469W WO 2016045417 A1 WO2016045417 A1 WO 2016045417A1
Authority
WO
WIPO (PCT)
Prior art keywords
base station
path loss
average path
serving
user
Prior art date
Application number
PCT/CN2015/081469
Other languages
French (fr)
Chinese (zh)
Inventor
程翔
汪彬
李红豆
常永宇
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016045417A1 publication Critical patent/WO2016045417A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/20Selecting an access point

Definitions

  • the present invention relates to the field of communications, and in particular, to a method, an apparatus, and a base station for determining a serving base station.
  • Small Cell is introduced, that is, a small cell base station, which is simply referred to as a small base station.
  • Small Cell is a low-power wireless access node that operates in an authorized, unlicensed spectrum. Small Cell can be used indoors or outdoors, covering 10 meters of indoor space or 2 km in the field; in contrast, macro base stations can cover several kilometers. Small Cell combines femtocell, picocell, microcell and distributed wireless technologies. Small Cell is characterized by dense layout and overlapping coverage.
  • Ultra Dense Networks one of the 5G business development requirements, is a network architecture formed by high-density deployment of Small Cell without exact planning requirements. This network architecture can improve spectral efficiency by reducing the distance between the transmitter and the receiver, while improving the quality of service of the macro base station by offloading the wireless traffic. UDN also provides an effective solution for the high capacity and high data rate requirements of future communication systems. UDN is a model for the development of network architecture in the direction of low cost, plug and play, self-organization and self-healing.
  • the massively densely deployed Small Cell also poses some challenges for the development of 5G. For example, more complex interference situations, etc., and different levels of coordination and cooperation between Small Cell are the key to controlling interference at an appropriate level and increasing network capacity. How to reduce system interference and improve system performance need to be solved by rationally planning the location of small cells on this basis.
  • the present invention provides a method, an apparatus, and a base station for determining a serving base station, so as to at least solve the problem that the allocation of the base station in the ultra-dense network UDN in the related art is unreasonable and the system interference is excessive.
  • a method for determining a serving base station includes: determining a central average path loss value between N base stations of a super-dense network UDN and a center user, and between the N base stations and edge users An edge average path loss value, wherein the central user is within a predetermined range of service for the N base stations a user outside the predetermined range that the edge user serves for the N base stations; determining, for the service, from the N base stations according to the central average path loss value and the edge average path loss value Base station.
  • the base station for serving is determined from the N base stations according to the central average path loss value and the edge average path loss value by using the following formula: Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
  • the central average path loss value is determined according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • the edge average path loss value is determined according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • determining the base station for serving according to the value of OF includes: turning off a base station corresponding to a minimum OF value of the OF values, and determining a base station for serving from the N base stations.
  • a device for determining a serving base station comprising: a first determining module configured to determine a central average path loss value and a value between N base stations of the ultra-dense network UDN and a central user An edge average path loss value between the N base stations and the edge user, wherein the central user is a user within a predetermined range served by the N base stations, and the edge user serves the N base stations a user outside the predetermined range; a second determining module configured to determine a base station for serving from the N base stations based on the central average path loss value and the edge average path loss value.
  • the apparatus further includes: a first calculating module, configured to determine, according to the central average path loss value and the edge average path loss value, from the N base stations by using a formula Service base station: Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
  • the apparatus further includes: a second calculating module, configured to determine the central average path loss value according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • the apparatus further includes: a third calculating module, configured to determine the edge average path loss value according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • the device further includes: a third determining module, configured to determine, according to the value of the OF, the base station for serving, comprising: turning off a base station corresponding to a minimum OF value of the OF values, from the N A base station for serving is determined among the base stations.
  • a third determining module configured to determine, according to the value of the OF, the base station for serving, comprising: turning off a base station corresponding to a minimum OF value of the OF values, from the N A base station for serving is determined among the base stations.
  • a base station comprising at least one of the above means.
  • a central average path loss value between the N base stations of the ultra-dense network UDN and a central user Determining, by the embodiment of the present invention, a central average path loss value between the N base stations of the ultra-dense network UDN and a central user, and an edge average path loss value between the N base stations and an edge user, where the central user a user within a predetermined range serving the N base stations, the edge user serving the user outside the predetermined range served by the N base stations; according to the central average path loss value and the edge average path Determining the value of the base station for the service from the N base stations, solving the problem that the allocation of the base station in the ultra-dense network UDN in the related art is unreasonable and causing excessive system interference, thereby reducing interference between the base stations and improving system performance. Effect.
  • FIG. 1 is a flow chart of a method for determining a serving base station according to an embodiment of the present invention
  • FIG. 2 is a block diagram of an apparatus for determining a serving base station according to an embodiment of the present invention
  • FIG. 3 is a block diagram 1 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention
  • FIG. 4 is a block diagram 2 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention
  • Figure 5 is a block diagram 3 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention
  • FIG. 6 is a block diagram 4 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention
  • FIG. 7 is a flowchart 1 of a method for determining a serving base station according to a preferred embodiment of the present invention.
  • FIG. 8 is a flowchart 2 of a method for determining a serving base station according to a preferred embodiment of the present invention.
  • FIG. 9 is a schematic diagram of an effect comparison before and after optimization of a base station according to a preferred embodiment of the present invention.
  • FIG. 1 is a flowchart of a method for determining a serving base station according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
  • Step S102 determining a central average path loss value between the N base stations of the ultra-dense network UDN and the central user, and an edge average path loss value between the N base stations and the edge users, wherein the central user is the N base stations. a user within a predetermined range of services for which the edge user serves the user outside the predetermined range of the N base stations;
  • Step S104 Determine a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value.
  • determining a central average path loss value between the N base stations of the ultra-dense network UDN and the central user and an edge average path loss value between the N base stations and the edge users wherein the central user is the N a user within a predetermined range of the base station service, the user outside the predetermined range served by the edge user for the N base stations, determined from the N base stations according to the central average path loss value and the edge average path loss value.
  • the base station for serving is determined from the N base stations according to the central average path loss value and the edge average path loss value by using the following formula: Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
  • the central average path loss value is determined according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • the edge average path loss value is determined according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • determining, according to the value of OF, the base station for serving includes: closing a base station corresponding to a minimum OF value in the OF value, determining a base station for serving from the N base stations, thereby reducing the base station.
  • Mutual interference increases the performance of the system.
  • a device for determining a serving base station is provided, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 2 is a block diagram of an apparatus for determining a serving base station according to an embodiment of the present invention. As shown in FIG. 2, the method includes: a first determining module 22 and a second determining module 24. The following describes each module.
  • the first determining module 22 is configured to determine a central average path loss value between the N base stations of the ultra-dense network UDN and the central user, and an edge average path loss value between the N base stations and the edge user, where the central user a user within a predetermined range serving the N base stations, the edge users serving the N base stations outside the predetermined range of users;
  • the second determining module 24 is configured to determine a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value.
  • FIG. 3 is a block diagram of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 3, the apparatus further includes:
  • the first calculating module 32 is configured to determine, by using the following formula, a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value: Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
  • FIG. 4 is a block diagram 2 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 4, the apparatus further includes:
  • the second calculation module 42 is configured to determine the central average path loss value according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • FIG. 5 is a block diagram 3 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 5, the apparatus further includes:
  • the third calculating module 52 is configured to determine the edge average path loss value according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • is the total number of users served by the small base station k; C 1 takes an integer in the range, when C When 1
  • FIG. 6 is a block diagram 4 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 6, the apparatus further includes:
  • the third determining module 62 is configured to determine, according to the value of the OF, the base station for serving, that: the base station corresponding to the minimum OF value of the OF value is turned off, and the base station for serving is determined from the N base stations.
  • a base station including at least one of the foregoing devices.
  • the uncertainty of the distribution of the user in a specific coverage area with time changes.
  • the throughput of the network changes with time. For example, at a certain time, users are concentrated in a small part of the coverage of the small cell base station group, which causes other small cell base stations to generate resources idle and reduce spectrum efficiency. Or at a certain time, the user is distributed at the edge of the small cell. At this time, the small cell base station side needs a large transmission power, which will cause large interference to the users in the same frequency band of the adjacent small cells, and the adjacent small cell edge When there are many users, the interference is especially serious.
  • the user service distribution is relatively unchanged over a long period of time.
  • a certain floor in an office building is rented to a company as an employee office area, but For various reasons, this floor is subletted to an educational institution for use as a classroom.
  • the office area changes to the classroom, the user distribution status also changes. Therefore, the original small cell base station deployment cannot match the current user distribution status. The system performance is thus degraded.
  • the embodiment of the present invention provides a method for optimizing the location of a small Cell base station in a UDN environment. After optimizing the deployment of the original small cell base station, the signal to noise ratio of the user can be improved, and the system performance is optimized. Not only can improve system resource utilization but also save power and reduce interference.
  • N small cell base stations are preset, numbered S 1 , S 2 , . . . , S N , and each small cell base station allows access;
  • K small cell base stations are deployed in the original state, and NK small cell base stations are additionally added before the optimization, and N small cell base stations are obtained, numbered as S 1 , S 2 , ..., S N , each small cell base station allows access.
  • N small cell base stations whose initial states are optimized to be fixed positions are optimized.
  • the number of optimized small cell base station targets is preset to K.
  • the optimization algorithm proposed by the embodiment of the present invention is based on two optimization targets for maximizing the average signal quality of the central user of the entire service area and minimizing the difference of signal quality. Determining the base station for service from the N base stations based on the central average path loss value and the edge average path loss value: Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
  • u denotes a penalty factor and takes a constant.
  • the edge average path loss value is determined according to the following formula:
  • u denotes a penalty factor and takes a constant.
  • g j (k) is the path loss between the jth user and the kth base station
  • the method for optimizing the location of the small cell base station specifically includes: for the N small cell base stations with the numbers S 1 , S 2 , . . . , S N in the initial state, obtaining the path loss between the J and the jth user according to the above criteria.
  • the smallest k-th base station acts as an access base station, and separately counts the OF value, and compares and finds the single small-cell base station S j with the smallest OF value to close or remove the small-cell base station; and sets the remaining small-cell base station ⁇ S 1 , S 2 Step S2 is continued in S N ⁇ ; step S3 is repeated until the number of remaining small cell base stations is the number of optimized small cell base station targets.
  • a method of shutting down the small cell base station is adopted, and all the small cell base stations are reactivated and the above optimization algorithm is implemented at intervals; and the mobility of the other user is relatively low.
  • the method of removing the small cell base station is adopted to achieve a small cell base station arrangement pattern that matches the current user distribution.
  • the small cell base station that affects the target is closed or removed, thereby achieving the purpose of optimizing the location of the small cell base station, thereby Improve system performance. It is especially suitable for UDNs where the small cell base station is extremely dense.
  • FIG. 7 is a flowchart 1 of a method for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 7, in a high mobility scenario of a user, performing location optimization on a small cell base station includes the following steps:
  • Step S702 initializing and activating N base stations
  • Step S704 calculating and comparing the OF of each base station
  • Step S706 turning off the base station with the smallest OF value
  • Step S708 it is checked whether the number of remaining base stations has dropped to K, if yes, step S710 is performed, otherwise step S704 is performed;
  • step S710 it is checked whether the preset interval time is reached. If yes, step S702 is performed, otherwise step S710 is performed.
  • FIG. 8 is a second flowchart of a method for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 8, the user performs location optimization on a small cell base station in a relatively low mobility scenario, including the following steps:
  • Step S802 adding N-Ks to the original K base stations according to the original deployment rule
  • Step S804 initializing and activating N base stations
  • Step S806 calculating and comparing the OF values of the respective base stations
  • Step S808 removing the base station with the smallest OF value
  • Step S810 it is checked whether the number of remaining base stations has dropped to K, and then the optimization is completed, otherwise step S806 is performed.
  • FIG. 9 is a schematic diagram of the effect comparison before and after optimization of a base station according to a preferred embodiment of the present invention.
  • 12 small cell base stations are originally deployed in a grid shape, and the users are evenly distributed.
  • the illustrated results are obtained after optimization by the scheme.
  • the location of the small cell base station before optimization and the location of the optimized small cell base station are completely different.
  • the optimization method of the embodiment of the present invention optimizes the base station, which not only improves system resource utilization but also saves Power, reduce interference.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above embodiments and the preferred embodiments solve the problem that the allocation of the base stations in the ultra-dense network UDN in the related art is unreasonable and the system interference is too large, thereby achieving the effect of reducing interference between the base stations and improving system performance.

Abstract

A method, device for determining a serving base station and a base station are disclosed in the present invention, wherein the method comprises: determining a centre average path loss value between the number of N base stations in a Ultra Dense Network (UDN) and a centre user, and an edge average path loss value between the number of N base stations and an edge user, and the centre user being a user in a pre-determined range served by the number of N base stations, and the edge user being a user outside the pre-determined range served by the number of N base stations; and determining a base station for serving from the number of N base stations according to the centre average path loss value and the edge average path loss value. With the present invention, the problem of excessive system interference caused by an irrational allocation of base stations in the Ultra Dense Network (UDN) in the related art is solved, and then the effect that interference between the base stations is reduced and system performance is improved is achieved.

Description

服务基站确定的方法、装置及基站Method, device and base station determined by serving base station 技术领域Technical field
本发明涉及通信领域,具体而言,涉及一种服务基站确定的方法、装置及基站。The present invention relates to the field of communications, and in particular, to a method, an apparatus, and a base station for determining a serving base station.
背景技术Background technique
在LTE R12中,引入了Small Cell,即小小区基站,简称为小基站。Small Cell是低功率的无线接入节点,工作在授权的、非授权的频谱。Small Cell可以用于室内或室外,可以覆盖10米的室内空间或野外2公里的范围;相比之下,宏基站的覆盖范围可以达到数公里。Small Cell融合了femtocell、picocell、microcell和分布式无线技术。Small Cell的特点是布置密集,覆盖范围互相交叉。In LTE R12, a Small Cell is introduced, that is, a small cell base station, which is simply referred to as a small base station. Small Cell is a low-power wireless access node that operates in an authorized, unlicensed spectrum. Small Cell can be used indoors or outdoors, covering 10 meters of indoor space or 2 km in the field; in contrast, macro base stations can cover several kilometers. Small Cell combines femtocell, picocell, microcell and distributed wireless technologies. Small Cell is characterized by dense layout and overlapping coverage.
作为5G的业务发展需求之一的超密集网络(Ultra Dense Networks,简称为UDN),是Small Cell在无确切规划要求的前提下,通过高密度部署形成的网络架构。这种网络架构能够通过减少的发射机和接收机之间的距离提高频谱效率,同时,能够通过卸载无线流量改善宏基站的服务质量。UDN也为未来通信系统的大容量和高数据速率需求提供了有效的解决方案。UDN是网络架构一步朝着低成本,即插即用,自组织和自愈合方向发展的典范。Ultra Dense Networks (UDN), one of the 5G business development requirements, is a network architecture formed by high-density deployment of Small Cell without exact planning requirements. This network architecture can improve spectral efficiency by reducing the distance between the transmitter and the receiver, while improving the quality of service of the macro base station by offloading the wireless traffic. UDN also provides an effective solution for the high capacity and high data rate requirements of future communication systems. UDN is a model for the development of network architecture in the direction of low cost, plug and play, self-organization and self-healing.
在UDN中,大规模密集部署的Small Cell也给5G的发展带来了一些挑战。比如更加复杂的干扰情况等等,而Small Cell间不同级别的协调合作是将干扰控制在适当水平并提升网络容量的关键。如何在此基础上通过合理规划小小区位置来降低系统干扰,提升系统性能亟待解决。In the UDN, the massively densely deployed Small Cell also poses some challenges for the development of 5G. For example, more complex interference situations, etc., and different levels of coordination and cooperation between Small Cell are the key to controlling interference at an appropriate level and increasing network capacity. How to reduce system interference and improve system performance need to be solved by rationally planning the location of small cells on this basis.
针对相关技术中超密集网络UDN中基站的分配不合理使得系统干扰过大的问题,目前尚未提出有效的解决方案。Aiming at the problem that the allocation of base stations in the ultra-dense network UDN in the related art is unreasonable and the system interference is too large, an effective solution has not been proposed yet.
发明内容Summary of the invention
本发明提供了一种服务基站确定的方法、装置及基站,以至少解决相关技术中超密集网络UDN中基站的分配不合理使得系统干扰过大的问题。The present invention provides a method, an apparatus, and a base station for determining a serving base station, so as to at least solve the problem that the allocation of the base station in the ultra-dense network UDN in the related art is unreasonable and the system interference is excessive.
根据本发明的一个方面,提供了一种服务基站确定的方法,包括:确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和所述N个基站与边缘用户之间的边缘平均路损值,其中,所述中心用户为所述N个基站服务的预定范围之内的用 户,所述边缘用户为所述N个基站服务的所述预定范围之外的用户;根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站。According to an aspect of the present invention, a method for determining a serving base station includes: determining a central average path loss value between N base stations of a super-dense network UDN and a center user, and between the N base stations and edge users An edge average path loss value, wherein the central user is within a predetermined range of service for the N base stations a user outside the predetermined range that the edge user serves for the N base stations; determining, for the service, from the N base stations according to the central average path loss value and the edge average path loss value Base station.
在本发明实施例中,通过以下公式,根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站:
Figure PCTCN2015081469-appb-000001
其中,OF为用于确定服务的基站的参数值,f1为所述中心平均路损值,f2为所述边缘平均路损值。
In the embodiment of the present invention, the base station for serving is determined from the N base stations according to the central average path loss value and the edge average path loss value by using the following formula:
Figure PCTCN2015081469-appb-000001
Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
在本发明实施例中,根据以下公式确定所述中心平均路损值:In the embodiment of the present invention, the central average path loss value is determined according to the following formula:
Figure PCTCN2015081469-appb-000002
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000002
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000003
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000004
Figure PCTCN2015081469-appb-000003
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000004
Figure PCTCN2015081469-appb-000005
Figure PCTCN2015081469-appb-000005
Figure PCTCN2015081469-appb-000006
Figure PCTCN2015081469-appb-000006
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
在本发明实施例中,根据以下公式确定所述边缘平均路损值:In the embodiment of the present invention, the edge average path loss value is determined according to the following formula:
Figure PCTCN2015081469-appb-000007
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000007
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000008
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000009
Figure PCTCN2015081469-appb-000008
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000009
Figure PCTCN2015081469-appb-000010
Figure PCTCN2015081469-appb-000010
Figure PCTCN2015081469-appb-000011
Figure PCTCN2015081469-appb-000011
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
在本发明实施例中,根据OF的值确定用于服务的基站包括:关闭所述OF值中的最小OF值对应的基站,从所述N个基站中确定用于服务的基站。In the embodiment of the present invention, determining the base station for serving according to the value of OF includes: turning off a base station corresponding to a minimum OF value of the OF values, and determining a base station for serving from the N base stations.
根据本发明的另一方面,还提供了一种服务基站确定的装置,包括:第一确定模块,设置为确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和所述N个基站与边缘用户之间的边缘平均路损值,其中,所述中心用户为所述N个基站服务的预定范围之内的用户,所述边缘用户为所述N个基站服务的所述预定范围之外的用户;第二确定模块,设置为根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站。According to another aspect of the present invention, there is provided a device for determining a serving base station, comprising: a first determining module configured to determine a central average path loss value and a value between N base stations of the ultra-dense network UDN and a central user An edge average path loss value between the N base stations and the edge user, wherein the central user is a user within a predetermined range served by the N base stations, and the edge user serves the N base stations a user outside the predetermined range; a second determining module configured to determine a base station for serving from the N base stations based on the central average path loss value and the edge average path loss value.
在本发明实施例中,所述装置还包括:第一计算模块,设置为通过以下公式,根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站:
Figure PCTCN2015081469-appb-000012
其中,OF为用于确定服务的基站的参数值,f1为所述中心平均路损值,f2为所述边缘平均路损值。
In an embodiment of the present invention, the apparatus further includes: a first calculating module, configured to determine, according to the central average path loss value and the edge average path loss value, from the N base stations by using a formula Service base station:
Figure PCTCN2015081469-appb-000012
Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
在本发明实施例中,所述装置还包括:第二计算模块,设置为根据以下公式确定所述中心平均路损值: In the embodiment of the present invention, the apparatus further includes: a second calculating module, configured to determine the central average path loss value according to the following formula:
Figure PCTCN2015081469-appb-000013
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000013
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000014
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000015
Figure PCTCN2015081469-appb-000014
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000015
Figure PCTCN2015081469-appb-000016
Figure PCTCN2015081469-appb-000016
Figure PCTCN2015081469-appb-000017
Figure PCTCN2015081469-appb-000017
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
在本发明实施例中,所述装置还包括:第三计算模块,设置为根据以下公式确定所述边缘平均路损值:In an embodiment of the present invention, the apparatus further includes: a third calculating module, configured to determine the edge average path loss value according to the following formula:
Figure PCTCN2015081469-appb-000018
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000018
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000019
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000020
Figure PCTCN2015081469-appb-000019
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000020
Figure PCTCN2015081469-appb-000021
Figure PCTCN2015081469-appb-000021
Figure PCTCN2015081469-appb-000022
Figure PCTCN2015081469-appb-000022
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
在本发明实施例中,所述装置还包括:第三确定模块,设置为根据OF的值确定用于服务的基站包括:关闭所述OF值中的最小OF值对应的基站,从所述N个基站中确定用于服务的基站。In the embodiment of the present invention, the device further includes: a third determining module, configured to determine, according to the value of the OF, the base station for serving, comprising: turning off a base station corresponding to a minimum OF value of the OF values, from the N A base station for serving is determined among the base stations.
根据本发明的另一方面,还提供了一种基站,至少包括上述装置之一。According to another aspect of the present invention, there is also provided a base station comprising at least one of the above means.
通过本发明实施例,确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和所述N个基站与边缘用户之间的边缘平均路损值,其中,所述中心用户为所述N个基站服务的预定范围之内的用户,所述边缘用户为所述N个基站服务的所述预定范围之外的用户;根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站,解决了相关技术中超密集网络UDN中基站的分配不合理使得系统干扰过大的问题,进而达到了减少基站间的干扰,提升系统性能的效果。Determining, by the embodiment of the present invention, a central average path loss value between the N base stations of the ultra-dense network UDN and a central user, and an edge average path loss value between the N base stations and an edge user, where the central user a user within a predetermined range serving the N base stations, the edge user serving the user outside the predetermined range served by the N base stations; according to the central average path loss value and the edge average path Determining the value of the base station for the service from the N base stations, solving the problem that the allocation of the base station in the ultra-dense network UDN in the related art is unreasonable and causing excessive system interference, thereby reducing interference between the base stations and improving system performance. Effect.
附图说明DRAWINGS
此处所说明的附图用来提供对本发明的进一步理解,构成本申请的一部分,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。在附图中:The drawings described herein are intended to provide a further understanding of the invention, and are intended to be a part of the invention. In the drawing:
图1是根据本发明实施例的服务基站确定的方法的流程图;1 is a flow chart of a method for determining a serving base station according to an embodiment of the present invention;
图2是根据本发明实施例的服务基站确定的装置的框图;2 is a block diagram of an apparatus for determining a serving base station according to an embodiment of the present invention;
图3是根据本发明优选实施例的服务基站确定的装置的框图一;3 is a block diagram 1 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention;
图4是根据本发明优选实施例的服务基站确定的装置的框图二; 4 is a block diagram 2 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention;
图5是根据本发明优选实施例的服务基站确定的装置的框图三;Figure 5 is a block diagram 3 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention;
图6是根据本发明优选实施例的服务基站确定的装置的框图四;6 is a block diagram 4 of an apparatus for determining a serving base station in accordance with a preferred embodiment of the present invention;
图7是根据本发明优选实施例的服务基站确定的方法的流程图一;7 is a flowchart 1 of a method for determining a serving base station according to a preferred embodiment of the present invention;
图8是根据本发明优选实施例的服务基站确定的方法的流程图二;8 is a flowchart 2 of a method for determining a serving base station according to a preferred embodiment of the present invention;
图9是根据本发明优选实施例的对基站进行优化前后效果对照的示意图。9 is a schematic diagram of an effect comparison before and after optimization of a base station according to a preferred embodiment of the present invention.
具体实施方式detailed description
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。The invention will be described in detail below with reference to the drawings in conjunction with the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.
在本实施例中提供了一种服务基站确定的方法,图1是根据本发明实施例的服务基站确定的方法的流程图,如图1所示,该流程包括如下步骤:In this embodiment, a method for determining a serving base station is provided. FIG. 1 is a flowchart of a method for determining a serving base station according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
步骤S102,确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和该N个基站与边缘用户之间的边缘平均路损值,其中,该中心用户为该N个基站服务的预定范围之内的用户,该边缘用户为该N个基站服务的该预定范围之外的用户;Step S102, determining a central average path loss value between the N base stations of the ultra-dense network UDN and the central user, and an edge average path loss value between the N base stations and the edge users, wherein the central user is the N base stations. a user within a predetermined range of services for which the edge user serves the user outside the predetermined range of the N base stations;
步骤S104,根据该中心平均路损值和该边缘平均路损值从该N个基站中确定用于服务的基站。Step S104: Determine a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value.
通过上述步骤,确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和该N个基站与边缘用户之间的边缘平均路损值,其中,该中心用户为该N个基站服务的预定范围之内的用户,该边缘用户为该N个基站服务的该预定范围之外的用户,根据该中心平均路损值和该边缘平均路损值从该N个基站中确定用于服务的基站,解决了相关技术中超密集网络UDN中基站的分配不合理使得系统干扰过大的问题,进而达到了减少基站间的干扰,提升系统性能的效果。Through the above steps, determining a central average path loss value between the N base stations of the ultra-dense network UDN and the central user and an edge average path loss value between the N base stations and the edge users, wherein the central user is the N a user within a predetermined range of the base station service, the user outside the predetermined range served by the edge user for the N base stations, determined from the N base stations according to the central average path loss value and the edge average path loss value The serviced base station solves the problem that the allocation of the base station in the ultra-dense network UDN in the related art is unreasonable and the system interference is too large, thereby achieving the effect of reducing inter-base station interference and improving system performance.
作为一种优选的实施方式,通过以下公式,根据该中心平均路损值和该边缘平均路损值从该N个基站中确定用于服务的基站:
Figure PCTCN2015081469-appb-000023
其中,OF为用于确定服务的基站的参数值,f1为该中心平均路损值,f2为该边缘平均路损值。
As a preferred embodiment, the base station for serving is determined from the N base stations according to the central average path loss value and the edge average path loss value by using the following formula:
Figure PCTCN2015081469-appb-000023
Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
作为一种优选的实施方式,根据以下公式确定该中心平均路损值: As a preferred embodiment, the central average path loss value is determined according to the following formula:
Figure PCTCN2015081469-appb-000024
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000024
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000025
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000026
Figure PCTCN2015081469-appb-000025
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000026
Figure PCTCN2015081469-appb-000027
Figure PCTCN2015081469-appb-000027
Figure PCTCN2015081469-appb-000028
Figure PCTCN2015081469-appb-000028
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
作为一种优选的实施方式,根据以下公式确定该边缘平均路损值:As a preferred embodiment, the edge average path loss value is determined according to the following formula:
Figure PCTCN2015081469-appb-000029
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000029
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000030
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000031
Figure PCTCN2015081469-appb-000030
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000031
Figure PCTCN2015081469-appb-000032
Figure PCTCN2015081469-appb-000032
Figure PCTCN2015081469-appb-000033
Figure PCTCN2015081469-appb-000033
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
作为一种优选的实施方式,根据OF的值确定用于服务的基站包括:关闭该OF值中的最小OF值对应的基站,从该N个基站中确定用于服务的基站,从而减少了基站间的相互干扰,提高了系统的性能。As a preferred implementation manner, determining, according to the value of OF, the base station for serving includes: closing a base station corresponding to a minimum OF value in the OF value, determining a base station for serving from the N base stations, thereby reducing the base station. Mutual interference increases the performance of the system.
本发明实施例的另一方面,还提供了一种服务基站确定的装置,该装置用于实现上述实施例及优选实施方式,已经进行过说明的不再赘述。如以下所使用的,术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现,但是硬件,或者软件和硬件的组合的实现也是可能并被构想的。In another aspect of the present invention, a device for determining a serving base station is provided, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
图2是根据本发明实施例的服务基站确定的装置的框图,如图2所示,包括:第一确定模块22和第二确定模块24,下面对各个模块进行说明。2 is a block diagram of an apparatus for determining a serving base station according to an embodiment of the present invention. As shown in FIG. 2, the method includes: a first determining module 22 and a second determining module 24. The following describes each module.
第一确定模块22,设置为确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和该N个基站与边缘用户之间的边缘平均路损值,其中,该中心用户为该N个基站服务的预定范围之内的用户,该边缘用户为该N个基站服务的该预定范围之外的用户;The first determining module 22 is configured to determine a central average path loss value between the N base stations of the ultra-dense network UDN and the central user, and an edge average path loss value between the N base stations and the edge user, where the central user a user within a predetermined range serving the N base stations, the edge users serving the N base stations outside the predetermined range of users;
第二确定模块24,设置为根据该中心平均路损值和该边缘平均路损值从该N个基站中确定用于服务的基站。The second determining module 24 is configured to determine a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value.
图3是根据本发明优选实施例的服务基站确定的装置的框图一,如图3所示,该装置还包括:3 is a block diagram of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 3, the apparatus further includes:
第一计算模块32,设置为通过以下公式,根据该中心平均路损值和该边缘平均路损值从该N个基站中确定用于服务的基站:
Figure PCTCN2015081469-appb-000034
其中,OF为用于确定服务的基站的参数值,f1为该中心平均路损值,f2为该边缘平均路损值。
The first calculating module 32 is configured to determine, by using the following formula, a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value:
Figure PCTCN2015081469-appb-000034
Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
图4是根据本发明优选实施例的服务基站确定的装置的框图二,如图4所示,该装置还包括: 4 is a block diagram 2 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 4, the apparatus further includes:
第二计算模块42,设置为根据以下公式确定该中心平均路损值:The second calculation module 42 is configured to determine the central average path loss value according to the following formula:
Figure PCTCN2015081469-appb-000035
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000035
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000036
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000037
Figure PCTCN2015081469-appb-000036
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000037
Figure PCTCN2015081469-appb-000038
Figure PCTCN2015081469-appb-000038
Figure PCTCN2015081469-appb-000039
Figure PCTCN2015081469-appb-000039
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
图5是根据本发明优选实施例的服务基站确定的装置的框图三,如图5所示,该装置还包括:5 is a block diagram 3 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 5, the apparatus further includes:
第三计算模块52,设置为根据以下公式确定该边缘平均路损值:The third calculating module 52 is configured to determine the edge average path loss value according to the following formula:
Figure PCTCN2015081469-appb-000040
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000040
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000041
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000042
Figure PCTCN2015081469-appb-000041
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000042
Figure PCTCN2015081469-appb-000043
Figure PCTCN2015081469-appb-000043
Figure PCTCN2015081469-appb-000044
Figure PCTCN2015081469-appb-000044
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P 0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, and SNRj, min is expressed in The minimum signal to noise ratio threshold at j users; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C When 1 =|C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
图6是根据本发明优选实施例的服务基站确定的装置的框图四,如图6所示,该装置还包括:FIG. 6 is a block diagram 4 of an apparatus for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 6, the apparatus further includes:
第三确定模块62,设置为根据OF的值确定用于服务的基站包括:关闭该OF值中的最小OF值对应的基站,从该N个基站中确定用于服务的基站。The third determining module 62 is configured to determine, according to the value of the OF, the base station for serving, that: the base station corresponding to the minimum OF value of the OF value is turned off, and the base station for serving is determined from the N base stations.
本发明实施例的另一方面,还提供了一种基站,至少包括上述装置之一。In another aspect of the embodiments of the present invention, a base station is provided, including at least one of the foregoing devices.
下面结合优选实施例对本发明实施例进行进一步说明。The embodiments of the present invention are further described below in conjunction with the preferred embodiments.
相关技术中,在用户移动性较高的情况下,由于用户的高移动性,造成用户在特定覆盖区域内的分布随时间变化的不确定性。在固定的小小区基站群覆盖范围内,由于这种不确定性,造成网络的吞吐量随着时间的变化而变化。比如说在某一时刻,用户集中分布在该小小区基站群覆盖范围中的一小部分,这就会使其他小小区基站产生资源空闲,降低频谱效率。又或者在某一时刻,用户分布在小小区边缘,此时小小区基站侧需要很大的发射功率,这就会对相邻小小区使用同一频段的用户产生较大干扰,相邻小小区边缘用户较多时,干扰尤为严重。In the related art, in the case where the user mobility is high, due to the high mobility of the user, the uncertainty of the distribution of the user in a specific coverage area with time changes. Within the coverage of a fixed small cell base station group, due to this uncertainty, the throughput of the network changes with time. For example, at a certain time, users are concentrated in a small part of the coverage of the small cell base station group, which causes other small cell base stations to generate resources idle and reduce spectrum efficiency. Or at a certain time, the user is distributed at the edge of the small cell. At this time, the small cell base station side needs a large transmission power, which will cause large interference to the users in the same frequency band of the adjacent small cells, and the adjacent small cell edge When there are many users, the interference is especially serious.
还有一种情况下,用户业务分布在较长的时间段内相对不变,比如在相对较长的某一段时间内,某栋写字楼里的某一楼层租给某公司作为员工办公区,但由于种种原因这一楼层又转租给某教育机构作为教室使用,在办公区向教室转变的时候,用户分布状态也随之转变了,于是,原有小小区基站部署已经不能匹配当前用户分布状态,于是系统性能降低。 In another case, the user service distribution is relatively unchanged over a long period of time. For example, in a relatively long period of time, a certain floor in an office building is rented to a company as an employee office area, but For various reasons, this floor is subletted to an educational institution for use as a classroom. When the office area changes to the classroom, the user distribution status also changes. Therefore, the original small cell base station deployment cannot match the current user distribution status. The system performance is thus degraded.
针对上述问题,本发明实施例提供了一种在UDN环境下优化Small Cell基站位置的方法,通过对原有小小区基站部署进行优化后,能够使用户信噪比得到提升,系统性能得到优化,不仅能提高系统的资源利用率还能节省功率、减少干扰。For the above problem, the embodiment of the present invention provides a method for optimizing the location of a small Cell base station in a UDN environment. After optimizing the deployment of the original small cell base station, the signal to noise ratio of the user can be improved, and the system performance is optimized. Not only can improve system resource utilization but also save power and reduce interference.
针对用户移动性较高的情况下,预设部署N个小小区基站,编号分别为,S1,S2,…,SN,每个小小区基站允许接入;针对用户业务分布在较长时间段内分布不变的场景,原始状态预设部署K个小小区基站,优化前再额外加入N-K个小小区基站,得到N个小小区基站,编号分别为,S1,S2,…,SN,每个小小区基站允许接入。综上,两个场景中优化初始状态均为固定位置的N个小小区基站。优化后的小小区基站目标个数预设为K。For the case of high user mobility, N small cell base stations are preset, numbered S 1 , S 2 , . . . , S N , and each small cell base station allows access; In the scenario where the distribution is constant in the time period, K small cell base stations are deployed in the original state, and NK small cell base stations are additionally added before the optimization, and N small cell base stations are obtained, numbered as S 1 , S 2 , ..., S N , each small cell base station allows access. In summary, in the two scenarios, N small cell base stations whose initial states are optimized to be fixed positions are optimized. The number of optimized small cell base station targets is preset to K.
本发明实施例提出的优化算法基于最大化整个服务区域中心用户平均信号质量和最小化信号质量差的区域两个优化目标。根据中心平均路损值和边缘平均路损值从N个基站中确定用于服务的基站:
Figure PCTCN2015081469-appb-000045
其中,OF为用于确定服务的基站的参数值,f1为该中心平均路损值,f2为该边缘平均路损值。
The optimization algorithm proposed by the embodiment of the present invention is based on two optimization targets for maximizing the average signal quality of the central user of the entire service area and minimizing the difference of signal quality. Determining the base station for service from the N base stations based on the central average path loss value and the edge average path loss value:
Figure PCTCN2015081469-appb-000045
Wherein, OF is a parameter value of a base station for determining a service, f 1 is the center average path loss value, and f 2 is the edge average path loss value.
根据以下公式确定该中心平均路损值:Determine the center average path loss value according to the following formula:
Figure PCTCN2015081469-appb-000046
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000046
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000047
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000048
Figure PCTCN2015081469-appb-000047
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000048
Figure PCTCN2015081469-appb-000049
Figure PCTCN2015081469-appb-000049
Figure PCTCN2015081469-appb-000050
Figure PCTCN2015081469-appb-000050
根据以下公式确定该边缘平均路损值:The edge average path loss value is determined according to the following formula:
Figure PCTCN2015081469-appb-000051
其中,wk=|Ck|/K,
Figure PCTCN2015081469-appb-000051
Where w k =|C k |/K,
Figure PCTCN2015081469-appb-000052
u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
Figure PCTCN2015081469-appb-000053
Figure PCTCN2015081469-appb-000052
u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
Figure PCTCN2015081469-appb-000053
Figure PCTCN2015081469-appb-000054
Figure PCTCN2015081469-appb-000054
Figure PCTCN2015081469-appb-000055
Figure PCTCN2015081469-appb-000055
其中,gj (k)是第j个用户和第k个基站之间的路损;gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。Where g j (k) is the path loss between the jth user and the kth base station; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm -(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 represents the base station transmit power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the receive noise figure, SNRj, min is expressed in the jth The minimum SNR threshold at the user; C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, when C 1 When ||C k |, the central average path loss value is the average path loss value between all service users and the serving base station.
小小区基站位置优化方法具体包括:针对初始状态下的编号分别为,S1,S2,…,SN的N个小小区基站,按照上述准则,获取到和第j个用户之间路损最小的第k个基站作为接入基站,分别统计OF值,通过比较找到OF值最小的单个小小区基站Sj,关闭或撤除该小小区基站;在剩余小小区基站集合{S1,S2,…,SN}中继续执行步骤S2;重复步骤S3直到剩余小小区基站个数为优化后小小区基站目标个数。The method for optimizing the location of the small cell base station specifically includes: for the N small cell base stations with the numbers S 1 , S 2 , . . . , S N in the initial state, obtaining the path loss between the J and the jth user according to the above criteria. The smallest k-th base station acts as an access base station, and separately counts the OF value, and compares and finds the single small-cell base station S j with the smallest OF value to close or remove the small-cell base station; and sets the remaining small-cell base station {S 1 , S 2 Step S2 is continued in S N }; step S3 is repeated until the number of remaining small cell base stations is the number of optimized small cell base station targets.
其中,在用户具有高移动性的场景中,采用关闭小小区基站的方法,并且每隔一段时间就要重新激活所有小小区基站并实施以上优化算法;而在另一种用户移动性相对较低的场景中,采用撤除小小区基站的方法,达到与当前用户分布相匹配的小小区基站布置格局。Wherein, in a scenario where the user has high mobility, a method of shutting down the small cell base station is adopted, and all the small cell base stations are reactivated and the above optimization algorithm is implemented at intervals; and the mobility of the other user is relatively low. In the scenario, the method of removing the small cell base station is adopted to achieve a small cell base station arrangement pattern that matches the current user distribution.
本发明实施例中,以最大化整个服务区域中心用户平均信号质量和最小化信号质量差的区域为目标,通过关闭或撤除影响该目标的小小区基站,达到小小区基站位置优化的目的,从而提高系统性能。在小小区基站密集度极高的UDN中尤其适用。In the embodiment of the present invention, aiming at an area that maximizes the average signal quality of the central user of the service area and minimizes the difference in signal quality, the small cell base station that affects the target is closed or removed, thereby achieving the purpose of optimizing the location of the small cell base station, thereby Improve system performance. It is especially suitable for UDNs where the small cell base station is extremely dense.
图7是根据本发明优选实施例的服务基站确定的方法的流程图一,如图7所示,在用户高移动性场景下,对小小区基站进行位置优化,包括以下步骤: FIG. 7 is a flowchart 1 of a method for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 7, in a high mobility scenario of a user, performing location optimization on a small cell base station includes the following steps:
步骤S702,初始化,激活N个基站;Step S702, initializing and activating N base stations;
步骤S704,计算并比较各个基站的OF;Step S704, calculating and comparing the OF of each base station;
步骤S706,关闭OF值最小的基站;Step S706, turning off the base station with the smallest OF value;
步骤S708,检验剩下基站个数是否降到了K,是则执行步骤S710,否则执行步骤S704;Step S708, it is checked whether the number of remaining base stations has dropped to K, if yes, step S710 is performed, otherwise step S704 is performed;
步骤S710,检验是否到达预设间隔时间,是则执行步骤S702,否则执行步骤S710。In step S710, it is checked whether the preset interval time is reached. If yes, step S702 is performed, otherwise step S710 is performed.
图8是根据本发明优选实施例的服务基站确定的方法的流程图二,如图8所示,用户在相对低移动性场景下,对小小区基站进行位置优化,包括以下步骤:FIG. 8 is a second flowchart of a method for determining a serving base station according to a preferred embodiment of the present invention. As shown in FIG. 8, the user performs location optimization on a small cell base station in a relatively low mobility scenario, including the following steps:
步骤S802,按照原有部署规律在原有K个基站的基础上加入N-K个;Step S802, adding N-Ks to the original K base stations according to the original deployment rule;
步骤S804,初始化,激活N个基站;Step S804, initializing and activating N base stations;
步骤S806,计算并比较各个基站的OF值;Step S806, calculating and comparing the OF values of the respective base stations;
步骤S808,撤除OF值最小的基站;Step S808, removing the base station with the smallest OF value;
步骤S810,检验剩下的基站个数是否降到了K个,是则优化完成,否则执行步骤S806。Step S810, it is checked whether the number of remaining base stations has dropped to K, and then the optimization is completed, otherwise step S806 is performed.
图9是根据本发明优选实施例的对基站进行优化前后效果对照的示意图,如图9所示,在用户高速移动性环境下,原有以网格形部署12个小小区基站,用户均匀分布在该覆盖区域内,经过该方案优化后得到图示结果。从图中,可以看出,优化前的小小区基站位置和优化后的小小区基站位置完全不同,采用本发明实施例的优化方法对基站进行优化,不仅能提高系统的资源利用率还能节省功率、减少干扰。FIG. 9 is a schematic diagram of the effect comparison before and after optimization of a base station according to a preferred embodiment of the present invention. As shown in FIG. 9 , in a high-speed mobility environment of a user, 12 small cell base stations are originally deployed in a grid shape, and the users are evenly distributed. In the coverage area, the illustrated results are obtained after optimization by the scheme. As shown in the figure, it can be seen that the location of the small cell base station before optimization and the location of the optimized small cell base station are completely different. The optimization method of the embodiment of the present invention optimizes the base station, which not only improves system resource utilization but also saves Power, reduce interference.
显然,本领域的技术人员应该明白,上述的本发明的各模块或各步骤可以用通用的计算装置来实现,它们可以集中在单个的计算装置上,或者分布在多个计算装置所组成的网络上,可选地,它们可以用计算装置可执行的程序代码来实现,从而,可以将它们存储在存储装置中由计算装置来执行,并且在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤,或者将它们分别制作成各个集成电路模块,或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样,本发明不限制于任何特定的硬件和软件结合。 It will be apparent to those skilled in the art that the various modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。The above description is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.
工业实用性Industrial applicability
如上所述,通过上述实施例及优选实施方式,解决了相关技术中超密集网络UDN中基站的分配不合理使得系统干扰过大的问题,进而达到了减少基站间的干扰,提升系统性能的效果。 As described above, the above embodiments and the preferred embodiments solve the problem that the allocation of the base stations in the ultra-dense network UDN in the related art is unreasonable and the system interference is too large, thereby achieving the effect of reducing interference between the base stations and improving system performance.

Claims (11)

  1. 一种服务基站确定的方法,包括:A method for determining a serving base station, comprising:
    确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和所述N个基站与边缘用户之间的边缘平均路损值,其中,所述中心用户为所述N个基站服务的预定范围之内的用户,所述边缘用户为所述N个基站服务的所述预定范围之外的用户;Determining a central average path loss value between the N base stations of the ultra-dense network UDN and a central user and an edge average path loss value between the N base stations and an edge user, wherein the central user is the N base stations a user within a predetermined range of services, the edge user serving the user outside the predetermined range of the N base stations;
    根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站。Determining a base station for serving from the N base stations based on the central average path loss value and the edge average path loss value.
  2. 根据权利要求1所述的方法,其中,通过以下公式,根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站:The method according to claim 1, wherein the base station for serving is determined from the N base stations based on the central average path loss value and the edge average path loss value by the following formula:
    Figure PCTCN2015081469-appb-100001
    其中,OF为用于确定服务的基站的参数值,f1为所述中心平均路损值,f2为所述边缘平均路损值。
    Figure PCTCN2015081469-appb-100001
    Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
  3. 根据权利要求2所述的方法,其中,根据以下公式确定所述中心平均路损值:The method of claim 2, wherein the central average path loss value is determined according to the following formula:
    Figure PCTCN2015081469-appb-100002
    Figure PCTCN2015081469-appb-100002
    其中,wk=|Ck|/K,Where w k =|C k |/K,
    Figure PCTCN2015081469-appb-100003
    u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
    Figure PCTCN2015081469-appb-100004
    Figure PCTCN2015081469-appb-100003
    u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
    Figure PCTCN2015081469-appb-100004
    Figure PCTCN2015081469-appb-100005
    Figure PCTCN2015081469-appb-100005
    Figure PCTCN2015081469-appb-100006
    Figure PCTCN2015081469-appb-100006
    其中,gj (k)是第j个用户和第k个基站之间的路损; Where g j (k) is the path loss between the jth user and the kth base station;
    gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm-(N 0 B)dBm-(F)dB-(SNR jmin )dB, P 0 represents the base station Transmit power, N 0 represents the noise power spectral density, B represents the channel bandwidth, F represents the received noise figure, and SNR j, min represents the minimum signal to noise ratio threshold at the jth user;
    Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, and when C 1 =|C k |, the center average path loss The value is the average path loss value between all service users and the serving base station.
  4. 根据权利要求2所述的方法,其中,根据以下公式确定所述边缘平均路损值:The method of claim 2, wherein the edge average path loss value is determined according to the following formula:
    Figure PCTCN2015081469-appb-100007
    Figure PCTCN2015081469-appb-100007
    其中,wk=|Ck|/K,Where w k =|C k |/K,
    Figure PCTCN2015081469-appb-100008
    u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
    Figure PCTCN2015081469-appb-100009
    Figure PCTCN2015081469-appb-100008
    u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
    Figure PCTCN2015081469-appb-100009
    Figure PCTCN2015081469-appb-100010
    Figure PCTCN2015081469-appb-100010
    Figure PCTCN2015081469-appb-100011
    Figure PCTCN2015081469-appb-100011
    其中,gj (k)是第j个用户和第k个基站之间的路损;Where g j (k) is the path loss between the jth user and the kth base station;
    gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm-(N 0 B)dBm-(F)dB-(SNR jmin )dB, P 0 represents the base station Transmit power, N 0 represents the noise power spectral density, B represents the channel bandwidth, F represents the received noise figure, and SNR j, min represents the minimum signal to noise ratio threshold at the jth user;
    Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。 C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, and when C 1 =|C k |, the center average path loss The value is the average path loss value between all service users and the serving base station.
  5. 根据权利要求2所述的方法,其中,根据所述OF的值确定用于服务的基站包括:关闭所述OF值中的最小OF值对应的基站,从所述N个基站中确定用于服务的基站。The method according to claim 2, wherein determining the base station for serving according to the value of the OF comprises: turning off a base station corresponding to a minimum OF value of the OF values, determining from the N base stations for serving Base station.
  6. 一种服务基站确定的装置,包括:A device for determining a serving base station, comprising:
    第一确定模块,设置为确定超密集网络UDN的N个基站与中心用户之间的中心平均路损值和所述N个基站与边缘用户之间的边缘平均路损值,其中,所述中心用户为所述N个基站服务的预定范围之内的用户,所述边缘用户为所述N个基站服务的所述预定范围之外的用户;a first determining module, configured to determine a central average path loss value between the N base stations of the ultra-dense network UDN and a central user, and an edge average path loss value between the N base stations and an edge user, wherein the center a user within a predetermined range served by the user for the N base stations, the edge user serving the user outside the predetermined range served by the N base stations;
    第二确定模块,设置为根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站。And a second determining module, configured to determine, from the N base stations, a base station for serving according to the central average path loss value and the edge average path loss value.
  7. 根据权利要求6所述的装置,其中,所述装置还包括:The apparatus of claim 6 wherein said apparatus further comprises:
    第一计算模块,设置为通过以下公式,根据所述中心平均路损值和所述边缘平均路损值从所述N个基站中确定用于服务的基站:
    Figure PCTCN2015081469-appb-100012
    其中,OF为用于确定服务的基站的参数值,f1为所述中心平均路损值,f2为所述边缘平均路损值。
    a first calculating module, configured to determine, by the following formula, a base station for serving from the N base stations according to the central average path loss value and the edge average path loss value:
    Figure PCTCN2015081469-appb-100012
    Wherein, OF is a parameter value of a base station for determining a service, f 1 is the central average path loss value, and f 2 is the edge average path loss value.
  8. 根据权利要求6所述的装置,其中,所述装置还包括:The apparatus of claim 6 wherein said apparatus further comprises:
    第二计算模块,设置为根据以下公式确定所述中心平均路损值:The second calculation module is configured to determine the central average path loss value according to the following formula:
    Figure PCTCN2015081469-appb-100013
    Figure PCTCN2015081469-appb-100013
    其中,wk=|Ck|/K,Where w k =|C k |/K,
    Figure PCTCN2015081469-appb-100014
    u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
    Figure PCTCN2015081469-appb-100015
    Figure PCTCN2015081469-appb-100014
    u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
    Figure PCTCN2015081469-appb-100015
    Figure PCTCN2015081469-appb-100016
    Figure PCTCN2015081469-appb-100016
    Figure PCTCN2015081469-appb-100017
    Figure PCTCN2015081469-appb-100017
    其中,gj (k)是第j个用户和第k个基站之间的路损;Where g j (k) is the path loss between the jth user and the kth base station;
    gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值;g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm-(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 denotes base station transmission Power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the received noise figure, and SNRj, min represents the minimum signal to noise ratio threshold at the jth user;
    Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, and when C 1 =|C k |, the center average path loss The value is the average path loss value between all service users and the serving base station.
  9. 根据权利要求6所述的装置,其中,所述装置还包括:The apparatus of claim 6 wherein said apparatus further comprises:
    第三计算模块,设置为根据以下公式确定所述边缘平均路损值:The third calculation module is configured to determine the edge average path loss value according to the following formula:
    Figure PCTCN2015081469-appb-100018
    Figure PCTCN2015081469-appb-100018
    其中,wk=|Ck|/K,Where w k =|C k |/K,
    Figure PCTCN2015081469-appb-100019
    u表示惩罚因子,取常数,对于确定的服务小基站k,所有用户与小基站间路损相对大小为:
    Figure PCTCN2015081469-appb-100020
    Figure PCTCN2015081469-appb-100019
    u denotes a penalty factor and takes a constant. For the determined serving small base station k, the relative path loss between all users and the small base station is:
    Figure PCTCN2015081469-appb-100020
    Figure PCTCN2015081469-appb-100021
    Figure PCTCN2015081469-appb-100021
    Figure PCTCN2015081469-appb-100022
    Figure PCTCN2015081469-appb-100022
    其中,gj (k)是第j个用户和第k个基站之间的路损;Where g j (k) is the path loss between the jth user and the kth base station;
    gj.max表示最大可允许路损,通过如下公式计算得到:gj,max=(P0)dBm-(N0B)dBm-(F)dB-(SNRjmin)dB,P0表示基站发射功率,N0表示噪声功率谱密度,B表示信道带宽,F表示接收噪声系数,SNRj,min表示在第j个用户处最小信噪比门限值; g j.max represents the maximum allowable path loss, calculated by the following formula: g j,max =(P 0 )dBm-(N 0 B)dBm-(F)dB-(SNR jmin )dB, P0 denotes base station transmission Power, N0 represents the noise power spectral density, B represents the channel bandwidth, F represents the received noise figure, and SNRj, min represents the minimum signal to noise ratio threshold at the jth user;
    Ck是被小基站k所服务的用户集合,|Ck|是被小基站k所服务的用户总数;C1在范围内取整数,当C1=|Ck|时,中心平均路损值即为所有服务用户与该服务基站之间的平均路损值。C k is the set of users served by the small base station k, |C k | is the total number of users served by the small base station k; C 1 takes an integer in the range, and when C 1 =|C k |, the center average path loss The value is the average path loss value between all service users and the serving base station.
  10. 根据权利要求6所述的装置,其中,所述装置还包括:The apparatus of claim 6 wherein said apparatus further comprises:
    第三确定模块,设置为根据OF的值确定用于服务的基站包括:关闭所述OF值中的最小OF值对应的基站,从所述N个基站中确定用于服务的基站。The third determining module is configured to determine, according to the value of the OF, the base station for serving, comprising: turning off a base station corresponding to a minimum OF value of the OF values, and determining a base station for serving from the N base stations.
  11. 一种基站,至少包括权利要求6-10中任一项所述的装置。 A base station comprising at least the apparatus of any one of claims 6-10.
PCT/CN2015/081469 2014-09-26 2015-06-15 Method, device for determining serving base station and base station WO2016045417A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410505513.8 2014-09-26
CN201410505513.8A CN105517115B (en) 2014-09-26 2014-09-26 The method, apparatus and base station that serving BS determines

Publications (1)

Publication Number Publication Date
WO2016045417A1 true WO2016045417A1 (en) 2016-03-31

Family

ID=55580258

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/081469 WO2016045417A1 (en) 2014-09-26 2015-06-15 Method, device for determining serving base station and base station

Country Status (2)

Country Link
CN (1) CN105517115B (en)
WO (1) WO2016045417A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111328065A (en) * 2020-03-03 2020-06-23 深圳清华大学研究院 Dynamic programming-based mobility cooperation management method for 5G cloud access network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101742628A (en) * 2008-11-24 2010-06-16 鼎桥通信技术有限公司 Method for reducing interference of uplink reference symbol
CN101931985A (en) * 2009-06-23 2010-12-29 华为技术有限公司 Selecting method of service cell and network side equipment
CN102149157A (en) * 2010-02-10 2011-08-10 中兴通讯股份有限公司 System and method for cell reselection
US20110216683A1 (en) * 2010-03-08 2011-09-08 Samsung Electronics Co., Ltd. Apparatus and method for reducing interference and saving energy in femto/pico cell of hierarchical cell structure

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101841842A (en) * 2009-03-16 2010-09-22 华为技术有限公司 Selection method and equipment of service node
WO2013037875A1 (en) * 2011-09-13 2013-03-21 Koninklijke Kpn N.V. Session setup in an energy-efficient cellular wireless telecommunications system
CN102892125A (en) * 2012-10-19 2013-01-23 北京邮电大学 interference coordination method for energy-saving communication of heterogeneous network
CN103118424B (en) * 2013-01-24 2015-07-01 富春通信股份有限公司 Long term evolution (LTE) uplink power control method and control system based on interference consciousness
CN104010356B (en) * 2014-05-29 2017-06-16 东南大学 A kind of centralization dynamic for heterogeneous network closes small minilocus approach

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101742628A (en) * 2008-11-24 2010-06-16 鼎桥通信技术有限公司 Method for reducing interference of uplink reference symbol
CN101931985A (en) * 2009-06-23 2010-12-29 华为技术有限公司 Selecting method of service cell and network side equipment
CN102149157A (en) * 2010-02-10 2011-08-10 中兴通讯股份有限公司 System and method for cell reselection
US20110216683A1 (en) * 2010-03-08 2011-09-08 Samsung Electronics Co., Ltd. Apparatus and method for reducing interference and saving energy in femto/pico cell of hierarchical cell structure

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111328065A (en) * 2020-03-03 2020-06-23 深圳清华大学研究院 Dynamic programming-based mobility cooperation management method for 5G cloud access network
CN111328065B (en) * 2020-03-03 2022-11-01 深圳清华大学研究院 Dynamic programming-based mobility cooperative management method for 5G cloud access network

Also Published As

Publication number Publication date
CN105517115B (en) 2019-11-29
CN105517115A (en) 2016-04-20

Similar Documents

Publication Publication Date Title
Sun et al. D2D enhanced heterogeneous cellular networks with dynamic TDD
Lien et al. Cognitive and game-theoretical radio resource management for autonomous femtocells with QoS guarantees
Pantisano et al. Coalition formation games for femtocell interference management: A recursive core approach
LeAnh et al. Distributed power and channel allocation for cognitive femtocell network using a coalitional game in partition-form approach
Dai et al. The multi-objective deployment optimization of UAV-mounted cache-enabled base stations
Duong et al. Distance-based resource allocation scheme for device-to-device communications underlaying cellular networks
Zhou et al. Joint mode selection, MCS assignment, resource allocation and power control for D2D communication underlaying cellular networks
CN108965009B (en) Load known user association method based on potential game
CN104770004B (en) A kind of communication system and method
Shahid et al. Self-organized energy-efficient cross-layer optimization for device to device communication in heterogeneous cellular networks
Akter et al. Distributed approach for power and rate allocation to secondary users in cognitive radio networks
Kalbkhani et al. Resource allocation in integrated femto–macrocell networks based on location awareness
Sobhi-Givi et al. Resource allocation and power control for underlay device-to-device communication in fractional frequency reuse cellular networks
Panahi et al. Stochastic geometry modeling and analysis of cognitive heterogeneous cellular networks
Chu et al. Small-cell deployment over existing heterogeneous networks
Hessar et al. Resource allocation techniques for cellular networks in TV white space spectrum
Rawat et al. Game theoretic dynamic spectrum access in cloud-based cognitive radio networks
Lotfollahzadeh et al. Femtocell base station clustering and logistic smooth transition autoregressive‐based predicted signal‐to‐interference‐plus‐noise ratio for performance improvement of two‐tier macro/femtocell networks
US8666424B2 (en) Systems, methods, and media for reducing femtocell interference
WO2016045417A1 (en) Method, device for determining serving base station and base station
CN108650705B (en) Heterogeneous wireless network robust power control method with maximized energy utilization rate
Valizadeh et al. An adaptive distributed coverage optimization scheme in LTE enterprise femtocells
AL-Samarrie et al. Proposed multi-stage PSO scheme for LTE network planning and operation
Mudassir et al. Game theoretic efficient radio resource allocation in 5G resilient networks: A data driven approach
Zhang et al. The 5G NOMA networks planning based on the multi-objective evolutionary algorithm

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15844430

Country of ref document: EP

Kind code of ref document: A1