[go: up one dir, main page]

WO2019129169A1 - 用于无线通信的电子设备和方法以及计算机可读存储介质 - Google Patents

用于无线通信的电子设备和方法以及计算机可读存储介质 Download PDF

Info

Publication number
WO2019129169A1
WO2019129169A1 PCT/CN2018/124587 CN2018124587W WO2019129169A1 WO 2019129169 A1 WO2019129169 A1 WO 2019129169A1 CN 2018124587 W CN2018124587 W CN 2018124587W WO 2019129169 A1 WO2019129169 A1 WO 2019129169A1
Authority
WO
WIPO (PCT)
Prior art keywords
virtual cell
search
access point
electronic device
location
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2018/124587
Other languages
English (en)
French (fr)
Inventor
赵友平
祝东芝
孙晨
郭欣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sony Corp
Original Assignee
Sony Corp
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 Sony Corp filed Critical Sony Corp
Priority to US16/652,072 priority Critical patent/US11032720B2/en
Priority to CN201880065293.8A priority patent/CN111194564A/zh
Priority to EP22153015.7A priority patent/EP4017058A1/en
Priority to AU2018396890A priority patent/AU2018396890A1/en
Priority to EP18895959.7A priority patent/EP3709696B1/en
Publication of WO2019129169A1 publication Critical patent/WO2019129169A1/zh
Anticipated expiration legal-status Critical
Priority to US17/242,336 priority patent/US20210250783A1/en
Priority to US18/210,677 priority patent/US20230328542A1/en
Ceased legal-status Critical Current

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/24—Cell structures
    • 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/24—Cell structures
    • H04W16/32—Hierarchical cell structures
    • 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/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H04W64/003—Locating users or terminals or network equipment for network management purposes, e.g. mobility management locating network equipment
    • 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/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/16—Performing reselection for specific purposes
    • H04W36/22—Performing reselection for specific purposes for handling the traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • H04W84/20—Leader-follower arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices

Definitions

  • Embodiments of the present invention generally relate to the field of wireless communications, and more particularly to the design of virtual cells, and more particularly to electronic devices and methods for wireless communications and computer readable storage media.
  • a virtual cell can be implemented by clustering access points (APs), and a local controller (also called a master node) can be set in each virtual cell.
  • APs access points
  • a local controller also called a master node
  • an electronic device for wireless communication comprising: processing circuitry configured to: determine a partitioning scheme of a virtual cell in a predetermined area in a dynamic manner, and determine a partitioning scheme of the virtual cell, including Dividing a plurality of access points in the predetermined area into one or more virtual cells and designating an access point as a master node in each virtual cell; and generating a message indicating a partitioning scheme of the virtual cell to notify the designated master node .
  • an electronic device for wireless communication comprising: processing circuitry configured to: perform a predetermined region for a particular search location in response to a distributed search request from a central management device An iterative operation of intra-virtual cell division, wherein the search location is the number of divided virtual cells; and the network utility value corresponding to the search location is calculated based on the virtual cell partition obtained when the iterative operation converges, the network utility value is a weighted sum of a function of a packet loss rate of each virtual cell and a function of a handover overhead within a predetermined area, wherein the packet loss rate is obtained based on a backhaul capacity of the master node of the corresponding virtual cell and a total backhaul requirement of the virtual cell; and generating A message containing the search location and network utility value to report to the central management device.
  • a method for wireless communication including: determining, in a dynamic manner, a division scheme of a virtual cell in a predetermined area, determining that a division scheme of the virtual cell includes multiple connections within a predetermined area
  • the ingress point is divided into one or more virtual cells and an access point that is designated as a master node in each virtual cell; and a message indicating a partitioning scheme of the virtual cell is generated to notify the designated master node.
  • a method for wireless communication comprising: performing an iterative operation for virtual cell partitioning within a predetermined area for a particular search location in response to a distributed search request from a central management device
  • the search location is the number of divided virtual cells
  • the network utility value corresponding to the search location is calculated, and the network utility value is a function of the packet loss rate of each virtual cell.
  • the packet loss rate is obtained based on a backhaul capacity of a master node of the corresponding virtual cell and a total backhaul requirement of the virtual cell; and generating a search location and a network utility value
  • the news is reported to the central management device.
  • the electronic device and method according to the present application can dynamically determine the division of a virtual cell, thereby flexibly and efficiently satisfying the communication requirements in the wireless network.
  • FIG. 1 shows a functional block diagram of an electronic device for wireless communication in accordance with one embodiment of the present application
  • FIG. 2 shows a scenario diagram of a distribution of access points (APs) as an example and division of virtual cells;
  • FIG. 3 is a schematic diagram showing the boundary of each AP generated by using a Veno diagram in a scenario in which 25 APs are randomly distributed in an area of 1 km ⁇ 1 km;
  • FIG. 4 is a schematic diagram showing a boundary of the obtained virtual cell in a case where the area shown in FIG. 3 is divided into five virtual cells;
  • FIG. 5 shows an exemplary schematic diagram of an information flow for implementing partitioning of a virtual cell on a coexistence manager
  • Figure 6 shows an exemplary schematic diagram of another information flow
  • FIG. 7 illustrates a functional block diagram of an electronic device for wireless communication in accordance with another embodiment of the present application.
  • Figure 8 shows an AP scene graph within a given area used in the simulation example
  • FIG. 9 shows an example of a randomly generated UE scene graph
  • FIG. 10 is a graph showing an example of a utility function of a virtual cell packet loss rate
  • FIG. 11 is a graph showing an example of a utility function of a virtual inter-cell handover overhead
  • FIG. 12 is a schematic diagram showing the boundary of each AP in the AP scenario of FIG. 8 generated using the Veno diagram;
  • FIG. 13 is a graph showing estimated virtual cell average packet loss rate and estimated virtual inter-cell handover overhead under the total number of possible virtual cells obtained by the existing exhaustive search method;
  • Figure 14 is a graph showing a network utility curve obtained using the technique search of the present application.
  • Figure 15 shows a graph of a utility curve obtained using an exhaustive search method
  • 16 is a schematic diagram showing an optimal virtual cell partitioning scheme obtained by the technique of the present application.
  • FIG. 17 shows a flow chart of a method for wireless communication in accordance with one embodiment of the present application.
  • Figure 18 is a flow chart showing an example of the step S11 in Figure 17;
  • FIG. 19 is a flow chart showing another example of step S11 in FIG. 17;
  • 21 is a block diagram showing an example of a schematic configuration of a server 700 to which the technology of the present disclosure can be applied;
  • FIG. 22 is a block diagram showing a first example of a schematic configuration of an eNB or a gNB to which the technology of the present disclosure may be applied;
  • FIG. 23 is a block diagram showing a second example of a schematic configuration of an eNB or a gNB to which the technology of the present disclosure may be applied;
  • FIG. 24 is a block diagram of an exemplary structure of a general purpose personal computer in which a method and/or apparatus and/or system in accordance with an embodiment of the present invention may be implemented.
  • the electronic device 100 includes a determining unit 101 configured to determine a predetermined schedule in a dynamic manner.
  • the dividing scheme of the virtual cell in the area, determining the dividing scheme of the virtual cell includes dividing a plurality of access points (APs) in the predetermined area into one or more virtual cells, and designating an access point as a master node in each virtual cell.
  • a generating unit 102 configured to generate a message indicating a partitioning scheme of the virtual cell to notify the designated master node.
  • the determining unit 101 and the generating unit 102 can be implemented by one or more processing circuits, which can be implemented, for example, as a chip.
  • FIG. 2 shows a scene graph of a distribution of access points (APs) as an example and division of virtual cells.
  • the AP described herein may be any node that provides network communication services, such as a base station, a small base station, and the like.
  • the base station can be implemented as any type of evolved Node B (eNB) or gNB (5G base station).
  • eNB evolved Node B
  • gNB 5G base station
  • the eNB includes, for example, a macro eNB and a small eNB.
  • the small eNB may be an eNB covering a cell smaller than the macro cell, such as a pico eNB, a micro eNB, and a home (femto) eNB.
  • a similar situation can also be used for gNB.
  • the base station can be implemented as any other type of base station, such as a NodeB and a base transceiver station (BTS).
  • the base station can include: a body (also referred to as a base station device) configured to control wireless communication; and one or more remote wireless headends (RRHs) disposed at a different location than the body.
  • RRHs remote wireless headends
  • various types of terminals can operate as base stations by performing base station functions temporarily or semi-persistently.
  • the user equipment (UE, also simply referred to as the user) shown in FIG. 2 may be any terminal device or a wireless communication device providing the service.
  • the terminal device may be implemented as a mobile terminal (such as a smart phone, a tablet personal computer (PC), a notebook PC, a portable game terminal, a portable/encrypted dog type mobile router, and a digital camera device) or an in-vehicle terminal (such as a car navigation device). ).
  • the terminal device can also be implemented as a terminal (also referred to as a machine type communication (MTC) terminal) that performs machine-to-machine (M2M) communication.
  • the terminal device may be a wireless communication module (such as an integrated circuit module including a single wafer) installed on each of the above terminals.
  • the electronic device 100 may cluster the AP shown in FIG. 2 to obtain a division of a virtual cell, that is, each cluster AP constitutes one virtual cell.
  • the electronic device 100 may be located, for example, on the core network side shown in FIG. 2 or on the central management device side.
  • the spectrum management device can function as a central management device.
  • the electronic device 100 can be located, for example, on the spectrum management device side.
  • the electronic device 100 can be implemented on a Spectrum Coordinator (SC), a Coexistence Manager (CxM), or a Spectrum Access System (SAS).
  • SC Spectrum Coordinator
  • CxM Coexistence Manager
  • SAS Spectrum Access System
  • APs are densely distributed. When the UE moves within the illustrated area, frequent handovers between APs occur, which causes large handover overhead and reduces communication quality and resource utilization efficiency.
  • the APs can be dynamically clustered to form multiple virtual cells, thereby reducing handover overhead.
  • the determining unit 101 of the electronic device 100 determines the partitioning scheme of the virtual cell in a dynamic manner, thereby being flexibly applicable to various AP distribution scenarios and UE distribution scenarios.
  • the determining a virtual cell partitioning scheme includes two aspects: dividing multiple APs into one or more virtual cells; and designating an access point as a master node in each cell.
  • the master node is responsible for resource management of the corresponding virtual cell. Since the division of the virtual cell is dynamic, the master node is not fixed, but changes as the UE moves or the state of the AP changes.
  • the generating unit 102 generates a message including a partitioning scheme of the virtual cell for providing the partitioning scheme to the designated master node.
  • the master node performs division and communication of the virtual cell according to the division scheme.
  • the electronic device 100 may further include a communication unit for performing various transceiving operations.
  • the communication unit can for example be implemented as an antenna or an array of antennas with which the antenna array is associated.
  • the operations of the determining unit 101 and the generating unit 102 may be performed in response to one or more of the following: the switching overhead of the one or more current virtual cells exceeds a predetermined overhead threshold; the backhaul demand of the one or more current virtual cells exceeds the corresponding virtual The backhaul capacity threshold of the cell; a predetermined time has elapsed.
  • the operations of the determining unit 101 and the generating unit 102 can be performed periodically and/or in a triggering manner. In this way, deterioration in communication quality can be avoided.
  • the operations of the determining unit 101 and the generating unit 102 correspond to the update of the division of the virtual cell, and the time interval between the two updates is referred to as an update slot.
  • the update slot is equal to the above predetermined time.
  • the determining unit 101 determines a partitioning scheme of the virtual cell based on one or more of the following: a backhaul capacity of the master node of the virtual cell; a switching overhead caused by the user equipment switching between the virtual cells.
  • the network communication quality can be effectively guaranteed by considering the division of the virtual cell by considering at least one of the above factors.
  • the backhaul capacity between the master node and the core network is limited, and if the user's backhaul demand exceeds the backhaul capacity, Lose packets and reduce communication quality. For example, when the coverage of the virtual cell is too large, there may be a situation where the backhaul requirement exceeds the backhaul capacity of the master node.
  • the current serving AP serving AP
  • the serving AP needs to issue a handover request to the current master node, and the current master node then sends a command to the master node of the target adjacent virtual cell.
  • the requesting, the main control node of the adjacent virtual cell sends an access request to the target serving AP in the virtual cell, and after receiving the request, the target serving AP returns to the original handover control signal, and finally the current serving AP sends a handover command to the user.
  • the neighboring virtual cell master node After the user synchronizes with the target service AP, the neighboring virtual cell master node sends the resource release signaling to the original virtual cell master node, and the original virtual cell master node sends the resource release signaling to the user's original serving AP, and finally completes the user. Switching between virtual cells. It can be seen that the more frequent the inter-virtual cell handover occurs, the greater the switching overhead between virtual cells involved.
  • the determining unit 101 may be configured to determine a partitioning scheme of the virtual cell such that the network utility value is the highest in the case of adopting the partitioning scheme, wherein the network utility value and the packet loss rate of each virtual cell are within a predetermined area
  • the handover overhead is related, for example, a weighted sum of a function of a packet loss rate of each virtual cell and a function of handover overhead within a predetermined area, wherein the packet loss rate is based on a backhaul capacity of the master node of the corresponding virtual cell and a total of the virtual cell Return demand is obtained.
  • the network utility value U can be, for example, as shown in the following formula (1):
  • f 1 is a utility function of the packet loss rate of each virtual cell
  • PL n is the packet loss rate of the nth virtual cell
  • E() represents the mean operation
  • f 2 is a utility function of the handover overhead in the predetermined area
  • H is The virtual inter-cell handover overhead (e.g., the number of handovers) estimated in the update slot in the case of using the division scheme of the virtual cell
  • a, b are weight coefficients
  • a + b 1.
  • the weight coefficients a, b can be set according to actual needs, or a and b can be set to empirical values. It can be understood that when one of a and b is 0, the division scheme of the virtual cell is determined based only on a single factor. Furthermore, f 1 and f 2 may be any suitable utility function and are not subject to any restrictions. Also, the form of the network utility value U is not limited to that shown in the formula (1), but other appropriate modifications or changes may be made, and the formula (1) is merely an example given for the purpose of understanding.
  • the packet loss rate of the nth virtual cell in the equation (1) can be estimated by the following equation (2).
  • Cn is the backhaul capacity between the master node of the nth virtual cell and the core network.
  • the determining unit 101 is further configured to acquire one or more of the following from each of the current master nodes: the location of each access point, and the backhaul of each access point Capacity, backhaul demand, location, and mobility information of user equipment within the coverage of the corresponding virtual cell.
  • the movement information includes, for example, a moving speed, historical movement data, and the like.
  • the determining unit 101 can also interact with the electronic devices of other central management devices to obtain management by other central management devices.
  • the information of the access point and/or the information of the access point managed by the central management device is provided to other central management devices.
  • the information of the access point includes, for example, the location of the access point, the backhaul capacity of the access point, and the like.
  • the electronic device 100 is located on the spectrum management device side, and the determining unit 101 can interact with other spectrum management devices in the predetermined region to exchange information of the respective managed access points.
  • the spectrum management device can be SC, CxM, SAS, or the like.
  • the determining unit 101 may use the network utility value to evaluate the performance of the partitioning scheme of the virtual cell to determine an optimal or preferred partitioning scheme.
  • the network utility value may be used to evaluate the performance of the partitioning scheme of the virtual cell to determine an optimal or preferred partitioning scheme.
  • the determining unit 101 is configured to: perform the iterative operation for virtual cell partitioning for different search locations for the number of divided virtual cells as the search location; the virtual cell partition obtained based on the completion of the iterative operation Calculating a network utility value corresponding to the search location; optimizing a search location to perform an iterative operation based on the network utility value to determine an optimal search location; and determining a partitioning scheme of the virtual cell corresponding to the optimal search location as The division scheme of the virtual cell to be adopted.
  • the above operation of the determining unit 101 nests two iterative operations, that is, An iterative operation of a given search location and a second iterative operation of changing the search location.
  • N p different search positions are randomly selected in the integer interval [1, M] to perform partitioning of the virtual cells respectively, where M is the number of APs in the predetermined area, and the search position represents the virtual area into which the predetermined area is divided.
  • the number of cells, the value of N p can be determined according to the computing power of the device, the required computing speed, and the like.
  • the determining unit 101 For each search location, the determining unit 101 performs an iterative operation to find an optimal partitioning manner, for example, which APs should be divided into one cluster, and which AP should be the master node.
  • the determining unit 101 performs an iterative operation for virtual cell partitioning as follows: 1) selecting a first number of access points corresponding to the search location as the respective virtual cells according to the location and backhaul capacity of each access point a candidate access point of the master node; 2) clustering the access point based on a weighted distance from each access point to the candidate access point, wherein the weighted distance is compared with the actual distance of the access point and the candidate access point, based on the candidate
  • the weighting factor of the backhaul capability of the access point is related, for example, may be a product of the two; 3) updating the candidate access point of the cluster for each cluster, and re-based the weighted distance based on the updated candidate access point
  • the clusters, until the predetermined condition is satisfied, the candidate access points of the clusters finally obtained are used as the master nodes of the respective virtual cells.
  • a first number such as K APs, having a larger spacing between each other and a larger backhaul capacity may be selected as candidate access points, wherein the candidate access points are candidates for the master nodes of the clusters.
  • the access points other than the K candidate access points are divided, that is, the clusters to which the candidate access points should be assigned, respectively.
  • the cluster of the finally determined K candidate access points is K virtual cells.
  • the access point may be clustered based on the weighted distance from the access point to the candidate access point. It should be noted that, without limitation, the clustering may be performed based on the actual distance from the access point to the candidate access point.
  • the weighting factor may be set such that the stronger the backhaul capability of the candidate access point, the more likely the access point is to be clustered to the candidate access point, and the backhaul of the user equipment around the candidate access point The greater the demand, the less likely it is to assign an access point to the cluster of candidate access points. That is, the weighting factor can be a compromise between these two tendencies.
  • the weighting factor may be set such that the possibility that the access point is allocated to the cluster of candidate access points with strong backhaul capability is greater than the possibility that the access point is assigned to the cluster of candidate access points with weak backhaul capability And the probability that the access point is allocated to the cluster of candidate access points with large backhaul requirements of the surrounding user equipment is less than the candidate access point with less backhaul demand of the user equipment to which the access point is divided.
  • the possibility in the cluster In the case of using the weighted distance, not only the influence of the distance of the actual distance but also the backhaul capability of the candidate access point is considered, thereby facilitating the obtaining of a better division scheme.
  • the weighting factor may be, for example, a normalized value of a ratio between a backhaul demand of the user equipment around the estimated candidate access point and a backhaul capacity of the candidate access point, for example, as shown in the following formula (3).
  • R i is a possible user requirement near the i-th candidate access point
  • C i is the i-th candidate access point.
  • R i in the formula (3) is an estimated value, that is, it is necessary to roughly estimate a possible backhaul demand near the i-th candidate access point.
  • the i-th user from the candidate access point within a predetermined distance r K backhaul requirements can be used as R i.
  • r K can be set to:
  • the determining unit 101 may assign the access point to the cluster of candidate access points to which the corresponding weighted distance is the smallest. Take equation (3) as an example, if If w i d mi ⁇ w j d mj , the mth AP is divided into clusters of the ith candidate access point, where d mi represents the geometry between the ith candidate access point and the mth AP distance.
  • the candidate access points of the cluster are updated for each cluster in 3) for the next iteration, that is, the clustering of step 2) is performed again. For example, for each cluster, the center of the location of all access points it contains can be calculated and the access point closest to the center in the cluster is selected as the candidate access point for the next iteration.
  • the predetermined condition is, for example, one or more of the following: the change in the position of the candidate access point between the two clustering operations is less than a predetermined degree; the number of executions of the clustering operation reaches a predetermined value.
  • the position of the candidate access point is substantially unchanged, it indicates that the iterative algorithm tends to converge, and the iteration can be stopped at this time.
  • the iteration is stopped to effectively control the calculation load.
  • the candidate access points of each cluster finally obtained are taken as the master nodes of the respective virtual cells.
  • the determining unit 101 may determine the boundary of the virtual cell based on the result of the finally obtained clustering, thereby completing the division of the virtual cell at a given search location.
  • the determining unit 101 calculates a network utility value at the search position based on the obtained division of the virtual cell. For example, the calculation can be performed using Equation (1), which involves the switching overhead caused by the user equipment switching between virtual cells and/or the degree to which the master node satisfies the user's backhaul requirements.
  • the determining unit 101 can estimate the handover overhead between the virtual cells based on the boundary of the virtual cell and the mobile information of the user equipment. Specifically, when the user equipment generates a handover overhead when moving across a boundary of the virtual cell, the determining unit 101 may estimate the virtuality determined in combination with the mobile information of the user equipment, such as the moving speed of the user equipment, historical mobile data, and map information. The number of effective user penetrations near the boundary of the cell, thereby counting the total number of effective penetration boundaries, ie the total handover overhead, under the virtual cell partitioning scheme at the corresponding search location.
  • the determining unit 101 may utilize a Voronoi diagram to derive the boundaries of the respective virtual cells.
  • the Veno diagram is a distance-based plane division method in computational geometry. Specifically, assuming that there are n non-coincident seed points on the plane, the plane is divided into n regions such that the distance of the points in each region to the seed points in the region thereof is closer than the distance to the seed points in other regions. Each region is called the Veno region of the seed point.
  • FIG. 3 shows a schematic diagram of the boundary of each AP generated using the Veno diagram in a scenario in which 25 APs are randomly distributed in an area of 1 km ⁇ 1 km.
  • FIG. 4 is a schematic diagram showing the boundary of a virtual cell obtained by combining boundaries of APs belonging to the same cluster when the division of the virtual cell is completed in the case where the number of virtual cells is 5.
  • the determining unit 101 estimates the maximum data backhaul requirement of each virtual cell in one update time slot in combination with the user's data backhaul requirement and the handover situation, and calculates the loss under the virtual cell partitioning scheme, for example, using equation (2). Package rate.
  • the network utility value under the virtual cell partitioning scheme is calculated using, for example, equation (1) as the network utility value at the search location.
  • the determining unit 101 may further provide the boundary information of the virtual cell to the master node of each current virtual cell, and estimate the coverage within the coverage by the master node of the current virtual cell in combination with the mobile information of the user equipment in the coverage area. The number of times the boundary may be penetrated and supplied to the determining unit 101. That is, at least a portion of the estimation of the handover overhead may be performed by the master node of each current virtual cell.
  • the network utility values at the N p search positions are respectively obtained, and the search position of the iterative operation of the division of the virtual cell next to be performed is optimized based on the obtained network utility value to determine an optimal search position, for example, Determine the search location where the network utility value is the largest.
  • the network utility values at Np search locations can be compared to select the largest one as the global optimal value and its corresponding search location as the global optimal search location.
  • the search location of the next iteration operation is updated based on the search location of the previous iteration operation and the corresponding network utility value and the global optimal search location and the corresponding network utility value.
  • the iterative operation of virtual cell partitioning is then completed for the updated Np search locations to obtain updated Np network utility values.
  • the above operation constitutes a second iterative operation.
  • the second iterative operation is repeatedly performed by using the updated N p network utility values to update the global optimal value and the corresponding global optimal search position until a predetermined condition is reached.
  • the predetermined condition herein may include, for example, one or more of the following: the global optimal search position no longer changes; the network utility value corresponding to the global optimal search position changes less than the predetermined degree between the two second iteration operations; The number of two iteration operations reaches a predetermined value.
  • the generating unit 102 When the second iteration operation is completed, it is considered that the global optimal search position is obtained, thereby determining the division scheme of the virtual cell to be adopted in the next time slot.
  • the generating unit 102 generates information including the dividing scheme to notify the designated master node.
  • the determining unit 101 may be further configured to determine a spectrum requirement of each virtual cell according to the determined backhaul requirement of the virtual cell and a communication quality requirement, such as a Signal to Interference and Noise Ratio (SINR) requirement, according to This spectrum requirement is used to determine the spectrum allocation scheme.
  • the generating unit 102 may also generate information including a spectrum allocation scheme to notify the master node.
  • the determining unit 101 can request the available spectrum resources from the spectrum management device.
  • the determining unit 101 may request an available spectrum resource from a spectrum management device such as a SAS via a Domain Proxy.
  • the electronic device 100 is implemented, for example, on a logical entity CxM.
  • the determining unit 101 transmits a spectrum request to the domain agent, the domain agent sends a spectrum query request to the SAS, and the SAS sends a spectrum query response to the domain agent.
  • the domain agent informs the determining unit 101 that the spectrum resource is available.
  • the determining unit 101 issues a resource release request to each of the current master nodes, and issues an access control request to the new master node.
  • each master node sends a resource release confirmation message to the core network, and the new master node sends an access control acknowledgement message to the determining unit 101.
  • the transceiver unit transmits information including the spectrum allocation scheme to the new master node or to the controlled node.
  • FIG. 5 shows an exemplary schematic diagram of an information flow for implementing partitioning of a virtual cell on CxM.
  • the electronic device 100 is implemented on a CxM
  • the master node can be implemented, for example, as a CBSD (Citizens Broadband Radio Service Device).
  • the current master node provides the CxM with various information required for the division of the virtual cell, including but not limited to: the location and backhaul capacity of each access point that the master node is responsible for, and the UE within the coverage of the current virtual cell. Backhaul demand, location and mobile information such as mobile speed and historical mobile information.
  • the division of the virtual cell is performed on the CxM using the division method of the virtual cell described in detail in the foregoing embodiment.
  • the CxM determines the spectrum requirement of the virtual cell according to the backhaul requirement and the communication quality requirement of the virtual cell, and sends a spectrum request to the domain proxy.
  • the domain proxy sends a spectrum query request to the SAS, and the SAS then sends a spectrum query response to the domain proxy.
  • the domain agent informs the CxM of the available spectrum resources accordingly.
  • the CxM sends a resource release request to the current master node and sends an access control request to the new master node.
  • each master node sends a resource release acknowledgement (ACK) message to the CxM, and the new master node sends an access to the CxM. Control ACK messages.
  • the CxM sends information to the new master node containing the spectrum allocation scheme and the controlled AP to be managed, ie, the virtual cell partitioning scheme.
  • FIG. 5 is merely exemplary and not limiting, and may be modified or changed according to actual needs and application scenarios.
  • the electronic device 100 is capable of dynamically determining a division scheme of a virtual cell in a predetermined area, thereby being flexibly applicable to various scenarios and ensuring communication quality.
  • the determining unit 101 is configured to: select a predetermined number of master nodes as search nodes according to current load of each master node; and instruct the search nodes to perform virtual respectively for different search locations An iterative operation of cell division, wherein the search location is the number of divided virtual cells; performing a second iterative operation until a predetermined condition is reached: obtaining virtual cell partitioning for the corresponding search location from the search node a network utility value of the solution, and determining a global optimal search location based on the network utility value; providing the global optimal search location and its corresponding network utility value to the search node, such that each search node is based on the global maximum The optimal search location and its corresponding network utility value and the search location of the last iterative operation of the search node and the corresponding network utility value update the search location of the next iteration operation.
  • the determination of the virtual cell division scheme is performed distributedly by the search node, thereby reducing the computational load of the electronic device 100.
  • a master node with a light load and/or a strong computing capability in the current master node may be selected as the search node.
  • the number N p of selected search nodes depends, for example, on the real-time requirements and the processing capabilities of the master node. When the real-time requirement is high, and/or the processing power of the master node is strong, N p can be set to be large.
  • the generating unit 102 is further configured to generate a distributed search request to provide to the selected search node, and to obtain a response from the search node for the distributed search request.
  • the determining unit 101 is further configured to provide the search node with one or more of the following: location of each access point, backhaul capacity of each access point, backhaul demand of the user equipment, location, and mobility information.
  • the mobile information of the user equipment includes, for example, the moving speed of the user equipment, historical movement data, and the like (may include only one of them).
  • the above information provided to the search node may also be provided by the current master node.
  • the current master node may collect the location of its UE, mobile information, data backhaul requirements, etc. and provide it to the search node.
  • each of the selected N p search nodes performs virtual cell partitioning for a randomly selected initial search location, that is, performs an iterative operation of the virtual cell partitioning described in the first embodiment to determine an initial search.
  • Virtual cell partitioning scheme at the location is also calculated based on the division scheme.
  • Each search node provides its initial search location and the calculated corresponding network utility value to the electronic device 100.
  • the determining unit 101 compares, for example, the network utility values at the Np initial search locations to select the largest one, as a global
  • the initial value of the optimal value and its corresponding search position is taken as the initial global optimal search position.
  • the global optimal value and the global optimal search position are provided to the Np search nodes, so that each search node is based on the search position of the previous iteration operation and the corresponding network utility value and the global optimal search position, respectively. And the global optimal value to update the search position of the next iteration operation.
  • the N p search nodes complete the iterative operation of the virtual cell division using the new search location to obtain updated N p network utility values, and provide the new search location and network utility value to the determining unit 101.
  • the determining unit 102 updates the global optimal value and the global optimal search position based on the updated search position and the network utility value.
  • the above operation constitutes a second iterative operation.
  • the second iterative operation is repeatedly performed to search for the final global optimal value and the global optimal search position.
  • the details of the iterative operation and the second iterative operation regarding the virtual cell division described above have been described in detail in the first embodiment, and are not repeated here.
  • the predetermined condition may include, for example, one or more of the following: the global optimal search position no longer changes; the network utility value corresponding to the global optimal search position changes less than the predetermined degree between the two second iteration operations The number of second iteration operations reaches a predetermined value.
  • the determining unit 101 may be further configured to acquire, from the search node that provides the final global optimal search position, a partitioning scheme of the virtual cell corresponding to the final global optimal search location as a partitioning scheme of the virtual cell to be employed.
  • the partitioning scheme of the virtual cell further includes information of a boundary of the virtual cell.
  • FIG. 6 shows an example of the information flow of the present embodiment.
  • the electronic device can be implemented on CxM, and the master node is implemented as CBSD.
  • the master node as the search node is implemented as a specific CBSD, hereinafter referred to as a CBSD agent.
  • CxM selects N p search nodes from the current master node as CBSD agents and sends a distributed search request thereto, and the CBSD agent sends a distributed search ACK in response to the request.
  • the CxM sends information of each access point to these CBSD agents, including, for example, the location of the access point, backhaul capacity, and the like.
  • the CBSD agent initializes the search location, for example, in a random manner, and requests the current master node for information of the UE, including, for example, the UE's backhaul demand, location, mobility information, and the like.
  • the current master node obtains this information from the UEs within its coverage in response to the request and sends it to the CBSD agent. It should be understood that the manner in which the above information is obtained is not restrictive, but other methods may be suitably employed, such as providing all information by CxM, or providing all information by the current master node, and the like.
  • the CBSD agent uses the obtained information to perform an iterative operation of virtual cell partitioning for the current search location. After the division of the virtual cell is completed, the boundary information of the virtual cell is calculated and provided to the current master node, so that the current master node estimates the number of times the UE penetrates the virtual cell boundary, that is, estimates the UE within its coverage. Switching overhead.
  • the current master node sends the estimated handover overhead to the CBSD agent. It should be understood that the CBSD agent can also estimate the switching overhead and calculate the network utility value.
  • the CBSD agent calculates the network utility value based on, for example, the handover overhead and the packet loss rate calculated based on the backhaul capacity and the backhaul demand, and transmits the current search location and the calculated network utility value to the CxM.
  • the CxM updates the global optimal value and the global optimal search position of the network utility value based on the obtained N p group data. For example, in the case where the algorithm does not converge, CxM sends the updated global optimal value and the global optimal search position to the CBSD agent to update the search position of the next iteration accordingly.
  • the dashed box shown in Figure 6 represents the second iteration operation described above.
  • the CxM requests an optimal virtual cell partitioning scheme from the CBSD agent that provides the final global optimal value, and the CBSD agent sends the optimal virtual cell partitioning scheme to the CxM.
  • the optimal virtual cell division scheme includes a master node and a controlled node of each virtual cell. Alternatively, the optimal virtual cell division scheme may further include information of boundaries of the respective virtual cells.
  • the CxM determines the spectrum requirement of the virtual cell according to the backhaul requirement and the communication quality requirement of the virtual cell, and sends a spectrum request to the domain proxy.
  • the domain proxy sends a spectrum query request to the SAS, and the SAS then sends a spectrum query response to the domain proxy.
  • the domain agent informs the CxM of the available spectrum resources accordingly.
  • the CxM sends a resource release request to the current master node and sends an access control request to the new master node.
  • each master node sends a resource release acknowledgement (ACK) message to the CxM, and the new master node sends an access to the CxM. Control ACK messages.
  • the CxM sends information to the new master node containing the spectrum allocation scheme and the controlled AP to be managed, ie, the virtual cell partitioning scheme.
  • FIG. 6 is merely exemplary and not limiting, and may be modified or changed according to actual needs and application scenarios.
  • the electronic device 100 is capable of dynamically determining a division scheme of a virtual cell in a predetermined area, thereby being flexibly applicable to various scenarios, ensuring communication quality, and improving a virtual cell division scheme by adopting a distributed search manner.
  • the determined real-time performance reduces the computational load of the electronic device 100.
  • FIG. 7 illustrates a functional block diagram of an electronic device 200 for wireless communication, as shown in FIG. 7, the electronic device 200 includes an execution unit 201 configured to be responsive from a central unit, in accordance with another embodiment of the present application.
  • Managing a distributed search request of the device performing an iterative operation for virtual cell partitioning in a predetermined area for a specific search location, wherein the search location is the number of divided virtual cells; and the computing unit 202 is configured to be based on the iteration Calculating a virtual utility cell obtained by converging to calculate a network utility value corresponding to the search location, the network utility value being a function of a function of a packet loss rate of each virtual cell and a function of a handover overhead within the predetermined region And, wherein the packet loss rate is obtained based on a backhaul capacity of a master node of the corresponding virtual cell and a total backhaul requirement of the virtual cell; and a generating unit 203 configured to generate the search location and the network utility value The message is reported to the
  • the execution unit 201, the calculation unit 202 and the generation unit 203 can be implemented by one or more processing circuits, which can be implemented, for example, as a chip. Further, although not shown in FIG. 7, the electronic device 200 may further include a communication unit for performing a transceiving operation.
  • the communication unit can for example be implemented as an antenna or an array of antennas with which the antenna array is associated.
  • the electronic device 200 can, for example, be located on a current master node selected as a search node and can be implemented, for example, on a CBSD agent.
  • the distributed search request may include one of: initial information for determining an initial search location as a particular search location; a current global optimal search location for determining a particular search location and its corresponding network utility value.
  • the distributed search request may include an initial search location, in other words, the initial search location is selected by the central management device and provided to the electronic device 200.
  • the distributed search request may include a random seed, and the execution unit 201 uses the random seed to generate an initial search location.
  • the distributed search request includes the pre-global optimal search location updated by the central management device and its corresponding network utility value.
  • the execution unit 201 is configured to determine a specific search location of the iteration based on the current global optimal search location and its corresponding network utility value and the search location at which the previous iteration operation converges and its corresponding network utility value.
  • the electronic device 200 may be further configured to acquire one or more of the following from the central management device: the location of each access point, the backhaul capacity of each access point, the backhaul demand, location, and movement of the user equipment information.
  • the electronic device 200 may also obtain backhaul requirements, location, and movement information of the user equipment within its coverage from the current respective master nodes.
  • the execution unit 201 may perform an iterative operation of selecting a first number of access points corresponding to a specific search location as candidate access points of the master nodes of the respective virtual cells according to the location and backhaul capacity of each access point;
  • the access point is clustered based on the weighted distance from each access point to the candidate access point, wherein the weighted distance is the product of the actual distance between the access point and the candidate access point and the weighting factor based on the backhaul capability of the candidate access point. Updating the candidate access points of the cluster for each cluster, and performing the weighted distance-based clustering again using the updated candidate access points until the predetermined condition is met, and the candidate access points of the finally obtained clusters are used as The master node of each virtual cell.
  • the predetermined condition may include one or more of the following: the change of the position of the candidate access point between the two clustering operations is less than a predetermined degree; the number of clustering operations reaches a predetermined value.
  • Execution unit 201 may assign the access point to a cluster of candidate access points to which the corresponding weighted distance is the smallest.
  • the execution unit 201 is further configured to set a weighting factor such that the stronger the backhaul capability of the candidate access point, the more likely the access point is to be allocated to the cluster of the candidate access point, and the user equipment around the candidate access point The larger the backhaul demand, the less likely it is to assign an access point to the cluster of candidate access points.
  • the weighting factor may be a normalized value of the ratio between the backhaul demand of the user equipment around the estimated candidate access point and the backhaul capacity of the candidate access point.
  • computing unit 202 can be configured to derive the boundaries of the respective virtual cells using the Veno diagram based on the results of the resulting clustering.
  • computing unit 202 is configured to estimate a handover overhead for each virtual cell based on the boundary and movement information of the user equipment to obtain a handover overhead within the predetermined area.
  • the information of the boundary may also be provided to the current respective master nodes, so that the current respective master nodes estimate the movement caused by the movement of the user equipment within the coverage based on the mobile device's mobile information.
  • the overhead calculation unit 202 acquires the information of the handover overhead from the current respective master control nodes, and estimates the handover overhead in the predetermined area based on the information of the handover overhead. Subsequently, the computing unit 202 calculates the network utility value based on, for example, the handover overhead and the packet loss rate calculated based on the backhaul capacity and the backhaul demand.
  • the electronic device 200 may further obtain, from the central management device, a partitioning scheme of the finally determined virtual cell, where the partitioning scheme of the virtual cell includes one or more of the following: a master node of the virtual cell, a controlled node of the virtual cell, and Information about the boundaries of the virtual cell.
  • the electronic device 200 can also acquire information of the spectrum allocation scheme from the central management device.
  • the electronic device 200 can perform the determination of the division scheme of the virtual cell in response to the request of the central management apparatus, thereby being flexibly applicable to various scenarios, improving the real-time performance of the virtual cell division scheme determination, and reducing the central management.
  • the computational load of the device can be performed.
  • Figure 8 is a diagram of an AP scene in a given area.
  • the distance between two APs cannot be less than r h by the hard core point process (HCPP).
  • ⁇ is the set of all AP location points in the area.
  • FIG. 9 is a randomly generated UE scene graph. It is assumed that the current master nodes can effectively estimate the number of effective user penetrations of boundaries within their virtual cell range based on the user's instantaneous speed, user history movement data, and street information.
  • s 1 and s 2 are expansion factors
  • h 1 and h 2 are symmetric centers
  • H is the total number of handovers between the estimated virtual cells
  • H th is the threshold of the number of handovers between virtual cells
  • the number of UEs is set in the simulation. 0.3 times.
  • the distributed search method described in the second embodiment is adopted, and the following parameters are adopted: simulation area, 1 km ⁇ 1 km; number of APs, 100; minimum distance between APs (r h ), 60 m; AP Backhaul capacity, 30 to 100 Mbps; number of UEs, 200; number of search nodes, three; weights of network utility values (see equation (1)), a; 0.5; calculation of network utility values (see formula (1)) weight b, 0.5; expansion factor s 1 , 35.3231; symmetry center h 1 , 0.1; spreading factor s 2 , 3.5834; symmetry center h 2 , 1.1946; H th , 60.
  • FIG. 12 shows the boundary of each AP in the AP scenario of FIG. 8 generated using the Veno diagram.
  • FIG. 13 is a graph of estimated virtual cell average packet loss rate and estimated virtual inter-cell handover overhead (ie, number of handovers) under the total number of possible virtual cells obtained by the existing exhaustive search method. As mentioned above, as the number of virtual cells increases, the average packet loss rate of the network gradually decreases, and the switching overhead between virtual cells gradually increases.
  • FIG. 14 is a network utility curve obtained by using the distributed search algorithm of the present application (also referred to as a distributed iterative algorithm based on particle swarm optimization (PSO) optimization algorithm), and FIG. 15 is obtained by using an exhaustive search method.
  • the utility curve shows that the distributed search algorithm of the present application can achieve the optimal utility value of the poor search through a few iterations.
  • FIG. 16 shows an optimal virtual cell partitioning scheme obtained by using the distributed search algorithm of the present application.
  • the circled AP is a master node determined by the algorithm of the present application, which has the same gray scale as the surrounding and An AP represented by an icon of the same shape constitutes a virtual cell. Meanwhile, FIG. 16 shows the boundary of the virtual cell obtained by using the Veno diagram.
  • FIG. 17 shows a flowchart of a method for wireless communication according to an embodiment of the present application, the method comprising: determining a division scheme of a virtual cell in a predetermined area in a dynamic manner (S11), determining the virtual cell
  • the dividing scheme includes dividing a plurality of access points in the predetermined area into one or more virtual cells and designating an access point as a master node in each virtual cell; and generating a message indicating a dividing scheme of the virtual cell to notify The designated master node (S12).
  • steps S11 and S12 may be performed in response to one or more of: the handover overhead of one or more current virtual cells exceeds a predetermined overhead threshold; the backhaul demand of one or more current virtual cells exceeds the backhaul of the corresponding virtual cell Capacity threshold; a predetermined time has elapsed.
  • the partitioning scheme of the virtual cell may be determined based on one or more of the following: the backhaul capacity of the master node of the virtual cell; the switching overhead caused by the user equipment switching between the virtual cells.
  • the division scheme of the virtual cell may be determined such that the network utility value is the highest in the case of adopting the division scheme, and the network utility value is, for example, related to the packet loss rate of each virtual cell and the handover overhead in the predetermined area, wherein the packet loss The rate is obtained based on the backhaul capacity of the master node of the corresponding virtual cell and the total backhaul demand of the virtual cell.
  • one or more of the following may be obtained from each of the current master nodes: the location of each access point, the backhaul capacity of each access point, and the backhaul requirement of the user equipment within the coverage of the corresponding virtual cell. , location and mobile information.
  • FIG. 18 shows a flowchart of an example of step S11.
  • step S11 includes: using the number of divided virtual cells as a search position, and performing iteration for virtual cell division for different search positions. Operation (S101); calculating a network utility value corresponding to the search location based on the virtual cell partition obtained when the iterative operation is completed (S102); optimizing a search location to perform an iterative operation based on the network utility value to determine an optimal search Position (S103); and determining a division scheme of the virtual cell corresponding to the optimal search location as a division scheme of the virtual cell to be employed (S104).
  • step S101 may include: selecting, according to the location and backhaul capacity of each access point, a first number of access points corresponding to the search location as candidate access points of the master node of each virtual cell; based on each access point The access point is clustered by a weighted distance to the candidate access point, wherein the weighted distance is related to the actual distance of the access point and the candidate access point, and the weighting factor based on the backhaul capability of the candidate access point; for each cluster, Update the candidate access points of the cluster, and perform re-sorting based on the weighted distances using the updated candidate access points until the predetermined condition is met, and the candidate access points of each cluster are finally taken as the master of each virtual cell. node.
  • the predetermined condition may include one or more of the following: the change of the position of the candidate access point between the two clustering operations is less than a predetermined degree; the number of executions of the clustering operation reaches a predetermined value.
  • the access point may be assigned to a cluster of candidate access points with the corresponding weighted distance being the smallest.
  • the weighting factor may be set such that the likelihood that the access point is split into clusters of candidate access points with strong backhaul capability is greater than the candidate access points to which the access point is assigned to a weak backhaul capability The likelihood in the cluster; and the likelihood that the access point is allocated to the cluster of candidate access points with large backhaul requirements of the surrounding user equipment is less than the backhaul requirement of the user equipment to which the access point is divided The likelihood of a cluster of candidate access points.
  • the weighting factor is a normalized value of the ratio between the estimated backhaul demand of the user equipment around the candidate access point and the backhaul capacity of the candidate access point.
  • step S102 the boundary of each virtual cell may be obtained based on the result of the finally obtained clustering, and the switching overhead between the virtual cells is estimated based on the boundary and the mobility information of the user equipment.
  • step S11 includes: selecting a predetermined number of master nodes as search nodes according to the current load of each master node (S111); indicating the search node Performing an iterative operation for virtual cell partitioning for different search locations (S112), wherein the search location is the number of divided virtual cells; performing the following second iterative operation until a predetermined condition is reached: obtaining from the search node a network utility value of the virtual cell partitioning scheme for the corresponding search location, and determining a global optimal search location based on the network utility value; and providing the global optimal search location and its corresponding network utility value to the search node, so that each search The node updates the search position of the next iteration operation according to the global optimal search position and its corresponding network utility value and the previous search position of the search node and the corresponding network utility value (S113).
  • the predetermined condition may include one or more of the following: the global optimal search position no longer changes; the network utility value corresponding to the global optimal search position changes less than the predetermined degree between the two second iteration operations; The number of iterative operations reaches a predetermined value.
  • the above method may further include: obtaining, by the search node that provides the final global optimal search position, a partitioning scheme of the virtual cell corresponding to the final global optimal search location as to be adopted.
  • a division scheme of the virtual cell, where the division scheme of the virtual cell may further include information of a boundary of the virtual cell.
  • Step S112 may also include generating a distributed search request to provide to the selected search node, and obtaining a response from the search node for the distributed search request.
  • the search node may also be provided with one or more of the following: location of each access point, backhaul capacity of each access point, backhaul demand of the user equipment, location, and mobility information.
  • the foregoing method may further include determining a spectrum requirement of each virtual cell according to the determined backhaul requirement of the virtual cell and a communication quality requirement, and determining a spectrum allocation scheme according to the spectrum requirement. And, a message including a spectrum allocation scheme can be generated to notify the master node.
  • the above method may be performed on the central management device side, and the method may further include interacting with other central management devices to obtain information of access points managed by other central management devices in a predetermined area and/or provide to other central management devices.
  • the information of the access point managed by the central management device may be performed on the central management device side, and the method may further include interacting with other central management devices to obtain information of access points managed by other central management devices in a predetermined area and/or provide to other central management devices.
  • the information of the access point managed by the central management device may be performed on the central management device side, and the method may further include interacting with other central management devices to obtain information of access points managed by other central management devices in a predetermined area and/or provide to other central management devices. The information of the access point managed by the central management device.
  • FIG. 20 shows a flowchart of a method for wireless communication in accordance with another embodiment of the present application, including: performing a predetermined search area for a specific search location in response to a distributed search request from a central management device An iterative operation of virtual cell division (S21), wherein the search location is the number of divided virtual cells; and the network utility value corresponding to the search location is calculated based on the virtual cell partition obtained when the iterative operation converges (S22)
  • the network utility value and the packet loss rate of each virtual cell are related to the handover overhead in the predetermined area, wherein the packet loss rate is obtained based on the backhaul capacity of the master node of the corresponding virtual cell and the total backhaul requirement of the virtual cell; and generating the inclusion A message of the location and network utility value is searched for reporting to the central management device (S23).
  • the distributed search request may include one of: initial information for determining an initial search location as a particular search location; a current global optimal search location for determining a particular search location and its corresponding network utility value.
  • the specific search location is determined based on the current global optimal search location and its corresponding network utility value and the search location at which the previous iteration operation converges and its corresponding network utility value.
  • step S21 is substantially the same as the iterative operation described in step S101 of FIG. 18, and is not repeated here.
  • a boundary of each virtual cell may be obtained based on the obtained master node, for example, by using a Veno diagram, and the handover overhead of each virtual cell is estimated based on the boundary and the mobility information of the user equipment to obtain a predetermined area. Switch overhead.
  • the information of the boundary may also be provided to each of the current master control nodes, so that the current individual master nodes estimate the handover overhead caused by the movement of the user equipment within the coverage area based on the mobile device's mobile information.
  • the information of the handover overhead is obtained from each of the current master nodes, and the handover overhead in the predetermined area is estimated based on the information of the handover overhead.
  • the foregoing method may further include: acquiring, from the central management device, a finalized division scheme of the virtual cell, where the division scheme of the virtual cell includes one or more of the following: a master of the virtual cell Information about nodes, controlled nodes of virtual cells, and boundaries of virtual cells.
  • the above method may also include obtaining information of the spectrum allocation scheme from the central management device.
  • electronic device 100 can be implemented as any type of server, such as a tower server, a rack server, and a blade server.
  • the electronic device 100 may be a control module mounted on a server (such as an integrated circuit module including a single wafer, and a card or blade inserted into a slot of the blade server).
  • Server 700 includes a processor 701, a memory 702, a storage device 703, a network interface 704, and a bus 706.
  • the processor 701 can be, for example, a central processing unit (CPU) or a digital signal processor (DSP) and controls the functionality of the server 700.
  • the memory 702 includes random access memory (RAM) and read only memory (ROM), and stores data and programs executed by the processor 701.
  • the storage device 703 may include a storage medium such as a semiconductor memory and a hard disk.
  • Network interface 704 is a communication interface for connecting server 700 to communication network 705.
  • Communication network 705 can be a core network such as an Evolved Packet Core Network (EPC) or a packet data network (PDN) such as the Internet.
  • EPC Evolved Packet Core Network
  • PDN packet data network
  • the bus 706 connects the processor 701, the memory 702, the storage device 703, and the network interface 704 to each other.
  • Bus 706 can include two or more buses (such as a high speed bus and a low speed bus) each having a different speed.
  • the determining unit 101, the generating unit 102, and the like described with reference to FIG. 1 may be implemented by the processor 701.
  • the processor 701 can determine a division scheme of the virtual cell in the predetermined area by performing the functions of the determining unit 101 and the generating unit 102.
  • FIG. 22 is a block diagram showing a first example of a schematic configuration of an eNB or a gNB to which the technology of the present disclosure can be applied. Note that the following description takes an eNB as an example, but can also be applied to a gNB.
  • the eNB 800 includes one or more antennas 810 and a base station device 820.
  • the base station device 820 and each antenna 810 may be connected to each other via an RF cable.
  • Each of the antennas 810 includes a single or multiple antenna elements, such as multiple antenna elements included in a multiple input multiple output (MIMO) antenna, and is used by the base station apparatus 820 to transmit and receive wireless signals.
  • MIMO multiple input multiple output
  • eNB 800 can include multiple antennas 810.
  • multiple antennas 810 can be compatible with multiple frequency bands used by eNB 800.
  • FIG. 22 illustrates an example in which the eNB 800 includes multiple antennas 810, the eNB 800 may also include a single antenna 810.
  • the base station device 820 includes a controller 821, a memory 822, a network interface 823, and a wireless communication interface 825.
  • the controller 821 can be, for example, a CPU or a DSP, and operates various functions of higher layers of the base station device 820. For example, controller 821 generates data packets based on data in signals processed by wireless communication interface 825 and communicates the generated packets via network interface 823. Controller 821 can bundle data from multiple baseband processors to generate bundled packets and pass the generated bundled packets. The controller 821 can have logic functions that perform control such as radio resource control, radio bearer control, mobility management, admission control, and scheduling. This control can be performed in conjunction with nearby eNBs or core network nodes.
  • the memory 822 includes a RAM and a ROM, and stores programs executed by the controller 821 and various types of control data such as a terminal list, transmission power data, and scheduling data.
  • Network interface 823 is a communication interface for connecting base station device 820 to core network 824. Controller 821 can communicate with a core network node or another eNB via network interface 823. In this case, the eNB 800 and the core network node or other eNBs may be connected to each other through a logical interface such as an S1 interface and an X2 interface. Network interface 823 can also be a wired communication interface or a wireless communication interface for wireless backhaul lines. If network interface 823 is a wireless communication interface, network interface 823 can use a higher frequency band for wireless communication than the frequency band used by wireless communication interface 825.
  • the wireless communication interface 825 supports any cellular communication scheme, such as Long Term Evolution (LTE) and LTE-Advanced, and provides a wireless connection to terminals located in cells of the eNB 800 via the antenna 810.
  • Wireless communication interface 825 may typically include, for example, baseband (BB) processor 826 and RF circuitry 827.
  • the BB processor 826 can perform, for example, encoding/decoding, modulation/demodulation, and multiplexing/demultiplexing, and performs layers (eg, L1, Medium Access Control (MAC), Radio Link Control (RLC), and Packet Data Convergence Protocol (PDCP)) Various types of signal processing.
  • BB processor 826 may have some or all of the above described logic functions.
  • the BB processor 826 can be a memory that stores a communication control program, or a module that includes a processor and associated circuitry configured to execute the program.
  • the update program can cause the function of the BB processor 826 to change.
  • the module can be a card or blade that is inserted into a slot of the base station device 820. Alternatively, the module can also be a chip mounted on a card or blade.
  • the RF circuit 827 may include, for example, a mixer, a filter, and an amplifier, and transmits and receives a wireless signal via the antenna 810.
  • the wireless communication interface 825 can include a plurality of BB processors 826.
  • multiple BB processors 826 can be compatible with multiple frequency bands used by eNB 800.
  • the wireless communication interface 825 can include a plurality of RF circuits 827.
  • multiple RF circuits 827 can be compatible with multiple antenna elements.
  • FIG. 22 illustrates an example in which the wireless communication interface 825 includes a plurality of BB processors 826 and a plurality of RF circuits 827, the wireless communication interface 825 may also include a single BB processor 826 or a single RF circuit 827.
  • the eNB 830 includes one or more antennas 840, a base station device 850, and an RRH 860.
  • the RRH 860 and each antenna 840 may be connected to each other via an RF cable.
  • the base station device 850 and the RRH 860 can be connected to each other via a high speed line such as a fiber optic cable.
  • Each of the antennas 840 includes a single or multiple antenna elements (such as multiple antenna elements included in a MIMO antenna) and is used by the RRH 860 to transmit and receive wireless signals.
  • eNB 830 can include multiple antennas 840.
  • multiple antennas 840 may be compatible with multiple frequency bands used by eNB 830.
  • FIG. 23 illustrates an example in which the eNB 830 includes multiple antennas 840, the eNB 830 may also include a single antenna 840.
  • the base station device 850 includes a controller 851, a memory 852, a network interface 853, a wireless communication interface 855, and a connection interface 857.
  • the controller 851, the memory 852, and the network interface 853 are the same as the controller 821, the memory 822, and the network interface 823 described with reference to FIG.
  • the wireless communication interface 855 supports any cellular communication scheme (such as LTE and LTE-Advanced) and provides wireless communication to terminals located in sectors corresponding to the RRH 860 via the RRH 860 and the antenna 840.
  • Wireless communication interface 855 can generally include, for example, BB processor 856.
  • the BB processor 856 is identical to the BB processor 826 described with reference to FIG. 22 except that the BB processor 856 is connected to the RF circuit 864 of the RRH 860 via the connection interface 857.
  • the wireless communication interface 855 can include a plurality of BB processors 856.
  • multiple BB processors 856 can be compatible with multiple frequency bands used by eNB 830.
  • FIG. 23 illustrates an example in which the wireless communication interface 855 includes a plurality of BB processors 856, the wireless communication interface 855 can also include a single BB processor 856.
  • connection interface 857 is an interface for connecting the base station device 850 (wireless communication interface 855) to the RRH 860.
  • the connection interface 857 may also be a communication module for communicating the base station device 850 (wireless communication interface 855) to the above-described high speed line of the RRH 860.
  • the RRH 860 includes a connection interface 861 and a wireless communication interface 863.
  • connection interface 861 is an interface for connecting the RRH 860 (wireless communication interface 863) to the base station device 850.
  • the connection interface 861 can also be a communication module for communication in the above high speed line.
  • the wireless communication interface 863 transmits and receives wireless signals via the antenna 840.
  • Wireless communication interface 863 can typically include, for example, RF circuitry 864.
  • the RF circuit 864 can include, for example, a mixer, a filter, and an amplifier, and transmits and receives wireless signals via the antenna 840.
  • the wireless communication interface 863 can include a plurality of RF circuits 864.
  • multiple RF circuits 864 can support multiple antenna elements.
  • FIG. 23 illustrates an example in which the wireless communication interface 863 includes a plurality of RF circuits 864, the wireless communication interface 863 may also include a single RF circuit 864.
  • the transceiving unit described in the third embodiment may be implemented by the wireless communication interface 825 and the wireless communication interface 855 and/or the wireless communication interface 863. At least a portion of the functionality can also be implemented by controller 821 and controller 851.
  • the execution unit 201, the calculation unit 202, and the generation unit 203 described with reference to FIG. 7 may be implemented by the controller 821 and the controller 851.
  • the controller 821 and the controller 851 can perform the determination of the virtual cell division scheme and the calculation of the corresponding network utility value at the specific search location by performing the functions of the execution unit 201, the calculation unit 202, and the generation unit 203.
  • the present invention also proposes a program product for storing an instruction code readable by a machine.
  • the instruction code is read and executed by a machine, the above-described method according to an embodiment of the present invention can be performed.
  • a storage medium for carrying a program product storing the above-described storage machine readable instruction code is also included in the disclosure of the present invention.
  • the storage medium includes, but is not limited to, a floppy disk, an optical disk, a magneto-optical disk, a memory card, a memory stick, and the like.
  • a program constituting the software is installed from a storage medium or a network to a computer having a dedicated hardware structure (for example, the general-purpose computer 2400 shown in FIG. 24), which is installed with various programs. At the time, it is possible to perform various functions and the like.
  • a central processing unit (CPU) 2401 executes various processes in accordance with a program stored in a read only memory (ROM) 2402 or a program loaded from a storage portion 2408 to a random access memory (RAM) 2403.
  • ROM read only memory
  • RAM random access memory
  • data required when the CPU 2401 performs various processes and the like is also stored as needed.
  • the CPU 2401, the ROM 2402, and the RAM 2403 are connected to each other via a bus 2404.
  • Input/output interface 2405 is also coupled to bus 2404.
  • the following components are connected to the input/output interface 2405: an input portion 2406 (including a keyboard, a mouse, etc.), an output portion 2407 (including a display such as a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.),
  • the storage section 2408 (including a hard disk or the like), the communication section 2409 (including a network interface card such as a LAN card, a modem, etc.).
  • the communication section 2409 performs communication processing via a network such as the Internet.
  • the driver 2410 can also be connected to the input/output interface 2405 as needed.
  • a removable medium 2411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory or the like is mounted on the drive 2410 as needed, so that the computer program read therefrom is installed into the storage portion 2408 as needed.
  • a program constituting the software is installed from a network such as the Internet or a storage medium such as the removable medium 2411.
  • such a storage medium is not limited to the removable medium 2411 shown in FIG. 24 in which a program is stored and distributed separately from the device to provide a program to the user.
  • the removable medium 2411 include a magnetic disk (including a floppy disk (registered trademark)), an optical disk (including a compact disk read only memory (CD-ROM) and a digital versatile disk (DVD)), and a magneto-optical disk (including a mini disk (MD) (registered) Trademark)) and semiconductor memory.
  • the storage medium may be a ROM 2402, a hard disk included in the storage portion 2408, or the like, in which programs are stored, and distributed to the user together with the device containing them.

Landscapes

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

Abstract

一种用于无线通信的电子设备和方法以及计算机可读存储介质，该电子设备包括：处理电路，被配置为：以动态的方式确定预定区域内虚拟小区的划分方案，确定虚拟小区的划分方案包括将预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及生成指示虚拟小区的划分方案的消息以通知所指定的主控节点。

Description

用于无线通信的电子设备和方法以及计算机可读存储介质
本申请要求于2017年12月29日提交中国专利局、申请号为201711481100.0、发明名称为“用于无线通信的电子设备和方法以及计算机可读存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本发明的实施例总体上涉及无线通信领域，具体地涉及虚拟小区的设计，更具体地涉及用于无线通信的电子设备和方法以及计算机可读存储介质。
背景技术
近年来，日益增长的移动数据速率需求使得网络密集化成为重要趋势，随之而来的是更频繁的测量、切换等问题。因为小区越来越小，用户的切换请求也越来越多，相邻小区的交叠区域越来越小，留给用户的切换时间也越来越短。而虚拟化可以创造无边界的网络，解决移动性带来的切换问题。
例如，可以通过对接入点(Access Point，AP)进行分簇来实现虚拟小区，每个虚拟小区中可以设置一个本地控制器(local anchor，也称为主控节点(master AP))，用来控制虚拟小区内的切换以及虚拟小区间的切换，并通过本地控制器与核心网之间的理想回程链路传输整个虚拟小区覆盖范围内的用户数据。
发明内容
在下文中给出了关于本申请的简要概述，以便提供关于本申请的某些方面的基本理解。应当理解，这个概述并不是关于本申请的穷举性概述。它并不是意图确定本申请的关键或重要部分，也不是意图限定本申请的范围。其目的仅仅是以简化的形式给出某些概念，以此作为稍后论述的更详细描述的前序。
根据本申请的一个方面，提供了一种用于无线通信的电子设备，包括：处理电路，被配置为：以动态的方式确定预定区域内虚拟小区的划分方案，确定虚拟小区的划分方案包括将预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及生成指示虚拟小区的划分方案的消息以通知所指定的主控节点。
根据本申请的另一个方面，提供了一种用于无线通信的电子设备，包括：处理电路，被配置为：响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作，其中，搜索位置为所划分的虚拟小区的个数；基于迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值，所述网络效用值为各个虚拟小区的丢包率的函数与预定区域内的切换开销的函数的加权和，其中丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及生成包含搜索位置和网络效用值的消息，以报告给中央管理装置。
根据本申请的另一个方面，提供了一种用于无线通信的方法，包括：以动态的方式确定预定区域内虚拟小区的划分方案，确定虚拟小区的划分方案包括将预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及生成指示虚拟小区的划分方案的消息以通知所指定的主控节点。
根据本申请的另一个方面，还提供了一种用于无线通信的方法，包括：响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作，其中，搜索位置为所划分的虚拟小区的个数；基于迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值，网络效用值为各个虚拟小区的丢包率的函数与预定区域内的切换开销的函数的加权和，其中所述丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及生成包含搜索位置和网络效用值的消息，以报告给中央管理装置。
依据本申请的其它方面，还提供了用于实现上述方法的计算机程序代码和计算机程序产品以及其上记录有该用于实现上述方法的计算机程序代码的计算机可读存储介质。
根据本申请的电子设备和方法能够动态地确定虚拟小区的划分，从 而灵活而有效地满足无线网络中的通信需求。
通过以下结合附图对本申请的优选实施例的详细说明，本申请的这些以及其他优点将更加明显。
附图说明
为了进一步阐述本发明的以上和其它优点和特征，下面结合附图对本发明的具体实施方式作进一步详细的说明。所述附图连同下面的详细说明一起包含在本说明书中并且形成本说明书的一部分。具有相同的功能和结构的元件用相同的参考标号表示。应当理解，这些附图仅描述本发明的典型示例，而不应看作是对本发明的范围的限定。在附图中：
图1示出了根据本申请的一个实施例的用于无线通信的电子设备的功能模块框图；
图2示出了作为示例的接入点(AP)的分布以及虚拟小区的划分的场景图；
图3示出了在1km×1km的区域内随机分布有25个AP的场景下，利用维诺图生成的每个AP的边界的示意图；
图4示出了将图3所示的区域划分为5个虚拟小区的情况下，所得到的虚拟小区的边界的示意图；
图5示出了在共存管理器上实现虚拟小区的划分的信息流程的示例性示意图；
图6示出了另一个信息流程的示例性示意图；
图7示出了根据本申请的另一个实施例的用于无线通信的电子设备的功能模块框图；
图8示出了仿真示例中使用的给定区域内的AP场景图；
图9示出了随机生成的UE场景图的示例；
图10示出了虚拟小区丢包率的效用函数的一个示例的曲线图；
图11示出了虚拟小区间切换开销的效用函数的一个示例的曲线图；
图12示出了利用维诺图生成的图8的AP场景下每个AP的边界的 示意图；
图13示出了采用已有的穷举搜索方法得到的全部可能的虚拟小区数目下估计的虚拟小区平均丢包率以及估计的虚拟小区间切换开销的曲线图；
图14示出了采用本申请的技术搜索得到的网络效用曲线的曲线图；
图15示出了采用穷举搜索方法得到的效用曲线的曲线图；
图16示出了采用本申请的技术得到的最优的虚拟小区划分方案的示意图；
图17示出了根据本申请的一个实施例的用于无线通信的方法的流程图；
图18示出了图17中的步骤S11的一个示例的流程图；
图19示出了图17中的步骤S11的另一个示例的流程图；
图20示出了根据本申请的另一个实施例的用于无线通信的方法的流程图；
图21是示出可以应用本公开内容的技术的服务器700的示意性配置的示例的框图；
图22是示出可以应用本公开内容的技术的eNB或gNB的示意性配置的第一示例的框图；
图23是示出可以应用本公开内容的技术的eNB或gNB的示意性配置的第二示例的框图；以及
图24是其中可以实现根据本发明的实施例的方法和/或装置和/或系统的通用个人计算机的示例性结构的框图。
具体实施方式
在下文中将结合附图对本发明的示范性实施例进行描述。为了清楚和简明起见，在说明书中并未描述实际实施方式的所有特征。然而，应该了解，在开发任何这种实际实施例的过程中必须做出很多特定于实施方式的决定，以便实现开发人员的具体目标，例如，符合与系统及业务 相关的那些限制条件，并且这些限制条件可能会随着实施方式的不同而有所改变。此外，还应该了解，虽然开发工作有可能是非常复杂和费时的，但对得益于本公开内容的本领域技术人员来说，这种开发工作仅仅是例行的任务。
在此，还需要说明的一点是，为了避免因不必要的细节而模糊了本发明，在附图中仅仅示出了与根据本发明的方案密切相关的设备结构和/或处理步骤，而省略了与本发明关系不大的其他细节。
<第一实施例>
图1示出了根据本申请的一个实施例的用于无线通信的电子设备100的功能模块框图，如图1所示，电子设备100包括：确定单元101，被配置为以动态的方式确定预定区域内虚拟小区的划分方案，确定虚拟小区的划分方案包括将预定区域内的多个接入点(AP)划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及生成单元102，被配置为生成指示虚拟小区的划分方案的消息以通知所指定的主控节点。
其中，确定单元101和生成单元102可以由一个或多个处理电路实现，该处理电路例如可以实现为芯片。
图2示出了作为示例的接入点(AP)的分布以及虚拟小区的划分的场景图。注意，本文中所述的AP可以是任何提供网络通信服务的节点，比如基站、小基站等。基站可以被实现为任何类型的演进型节点B(eNB)或gNB(5G基站)。eNB例如包括宏eNB和小eNB。小eNB可以为覆盖比宏小区小的小区的eNB，诸如微微eNB、微eNB和家庭(毫微微)eNB。对于gNB也可以由类似的情形。代替地，基站可以被实现为任何其他类型的基站，诸如NodeB和基站收发台(BTS)。基站可以包括：被配置为控制无线通信的主体(也称为基站设备)；以及设置在与主体不同的地方的一个或多个远程无线头端(RRH)。另外，各种类型的终端均可以通过暂时地或半持久性地执行基站功能而作为基站工作。
此外，图2中所示的用户设备(UE，也可以简称为用户)可以是任何终端设备或者提供服务的无线通信设备。例如，终端设备可以被实现为移动终端(诸如智能电话、平板个人计算机(PC)、笔记本式PC、便 携式游戏终端、便携式/加密狗型移动路由器和数字摄像装置)或者车载终端(诸如汽车导航设备)。终端设备还可以被实现为执行机器对机器(M2M)通信的终端(也称为机器类型通信(MTC)终端)。此外，终端设备可以为安装在上述终端中的每个终端上的无线通信模块(诸如包括单个晶片的集成电路模块)。
根据本申请的实施例的电子设备100可以对图2中所示的AP进行分簇以获得虚拟小区的划分，即每一簇AP构成一个虚拟小区。电子设备100例如可以位于图2中所示的核心网侧，或者位于中央管理装置侧。
例如，在认知无线电应用场景下，频谱管理装置可以起到中央管理装置的作用。在这种情况下，电子设备100例如可以位于频谱管理装置侧。作为示例，电子设备100可以在频谱管理器(Spectrum Coordinator,SC)、共存管理器(Coexistence Manager，CxM)或者频谱访问系统(Spectrum Access System,SAS)上实现。
如图2所示，AP被密集地分布，当UE在图示区域内移动时，将发生AP之间的频繁切换，这会引起较大的切换开销，降低通信质量和资源利用效率。可以对AP进行动态地分簇，以形成多个虚拟小区，从而降低切换开销。
因此，电子设备100的确定单元101以动态的方式确定虚拟小区的划分方案，从而灵活地适用于各种AP分布场景和UE分布场景。其中，确定虚拟小区的划分方案包括两个方面：将多个AP划分为一个或多个虚拟小区；以及指定各个小区中作为主控节点的接入点。主控节点负责对相应的虚拟小区进行资源管理。由于虚拟小区的划分是动态的，因此主控节点也不是固定不变的，而是随着UE的移动或者AP的状态变化而改变。
生成单元102生成包含虚拟小区的划分方案的消息，用于将该划分方案提供给指定的主控节点。主控节点按照该划分方案进行虚拟小区的划分并进行通信。
相应地，虽然图1中未示出，电子设备100还可以包括通信单元，用于执行各种收发操作。通信单元例如可以实现为天线或天线阵列与其相关联的电路元件。
确定单元101和生成单元102的操作可以响应于以下中的一个或多 个来执行：一个或多个当前虚拟小区的切换开销超过预定开销阈值；一个或多个当前虚拟小区的回程需求超过相应虚拟小区的回程容量阈值；经过了预定时间。换言之，可以周期性地以及/或者以触发方式来执行确定单元101和生成单元102的操作。这样，可以避免通信质量的劣化。
确定单元101和生成单元102的操作对应于虚拟小区的划分的更新，将两次更新之间的时间间隔称为更新时隙。在周期性执行确定单元101和生成单元102的操作的情况下，更新时隙等于上述预定时间。
在一个示例中，确定单元101基于如下中的一个或多个来确定虚拟小区的划分方案：虚拟小区的主控节点的回程容量；用户设备在虚拟小区间切换引起的切换开销。通过考虑以上因素中的至少一个来进行虚拟小区的划分，可以有效地保障网络通信质量。
由于虚拟小区覆盖范围内的所有用户设备的回程操作均是由主控节点执行的，而主控节点与核心网之间的回程容量是有限的，如果用户回程需求超过该回程容量，则会造成丢包，降低通信质量。例如，当虚拟小区的覆盖范围过大时，可能出现回程需求超过主控节点的回程容量的情形。
另一方面，用户当前的服务AP(serving AP)对该用户做出切换判决，接着服务AP需向当前主控节点发出切换请求，当前主控节点继而向目标相邻虚拟小区的主控节点发出请求，相邻虚拟小区的主控节点再向自己虚拟小区内的目标服务AP发出接入请求，目标服务AP接收请求后，再原路返回接受切换信令，最后当前服务AP给用户发送切换命令，用户与目标服务AP实现同步后，相邻虚拟小区主控节点向原虚拟小区主控节点发送资源释放信令，原虚拟小区主控节点再向用户原服务AP发送资源释放信令，最终完成用户在虚拟小区间的切换。由此可见，虚拟小区间切换发生得越频繁，涉及的虚拟小区间切换开销越大。
如果虚拟小区覆盖范围过小，则会产生频繁的虚拟小区间切换，从而产生较大的虚拟小区间切换开销。
例如，确定单元101可以被配置为确定虚拟小区的划分方案，以使得在采用该划分方案的情况下的网络效用值最高，其中，网络效用值与各个虚拟小区的丢包率与预定区域内的切换开销有关，例如为各个虚拟小区的丢包率的函数与预定区域内的切换开销的函数的加权和，其中丢 包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到。
网络效用值U例如可以如下式(1)所示：
U＝a·E{f 1(PL n)}+b·f 2(H)             (1)
其中，f 1为各个虚拟小区丢包率的效用函数，PL n为第n个虚拟小区的丢包率，E()表示均值运算，f 2为预定区域内的切换开销的效用函数，H为在使用该虚拟小区的划分方案的情况下所估计的在更新时隙内的虚拟小区间切换开销(例如，切换次数)，a、b为权重系数，并且a+b＝1。
可以根据实际需求来设置权重系数a、b，或者将a和b设置为经验值。可以理解，当a和b中的一个为0时，仅基于单个因素来确定虚拟小区的划分方案。此外，f 1和f 2可以为任何恰当的效用函数，并不受任何限制。并且，网络效用值U的形式也不限于式(1)所示，而是可以有其他适当的修改或改变，式(1)仅是为了理解的需要而给出的示例。
示例性地，式(1)中的第n个虚拟小区的丢包率可以通过下式(2)来估计。
Figure PCTCN2018124587-appb-000001
其中，
Figure PCTCN2018124587-appb-000002
为估计的第n个虚拟小区覆盖范围内所有用户总的数据回程需求，C n为第n个虚拟小区的主控节点与核心网之间的回程容量。
为了计算网络效用值进而进行虚拟小区的划分方案的确定，确定单元101还被配置为从当前各个主控节点获取以下中的一个或多个：各个接入点的位置，各个接入点的回程容量，对应的虚拟小区覆盖范围内的用户设备的回程需求、位置和移动信息。移动信息例如包括移动速度、历史移动数据等。
此外，在电子设备100位于中央管理装置侧的情况下，如果预定区域内还存在其他中央管理装置，则确定单元101还可以与其他中央管理装置的电子设备交互，以获得由其他中央管理装置管理的接入点的信息以及/或者向其他中央管理装置提供本中央管理装置管理的接入点的信息。其中，接入点的信息例如包括接入点的位置、接入点的回程容量等。
例如，在认知无线电通信场景下，电子设备100位于频谱管理装置侧，则确定单元101可以与预定区域中的其他频谱管理装置交互以交换各自管理的接入点的信息。如上所述，频谱管理装置可以为SC、CxM、SAS等。
确定单元101可以使用网络效用值来评估虚拟小区的划分方案的性能，从而确定最优或较优的划分方案。为了便于理解，下面将描述一种基于机器学习来进行虚拟小区的划分的示例。但是，应该理解，该示例并不构成对本申请的限制。
在该示例中，确定单元101被配置为：将所划分的虚拟小区的个数作为搜索位置，针对不同的搜索位置执行用于虚拟小区划分的迭代操作；基于迭代操作完成时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值；基于网络效用值来优化要执行迭代操作的搜索位置，以确定最优的搜索位置；以及将最优的搜索位置对应的虚拟小区的划分方案确定为要采用的虚拟小区的划分方案。
参照图2所示的场景，由于将AP划分为几个虚拟小区以及如何进行划分才能获得最优的性能均是未知的，因此，确定单元101的上述操作嵌套了两个迭代操作，即针对给定搜索位置的迭代操作以及改变搜索位置的第二迭代操作。
换言之，首先在整数区间[1,M]中随机选择N p个不同的搜索位置来分别执行虚拟小区的划分，其中，M为预定区域中AP的数量，搜索位置代表将预定区域划分成的虚拟小区的个数，N p的取值可以根据设备的计算能力、所要求的计算速度等来确定。
针对每一个搜索位置，确定单元101执行迭代操作以寻找最优的划分方式，例如，哪些AP应该分为一簇，以及哪一个AP应该作为主控节点。
在一个示例中，确定单元101如下执行用于虚拟小区划分的迭代操作：1)根据各个接入点的位置和回程容量，选择与搜索位置对应的第一数目的接入点作为各个虚拟小区的主控节点的候选接入点；2)基于各个接入点至候选接入点的加权距离对接入点进行分簇，其中加权距离与接入点和候选接入点的实际距离、基于候选接入点的回程能力的加权因子有关，例如可以为二者的乘积；3)针对每一簇，更新该簇的候选接入点， 并使用更新的候选接入点重新进行基于加权距离的分簇，直到满足预定条件为止，将最终得到的各簇的候选接入点作为各个虚拟小区的主控节点。
在1)中，可以选择相互之间间距较大且回程容量较大的第一数目比如K个AP作为候选接入点，其中，该候选接入点为各簇的主控节点的候选。
在2)中，对K个候选接入点以外的其他接入点进行划分，即，分别确定这些接入点应该被分到哪一个候选接入点的簇中。最终确定的K个候选接入点的簇为K个虚拟小区。可以基于接入点至候选接入点的加权距离对接入点进行分簇，应该注意，并不限于此，也可以基于接入点至候选接入点的实际距离来进行分簇。
在一个示例中，可以设置加权因子，以使得候选接入点的回程能力越强，越倾向于将接入点分到该候选接入点的簇，以及候选接入点周围的用户设备的回程需求越大，越不倾向于将接入点分配到该候选接入点的簇。即，加权因子可以为这两种倾向的折衷。例如，可以设置加权因子，以使得接入点被分到回程能力强的候选接入点的簇中的可能性大于该接入点被分到回程能力弱的候选接入点的簇中的可能性；以及接入点被分到周围的用户设备的回程需求大的候选接入点的簇中的可能性小于该接入点被分到周围的用户设备的回程需求小的候选接入点的簇中的可能性。在使用加权距离的情况下，不仅考虑了实际距离的远近的影响，而且考虑了候选接入点的回程能力，从而有利于获得较优的划分方案。
具体地，加权因子例如可以为估算的候选接入点周围的用户设备的回程需求与该候选接入点的回程容量之间的比值的归一化值，例如，如下式(3)所示。
Figure PCTCN2018124587-appb-000003
其中，w i为AP分到第i簇的加权因子(i＝1,…,K)，R i为第i个候选接入点附近可能的用户需求，C i为第i个候选接入点与核心网之间的回程容量。注意，由于在计算加权因子时还并未确定分簇，因此无法确定每个用户会位于哪个虚拟小区内。鉴于此，公式(3)中的R i为估计值，即，需要大致估计一下第i个候选接入点附近可能的回程需求。例如， 可以将距离第i个候选接入点预定距离r K以内的用户的回程需求作为R i。当预定区域的宽度为x时，例如可以将r K设置为：
Figure PCTCN2018124587-appb-000004
其中，
Figure PCTCN2018124587-appb-000005
表示在各个候选接入点在预定区域内均匀分布条件下两个候选接入点之间的距离，ε为弹性变量，取值在0～1之间。可以理解，要分的簇越多，则r K越小。
例如，确定单元101可以将接入点分配到所对应的加权距离最小的候选接入点的簇中。以式(3)为例，如果对
Figure PCTCN2018124587-appb-000006
均有w id mi≤w jd mj，则将第m个AP分到第i个候选接入点的簇，其中d mi表示第i个候选接入点与第m个AP之间的几何距离。
在完成2)的分簇操作之后，在3)中对于每一簇更新该簇的候选接入点，以进行下一次迭代，即再次执行步骤2)的分簇。例如，对于每一簇，可以计算其包含的所有接入点的位置的中心，并选择该簇中距离该中心最近的接入点作为下一次迭代的候选接入点。
执行迭代操作直到满足3)中所述的预定条件，以获得该搜索位置处的优化的虚拟小区划分方案。该预定条件例如为如下中的一个或多个：候选接入点的位置在两次分簇操作之间的变化小于预定程度；分簇操作的执行次数达到预定值。换言之，当候选接入点的位置基本不变时，说明迭代算法趋于收敛，此时可以停止迭代。或者，当执行了预定次数的操作时，停止迭代，以有效地控制计算负荷。
无论采取哪种预定条件，将最终获得的各簇的候选接入点作为各个虚拟小区的主控节点。确定单元101可以基于最终得到的分簇的结果来确定虚拟小区的边界，从而完成在给定搜索位置处的虚拟小区的划分。
接下来，确定单元101基于所得到的虚拟小区的划分来计算该搜索位置处的网络效用值。例如，可以使用公式(1)进行计算，其中涉及到用户设备在虚拟小区间切换引起的切换开销以及/或者主控节点对于用户回程需求的满足程度。
例如，确定单元101可以基于虚拟小区的边界和用户设备的移动信 息来估计虚拟小区间的切换开销。具体地，当用户设备在移动穿过虚拟小区的边界时产生切换开销，确定单元101可以结合用户设备的移动信息比如用户设备的移动速度、历史移动数据以及地图信息等，估计在所确定的虚拟小区的边界附近的有效用户穿透次数，从而统计在相应的搜索位置处的虚拟小区划分方案下有效穿透边界的总次数、即总的切换开销。
在一个示例中，确定单元101可以利用维诺(Voronoi)图来得到各个虚拟小区的边界。维诺图是计算几何里的一种基于距离的平面划分方法。具体地，假设在平面上有n个不重合种子点，把平面分为n个区域，以使得每个区域内的点到它所在区域的种子点的距离比到其它区域种子点的距离近，每个区域称为该种子点的维诺区域。为了便于理解，图3示出了在1km×1km的区域内随机分布有25个AP的场景下，利用维诺图生成的每个AP的边界的示意图。图4示出了在虚拟小区数目为5的情况下，完成了虚拟小区的划分时，分别将属于同一簇的AP的边界合并所得到的虚拟小区的边界的示意图。
此外，确定单元101结合用户的数据回程需求以及切换情况，估计每个虚拟小区在一个更新时隙内的最大数据回程需求，以及例如使用公式(2)来计算在该虚拟小区划分方案下的丢包率。最后，利用例如公式(1)来计算该虚拟小区划分方案下的网络效用值作为该搜索位置处的网络效用值。
注意，确定单元101还可以将虚拟小区的边界信息提供给当前各虚拟小区的主控节点，并且由当前各虚拟小区的主控节点结合覆盖范围内的用户设备的移动信息来估计覆盖范围内的边界可能被穿透的次数并提供给确定单元101。即，切换开销的估计的至少一部分可以由当前各虚拟小区的主控节点执行。
如上，分别获得了N p个搜索位置处的网络效用值，基于所获得的网络效用值来优化接下来要执行虚拟小区的划分的迭代操作的搜索位置，以确定最优的搜索位置，例如，以确定网络效用值最大的搜索位置。
在一个示例中，可以比较N p个搜索位置处的网络效用值以选择最大的一个，将其作为全局最优值并将其对应的搜索位置作为全局最优搜索位置。针对N p个搜索位置中的每一个，基于前一次迭代操作的搜索位置 及对应的网络效用值和全局最优搜索位置及对应的网络效用值来更新下一次迭代操作的搜索位置。然后，针对更新的N p个搜索位置完成虚拟小区划分的迭代操作，以获得更新的N p个网络效用值。上述操作构成了一次第二迭代操作。通过利用更新的N p个网络效用值来更新全局最优值和对应的全局最优搜索位置，重复执行第二迭代操作，直到达到预定条件为止。这里的预定条件例如可以包括以下中的一个或多个：全局最优搜索位置不再变化；全局最优搜索位置对应的网络效用值在两次第二迭代操作之间的变化小于预定程度；第二迭代操作的数目达到预定值。
当第二迭代操作完成时，认为获得了全局最优的搜索位置，从而确定了下一个时隙要采用的虚拟小区的划分方案。生成单元102生成包含该划分方案的信息以通知指定的主控节点。
此外，确定单元101还可以被配置为根据所确定的虚拟小区的回程需求以及通信质量需求比如信干噪比(Signal to interference and noise ratio，SINR)需求来确定各个虚拟小区的频谱需求，并根据该频谱需求来确定频谱分配方案。生成单元102还可以生成包含频谱分配方案的信息以通知主控节点。
在认知无线电的场景下，确定单元101可以向频谱管理装置请求可用频谱资源。例如，确定单元101可以经由域代理(Domain Proxy)来向频谱管理装置比如SAS请求可用频谱资源。电子设备100例如实现在逻辑实体CxM上。
具体地，例如，确定单元101向域代理发送频谱需求，域代理向SAS发送频谱查询请求，SAS向域代理发送频谱查询响应。域代理告知确定单元101可用频谱资源。然后，确定单元101向当前各主控节点发出资源释放请求，向新的主控节点发出接入控制请求。当前各主控节点向核心网发出资源释放确认信息，新的主控节点向确定单元101发出接入控制确认消息。收发单元将包含频谱分配方案的信息发送至新的主控节点，或者还发送至受控节点。
图5示出了在CxM上实现虚拟小区的划分的信息流程的示例性示意图。在图5中，电子设备100在CxM上实现，主控节点例如可以实现为公民宽带无线服务用户(CBSD，Citizens Broadband Radio Service Device)。首先，当前的主控节点向CxM提供虚拟小区的划分所需要的 各种信息，包括但不限于：主控节点所负责的各个接入点的位置和回程容量、当前虚拟小区覆盖范围内的UE的回程需求、位置和移动信息比如移动速度和历史移动信息等。在获得了这些信息后，在CxM上使用以上本实施例中详细描述的虚拟小区的划分方法进行虚拟小区的划分，具体的方法在前文中已进行了详细的描述，在此不再重复。接下来，CxM例如根据虚拟小区的回程需求和通信质量需求来确定虚拟小区的频谱需求，并向域代理发送频谱请求，域代理向SAS发送频谱查询请求，SAS随后向域代理发送频谱查询响应，域代理据此告知CxM可用频谱资源。CxM向当前各主控节点发送资源释放请求以及向新的主控节点发送接入控制请求，当前各主控节点向CxM发出资源释放确认(ACK)消息，新的主控节点向CxM发出接入控制ACK消息。最后，CxM向新的主控节点发送包含频谱分配方案和要管理的受控AP、即虚拟小区划分方案的信息。
应该理解，图5所示的信息流程仅是示例性的，而非限制性的，其可以根据实际需要和应用场景进行修改或改变。
根据本实施例的电子设备100能够动态地确定预定区域内虚拟小区的划分方案，从而灵活地适用于各种场景，保证通信质量。
<第二实施例>
返回参照图1，在本实施例中，确定单元101被配置为：根据各个主控节点的当前负载选择预定数量的主控节点作为搜索节点；指示所述搜索节点分别针对不同的搜索位置进行虚拟小区划分的迭代操作，其中，所述搜索位置为所划分的虚拟小区的个数；执行如下第二迭代操作，直到达到预定条件为止：从所述搜索节点获取针对相应的搜索位置的虚拟小区划分方案的网络效用值，并基于网络效用值确定全局最优搜索位置；将所述全局最优搜索位置及其对应的网络效用值提供给所述搜索节点，以使得各个搜索节点根据所述全局最优搜索位置及其对应的网络效用值和该搜索节点上一次迭代操作的搜索位置及对应的网络效用值更新下一次迭代操作的搜索位置。
在本实施例中，由搜索节点分布式地执行虚拟小区划分方案的确定、即对全局最优搜索位置进行分布式地搜索，从而减轻了电子设备100的 计算负荷。例如，可以选择当前主控节点中负载较轻以及/或者计算能力较强的主控节点作为搜索节点。所选择的搜索节点的数量N p例如取决于实时性要求和主控节点的处理能力。当实时性要求较高，以及/或者主控节点的处理能力较强时，可以将N p设置为较大。
在一个示例中，生成单元102还被配置为生成分布式搜索请求以提供给所选择的搜索节点，以及获取来自搜索节点的对于该分布式搜索请求的应答。
确定单元101还被配置为向搜索节点提供以下中的一个或多个：各个接入点的位置、各个接入点的回程容量、用户设备的回程需求、位置和移动信息。用户设备的移动信息例如包括用户设备的移动速度、历史移动数据等(可以仅包括其中一种)。
注意，提供给搜索节点的上述信息的至少一部分还可以由当前主控节点提供。例如，当前主控节点可以收集其UE的位置、移动信息、数据回程需求等并且提供给搜索节点。
初始时，所选择的N p个搜索节点的每一个针对一个比如随机选择的初始搜索位置进行虚拟小区的划分，即执行第一实施例中所述的虚拟小区划分的迭代操作，以确定初始搜索位置处的虚拟小区划分方案。并且，还基于该划分方案来计算网络效用值。
每一个搜索节点将其初始搜索位置和计算出的对应的网络效用值提供给电子设备100，确定单元101例如比较N p个初始搜索位置处的网络效用值以选择最大的一个，将其作为全局最优值的初始值并将其对应的搜索位置作为初始的全局最优搜索位置。
接下来，将全局最优值和全局最优搜索位置提供给N p个搜索节点，以使得每一个搜索节点分别基于其前一次迭代操作的搜索位置及对应的网络效用值和全局最优搜索位置及全局最优值来更新下一次迭代操作的搜索位置。然后，N p个搜索节点使用新的搜索位置完成虚拟小区划分的迭代操作，以获得更新的N p个网络效用值，并将新的搜索位置和网络效用值提供给确定单元101。确定单元102基于更新的搜索位置和网络效用值更新全局最优值和全局最优搜索位置。
上述操作构成了一次第二迭代操作。重复执行第二迭代操作以搜索最终的全局最优值和全局最优搜索位置。其中，有关上述虚拟小区划分 的迭代操作以及第二迭代操作的细节在第一实施例中已经进行了详细的描述，在此不再重复。
类似地，上述预定条件例如可以包括以下中的一个或多个：全局最优搜索位置不再变化；全局最优搜索位置对应的网络效用值在两次第二迭代操作之间的变化小于预定程度；第二迭代操作的数目达到预定值。
此外，确定单元101还可以被配置为从提供最终的全局最优搜索位置的搜索节点获取对应于该最终的全局最优搜索位置的虚拟小区的划分方案作为要采用的虚拟小区的划分方案。在一个示例中，虚拟小区的划分方案还包括虚拟小区的边界的信息。
为了便于理解，图6示出了本实施例的信息流程的一个示例。与第一实施例中类似地，电子设备可以在CxM上实现，主控节点实现为CBSD。而作为搜索节点的主控节点实现为特定的CBSD，以下称为CBSD智能体。
首先，CxM从当前主控节点中选择N p个搜索节点作为CBSD智能体，并向其发送分布式搜索请求，CBSD智能体响应于该请求发送分布式搜索ACK。接下来，CxM向这些CBSD智能体发送各个接入点的信息，例如包括接入点的位置、回程容量等。CBSD智能体例如以随机的方式初始化搜索位置，并且向当前主控节点请求UE的信息，例如包括UE的回程需求、位置、移动信息等。当前主控节点响应于该请求从其覆盖范围内的UE获取这些信息并且发送给CBSD智能体。应该理解，上述信息的获取方式并不是限制性的，而是可以适当地采用其他方式，例如由CxM提供所有信息，或者由当前主控节点提供所有信息，等等。
CBSD智能体使用所获得的信息，针对当前的搜索位置执行虚拟小区划分的迭代操作。在完成虚拟小区的划分后，计算出虚拟小区的边界信息，并将其提供给当前主控节点，以使得当前主控节点估计UE穿透虚拟小区边界的次数、即估计其覆盖范围内的UE的切换开销。当前主控节点将估计的切换开销发送给CBSD智能体。应该理解，CBSD智能体也可以自行估计切换开销并计算网络效用值。CBSD智能体例如基于切换开销以及基于回程容量和回程需求计算的丢包率来计算网络效用值，并将当前搜索位置和计算出的网络效用值发送至CxM。
CxM基于所获得的N p组数据来更新网络效用值的全局最优值和全 局最优搜索位置。例如，在算法未收敛的情况下，CxM将更新的全局最优值和全局最优搜索位置发送给CBSD智能体，以使其据此更新下一轮迭代的搜索位置。图6中所示的虚线框代表前文所述的第二迭代操作。另一方面，在算法收敛的情况下，CxM向提供最终的全局最优值的CBSD智能体请求最优的虚拟小区划分方案，该CBSD智能体将最优的虚拟小区划分方案发送给CxM。该最优的虚拟小区划分方案包括各个虚拟小区的主控节点以及受控节点。或者，该最优的虚拟小区划分方案还可以包括各个虚拟小区的边界的信息。
接下来，CxM例如根据虚拟小区的回程需求和通信质量需求来确定虚拟小区的频谱需求，并向域代理发送频谱请求，域代理向SAS发送频谱查询请求，SAS随后向域代理发送频谱查询响应，域代理据此告知CxM可用频谱资源。CxM向当前各主控节点发送资源释放请求以及向新的主控节点发送接入控制请求，当前各主控节点向CxM发出资源释放确认(ACK)消息，新的主控节点向CxM发出接入控制ACK消息。最后，CxM向新的主控节点发送包含频谱分配方案和要管理的受控AP、即虚拟小区划分方案的信息。
应该理解，图6所示的信息流程仅是示例性的，而非限制性的，其可以根据实际需要和应用场景进行修改或改变。
根据本实施例的电子设备100能够动态地确定预定区域内虚拟小区的划分方案，从而灵活地适用于各种场景，保证通信质量，并且由于采用了分布式搜索的方式，改善了虚拟小区划分方案确定的实时性，减小了电子设备100的计算负荷。
<第三实施例>
图7示出了根据本申请的另一个实施例的用于无线通信的电子设备200的功能模块框图，如图7所示，该电子设备200包括：执行单元201，被配置为响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作，其中，搜索位置为所划分的虚拟小区的个数；计算单元202，被配置为基于所述迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值，所述网络效用值为所述各个虚拟小区的丢包率的函数与所述预定区域内的切换 开销的函数的加权和，其中所述丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及生成单元203，被配置为生成包含所述搜索位置和所述网络效用值的消息，以报告给所述中央管理装置。
其中，执行单元201、计算单元202和生成单元203可以由一个或多个处理电路实现，该处理电路例如可以实现为芯片。此外，虽然图7中未示出，但是电子设备200还可以包括通信单元，用于执行收发操作。通信单元例如可以实现为天线或天线阵列与其相关联的电路元件。电子设备200例如可以位于被选择为搜索节点的当前主控节点上，并且例如可以在CBSD智能体上实现。
例如，分布式搜索请求中可以包括以下中的一个：用于确定作为特定搜索位置的初始搜索位置的初始信息；用于确定特定搜索位置的当前全局最优搜索位置及其对应的网络效用值。
具体地，在初始时，分布式搜索请求可以包括初始搜索位置，换言之，初始搜索位置由中央管理装置选择并提供给电子设备200。或者，在初始时，分布式搜索请求可以包括随机种子，执行单元201使用该随机种子生成初始搜索位置。在后续迭代操作中，分布式搜索请求包括中央管理装置更新的前全局最优搜索位置及其对应的网络效用值。执行单元201被配置为基于该当前全局最优搜索位置及其对应的网络效用值以及前一次迭代操作收敛时的搜索位置及其对应的网络效用值来确定本次迭代的特定搜索位置。
为了执行上述操作，电子设备200还可以被配置为从中央管理装置获取以下中的一个或多个：各个接入点的位置，各个接入点的回程容量，用户设备的回程需求、位置和移动信息。或者，电子设备200也可以从当前的各个主控节点获取其覆盖范围内的用户设备的回程需求、位置和移动信息。
例如，执行单元201可以如下执行迭代操作：根据各个接入点的位置和回程容量，选择与特定搜索位置对应的第一数目的接入点作为各个虚拟小区的主控节点的候选接入点；基于各个接入点至候选接入点的加权距离对接入点进行分簇，其中加权距离为接入点与候选接入点的实际距离与基于候选接入点的回程能力的加权因子的乘积；针对每一簇，更 新该簇的候选接入点，并使用更新的候选接入点重新进行基于加权距离的分簇，直到满足预定条件为止，将最终得到的各簇的候选接入点作为各个虚拟小区的主控节点。
其中，预定条件可以包括如下中的一个或多个：候选接入点的位置在两次分簇操作之间的变化小于预定程度；分簇操作的数目达到预定值。执行单元201可以将接入点分配到所对应的加权距离最小的候选接入点的簇中。
执行单元201还被配置为设置加权因子，以使得候选接入点的回程能力越强，越倾向于将接入点分到该候选接入点的簇，以及候选接入点周围的用户设备的回程需求越大，越不倾向于将接入点分配到该候选接入点的簇。例如，加权因子可以为估算的候选接入点周围的用户设备的回程需求与该候选接入点的回程容量之间的比值的归一化值。
此外，计算单元202可以被配置为基于最终得到的分簇的结果，利用维诺图得到各个虚拟小区的边界。在一个示例中，计算单元202被配置为基于该边界以及用户设备的移动信息来估计各个虚拟小区的切换开销以获得预定区域内的切换开销。
在另一个示例中，还可以将该边界的信息提供给当前的各个主控节点，以使得当前的各个主控节点基于用户设备的移动信息来估算其覆盖范围内的用户设备的移动引起的切换开销，计算单元202从当前的各个主控节点获取该切换开销的信息，并基于该切换开销的信息来估算预定区域内的切换开销。随后，计算单元202例如基于切换开销和基于回程容量和回程需求计算的丢包率来计算网络效用值。
此外，电子设备200还可以从中央管理装置获取最终确定的虚拟小区的划分方案，该虚拟小区的划分方案包括如下中的一个或多个：虚拟小区的主控节点、虚拟小区的受控节点以及虚拟小区的边界的信息。另一方面，电子设备200还可以从中央管理装置获取频谱分配方案的信息。
以上有关用于虚拟小区的划分的迭代操作、网络效用值的计算、与中央管理装置的信息交互等内容已经在第一实施例和第二实施例中进行了详细描述，在此不再重复。
根据本实施例的电子设备200能够响应于中央管理装置的要求执行虚拟小区的划分方案的确定，从而灵活地适用于各种场景，改善了虚拟 小区划分方案确定的实时性，减小了中央管理装置的计算负荷。
下面给出应用本公开的技术的一个示意性仿真示例。
图8为给定区域内的AP场景图，通过硬核点过程(hard core point process，HCPP)生成，两个AP之间的距离不能小于r h，即满足
Figure PCTCN2018124587-appb-000007
Π为区域内所有AP位置点集。图9为随机生成的UE场景图。假设当前的各主控节点能根据用户的即时速度、用户历史移动数据以及街道信息等，有效估计出其虚拟小区范围内的边界的有效用户穿透次数。
假设采用下式(5)作为第n个虚拟小区丢包率的效用函数，采用下式(6)作为虚拟小区间切换开销的效用函数。图10和图11分别示出了这两个函数的曲线图。
Figure PCTCN2018124587-appb-000008
Figure PCTCN2018124587-appb-000009
其中，s 1、s 2为扩展因子，h 1、h 2为对称中心，H为估计的虚拟小区间总的切换次数，H th为虚拟小区间切换次数门限，仿真中设定为UE数目的0.3倍。
在仿真中，采用第二实施例中所述的分布式搜索的方式，并采用如下参数：仿真面积，1km×1km；AP数量，100个；AP间的最小距离(r h)，60m；AP的回程容量，30至100Mbps；UE的数量，200个；搜索节点的数量，3个；网络效用值的计算(参见公式(1))中的权重a，0.5；网络效用值的计算(参见公式(1))中的权重b，0.5；扩展因子s 1，35.3231；对称中心h 1，0.1；扩展因子s 2，3.5834；对称中心h 2，1.1946；H th，60。
图12示出了利用维诺图生成的图8的AP场景下每个AP的边界。图13为采用已有的穷举搜索方法得到的全部可能的虚拟小区数目下估计的虚拟小区平均丢包率以及估计的虚拟小区间切换开销(即，切换次数)的曲线。如前所述，随着虚拟小区数目的增加，网络平均丢包率逐渐降低，而虚拟小区间切换开销逐渐增大。
图14为采用本申请的分布式搜索算法(也可称为基于粒子群 (particle swarm optimization，PSO)优化算法的分布式迭代算法)搜索得到的网络效用曲线，图15为采用穷举搜索方法得到的效用曲线，通过对比可以看出本申请的分布式搜索算法通过少数次迭代就可以达到穷搜的最优效用值。
图16示出了采用本申请的分布式搜索算法得到的最优的虚拟小区划分方案，用圆圈圈住的AP为利用本申请的算法所确定的主控节点，其与周围具有相同灰度并且用相同形状的图标代表的AP构成一个虚拟小区。同时，图16示出了利用维诺图得到的虚拟小区的边界。
应该理解，以上仿真示例仅是示例性的，并不对本申请构成限制。
<第四实施例>
在上文的实施方式中描述用于无线通信的电子设备的过程中，显然还公开了一些处理或方法。下文中，在不重复上文中已经讨论的一些细节的情况下给出这些方法的概要，但是应当注意，虽然这些方法在描述用于无线通信的电子设备的过程中公开，但是这些方法不一定采用所描述的那些部件或不一定由那些部件执行。例如，用于无线通信的电子设备的实施方式可以部分地或完全地使用硬件和/或固件来实现，而下面讨论的用于无线通信的方法可以完全由计算机可执行的程序来实现，尽管这些方法也可以采用用于无线通信的电子设备的硬件和/或固件。
图17示出了根据本申请的一个实施例的用于无线通信的方法的流程图，该方法包括：以动态的方式确定预定区域内虚拟小区的划分方案(S11)，确定所述虚拟小区的划分方案包括将所述预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及生成指示虚拟小区的划分方案的消息以通知所指定的主控节点(S12)。
例如，可以响应于以下中的一个或多个来执行步骤S11和S12：一个或多个当前虚拟小区的切换开销超过预定开销阈值；一个或多个当前虚拟小区的回程需求超过相应虚拟小区的回程容量阈值；经过了预定时间。
在一个示例中，可以基于如下中的一个或多个来确定虚拟小区的划 分方案：虚拟小区的主控节点的回程容量；用户设备在虚拟小区间切换引起的切换开销。
例如，可以确定虚拟小区的划分方案，以使得在采用该划分方案的情况下的网络效用值最高，网络效用值例如与各个虚拟小区的丢包率与预定区域内的切换开销有关，其中丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到。
为了执行S11的处理，可以从当前各个主控节点获取以下中的一个或多个：各个接入点的位置，各个接入点的回程容量，对应的虚拟小区覆盖范围内的用户设备的回程需求、位置和移动信息。
图18示出了步骤S11的一个示例的流程图，如图18所示，步骤S11包括：将所划分的虚拟小区的个数作为搜索位置，针对不同的搜索位置执行用于虚拟小区划分的迭代操作(S101)；基于迭代操作完成时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值(S102)；基于网络效用值来优化要执行迭代操作的搜索位置，以确定最优的搜索位置(S103)；以及将最优的搜索位置对应的虚拟小区的划分方案确定为要采用的虚拟小区的划分方案(S104)。
例如，步骤S101可以包括：根据各个接入点的位置和回程容量，选择与搜索位置对应的第一数目的接入点作为各个虚拟小区的主控节点的候选接入点；基于各个接入点至候选接入点的加权距离对接入点进行分簇，其中加权距离与接入点和候选接入点的实际距离、基于候选接入点的回程能力的加权因子有关；针对每一簇，更新该簇的候选接入点，并使用更新的候选接入点重新进行基于加权距离的分簇，直到满足预定条件为止，将最终得到的各簇的候选接入点作为各个虚拟小区的主控节点。
其中，预定条件可以包括如下中的一个或多个：候选接入点的位置在两次分簇操作之间的变化小于预定程度；分簇操作的执行次数达到预定值。例如，可以为接入点分配到所对应的加权距离最小的候选接入点的簇中。
在一个示例中，加权因子可以被设置为使得：接入点被分到回程能力强的候选接入点的簇中的可能性大于所述接入点被分到回程能力弱的候选接入点的簇中的可能性；以及接入点被分到周围的用户设备的回程需求大的候选接入点的簇中的可能性小于所述接入点被分到周围的用户 设备的回程需求小的候选接入点的簇中的可能性。例如，加权因子为估算的候选接入点周围的用户设备的回程需求与该候选接入点的回程容量之间的比值的归一化值。
在步骤S102中，可以基于最终得到的分簇的结果，得到各个虚拟小区的边界，并且基于该边界以及用户设备的移动信息估计虚拟小区间的切换开销。
图19示出了步骤S11的另一个示例的流程图，如图19所示，步骤S11包括：根据各个主控节点的当前负载选择预定数量的主控节点作为搜索节点(S111)；指示搜索节点分别针对不同的搜索位置进行用于虚拟小区划分的迭代操作(S112)，其中，搜索位置为所划分的虚拟小区的个数；执行如下第二迭代操作，直到达到预定条件为止：从搜索节点获取针对相应的搜索位置的虚拟小区划分方案的网络效用值，并基于网络效用值确定全局最优搜索位置；以及将全局最优搜索位置及其对应的网络效用值提供给搜索节点，以使得各个搜索节点根据全局最优搜索位置及其对应的网络效用值和该搜索节点先前的搜索位置和对应的网络效用值更新下一次迭代操作的搜索位置(S113)。
例如，预定条件可以包括如下中的一个或多个：全局最优搜索位置不再变化；全局最优搜索位置对应的网络效用值在两次第二迭代操作之间的变化小于预定程度；第二迭代操作的数目达到预定值。
此外，虽然图19中未示出，但是上述方法还可以包括：从提供最终的全局最优搜索位置的搜索节点获取对应于该最终的全局最优搜索位置的虚拟小区的划分方案作为要采用的虚拟小区的划分方案，其中，虚拟小区的划分方案还可以包括虚拟小区的边界的信息。
步骤S112还可以包括生成分布式搜索请求以提供给所选择的搜索节点，以及获取来自搜索节点的对于该分布式搜索请求的应答。
例如，还可以向搜索节点提供以下中的一个或多个：各个接入点的位置，各个接入点的回程容量，用户设备的回程需求、位置和移动信息。
此外，上述方法还可以包括根据所确定的虚拟小区的回程需求以及通信质量需求来确定各个虚拟小区的频谱需求，并根据该频谱需求确定频谱分配方案。并且，可以生成包含频谱分配方案的消息以通知主控节点。
例如，上述方法可以在中央管理装置侧执行，上述方法还可以包括与其他中央管理装置交互，以获得预定区域中由其他中央管理装置管理的接入点的信息以及/或者向其他中央管理装置提供本中央管理装置管理的接入点的信息。
图20示出了根据本申请的另一个实施例的用于无线通信的方法的流程图，该方法包括：响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作(S21)，其中，搜索位置为所划分的虚拟小区的个数；基于所述迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值(S22)，网络效用值与各个虚拟小区的丢包率与预定区域内的切换开销有关，其中丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及生成包含搜索位置和网络效用值的消息，以报告给中央管理装置(S23)。
例如，分布式搜索请求中可以包括以下中的一个：用于确定作为特定搜索位置的初始搜索位置的初始信息；用于确定特定搜索位置的当前全局最优搜索位置及其对应的网络效用值。在后一种情况下，基于该当前全局最优搜索位置及其对应的网络效用值以及前一次迭代操作收敛时的搜索位置及其对应的网络效用值来确定特定搜索位置。
其中，步骤S21中的迭代操作与参照图18的步骤S101描述的迭代操作基本相同，在此不再重复。
在步骤S22中，可以基于所得到的主控节点，例如利用维诺图得到各个虚拟小区的边界，并且基于该边界以及用户设备的移动信息来估计各个虚拟小区的切换开销以获得预定区域内的切换开销。
可替选地，还可以将边界的信息提供给当前的各个主控节点，以使得当前的各个主控节点基于用户设备的移动信息来估算其覆盖范围内的用户设备的移动引起的切换开销，从当前的各个主控节点获取该切换开销的信息，并基于该切换开销的信息来估算预定区域内的切换开销。
此外，虽然图20中未示出，上述方法还可以包括：从中央管理装置获取最终确定的虚拟小区的划分方案，该虚拟小区的划分方案包括如下中的一个或多个：虚拟小区的主控节点、虚拟小区的受控节点以及虚拟小区的边界的信息。上述方法还可以包括从中央管理装置获取频谱分配 方案的信息。
注意，上述各个方法可以结合或单独使用，其细节在第一至第三实施例中已经进行了详细描述，在此不再重复。
本公开内容的技术能够应用于各种产品。例如，电子设备100可以被实现为任何类型的服务器，诸如塔式服务器、机架式服务器以及刀片式服务器。电子设备100可以为安装在服务器上的控制模块(诸如包括单个晶片的集成电路模块，以及插入到刀片式服务器的槽中的卡或刀片(blade))。
[关于服务器的应用示例]
图21是示出可以应用本公开内容的技术的服务器700的示意性配置的示例的框图。服务器700包括处理器701、存储器702、存储装置703、网络接口704以及总线706。
处理器701可以为例如中央处理单元(CPU)或数字信号处理器(DSP)，并且控制服务器700的功能。存储器702包括随机存取存储器(RAM)和只读存储器(ROM)，并且存储数据和由处理器701执行的程序。存储装置703可以包括存储介质，诸如半导体存储器和硬盘。
网络接口704为用于将服务器700连接到通信网络705的通信接口。通信网络705可以为诸如演进分组核心网(EPC)的核心网或者诸如因特网的分组数据网络(PDN)。
总线706将处理器701、存储器702、存储装置703和网络接口704彼此连接。总线706可以包括各自具有不同速度的两个或更多个总线(诸如高速总线和低速总线)。
在图21所示的服务器700中，参照图1所描述的确定单元101、生成单元102等可以由处理器701实现。例如，处理器701可以通过执行确定单元101和生成单元102的功能来确定预定区域内虚拟小区的划分方案。
[关于基站的应用示例]
(第一应用示例)
图22是示出可以应用本公开内容的技术的eNB或gNB的示意性配置的第一示例的框图。注意，以下的描述以eNB作为示例，但是同样可以应用于gNB。eNB 800包括一个或多个天线810以及基站设备820。基站设备820和每个天线810可以经由RF线缆彼此连接。天线810中的每一个均包括单个或多个天线元件(诸如包括在多输入多输出(MIMO)天线中的多个天线元件)，并且用于基站设备820发送和接收无线信号。如图22所示，eNB 800可以包括多个天线810。例如，多个天线810可以与eNB 800使用的多个频带兼容。虽然图22示出其中eNB 800包括多个天线810的示例，但是eNB 800也可以包括单个天线810。
基站设备820包括控制器821、存储器822、网络接口823以及无线通信接口825。
控制器821可以为例如CPU或DSP，并且操作基站设备820的较高层的各种功能。例如，控制器821根据由无线通信接口825处理的信号中的数据来生成数据分组，并经由网络接口823来传递所生成的分组。控制器821可以对来自多个基带处理器的数据进行捆绑以生成捆绑分组，并传递所生成的捆绑分组。控制器821可以具有执行如下控制的逻辑功能：该控制诸如为无线资源控制、无线承载控制、移动性管理、接纳控制和调度。该控制可以结合附近的eNB或核心网节点来执行。存储器822包括RAM和ROM，并且存储由控制器821执行的程序和各种类型的控制数据(诸如终端列表、传输功率数据以及调度数据)。
网络接口823为用于将基站设备820连接至核心网824的通信接口。控制器821可以经由网络接口823而与核心网节点或另外的eNB进行通信。在此情况下，eNB 800与核心网节点或其他eNB可以通过逻辑接口(诸如S1接口和X2接口)而彼此连接。网络接口823还可以为有线通信接口或用于无线回程线路的无线通信接口。如果网络接口823为无线通信接口，则与由无线通信接口825使用的频带相比，网络接口823可以使用较高频带用于无线通信。
无线通信接口825支持任何蜂窝通信方案(诸如长期演进(LTE)和LTE-先进)，并且经由天线810来提供到位于eNB 800的小区中的终端的无线连接。无线通信接口825通常可以包括例如基带(BB)处理器 826和RF电路827。BB处理器826可以执行例如编码/解码、调制/解调以及复用/解复用，并且执行层(例如L1、介质访问控制(MAC)、无线链路控制(RLC)和分组数据汇聚协议(PDCP))的各种类型的信号处理。代替控制器821，BB处理器826可以具有上述逻辑功能的一部分或全部。BB处理器826可以为存储通信控制程序的存储器，或者为包括被配置为执行程序的处理器和相关电路的模块。更新程序可以使BB处理器826的功能改变。该模块可以为插入到基站设备820的槽中的卡或刀片。可替代地，该模块也可以为安装在卡或刀片上的芯片。同时，RF电路827可以包括例如混频器、滤波器和放大器，并且经由天线810来传送和接收无线信号。
如图22所示，无线通信接口825可以包括多个BB处理器826。例如，多个BB处理器826可以与eNB 800使用的多个频带兼容。如图22所示，无线通信接口825可以包括多个RF电路827。例如，多个RF电路827可以与多个天线元件兼容。虽然图22示出其中无线通信接口825包括多个BB处理器826和多个RF电路827的示例，但是无线通信接口825也可以包括单个BB处理器826或单个RF电路827。
(第二应用示例)
图23是示出可以应用本公开内容的技术的eNB的示意性配置的第二示例的框图。eNB 830包括一个或多个天线840、基站设备850和RRH860。RRH 860和每个天线840可以经由RF线缆而彼此连接。基站设备850和RRH 860可以经由诸如光纤线缆的高速线路而彼此连接。
天线840中的每一个均包括单个或多个天线元件(诸如包括在MIMO天线中的多个天线元件)并且用于RRH 860发送和接收无线信号。如图23所示，eNB 830可以包括多个天线840。例如，多个天线840可以与eNB 830使用的多个频带兼容。虽然图23示出其中eNB 830包括多个天线840的示例，但是eNB 830也可以包括单个天线840。
基站设备850包括控制器851、存储器852、网络接口853、无线通信接口855以及连接接口857。控制器851、存储器852和网络接口853与参照图22描述的控制器821、存储器822和网络接口823相同。
无线通信接口855支持任何蜂窝通信方案(诸如LTE和LTE-先进)，并且经由RRH 860和天线840来提供到位于与RRH 860对应的扇区中 的终端的无线通信。无线通信接口855通常可以包括例如BB处理器856。除了BB处理器856经由连接接口857连接到RRH 860的RF电路864之外，BB处理器856与参照图22描述的BB处理器826相同。如图23所示，无线通信接口855可以包括多个BB处理器856。例如，多个BB处理器856可以与eNB 830使用的多个频带兼容。虽然图23示出其中无线通信接口855包括多个BB处理器856的示例，但是无线通信接口855也可以包括单个BB处理器856。
连接接口857为用于将基站设备850(无线通信接口855)连接至RRH 860的接口。连接接口857还可以为用于将基站设备850(无线通信接口855)连接至RRH 860的上述高速线路中的通信的通信模块。
RRH 860包括连接接口861和无线通信接口863。
连接接口861为用于将RRH 860(无线通信接口863)连接至基站设备850的接口。连接接口861还可以为用于上述高速线路中的通信的通信模块。
无线通信接口863经由天线840来传送和接收无线信号。无线通信接口863通常可以包括例如RF电路864。RF电路864可以包括例如混频器、滤波器和放大器，并且经由天线840来传送和接收无线信号。如图23所示，无线通信接口863可以包括多个RF电路864。例如，多个RF电路864可以支持多个天线元件。虽然图23示出其中无线通信接口863包括多个RF电路864的示例，但是无线通信接口863也可以包括单个RF电路864。
在图22和图23所示的eNB 800和eNB 830中，第三实施例中所述的收发单元可以由无线通信接口825以及无线通信接口855和/或无线通信接口863实现。功能的至少一部分也可以由控制器821和控制器851实现。参照图7所描述的执行单元201、计算单元202和生成单元203可以由控制器821和控制器851实现。例如，控制器821和控制器851可以通过执行执行单元201、计算单元202和生成单元203的功能来进行特定搜素位置处虚拟小区划分方案的确定和相应的网络效用值的计算。
以上结合具体实施例描述了本发明的基本原理，但是，需要指出的是，对本领域的技术人员而言，能够理解本发明的方法和装置的全部或 者任何步骤或部件，可以在任何计算装置(包括处理器、存储介质等)或者计算装置的网络中，以硬件、固件、软件或者其组合的形式实现，这是本领域的技术人员在阅读了本发明的描述的情况下利用其基本电路设计知识或者基本编程技能就能实现的。
而且，本发明还提出了一种存储有机器可读取的指令代码的程序产品。所述指令代码由机器读取并执行时，可执行上述根据本发明实施例的方法。
相应地，用于承载上述存储有机器可读取的指令代码的程序产品的存储介质也包括在本发明的公开中。所述存储介质包括但不限于软盘、光盘、磁光盘、存储卡、存储棒等等。
在通过软件或固件实现本发明的情况下，从存储介质或网络向具有专用硬件结构的计算机(例如图24所示的通用计算机2400)安装构成该软件的程序，该计算机在安装有各种程序时，能够执行各种功能等。
在图24中，中央处理单元(CPU)2401根据只读存储器(ROM)2402中存储的程序或从存储部分2408加载到随机存取存储器(RAM)2403的程序执行各种处理。在RAM 2403中，也根据需要存储当CPU 2401执行各种处理等等时所需的数据。CPU 2401、ROM 2402和RAM 2403经由总线2404彼此连接。输入/输出接口2405也连接到总线2404。
下述部件连接到输入/输出接口2405：输入部分2406(包括键盘、鼠标等等)、输出部分2407(包括显示器，比如阴极射线管(CRT)、液晶显示器(LCD)等，和扬声器等)、存储部分2408(包括硬盘等)、通信部分2409(包括网络接口卡比如LAN卡、调制解调器等)。通信部分2409经由网络比如因特网执行通信处理。根据需要，驱动器2410也可连接到输入/输出接口2405。可移除介质2411比如磁盘、光盘、磁光盘、半导体存储器等等根据需要被安装在驱动器2410上，使得从中读出的计算机程序根据需要被安装到存储部分2408中。
在通过软件实现上述系列处理的情况下，从网络比如因特网或存储介质比如可移除介质2411安装构成软件的程序。
本领域的技术人员应当理解，这种存储介质不局限于图24所示的其中存储有程序、与设备相分离地分发以向用户提供程序的可移除介质2411。可移除介质2411的例子包含磁盘(包含软盘(注册商标))、光 盘(包含光盘只读存储器(CD-ROM)和数字通用盘(DVD))、磁光盘(包含迷你盘(MD)(注册商标))和半导体存储器。或者，存储介质可以是ROM 2402、存储部分2408中包含的硬盘等等，其中存有程序，并且与包含它们的设备一起被分发给用户。
还需要指出的是，在本发明的装置、方法和系统中，各部件或各步骤是可以分解和/或重新组合的。这些分解和/或重新组合应该视为本发明的等效方案。并且，执行上述系列处理的步骤可以自然地按照说明的顺序按时间顺序执行，但是并不需要一定按时间顺序执行。某些步骤可以并行或彼此独立地执行。
最后，还需要说明的是，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者设备所固有的要素。此外，在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、物品或者设备中还存在另外的相同要素。
以上虽然结合附图详细描述了本发明的实施例，但是应当明白，上面所描述的实施方式只是用于说明本发明，而并不构成对本发明的限制。对于本领域的技术人员来说，可以对上述实施方式作出各种修改和变更而没有背离本发明的实质和范围。因此，本发明的范围仅由所附的权利要求及其等效含义来限定。

Claims (34)

  1. 一种用于无线通信的电子设备，包括：
    处理电路，被配置为：
    以动态的方式确定预定区域内虚拟小区的划分方案，确定所述虚拟小区的划分方案包括将所述预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及
    生成指示所述虚拟小区的划分方案的消息以通知所指定的主控节点。
  2. 根据权利要求1所述的电子设备，其中，所述处理电路被配置为基于如下中的一个或多个来确定所述虚拟小区的划分方案：虚拟小区的主控节点的回程容量；用户设备在虚拟小区间切换引起的切换开销，并且响应于以下中的一个或多个来执行所述虚拟小区的划分方案的确定以及所述消息的生成：一个或多个当前虚拟小区的切换开销超过预定开销阈值；一个或多个当前虚拟小区的回程需求超过相应虚拟小区的回程容量阈值；经过了预定时间。
  3. 根据权利要求2所述的电子设备，其中，所述处理电路被配置为确定所述虚拟小区的划分方案，以使得在采用该划分方案的情况下的网络效用值最高，所述网络效用值与所述各个虚拟小区的丢包率、所述预定区域内的切换开销有关，
    其中，所述丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到。
  4. 根据权利要求1所述的电子设备，其中，所述处理电路被配置为从当前各个主控节点获取以下中的一个或多个：各个接入点的位置，各个接入点的回程容量，对应的虚拟小区覆盖范围内的用户设备的回程需求、位置和移动信息。
  5. 根据权利要求3所述的电子设备，其中，所述处理电路被配置为：
    将所划分的虚拟小区的个数作为搜索位置，针对不同的搜索位置执行用于虚拟小区划分的迭代操作；
    基于所述迭代操作完成时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值；
    基于所述网络效用值来优化要执行所述迭代操作的搜索位置，以确定最优的搜索位置；以及
    将最优的搜索位置对应的虚拟小区的划分方案确定为要采用的虚拟小区的划分方案。
  6. 根据权利要求5所述的电子设备，其中，所述处理电路被配置为如下执行所述用于虚拟小区划分的迭代操作：
    根据各个接入点的位置和回程容量，选择与搜索位置对应的第一数目的接入点作为各个虚拟小区的主控节点的候选接入点；
    基于各个接入点至候选接入点的加权距离对接入点进行分簇，其中所述加权距离与接入点和候选接入点的实际距离、基于候选接入点的回程能力的加权因子有关；
    针对每一簇，更新该簇的候选接入点，并使用更新的候选接入点重新进行基于加权距离的分簇，直到满足预定条件为止，将最终得到的各簇的候选接入点作为各个虚拟小区的主控节点。
  7. 根据权利要求6所述的电子设备，其中，所述预定条件包括如下中的一个或多个：所述候选接入点的位置在两次分簇操作之间的变化小于预定程度；分簇操作的执行次数达到预定值。
  8. 根据权利要求6所述的电子设备，其中，所述处理电路被配置为设置所述加权因子，以使得接入点被分到回程能力强的候选接入点的簇中的可能性大于所述接入点被分到回程能力弱的候选接入点的簇中的可能性；以及接入点被分到周围的用户设备的回程需求大的候选接入点的簇中的可能性小于所述接入点被分到周围的用户设备的回程需求小的候选接入点的簇中的可能性。
  9. 根据权利要求8所述的电子设备，其中，所述加权因子为估算的候选接入点周围的用户设备的回程需求与该候选接入点的回程容量之间的比值的归一化值。
  10. 根据权利要求6所述的电子设备，其中，所述处理电路被配置为接入点分配到所对应的加权距离最小的候选接入点的簇中。
  11. 根据权利要求7所述的电子设备，其中，所述处理电路被配置为基于最终得到的分簇的结果，得到各个虚拟小区的边界，并且基于所述边界以及用户设备的移动信息估计虚拟小区间的切换开销。
  12. 根据权利要求3所述的电子设备，其中，所述处理电路被配置为：
    根据各个主控节点的当前负载选择预定数量的主控节点作为搜索节点；
    指示所述搜索节点分别针对不同的搜索位置进行虚拟小区划分的迭代操作，其中，所述搜索位置为所划分的虚拟小区的个数；
    执行如下第二迭代操作，直到达到预定条件为止：
    从所述搜索节点获取针对相应的搜索位置的虚拟小区划分方案的网络效用值，并基于网络效用值确定全局最优搜索位置；以及
    将所述全局最优搜索位置及其对应的网络效用值提供给所述搜索节点，以使得各个搜索节点根据所述全局最优搜索位置及其对应的网络效用值和该搜索节点先前的搜索位置和对应的网络效用值更新下一次迭代操作的搜索位置。
  13. 根据权利要求12所述的电子设备，其中，所述预定条件包括如下中的一个或多个：所述全局最优搜索位置不再变化；所述全局最优搜索位置对应的网络效用值在两次第二迭代操作之间的变化小于预定程度；第二迭代操作的数目达到预定值。
  14. 根据权利要求12所述的电子设备，其中，所述处理电路还被配置为从提供最终的全局最优搜索位置的搜索节点获取对应于该最终的全局最优搜索位置的虚拟小区的划分方案作为要采用的虚拟小区的划分方案，其中，所述虚拟小区的划分方案还包括所述虚拟小区的边界的信息。
  15. 根据权利要求12所述的电子设备，其中，所述处理电路还被配置为生成分布式搜索请求以提供给所选择的搜索节点，以及获取来自所述搜索节点的对于该分布式搜索请求的应答。
  16. 根据权利要求1所述的电子设备，其中，所述处理电路还被配置为根据所确定的虚拟小区的回程需求以及通信质量需求来确定各个虚拟小区的频谱需求，并根据该频谱需求确定频谱分配方案。
  17. 根据权利要求16所述的电子设备，其中，所述处理电路还被配 置为生成包含所述频谱分配方案的消息以通知所述主控节点。
  18. 根据权利要求16所述的电子设备，其中，所述处理电路还被配置为向频谱管理装置请求可用频谱资源。
  19. 根据权利要求18所述的电子设备，其中，所述处理电路还被配置为经由域代理向频谱管理装置请求可用频谱资源。
  20. 根据权利要求1所述的电子设备，其中，所述电子设备位于中央管理装置侧，所述处理电路还被配置为与其他中央管理装置的电子设备交互，以获得所述预定区域中由其他中央管理装置管理的接入点的信息以及/或者向所述其他中央管理装置提供本中央管理装置管理的接入点的信息。
  21. 一种用于无线通信的电子设备，包括：
    处理电路，被配置为：
    响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作，其中，搜索位置为所划分的虚拟小区的个数；
    基于所述迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值，所述网络效用值为所述各个虚拟小区的丢包率的函数与所述预定区域内的切换开销的函数的加权和，其中所述丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及
    生成包含所述搜索位置和所述网络效用值的消息，以报告给所述中央管理装置。
  22. 根据权利要求21所述的电子设备，其中，所述分布式搜索请求中包括以下中的一个：用于确定作为特定搜索位置的初始搜索位置的初始信息；用于确定所述特定搜索位置的当前全局最优搜索位置及其对应的网络效用值。
  23. 根据权利要求21所述的电子设备，其中，所述处理电路被配置为如下执行所述迭代操作：
    根据各个接入点的位置和回程容量，选择与所述特定搜索位置对应的第一数目的接入点作为各个虚拟小区的主控节点的候选接入点；
    基于各个接入点至候选接入点的加权距离对接入点进行分簇，其中所述加权距离为接入点与候选接入点的实际距离与基于候选接入点的回程能力的加权因子的乘积；
    针对每一簇，更新该簇的候选接入点，并使用更新的候选接入点重新进行基于加权距离的分簇，直到满足预定条件为止，将最终得到的各簇的候选接入点作为各个虚拟小区的主控节点。
  24. 根据权利要求23所述的电子设备，其中，所述预定条件包括如下中的一个或多个：所述候选接入点的位置在两次分簇操作之间的变化小于预定程度；分簇操作的执行次数达到预定值。
  25. 根据权利要求23所述的电子设备，其中，所述处理电路被配置为基于最终得到的分簇的结果，得到各个虚拟小区的边界。
  26. 根据权利要求25所述的电子设备，其中，所述处理电路还被配置为基于所述边界以及用户设备的移动信息来估计各个虚拟小区的切换开销以获得预定区域内的切换开销。
  27. 根据权利要求25所述的电子设备，其中，所述处理电路还被配置为将所述边界的信息提供给当前的各个主控节点，以使得当前的各个主控节点基于用户设备的移动信息来估算其覆盖范围内的用户设备的移动引起的切换开销，所述处理电路从当前的各个主控节点获取该切换开销的信息，并基于该切换开销的信息来估算所述预定区域内的切换开销。
  28. 根据权利要求21所述的电子设备，其中，所述处理电路被配置为从当前的各个主控节点获取其覆盖范围内的用户设备的回程需求、位置和移动信息。
  29. 根据权利要求22所述的电子设备，其中，在所述分布式搜索请求中包括当前全局最优搜索位置及其对应的网络效用值的情况下，所述处理电路被配置为基于该当前全局最优搜索位置及其对应的网络效用值以及前一次迭代操作收敛时的搜索位置及其对应的网络效用值来确定所述特定搜索位置。
  30. 根据权利要求21所述的电子设备，其中，所述处理电路还被配置为从所述中央管理装置获取最终确定的虚拟小区的划分方案，所述虚拟小区的划分方案包括如下中的一个或多个：虚拟小区的主控节点、虚 拟小区的受控节点以及虚拟小区的边界的信息。
  31. 根据权利要求21所述的电子设备，其中，所述处理电路还被配置为从所述中央管理装置获取频谱分配方案的信息。
  32. 一种用于无线通信的方法，包括：
    以动态的方式确定预定区域内虚拟小区的划分方案，所述虚拟小区的划分方案包括将所述预定区域内的多个接入点划分为一个或多个虚拟小区以及指定各个虚拟小区中作为主控节点的接入点；以及
    生成指示所述虚拟小区的划分方案的消息以通知所指定的主控节点。
  33. 一种用于无线通信的方法，包括：
    响应于来自中央管理装置的分布式搜索请求，针对特定搜索位置执行用于预定区域内虚拟小区划分的迭代操作，其中，搜索位置为所划分的虚拟小区的个数；
    基于所述迭代操作收敛时得到的虚拟小区划分来计算对应于该搜索位置的网络效用值，所述网络效用值为所述各个虚拟小区的丢包率的函数与所述预定区域内的切换开销的函数的加权和，其中所述丢包率基于相应虚拟小区的主控节点的回程容量和该虚拟小区的总的回程需求得到；以及
    生成包含所述搜索位置和所述网络效用值的消息，以报告给所述中央管理装置。
  34. 一种计算机可读存储介质，其上存储有计算机可执行指令，当所述计算机可执行指令被执行时，执行根据权利要求32或33所述的用于无线通信的方法。
PCT/CN2018/124587 2017-12-29 2018-12-28 用于无线通信的电子设备和方法以及计算机可读存储介质 Ceased WO2019129169A1 (zh)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US16/652,072 US11032720B2 (en) 2017-12-29 2018-12-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
CN201880065293.8A CN111194564A (zh) 2017-12-29 2018-12-28 用于无线通信的电子设备和方法以及计算机可读存储介质
EP22153015.7A EP4017058A1 (en) 2017-12-29 2018-12-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
AU2018396890A AU2018396890A1 (en) 2017-12-29 2018-12-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
EP18895959.7A EP3709696B1 (en) 2017-12-29 2018-12-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
US17/242,336 US20210250783A1 (en) 2017-12-29 2021-04-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
US18/210,677 US20230328542A1 (en) 2017-12-29 2023-06-16 Electronic apparatus and method used in wireless communications, and computer readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711481100.0 2017-12-29
CN201711481100.0A CN109996248A (zh) 2017-12-29 2017-12-29 用于无线通信的电子设备和方法以及计算机可读存储介质

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US16/652,072 A-371-Of-International US11032720B2 (en) 2017-12-29 2018-12-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium
US17/242,336 Continuation US20210250783A1 (en) 2017-12-29 2021-04-28 Electronic apparatus and method used in wireless communications, and computer readable storage medium

Publications (1)

Publication Number Publication Date
WO2019129169A1 true WO2019129169A1 (zh) 2019-07-04

Family

ID=67066644

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/124587 Ceased WO2019129169A1 (zh) 2017-12-29 2018-12-28 用于无线通信的电子设备和方法以及计算机可读存储介质

Country Status (6)

Country Link
US (3) US11032720B2 (zh)
EP (2) EP3709696B1 (zh)
CN (2) CN109996248A (zh)
AU (1) AU2018396890A1 (zh)
TW (1) TWI753175B (zh)
WO (1) WO2019129169A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111818535A (zh) * 2020-06-05 2020-10-23 温州大学 一种融合多种群优化算法的无线局域网三维优化部署方法
KR20220009217A (ko) * 2020-07-15 2022-01-24 삼성전자주식회사 무선 통신 시스템에서의 동적 주파수 공유 방법, 시스템 및 장치

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109996248A (zh) * 2017-12-29 2019-07-09 索尼公司 用于无线通信的电子设备和方法以及计算机可读存储介质
KR102505060B1 (ko) * 2018-01-12 2023-03-02 삼성전자주식회사 무선 통신 시스템에서 스케줄링을 위한 장치 및 방법
US11122440B2 (en) 2019-09-10 2021-09-14 Cisco Technology, Inc. Performance assurance and optimization for GAA and PAL devices in a CBRS network for private enterprise environment
US11172422B2 (en) 2020-03-18 2021-11-09 Verizon Patent And Licensing Inc. Systems and methods for anchor selection in a non-standalone wireless network environment
CN114239666B (zh) * 2020-09-07 2025-10-14 中兴通讯股份有限公司 分类模型训练的方法、设备、计算机可读介质
US12267690B2 (en) * 2022-01-07 2025-04-01 Dish Wireless L.L.C. Method and system for interface management for neighboring enterprise networks
CN115190493B (zh) * 2022-07-07 2025-01-28 苏州麦杰工业大数据产业研究院有限公司 一种基于硬核距离与动态付费机制的网络基站部署优化方法、系统、装置及存储介质
US20240147245A1 (en) * 2022-10-31 2024-05-02 Cisco Technology, Inc. Adaptive presence-based access point radio configuration
CN115884117A (zh) * 2022-12-28 2023-03-31 中兴通讯股份有限公司 一种指令发送、接收方法，通信节点及存储介质
US12446056B2 (en) * 2023-02-06 2025-10-14 Cisco Technology, Inc. Systems and methods for dynamically configuring wireless access points for a wireless local area network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102625320A (zh) * 2012-04-13 2012-08-01 北京邮电大学 一种家庭基站网络节能的方法
CN105101234A (zh) * 2014-05-08 2015-11-25 索尼公司 对时分双工网络中的小小区进行分簇的装置、方法及基站
CN105101227A (zh) * 2014-05-08 2015-11-25 索尼公司 对时分双工网络中的小小区进行分簇的装置、方法及基站
US20170027004A1 (en) * 2015-07-24 2017-01-26 Aruba Networks, Inc. Heterogeneous deployment of access point clusters

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8553711B2 (en) * 2009-03-19 2013-10-08 Qualcomm Incorporated Association and resource partitioning in a wireless network with relays
US8447314B2 (en) * 2009-12-21 2013-05-21 Cisco Technology, Inc. System and method for providing resource management in a network environment
EP2403186B1 (en) * 2010-07-02 2017-12-27 Vodafone IP Licensing limited Telecommunication networks
US8681758B2 (en) * 2010-12-14 2014-03-25 Symbol Technologies, Inc. Video caching in a wireless communication network
US20120188938A1 (en) * 2011-01-20 2012-07-26 Atheros Communications, Inc. System and method for providing a location aware wireless network
WO2012144721A1 (ko) * 2011-04-18 2012-10-26 엘지전자 주식회사 다른 클러스터의 비율 변경을 보상하는 무선 자원의 배분
KR101884332B1 (ko) * 2011-09-14 2018-08-01 삼성전자주식회사 무선통신 시스템에서 가상 셀 형성 방법 및 장치
US8958807B2 (en) * 2012-01-09 2015-02-17 Samsung Electronic Co., Ltd. Method and apparatus for providing communication service to mobile station by multiple base stations in cooperation in wireless communication system
KR102083352B1 (ko) * 2013-07-03 2020-03-03 삼성전자주식회사 가상 셀 네트워크 시스템에서 가상 셀 형성장치 및 방법
US9426770B2 (en) * 2013-09-30 2016-08-23 Qualcomm Incorporated Access point selection for network-based positioning
ES2636889T3 (es) * 2013-10-31 2017-10-10 Telefonica Digital España, S.L.U. Método y dispositivo para coordinar puntos de acceso para la agregación de enlace de retroceso en una red de telecomunicaciones
EP2879448B1 (en) * 2013-11-27 2018-12-26 Sony Corporation Efficient small cell activation
US9781610B2 (en) * 2013-12-18 2017-10-03 Qualcomm Incorporated Small cell clusters for signaling load reduction, time synchronization, KPI filtering and spectrum coordination
US10009733B2 (en) * 2014-05-13 2018-06-26 Samsung Electronics Co., Ltd. Method and system for determining a position of a mobile device by an access point
US9820205B2 (en) * 2014-07-29 2017-11-14 Qualcomm Incorporated Signaling virtual cell ID sets
CN105376748A (zh) * 2014-08-27 2016-03-02 中兴通讯股份有限公司 虚拟小区的构建、协作节点的选择方法及装置
CN105657837B (zh) * 2014-11-24 2021-08-24 中兴通讯股份有限公司 虚拟小区资源分配方法、装置和系统
SG11201707454QA (en) * 2015-03-13 2017-10-30 Comptel Corp Network management
CN106454909A (zh) * 2015-08-11 2017-02-22 中兴通讯股份有限公司 AP组信息处理方法及eNB
CN106788646B (zh) * 2015-11-24 2022-03-18 上海诺基亚贝尔股份有限公司 用于利用虚拟小区进行通信的方法和装置以及通信系统
US20170166380A1 (en) 2015-11-25 2017-06-15 Unither Pharmaceuticals Stick pack design
CN107371165A (zh) * 2016-05-13 2017-11-21 索尼公司 频谱管理装置和方法、电子装置和方法以及无线通信系统
CN107801188B (zh) * 2016-08-30 2021-07-06 上海诺基亚贝尔股份有限公司 异构网络中形成虚拟小区的方法、宏基站和传输点设备
US10405366B1 (en) * 2016-09-28 2019-09-03 Amazon Technologies, Inc. Coordinated beamforming
US11627478B2 (en) * 2017-10-18 2023-04-11 Parallel Wireless, Inc. Virtualized cell architecture
CN109996248A (zh) * 2017-12-29 2019-07-09 索尼公司 用于无线通信的电子设备和方法以及计算机可读存储介质

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102625320A (zh) * 2012-04-13 2012-08-01 北京邮电大学 一种家庭基站网络节能的方法
CN105101234A (zh) * 2014-05-08 2015-11-25 索尼公司 对时分双工网络中的小小区进行分簇的装置、方法及基站
CN105101227A (zh) * 2014-05-08 2015-11-25 索尼公司 对时分双工网络中的小小区进行分簇的装置、方法及基站
US20170027004A1 (en) * 2015-07-24 2017-01-26 Aruba Networks, Inc. Heterogeneous deployment of access point clusters

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111818535A (zh) * 2020-06-05 2020-10-23 温州大学 一种融合多种群优化算法的无线局域网三维优化部署方法
CN111818535B (zh) * 2020-06-05 2023-04-18 温州大学 一种融合多种群优化算法的无线局域网三维优化部署方法
KR20220009217A (ko) * 2020-07-15 2022-01-24 삼성전자주식회사 무선 통신 시스템에서의 동적 주파수 공유 방법, 시스템 및 장치
EP4154571A4 (en) * 2020-07-15 2023-11-22 Samsung Electronics Co., Ltd. METHOD, SYSTEM AND APPARATUS FOR SHARING A DYNAMIC FREQUENCY IN A MOBILE COMMUNICATION SYSTEM
US12238528B2 (en) 2020-07-15 2025-02-25 Samsung Electronics Co., Ltd. Method, system, and apparatus for sharing dynamic frequency in mobile communication system
KR102824984B1 (ko) * 2020-07-15 2025-06-26 삼성전자주식회사 무선 통신 시스템에서의 동적 주파수 공유 방법, 시스템 및 장치

Also Published As

Publication number Publication date
AU2018396890A1 (en) 2020-07-23
CN109996248A (zh) 2019-07-09
US20200252808A1 (en) 2020-08-06
EP4017058A1 (en) 2022-06-22
EP3709696A4 (en) 2020-11-25
US11032720B2 (en) 2021-06-08
TWI753175B (zh) 2022-01-21
US20230328542A1 (en) 2023-10-12
TW201931912A (zh) 2019-08-01
EP3709696B1 (en) 2022-03-16
EP3709696A1 (en) 2020-09-16
US20210250783A1 (en) 2021-08-12
CN111194564A (zh) 2020-05-22

Similar Documents

Publication Publication Date Title
US20230328542A1 (en) Electronic apparatus and method used in wireless communications, and computer readable storage medium
CN110213809B (zh) 用于非蜂窝式无线接入的系统和方法
CN111108721B (zh) 网络切片中分配资源的方法、设备和计算机可读存储介质
CN109151864B (zh) 一种面向移动边缘计算超密集网络的迁移决策与资源优化分配方法
US12184719B2 (en) Cloud-network integration oriented multi-access edge computing architecture
WO2015131677A1 (zh) 虚拟小区的构建、协作节点的选择方法及装置
WO2018082415A1 (zh) 用于资源管理装置、数据库和对象的电子设备和方法
JP2016503974A (ja) デバイス間通信のためのリソース割当方法及び装置
EP3611968A1 (en) First base station, second base station, terminal device, method, program, and recording medium
WO2020125575A1 (zh) 用于无线通信的电子设备和方法、计算机可读存储介质
CN113330767B (zh) 频谱管理设备、电子设备、无线通信方法和存储介质
Chen et al. Joint computation offloading and radio resource allocations in wireless cellular networks
Zheng et al. Joint downlink and uplink edge computing offloading in ultra-dense HetNets
KR101924628B1 (ko) 트래픽 오프로딩을 제어하기 위한 장치 및 방법
TW201804829A (zh) 電子設備和用於電子設備的方法
US9131421B2 (en) Methods and apparatus for handover management
US12069697B2 (en) Control apparatus, resource allocation method and program
WO2022134854A1 (zh) 信息共享方法及通信装置
Jiang et al. Proportionally fair load balancing with statistical quality of service provisioning for aerial base stations
CN109155916B (zh) 电子设备和用于电子设备的方法
Wang et al. User association for energy harvesting relay stations in cellular networks
CN116724517A (zh) 减少干扰和优化参数
EP4120578A1 (en) Beam optimization based on signal measurements in neighboring cells
WO2024208304A1 (zh) 用于资源调度的方法、设备、装置和介质
Zhou et al. Service Proactive Caching Based Computation Offloading for Mobile Edge Computing

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018895959

Country of ref document: EP

Effective date: 20200612

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018396890

Country of ref document: AU

Date of ref document: 20181228

Kind code of ref document: A