Evolutionary algorithms for geographic load balancing using a distributed antenna system

Abstract

Methods and apparatuses are presented for balancing non-uniformly distributed network traffic in a wireless communications system having a plurality of digital remote units (DRUs). In some embodiments, a method comprises partitioning the plurality of DRUs into a plurality of DRU sectors, and dynamically repartitioning the plurality of DRU sectors depending on traffic conditions in at least one of the DRU sectors, such that the repartitioning satisfies at least one of a soft capacity constraint or a hard capacity constraint. The dynamic repartitioning may be based on at least one optimization algorithm.

Claims

1. A method for dynamically repartitioning cells of a mobile network, the method comprising: receiving, by a digital access unit (DAU), performance data from a plurality of sectors of a base transceiver station, wherein the DAU is operable to allocate radio resources associated with a sector of the plurality of sectors, determining a traffic load of a cell of the mobile network; determining a rate of handoffs between the cell and at least one further cell of the mobile network; and on the basis of at least one of the performance data, the traffic load, or the rate of handoffs, allocating, by the DAU, radio resources associated with the sector of the plurality of sectors to the cell and the at least one further cell.

2. The method of claim 1, further comprising: comparing the traffic load of the cell to a threshold; and if the traffic load is below the threshold, selecting the cell as a candidate for allocation to the same sector.

3. The method of claim 1, wherein the at least one further cell is along a border of the cell.

4. The method of claim 1, further comprising: determining a traffic load of the at least one further cell, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the at least one further cell.

5. The method of claim 1, further comprising: estimating a traffic load of the sector, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the sector.

6. The method of claim 5, further comprising: comparing the estimated traffic load of the sector to a threshold value.

7. A digital access unit (DAU) for dynamically repartitioning cells of a mobile network, the DAU comprising a processor configured to: receive performance data from a plurality of sectors of a base transceiver station; determine a traffic load of a cell of the mobile network; determine a rate of handoffs between the cell and at least one further cell of the mobile network; and allocate radio resources associated with a sector of the plurality of sectors to the cell and the at least one further cell on the basis of at least one of the performance data, the traffic load, and the rate of handoffs.

8. The DAU of claim 7, wherein the processor is further configured to: compare the traffic load of the cell to a threshold; and if the traffic load is below the threshold, select the cell as a candidate for allocation to the same sector.

9. The DAU of claim 7, wherein the at least one further cell is along the border of the cell.

10. The DAU of claim 7, wherein the processor is further configured to: determine a traffic load of the at least one further cell, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the at least one further cell.

11. The DAU of claim 7, wherein the processor is further configured to: estimate a traffic load of the sector, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the sector.

12. The DAU of claim 11, wherein the processor is further configured to: compare the estimated traffic load of the sector to a threshold value.

13. A non-transitory computer-readable storage medium comprising a plurality of computer-readable instructions tangibly embodied on the computer-readable storage medium, which, when executed by a data processor, provide for dynamic repartitioning of cells of a mobile network, the plurality of instructions comprising: instructions that cause the data processor to receive performance data from a plurality of sectors of a base transceiver station; instructions that cause the data processor to determine a traffic load of a cell of the mobile network; instructions that cause the data processor to determine a rate of handoffs between the cell and at least one further cell of the mobile network; and instructions that cause the data processor to allocate radio resources associated with a sector of the plurality of sectors to the cell and the at least one further cell on the basis of at least one of the performance data, the traffic load, and the rate of handoffs.

14. The non-transitory computer-readable storage medium of claim 13, the plurality of instructions further comprising: instructions that cause the data processor to compare the traffic load of the cell to a threshold; and if the traffic load is below the threshold, instructions that cause the data processor to select the cell as a candidate for allocation to the same sector.

15. The non-transitory computer-readable storage medium of claim 13, wherein the at least one further cell is along the border of the cell.

16. The non-transitory computer-readable storage medium of claim 13, the plurality of instructions further comprising: instructions to cause the data processor to determine a traffic load of the at least one further cell, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the at least one further cell.

17. The non-transitory computer-readable storage medium of claim 13, the plurality of instructions further comprising: instructions to cause the data processor to estimate a traffic load of the sector, wherein the allocating the cell and the at least one further cell to the same sector is further based on the traffic load of the sector.

18. The non-transitory computer-readable storage medium of claim 13, the plurality of instructions further comprising: instructions to cause the data processor to compare the traffic load to a threshold value.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) An understanding of the nature and advantages of various embodiments may be realized by reference to the following figures. In the appended figures, similar components or features may have the same reference label. Further, various components of the same type may be distinguished by following the reference label by a dash and a second label that distinguishes among the similar components. If only the first reference label is used in the specification, the description is applicable to any one of the similar components having the same first reference label irrespective of the second reference label.

(2) FIG. 1 is a schematic illustration of an example Distributed Antenna System (DAS) according to some embodiments.

(3) FIGS. 2A and 2B illustrate an example methodology according to some embodiments.

(4) FIG. 3 shows example sectorization problems and solutions according to some embodiments.

(5) FIGS. 4A and 4B are example sectorization scenarios associated with some embodiments.

(6) FIGS. 5A and 5B are other example sectorization scenarios associated with some embodiments.

(7) FIGS. 6A and 6B are yet other example sectorization scenarios associated with some embodiments.

(8) FIGS. 7, 8, and 9 illustrate quantitative improvements according to implementations of some embodiments.

(9) FIGS. 10, 11, and 12 show charts of example tradeoffs between the population size and the number of generation required to achieve a specified performance according to some embodiments.

(10) FIG. 13 shows an example flowchart according to some embodiments.

DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

(11) 3GPP LTE is a promising candidate for next generation wireless networks. In the last 15 years there has been substantial growth in cellular mobile communication systems. It is imperative to provide a high quality of service (QoS) at a minimum cost. With the substantial increase in cellular users, traffic hot spots and unbalanced call distributions are common in wireless networks. This decreases the quality of service and increases call blocking and dropping. Inter-cell optimization in GSM and UMTS networks is usually delivered at the stage of network planning, and often done manually. As traffic environments change, the network performance will not be optimum. It is therefore necessary to perform inter-cell optimization of the network dynamically according to the traffic environment, especially when cell traffic loads are not uniformly distributed. This is one of the important optimization issues in self-organizing networks (SON) for 3GPP LTE. When the traffic loads among cells are not balanced, the blocking probability of heavily loaded cells may be higher, while their neighboring cells may have resources not fully utilized. In this case load balancing can be conducted to alleviate and even avoid this problem. Additionally, other next-generation networks besides 3GPP LTE may experience similar problems. In some embodiments, the solutions presented herein may apply to those architectures as well.

(12) According to some embodiments, one approach to solve this problem is to take advantage of aspects of a Distributed Antenna System (DAS). A DAS breaks the traditional radio base station architecture into two pieces: a central processing facility and a set of distributed antennas (DAs) connected to the central facility by a high-bandwidth network. The DAS network transports radio signals, in either analog or digital form, to/from the central facility where all the base stations processing is performed. By replacing a single high-power antenna with several low-power antennas distributed to give the same coverage as the single antenna, a DAS is able to provide more-reliable wireless service within a geographic area or structure while reducing power consumption. In a Virtualized DAS, the traffic load from multiple sectorized eNodeBs, at a hotel station, is distributed to multiple Digital Remote Units (DRU). This synergistic configuration also allows multiple operators to use multiple technologies over the same physical facilities, thereby providing a cost-effective means of furnishing subscribers with high quality, highly reliable communication services. With respect to a Virtualized DAS configuration, multiple DRUs can be dynamically assigned to the different eNodeB sectors depending on the time-varying traffic, in order to resolve unbalanced traffic scenarios.

(13) One of the primary design challenges for a Virtualized DAS system is location area management. The location area management problem can be generally stated as: For a given network of nDRUs, the objective is to partition the network into m coverage areas, without exceeding the number of users which can be supported by the eNodeBs. To provide the best Quality of Service (QoS) for a given number of eNodeBs and resources, the call traffic must be dynamically balanced when we consider call handoffs and call blockage rates. This is a location management optimization problem that can be accomplished through delivering the sectorized eNodeB traffic to the independent DRUs.

(14) Once traffic resources are aggregated into eNodeB hotels, the discrete resources of a single eNodeB are still allocated to a specific set of antennas associated with that eNodeB and providing coverage to a specific geographic area. The traffic resources are fixed, i.e., only the resources associated with a specific eNodeB can be allocated to the antennas associated with that eNodeB. However, because the eNodeBs are collocated in an eNodeB hotel, the system can use the aggregated traffic resources of the discrete eNodeBs as a single, pooled traffic resource that can be allocated according to various algorithms. Assumptions are typically predicated on worst-case traffic assets in all areas, network design is wasteful 99 percent of the time, inevitably resulting in over- or under-provisioning of fixed resources. Traffic resources either go unused (idle channels), or are under-provisioned and are insufficient to handle the offered traffic. Both circumstances give rise to the same outcome: lost revenue and lost opportunity. When a site's traffic resources are idle and unused, the traffic asset fails to provide an optimal return on investment. But a site that lacks sufficient capacity to support the offered traffic at any point during the day garners dropped calls, lost revenue opportunity, and dissatisfied customers. The traffic information derived from an extensive sensor network will be used to dynamically allocate the traffic resources to the required geographical areas only for the time period the service is needed. Once the service is supplied and the traffic sensor network determines that the traffic resources are no longer required, they are returned to the resource pool for reallocation. The entire network automatically reconfigures itself based on the perceived (sensed) need or in the event of disruption due to natural or manmade events.

(15) Load balancing can be classified into two general categories: block probability-triggered load balancing and utility based load balancing. However, very little research has dealt with the unbalance load network scenario in LTE-like packet switched networks.

(16) It may be known in the art various schemes related to mobile cellular networks and increasing system capacity. Balancing the traffic load and use of DAS are two of the most important ones which have rarely been considered in the art. Traffic load balancing in mobile cellular network may be well known since the first generation of mobile communication systems. Many methods have been proposed to address this problem, such as cell splitting, channel borrowing, channel sharing, dynamical channel allocation, etc. The applications of DAS in cellular networks may also be known. However, most work related to traffic load balancing only focuses on different radio resource allocation schemes, and most work on DAS only considers the radio propagation channels within a multi-cell to improve the system capacity.

(17) Geographic load balancing using VDAS, as described in some embodiments of the present invention, is recognized as a new approach for traffic load balancing which provides dynamic load redistribution in real time according to the current geographic traffic conditions. It can be used to improve the performance for any distributed systems containing non-uniformly distributed traffic, especially for resolving traffic hot spots. Knowledge in dynamic sectorization, use of tilted antennas, and dynamic cell-size control (cell breathing) illustrate that the system performance can be improved by balancing non-uniformly distributed traffic.

(18) Some embodiments of the present invention deliver the eNodeB traffic to independent DRUs with the objective to dynamically balance the traffic. Sectorization also reduces handoffs between cells allocated to the same sector, which is possible with the simulcast capability inherent in a DAS network. This disclosed management of the sectorized DRUs in some embodiments is distinct from the existing balancing methods. In previous dynamic balancing research, fixed basic resources are allocated to each cell and some reserved or borrowed resources are assigned to cells with higher traffic. However, in disclosed embodiments, units called hard capacities control resources and are assigned to eNodeBs by grouping DRUs depending on the time-varying traffic at each cell. Thus the dynamic sectorization that satisfies hard capacities dramatically reduces call blocking probability and call handoffs.

(19) The remainder of this disclosure, all of which disclose certain aspects of the present invention, is organized as follows. Virtualized Distributed Antenna Systems and dynamic sectorization of DRUs. A formulation for the DRU load-balancing problem. Two evolutionary algorithms to solve the problem: Genetic Algorithm (GA) and Estimation Distribution Algorithm (EDA). The performance of two algorithms is compared with the optimal or lower bound solution.

(20) Distributed Antenna System

(21) Distributed antenna systems (DAS) have been widely implemented in state-of-the art cellular communication systems to cover dead spots. In DAS, antenna modules are geographically distributed to reduce access distance instead of centralizing at a location. Each distributed antenna module is connected to a home base station (eNodeB hotel or central unit) via dedicated wires, fiber optics, or an exclusive RF link.

(22) From an architectural point-of-view, DAS has discernible advantages over conventional communication systems. DAS can reduce the system installation costs and simplify maintenance, because DAS can reduce the required number of base stations within a target service area. An alternative strategy is to try to reduce the overall transmit power using distributed antennas, which has the additional merit of providing better coverage and increased cellphone battery life. Although distributed antennas systems (DAS) were originally introduced to simply cover the dead spots in indoor wireless communications, recent studies have identified other potential advantages such as power and system capacity, and expanded its applications. Furthermore, blocking probability can be improved owing to the principle of trunking efficiency because resources for signal processing such as licenses/channel cards are centralized and shared at the home base station. In addition to these architectural advantages, DAS also has been shown to possess advantages in terms of power, signal-to interference-plus-noise ratio (SINR), and capacity owing to macro-diversity and the reduced access distance. Based on these advantages, many cellular service providers or system manufacturers are replacing legacy cellular systems with distributed antenna systems. However, most of the recent work on DAS has been focused on investigating those advantages and analyzing its performance. On the other hand, there are few disclosure on load balancing in time-varying networks using DAS.

(23) System Structure

(24) FIG. 1 discloses certain embodiments of the present invention. In a Virtualized DAS as shown in FIG. 1, Digital Remote Antennas (DRUs), such as DRU 110, are connected to an eNodeB hotel 100 via optical fiber, such as optical fiber cable 112, and Digital Access Units (DAU), such as DAU 104 (DAU 1). Each DRU may provide service to a cell, such that whoever is within range of the cell will be serviced by the particular DRU in the cell. The DRUs may be strategically installed so that the sum total of the DRUs may provide service to a wide area, such as the 7-cell area 106 as shown. In other cases, fewer DRUs may be installed, and may provide service to a smaller area, such as 3-cell area 108. The DAUs are interconnected and connected to multiple sectors, such as Sectors 1, 2, and 3 in eNodeB1 102. This capability enables the virtualization of the eNodeB resources at the independent DRUs. The eNodeB hotel 100 may be linked to a public switched telephone network or a mobile switching center. DRUs are sectorized such that each DRU allocated to a given eNodeB sector is simulcast. For the simulcasting operation, the access network between the eNodeB hotel and DRUs should have a multi drop bus topology. The DAUs dynamically assign the radio resources of the various sectors to the independent DRUs according to the traffic demand.

(25) An eNodeB limitation for the number of active users is defined as hard capacity. Base Station vendors charge the operators based on the number of licenses (resources) allocated. In general, a three sector BTS, such as eNodeB 102, shares the licenses for traffic demand amongst the sectors. As an example, 600 licenses could be assigned to the three sector BTS. The set of 600 licenses is called the virtual base station (VBS). An eNodeB hotel can contain several VBSs.

(26) Dynamic DRU Sector Allocation

(27) According to some embodiments, in the Virtualized DAS discussed in relation to FIG. 1, it is beneficial to sectorize the DRUs to cope with dynamically changing traffic and to balance the traffic for each sector. At the DRU coverage area the traffic is increased or decreased depending on the period of time. Thus embodiments provide methods and systems to dynamically sectorize the DRUs such that the DRUs in a sector satisfy the soft capacity (e.g., the maximum number of users in order to maintain an acceptable SNR) and the sectors in a VBS meet the hard capacity (e.g., the total number of licenses/sources assigned to a VBS). Some embodiments focus on proper sectorization that satisfies the soft and hard capacities for balanced traffic. Without proper sectorization there may be cases of unbalanced traffic where the number of blocked calls are increased in a specific sector, even if the other sectors have very little traffic. FIG. 2A shows an example of sectorization where there are ten DRUs, three sectors and one VBS. The sectors as shown may be distinguished by the different orientation of lines within the DRUs. For example, the DRUs with horizontal lines constitute a first sector 202, the DRUs with criss-crossed lines constitute a second sector 204, and the DRUs with vertical lines constitute a third sector 206. The numbers within each hexagonal DRU may represent a present number of calls at a given time. Thus, for example, sector 202 currently services 80+70+50=200 calls in FIG. 2A. In this example, by assuming 600 licenses of hard capacity in the VBS and 200 channels of soft capacity per sector, improper sectorization produces 35 blocked calls, while the other two sectors have idle channels. This can be seen by observing that sector 206 has 50+45+80+60=235 calls at one time, while sector 204 has 40+35+75=150 calls. Assuming each call has its own separate channel, and each sector has a soft capacity of 200 channels, then sector 206 has 35 more calls than it can presently handle, resulting in 35 dropped or blocked calls. Such a situation may be characterized as an improper sectorization, due to at least one sector being heavily loaded with calls while other sectors still have capacity to handle more calls.

(28) However, no calls are blocked and the traffic is well balanced in the proper sectorization. Referring to FIG. 2B, if the DRUs are balanced across the sectors better, then no blocked calls may occur. In this case, the DRU from sector 206 with 50 calls may be reallocated to sector 204 which had only 150 calls. Thus, a reallocation according to some embodiments results in balanced sectors 204′ (40+35+75+50=200) and 206′ (45+80+60=185) serving no more than their channel soft capacity, resulting in no blocked or dropped calls. Now, note that all DRUs allocated to a given sector broadcast the radio signals in a simulcast. In some embodiments, the number of blocked calls may be a metric that is desired to be minimized or otherwise optimized. For example, in some embodiments, if the number of blocked calls is currently above a predetermined threshold, then steps may be taken to reallocate DRUs to other sectors and to generally rebalance the load between sectors through a series of iterations until the number of blocked calls falls below the threshold.

(29) In general, the present disclosures illustrate several problems that may result in inefficient and suboptimal sectorizations. For example, if the DRUs servicing these hexagonal areas are disconnected as in FIG. 3(a), there may be significant interference from other adjacent simulcasting groups. Notice how DRUs 302, with horizontal lines, is in the same sector as DRU 304, also with horizontal lines, but they are clearly disconnected. The disconnected sectorization also generates unnecessary handoffs between sectors. For example, if a user is on a call and passes from DRUs 302 over to DRU 304, the user will have to pass through some of the vertical-lined DRUs that are associated with a different sector. Each time the user crosses into a different sector, a handoff must take place, resulting in unnecessary handoffs and wasted resources. Therefore, it is better when cells allocated to a given sector are connected. To minimize the handoffs and interference among sectors we consider the compactness of DRU sectorization. FIG. 3(b) shows examples of connected but incompact sectorization of DRUs. For example, sector 206, 208, and 310, as distinguished by the different lined orientations, are each connected to DRUs within their respective sectors. However, the DRUs are grouped generally in a line formation. This may result in a higher tendency to have to perform handoffs, because there is a larger perimeter around the sectors than if the DRUs were grouped in a more compact manner. An isolated DRU surrounded by DRUs allocated to other sectors may experience higher interference than the DRUs in compact sectorization. Compact sectorization also reduces the number of handoffs by decreasing the length of the border between two different sectors.

(30) In contrast, FIG. 3(c) shows a connected and compact configuration. The sectors 312, 314, and 316 all have their respective DRUs connected, and the configuration of the DRUs are more compact than say, FIG. 3(b) because there is a smaller perimeter around the sectors, resulting in smaller likelihood of users moving across the borders of the sectors and needing to perform handoffs. In general, it may be a goal according to some embodiments to generate sector configurations that are well balanced, in the sense that the number of blocked calls is minimized (i.e. proper sectorization), the number of handoffs may be minimized, and/or the configurations of the cells are connected and compact (which relates at least to minimizing the number of handoffs). Additionally, embodiments may be viewed as solving or mitigating a “soft-capacity” problem and/or a “hard-capacity” problem related to DRU sectorization. For example, a soft capacity constraint of the sectors may be the number of handoffs occurring between the sectors. A hard capacity constraint may be the number of channels each sector is allocated, thereby determining a maximum number of calls within the sector at any point in time.

(31) To measure the compactness of sectorization in the hexagonal DRU environment, introduced is the compactness index (CI) which is defined as the ratio of the number of handoff cell sides to the total number of cell sides in a VBS. For example the CI of the sectorization of FIG. 3(b) is 10/18 and FIG. 3(c) is 7/18.

(32) As will be discussed more below, embodiments of the present invention may perform dynamic repartitioning of DRUs into different sectors based on at least one optimization algorithm in order to reduce, minimize, and/or optimize these and other similar types of problems. The algorithm may involve measurement of various key performance indicators (KPI) including signal strength, which provides an indication of the number of users operating through a given DRU.

(33) Formulation of DRU Sectorization

(34) The network's performance (expressed by the number of KPIs from different parts of the network) determines the QoS values. Different operators may have different defined business goals and different services of interest. Based on these considerations, efficient and cost effective network performance management varies from operator to operator. Therefore, QoS metrics could be defined and mapped to a set of KPIs. When a set of KPIs is used, then the mapping needs to be represented by a weighted normalized function.

(35) The following describes a formulation of the sectorization problem with mixed integer programming to balance traffic among sectors and to minimize handoffs with connected and compact sectors. These formulations are included in parts of embodiments of the present invention. Given the sectorization of DRUs at time period t, a problem is to obtain new sectorization at time period t+1 that adaptively balances the change in traffic demands.

(36) In order to formulate the problem, consider a service coverage area with N DRUs. Each DRU is assumed to have traffic demand T.sub.i i=1, . . . , N. Note that, UE.sub.A belongs to DRU.sub.B if the received uplink power from UE.sub.A at DRU.sub.B is greater than the other DRUs. Let p.sub.ij be the transition probability of mobiles from DRU.sub.i to DRU.sub.j. Then, the handoff calls from DRU.sub.i to DRU.sub.j become h.sub.ij=p.sub.ijT.sub.i. The distance between DRU.sub.i and DRU.sub.j is inversely proportional to p.sub.ij. Assume that an eNodeB hotel has M VBSs. Let SOS.sub.m and SOD.sub.k be the set of sectors in VBS.sub.m and the set of DRUs allocated to Sector.sub.k, respectively, such that |SOS.sub.m|=3 (if each eNodeB/VBS has three sectors), m=1, . . . , M and k=1, . . . , K. Now consider the following three cost factors (KPIs) in the sectorization problem:

(37) (1) KPI.sub.BC (Inverse of the number of Blocked Calls): The penalty of the blocked calls caused by hard capacity and soft capacity. Let HC.sub.m and SC.sub.k be the hard capacity of VBS.sub.m and soft capacity of Sector.sub.k respectively such that

(38) ${\mathrm{HC}}_m=\underset{k\in {\mathrm{SOS}}_m}{.Math.}{\mathrm{SC}}_k.$
The binary variable x.sub.ik=1, when DRU.sub.i belongs to Sector.sub.k.

(39) $y_{\mathrm{im}}=\underset{k\in {\mathrm{SOS}}_m}{.Math.}{x}_{\mathrm{ik}},$
then y.sub.im=1 when DRU.sub.i belongs to VBS.sub.m.

(40) $\begin{array}{cc}{\mathrm{sc}}_k=\{\begin{array}{cc}0& \mathrm{if}\underset{i}{.Math.}{T}_i{x}_{\mathrm{ik}}<{\mathrm{SC}}_k\\ \underset{i}{.Math.}{T}_i{x}_{\mathrm{ik}}-{\mathrm{SC}}_k& \mathrm{otherwise}\end{array}\begin{array}{c}{\mathrm{hc}}_m=\underset{i}{.Math.}{T}_i{y}_{\mathrm{im}}-{\mathrm{HC}}_m\\ =\underset{i}{.Math.}{T}_i\underset{k\in {\mathrm{SOS}}_m}{.Math.}{x}_{\mathrm{ik}}-\underset{k\in {\mathrm{SOS}}_m}{.Math.}{\mathrm{SC}}_k\\ =\underset{k\in {\mathrm{SOS}}_m}{.Math.}\underset{i}{.Math.}{T}_i{x}_{\mathrm{ik}}-{\mathrm{SC}}_k\\ =\underset{k\in {\mathrm{SOS}}_m}{.Math.}{\mathrm{sc}}_k\end{array}& \left(1\right)\end{array}$

(41) Since a penalty occurs only when the calls are blocked, we apply just sc.sub.k to the objective function, because the hc.sub.m is a function of sc.sub.k and there is no need to add it as another term to the objective function. sc.sub.k is a nonnegative real variable. So,

(42) $\begin{array}{cc}{\mathrm{KPI}}_{\mathrm{BC}}={\left[\underset{k\in {\mathrm{SOS}}_m}{.Math.}{\mathrm{sc}}_k\right]}^{-1}& \left(2\right)\end{array}$

(43) (2) KPI.sub.HO(Inverse of the number of Handoffs): Consider three different types of Handoffs:

(44) (A) Inter-eNodeB Handoff: When user equipment (UE) with an ongoing call moves from one VBS to another VBS, then the UE needs an inter-eNodeB handoff. Inter-eNodeB handoff is executed using the X2 interface (as long as the UE does not leave the LTE coverage area) or S1 interface (when the UE leaves the serving cell). The X2 handoff includes establishing a signaling connection using the X2 Application Part (X2AP) from the source to the target eNodeB. The target eNodeB updates the MME (Mobility Management Entity) with the new geographic position of the UE. To enable this procedure, the MME needs to communicate with S-GW (Serving Gateway) to negotiate the new endpoint. During the S1 handoff, the MME receives the relocation preparation request of the source eNodeB, it starts the handoff resource allocation procedure to request the necessary radio resource from the target eNodeB. After the target eNodeB sends the required radio interface parameters embedded in a handoff command message; the MME forwards this handoff command message transparently to the UE, which executes the handoff. The main procedure is triggered by the MME and executed by S-GW.

(45) Let the binary variable z.sub.ijm=1, when DRU.sub.i and DRU.sub.j belong to VBS.sub.m. Then the inter-eNodeB handoff cost is computed by using the variable

(46) $z_{\mathrm{ij}}=1-\underset{m}{.Math.}{z}_{\mathrm{ijm}},$
the cost becomes

(47) $\underset{i}{.Math.}\underset{j}{.Math.}{h}_{\mathrm{ij}}{z}_{\mathrm{ij}}.$

(48) Note that inter-eNodeB handoff occurs when DRU.sub.i and DRU.sub.j belong to different VBS, i.e., z.sub.ijm=0.

(49) (B) Intra-eNodeBHandoff: When a UE with an ongoing call moves from one sector to another in a VBS, then the mobile needs an intra-eNodeB handoff. This procedure doesn't need to involve MME or S-GW because it can be handled entirely within that VBS. Now by letting the binary variable w.sub.ijk=1 when DRU.sub.i and DRU.sub.j belong to sector k, the intra-eNodeB handoff cost is computed by using two variables w.sub.ij−z.sub.ij where

(50) $w_{\mathrm{ij}}=1-\underset{k}{.Math.}{w}_{\mathrm{ijk}},$
the cost becomes

(51) $\underset{i}{.Math.}\underset{j}{.Math.}{h}_{\mathrm{ij}}\left(w_{\mathrm{ij}}-z_{\mathrm{ij}}\right).$

(52) An intra-eNodeB handoff occurs when DRU.sub.i and DRU.sub.j belong to different sectors of the same VBS.

(53) (C) Forced Handoff: When a DRU changes its sector, all ongoing calls in the cell have to change their pilot PN offsets for WCDMA. The cost of forced handoff is computed by employing the current sectorization a.sub.ik, which is equal to zero when DRU.sub.i is in Sector.sub.k. Since the cost occurs when DRU.sub.i currently in another sector moves into Sector.sub.k, the cost becomes

(54) $\underset{i}{.Math.}\underset{k}{.Math.}{a}_{\mathrm{ik}}{T}_i{x}_{\mathrm{ik}}.$

(55) The weighted combination of these three handoff cost would be:

(56) 0$\begin{array}{cc}{\mathrm{KPI}}_{\mathrm{HO}}={\left[c_1\underset{i}{.Math.}\underset{j}{.Math.}{h}_{\mathrm{ij}}{z}_{\mathrm{ij}}+c_2\underset{i}{.Math.}\underset{j}{.Math.}{h}_{\mathrm{ij}}\left(w_{\mathrm{ij}}-z_{\mathrm{ij}}\right)+c_3\underset{i}{.Math.}\underset{k}{.Math.}{a}_{\mathrm{ik}}{T}_i{x}_{\mathrm{ik}}\right]}^{-1}& \left(3\right)\end{array}$

(57) (3) KPI.sub.CI(Inverse of the Compactness Index): The object here is to minimize the length of handoff border with the compactness index CI. In Equation (4) the numerator term represents the number of handoff DRU sides between two different sectors.

(58) $\begin{array}{cc}{\mathrm{KPI}}_{\mathrm{CI}}={\left[\mathrm{CI}\right]}^{-1}={\left[\frac{\underset{i}{.Math.}\underset{i\prec j}{.Math.}{w}_{\mathrm{ij}}{B}_{\mathrm{ij}}}{\underset{i}{.Math.}\underset{i\prec j}{.Math.}{B}_{\mathrm{ij}}}\right]}^{-1}& \left(4\right)\end{array}$

(59) Where B.sub.ij=1, if DRU.sub.i and DRU.sub.j are adjacent.

(60) Now consider the following constraints required in the formulation included in various embodiments of the invention:

(61) 1. each DRU has to belong to a sector, that is,

(62) $\begin{array}{cc}\underset{k}{.Math.}{x}_{\mathrm{ik}}=1\mathrm{for}\mathrm{all}i& \left(5\right)\end{array}$

(63) 2. The relationship between any two DRUs in a Sector.sub.k has to satisfy w.sub.ijk=1 if and only if x.sub.ik=x.sub.jk=1. Thus:
w.sub.ijk≦x.sub.ik, w.sub.ijk≦x.sub.jk and w.sub.ijk≧x.sub.ik+x.sub.jk−1 for all i,j and k  (6)

(64) 3. The relationship between two DRUs in a VBS.sub.m. z.sub.ijm=1 if and only if y.sub.im=y.sub.jm=1 which leads to:
z.sub.ijm≦y.sub.im, z.sub.ijm≦y.sub.jm and z.sub.ijm≧y.sub.im+y.sub.jm−1 for all i,j and k  (7)

(65) 4. Connected sectorization, if a sector has more than one DRU, then the DRUs of the sector have to be connected. For the formulation of connected sectors we employ the cut theorem on SOD.sub.k. If Sector.sub.k is connected, then any cut that separates cells in SOD.sub.k has at least one common side of the hexagonal cells. Let S1.sub.k be a proper subset of SOD.sub.k, that is, S1.sub.k⊂SOD.sub.k, S1.sub.k≠φ, and S1.sub.k≠SOD.sub.k. Also let S2.sub.k be the opposite set of S1.sub.k, that is, S2.sub.k=SOD.sub.k−S1.sub.k. Because two subsets are connected, there exists at least one common side of the DRUs separated by the subsets. In other words:

(66) $\begin{array}{cc}\underset{i\in S{1}_k}{.Math.}\underset{j\in S{2}_k}{.Math.}{B}_{\mathrm{ij}}\ge 1& \left(8\right)\end{array}$

(67) Now, the QoS function is the weighted combination of three KPIs (cost factors) which have already been introduced, above. Obviously the objective function is to maximize the QoS function. There are penalties of blocked calls by hard and soft capacities and handoff calls. The DRU sectorization can be formulated as the following mixed integer linear programming:

(68) $\begin{array}{cc}\mathrm{Minimize}{\mathrm{QoS}}^{-1}=w_1.Math.{\mathrm{KPI}}_{\mathrm{BC}}^{-1}+w_2.Math.{\mathrm{KPI}}_{\mathrm{HO}}^{-1}+w_3.Math.{\mathrm{KPI}}_{\mathrm{CI}}^{-1}\mathrm{Subject}\mathrm{to}\text{:}\underset{k}{.Math.}{x}_{\mathrm{ik}}=1\mathrm{for}\mathrm{all}i\begin{array}{c}{w}_{\mathrm{ijk}}\le x_{\mathrm{ik}},\\ w_{\mathrm{ijk}}\le x_{\mathrm{jk}}\mathrm{and}{w}_{\mathrm{ijk}}\ge x_{\mathrm{ik}}+x_{\mathrm{jk}}-1\end{array}\mathrm{for}\mathrm{all}i,j\mathrm{and}k{w}_{\mathrm{ij}}=1-\underset{k}{.Math.}{w}_{\mathrm{ijk}}\mathrm{for}\mathrm{all}i,j{y}_{\mathrm{im}}=\underset{k\in {\mathrm{SOS}}_m}{.Math.}{x}_{\mathrm{ik}}\mathrm{for}\mathrm{all}m\begin{array}{c}{z}_{\mathrm{ijm}}\le y_{\mathrm{im}},\\ z_{\mathrm{ijm}}\le y_{\mathrm{jm}}\mathrm{and}{z}_{\mathrm{ijm}}\ge y_{\mathrm{im}}+y_{\mathrm{jm}}-1\end{array}\mathrm{for}\mathrm{all}i,j\mathrm{and}m{z}_{\mathrm{ij}}=1-\underset{k}{.Math.}{z}_{\mathrm{ijk}}\mathrm{for}\mathrm{all}i,j\underset{i\in S{1}_k}{.Math.}\underset{j\in S{2}_k}{.Math.}{B}_{\mathrm{ij}}\ge 1\mathrm{for}\mathrm{all}S{1}_k.Math.{\mathrm{SOD}}_k\mathrm{where}S{1}_k\ne \varphi \mathrm{and}S{1}_k\ne {\mathrm{SOD}}_k\mathrm{and}S{2}_k={\mathrm{SOD}}_k-S{1}_k{h}_{\mathrm{ij}}=p_{\mathrm{ij}}{T}_i\mathrm{for}\mathrm{all}i\mathrm{and}j{\mathrm{hc}}_m=\underset{i}{.Math.}{T}_i{y}_{\mathrm{im}}-{\mathrm{HC}}_m\mathrm{for}\mathrm{all}m{\mathrm{sc}}_k=\{\begin{array}{cc}0& \mathrm{if}\underset{i}{.Math.}{T}_i{x}_{\mathrm{ik}}<{\mathrm{SC}}_k\\ \underset{i}{.Math.}{T}_i{x}_{\mathrm{ik}}-{\mathrm{SC}}_k& \mathrm{otherwise}\end{array}\mathrm{for}\mathrm{all}k{x}_{\mathrm{ik}},w_{\mathrm{ijk}},z_{\mathrm{ijm}},P_k\in \left\{0,1\right]\mathrm{for}\mathrm{all}i,j,k\mathrm{and}m& \left(9\right)\end{array}$

(69) Note that many grouping problems which are special cases of the sectorization problem are well-known NP-hard problems. Since our problem is NP hard, the time it takes to execute the algorithm is exponentially increasing with the size of the problem. Such an algorithm is thus in most cases unusable for real-world size problem. As an encouraging result on NP-hard problems, we investigate evolutionary algorithms to solve the sectorization problem and compare the performance with the solutions obtained by the mixed integer programming.

(70) Evolutionary Algorithm

(71) Evolutionary algorithms have been used to solve difficult optimization problems. Some embodiments employ evolutionary algorithms to optimize the network traffic in the system. Candidate solutions to an optimization problem are represented as individuals in the population. Evolutionary Algorithms (EAs) are inspired by the theory of biological evolution. In EAs the cost function value of a candidate solution to the optimization problem indicates the fitness of the individual in the concept of natural selection. In the following, two types of Evolutionary algorithms are discussed in relation to solving the problem formulated above: Genetic Algorithm and Estimation Distribution Algorithm.

(72) A. Genetic Algorithm (GA)

(73) GAs are stochastic search methods that mimic genetic phenomena such as gene recombination, mutation and survival of the fittest. GAs have been applied to a large number of scientific and engineering problems, including many combinatorial optimization problems in networks. GAs operate on a set of candidate solutions, called a population. Each solution is typically represented by a string, called a chromosome. Each chromosome is assigned a fitness value that measures how well the chromosome solves the problem at hand, compared with other chromosomes in the population. From the current population, a new population is generated typically using three genetic operators: selection, crossover and mutation. Chromosomes for the new population are selected randomly (with replacement) in such a way that fitter chromosomes are selected with higher probability. For crossover, survived chromosomes are randomly paired, and then two chromosomes in each pair exchange a subset of their strings to create two offspring. Chromosomes are then subject to mutation, which refers to random flips of the string's element applied individually to each of the new chromosomes. The process of evaluation, selection, crossover and mutation forms one generation in the execution of a GA. The above process is iterated with the newly generated population successively replacing the current one. The GA terminates when a certain stopping criterion is reached, e.g., after a predefined number of generations. There are several aspects of this problem suggesting that a GA-based method may be a promising candidate and are thus used in some embodiments: GA has proven to work well if the space to be searched is large, but known not to be perfectly smooth, or if the space is not well understood, and if finding a global optimum is not critical. In general, they use a penalty function to encode problem constraints and allow a search for illegal solutions, e.g., a solution that violates the connectedness or compactness of DRUs in this sectorization problem. Allowing a search for illegal solutions may prevent falling down into a local minimum and generate a better solution. During each generation of the GAs individuals in the current population are rated for their fitness as domain solutions. The fitness value is based on the objective function value of Equation (9).

(74) In general, conventional GAs can be characterized by parameters and notations
(I.sub.s,F,Δ.sub.l,η.sub.l,β.sub.l,P.sub.s,Pc,Pm,I.sub.Ter)  (10)
where 1) I.sub.s is the space of all potential solutions (entire search space of chromosomes). 2) F denotes a fitness function. 3) Δ.sub.l is the set of chromosomes (population) at the l.sub.th generation. 4) η.sub.i is the set of best candidate solutions selected from set Δ.sub.l at the l.sub.th generation. 5) We denote β.sub.l≡Δ.sub.l−η.sub.l≡Δ.sub.l∩η.sub.l.sup.C. where η.sub.l.sup.C is the complement of η.sub.l. 6) p.sub.s is the selection probability. The GA algorithm selects p.sub.s|Δ.sub.l| individuals from set Δ.sub.l to make up set η.sub.l. 7) Pc is the crossover probability. In the uniform crossover process two chromosomes are randomly chosen with a probability Pc and genes are exchanged with a rate CR. 8) Pm is the mutation probability. For the mutation a gene is randomly chosen with a probability Pm and the value of the gene is changed. 9) I.sub.Ter are the maximum number of generation.

(75) In conventional GAs, each chromosome is designated by a string of different gene with length n (n-dimensional vector). A typical GA is described in the following steps: Step 0: Generate initial population Δ.sub.0. The initial population (|Δ.sub.0|chromosomes) is typically obtained by sampling according the uniform (equally likely) distribution. Step 1: Evaluate the chromosomes in the current population Δ.sub.l-1 according to the fitness function F. Sort the candidate solutions (chromosomes in the current population) according to their fitness orders. Step 2: If the best candidate solution satisfies the convergence criterion or the number of iterations exceeds its limit I.sub.Ter, then terminate; else go to step 3. Step 3: Select the best p.sub.sΔ.sub.l-1 candidate solutions (chromosomes) from current population Δ.sub.l-1. This selection is accomplished according to the sorted candidate solutions. Step 4: Perform uniform crossover and flipping mutation and then generate new |Δ.sub.l-1|−|η.sub.l-1| chromosomes on the basis of these performing. Replace the bad |β.sub.l-1| chromosomes with newly generated |Δ.sub.l-1|−|η.sub.l-1| chromosomes. Step 5: Go to step 1 and repeat the steps

(76) B. Estimation Distribution Algorithm (EDA)

(77) Unlike other evolutionary algorithms, in EDA a new population of individuals in each generation is generated without crossover and mutation operators. Instead, in EDA a new population is generated based on a probability distribution, which is estimated from the best selected individuals of previous generation. We introduce each main-vector as an individual for the EDA approach to embodiments of the present invention, and also the fitness function is objective function. In general, conventional EDAs can be characterized by parameters and notations
(I.sub.s,F,Δ.sub.l,η.sub.l,β.sub.l,p.sub.s,Γ,I.sub.Ter)  (11)
where 1) I.sub.s is the space of all potential solutions (entire search space of individuals). 2) F denotes a fitness function. 3) Δ.sub.l is the set of individuals (population) at the l.sub.th generation. 4) η.sub.l is the set of best candidate solutions selected from set Δ.sub.l at the l.sub.th generation. 5) We denote β.sub.l≡Δ.sub.1−η.sub.l≡Δ.sub.l∩η.sub.l.sup.C. where η.sub.l.sup.C is the complement of η.sub.l. 6) p.sub.s is the selection probability. The EDA algorithm selects p.sub.s|Δ.sub.l| individuals from set Δ.sub.l to make up set η.sub.l. 7) We denote by Γ the distribution estimated from η.sub.l (the set of selected candidate solutions) at each generation. 8) I.sub.Ter are the maximum number of generation

(78) In conventional EDAs, each individual is designated by a string. A typical EDA is described in the following steps: Step 0: Generate initial population Δ.sub.0. The initial population (|Δ.sub.0| individuals) is typically obtained by sampling according the uniform (equally likely) distribution:

(79) $\begin{array}{cc}p\left({\theta }_1,{\theta }_2,\mathrm{.Math.},{\theta }_n\right)=\underset{i=1}{\overset{n}{.Math.}}{p}_i\left({\theta }_i\right),\forall i=1,2,\mathrm{.Math.},n,\mathrm{and}{p}_i\left({\theta }_i=S_{11}\right)=p_i\left({\theta }_i=S_{21}\right)=\mathrm{.Math.}=p_i\left({\theta }_i=S_{.Math.{\mathrm{SOS}}_M.Math.M}\right)=\frac{1}{\underset{n=1}{\overset{M}{.Math.}}.Math.{\mathrm{SOS}}_n.Math.}& \left(12\right)\end{array}$
For generation l=1, 2, . . . , follow steps 1 through 6 Step 1: Evaluate the individuals in the current population Δ.sub.l-1 according to the fitness function F. Sort the candidate solutions (individuals in the current population) according to their fitness orders. Step 2: If the best candidate solution satisfies the convergence criterion or the number of generation exceeds its limit I.sub.Ter, then terminate; else go to step 3. Step 3: Select the best p.sub.sΔ.sub.l-1 candidate solutions (individuals) from current population Δ.sub.l-1. This selection is accomplished according to the sorted candidate solutions. Step 4: Estimate the probability distribution p(θ.sub.1,θ.sub.1, . . . , θ.sub.n) on the basis of |η.sub.l-1| best candidate solutions. This estimation is denoted by
Γ=P(θ.sub.1,θ.sub.2, . . . ,θ.sub.n|η.sub.l-1)  (13) Step 5: Generate new |Δ.sub.l-1|−|η.sub.l-1| individuals on the basis of this new estimated probability distribution Γ. Replace the bad |β.sub.l-1| individuals with newly generated |Δ.sub.l-1|−|η.sub.l-1| individuals. Step 6: Go to step 1 and repeat the steps

(80) Embodiments of the present invention follow the steps of the above pseudo code in the EDA implementations. For estimation, a simple scheme of estimating the marginal distributions separately is used, and using product form

(81) $\begin{array}{cc}=p\left({\theta }_1,{\theta }_2,\mathrm{.Math.},{\theta }_n|{\eta }_{l-1}\right)\underset{i=1}{\overset{n}{.Math.}}{p}_i\left({\theta }_i|{\eta }_{l-1}\right)=\underset{i=1}{\overset{n}{.Math.}}\left(\frac{\underset{j=1}{\overset{.Math.{\eta }_{l-1}.Math.}{.Math.}}\delta \left(x_i^j={\theta }_i|{\eta }_{l-1}\right)}{.Math.{\eta }_{l-1}.Math.}\right)& \left(14\right)\end{array}$
Where δ is an indicator function and it can be expressed as

(82) $\begin{array}{cc}\delta \left(x_i^j=\theta |{\eta }_{l-1}\right)=\{\begin{array}{cc}1& \mathrm{if}{x}_i^j=\theta \\ 0& \mathrm{otherwise}\end{array}& \left(15\right)\end{array}$

(83) The efficiency of the three algorithms for the DRU sectorization problem has been analyzed in accordance with various embodiments of the present invention. Traffic is assumed uniformly distributed over the DRUs. The number of VBSs and sectors are assumed as in Table I. The possible number of sectorizations increases exponentially with the number of DRUs. The performance of proposed algorithms will be investigated by comparing with each other and optimal solutions of the formulation.

(84) The cost coefficients employed for the objective function in Equation (9) are w.sub.1=w.sub.3=10, w.sub.21, c.sub.1=2, and c.sub.2=c.sub.3=1. Higher weights are given to w.sub.1 and w.sub.5, in order to minimize the blocked calls by hard and soft capacity and CI is the first priority in the sectorization. The weight by the inter-eNodeB handoff w.sub.1 is twice that of the intra-eNodeB handoff w.sub.2 because handoff between two sectors on the same eNodeB can be handled entirely within that eNodeB, while handoff between two eNodeBs involves not only those eNodeBs, but also the MME and S-GW as well; this latter case is much more expensive, since it involves more signaling, more processing, more coordination, and more time. However, since the forced handoff only occurs at the beginning of sectorization period, equal weights are given to w.sub.2 and w.sub.3. Presented are the optimal solutions for the 19, 37 and 61 DRUs problems using MATLAB simulations to validate the performance of certain embodiments.

(85) Parameters for Algorithms

(86) Before investigating the performance of the algorithms for the sectorization problem, declared are tunings of the algorithms parameters.

(87) In GA Algorithm, each gene in a chromosome represents the sector and VBS to which the corresponding DRUs belong. We denote by a row vector X=(x.sub.1, x.sub.2, . . . , x.sub.n), x.sub.lε{S.sub.jk|j=1, . . . , |SOS.sub.k|, k=1, . . . M}, i=1 . . . n as a chromosome where x.sub.j=S.sub.jk means DRU.sub.i belongs to VBS.sub.k and Sector.sub.j. A GA maintains a population of chromosomes in each generation. We denote by |Δ.sub.l| the number of chromosomes in population Δ.sub.l. Where superscript j in the row vector) X.sup.j=(x.sub.1.sup.j, x.sub.2.sup.j, x.sub.3.sup.j, . . . , x.sub.n.sup.j) indexes an individual in the population. In the uniform crossover process two chromosomes are randomly chosen with a probability P.sub.c=0.9 and gene are exchanged with a rate 0.4. For the mutation a gene is randomly chosen with a probability P.sub.m=0.1 and the value of the gene is changed, that is, the DRU changes its sector. The selection probability is P.sub.s=0.5.

(88) In EDA Algorithm, each individual is designated by a string, members of which are taken from the set S, i.e. {s.sub.jk|j=1, . . . , |SOS.sub.k|, k=1, . . . , M} with length n (n-dimensional vector) where S.sub.jk means DRU.sub.i belongs to VBS.sub.k and Sector.sub.j. Each member in an individual represents the sector and VBS to which the corresponding DRUs belong. We denote by a row vector X=(x.sub.1, x.sub.2, . . . , x.sub.n), x.sub.iεS, i=1 . . . n as an individual. An EDA maintains a population of individuals in each generation. We denote by |Δ.sub.1| the number of individuals in population Δ.sub.l. Where superscript j in the row vector X.sup.j=(x.sub.1.sup.j, x.sub.2.sup.j, x.sub.3.sup.j, . . . , x.sub.n.sup.j) indexes an individual in the population. The selection probability is P.sub.s=0.5.

(89) Generating the Initial Population

(90) Generally in both algorithms, the initial population is chosen randomly from set S with uniform distribution. It should be noted that it is possible to get all infeasible solutions or very small number of feasible solutions when the size of the population in GA or EDA is much smaller than the size of the whole search space. To overcome this problem, it is necessary to have some percentage (e.g., x %) of the initial population to be exactly in the form of sectorizing, on which the algorithm will be applied. In our algorithms we consider x=30.

(91) Performance of the Algorithms

(92) Referring to FIGS. 4A, 4B, 5A, 5B, 6A, and 6B, we now consider three benchmarking problems illustrating various techniques and results according to some embodiments. In these cases, for the traffic distribution, we use an Erlang distribution with average traffic of 50 for all problems. We found the optimal solutions of the 19 DRU problem using MATLAB to validate the performance of the heuristics. We terminate the algorithms after 35, 200 and 200 generations in 19_DRU (FIGS. 4A and 4B), 37_DRU (FIGS. 5A and 5B) and 61_DRU (FIGS. 6A and 6B) scenarios, respectively. We define the convergence rate to be the number of times an optimal (or best found for the 37 and 61 DRUs problems) solution is obtained over the overall number of generations performed. Each of the examples shown, e.g. FIGS. 4A, 4B, 5A, 5B, 6A, and 6B, represent just one example problem and solution with respect to a certain size and scale of a number of DRUs to be balanced. These are merely just examples, as it should be clearly seen that many of the characteristics in each example can vary, e.g., the number of calls within each DRU, the number of DRUs initially in a sector, the number of sectors within each VBS, the number of VBSs, the soft capacity of each sector, and the like, all of which are possible according to some embodiments. Table I shows a brief summary of the different scenarios presented in FIGS. 4A, 4B, 5A, 5B, 6A, and 6B:

(93) TABLE-US-00001 TABLE I Description of three benchmarking examples 19_DRUs 37_DRUs 61_DRUs Number of DRUs 19 37 61 Number of VBSs/eNBs 2 3 4 Number of Sectors 6 9 12

(94) For the 19_DRU problem, for example, as shown in FIGS. 4A and 4B, the evaluation QoS values of the old and the new groupings at times t and t+1 are 1.1*10.sup.−3(KPI.sub.BC.sup.−1=90, KPI.sub.HO.sup.−1=0, CI=22/42) and 3.488*10.sup.−3 (KPI.sub.BC.sup.−1=0, KPI.sub.HO.sup.−1=155, CI=23/42) as shown in FIG. 4A. The key 400 shows two VBSs with 3 sectors each in order to constitute the 19-cell DRU configuration as shown. We find an optimal solution with evaluation value of 286.904 using MATLAB with execution time=8.64*10.sup.5 CPU seconds (around 9 days). The convergence rate of the EDA to this optimal solution is 0.93 (over 200 generations) with 0.082 CPU seconds while the convergence rate of GA is 0.89 (over 200 generations) with 0.0901 CPU seconds (cross-reference to FIG. 7.). The resulting optimal solution is shown in FIG. 4B.

(95) For the 37_DRU problem, for example, as shown in FIGS. 5A and 5B, the evaluation QoS values of the old and the new groupings at times t and t+1 are 0.5*10.sup.−3(KPI.sub.BC.sup.−1=177, KPI.sub.HO.sup.−1=0, CI=56/90) and 2.4*10.sup.−3(KPI.sub.BC.sup.−1=7, KPI.sub.HO.sup.−1=194, CI=56/90) as shown in FIGS. 5A and 5B. The key 500 shows three VBSs with 3 sectors each in order to constitute the 37-cell DRU configuration as shown. This problem may be computational intensive, so we compare the performance of the EDA and the GA using convergence rate within limited CPU time. The convergence rate of the EDA to the best found solution is 0.87 with 0.1532 CPU seconds while the convergence rate of GA is 0.50 with 0.169 CPU seconds (cross-reference to FIG. 8.). The resulting improved solution is shown in FIG. 5B.

(96) For the large 61_DRU problem, for example, as shown in FIGS. 6A and 6B, the evaluation QoS values of the old and the new groupings at times t and t+1 are 0.77*10.sup.−3(KPI.sub.BC.sup.−1=128, KPI.sub.HO.sup.−1=0, CI=89/156) and 2.8*10.sup.−3(KPI.sub.BC.sup.−1=13, KPI.sub.HO.sup.−1=105, CI=77/156) as shown in FIGS. 6A and 6B. The key 600 shows four VBSs with 3 sectors each in order to constitute the 61-cell DRU configuration as shown. This problem may also be computational intensive, so we compare the performance of the EDA and the GA using convergence rate within limited CPU time. The convergence rate of the EDA to the best found solution is 0.88 with 0.2815 CPU seconds while the convergence rate of GA is 0.49 with 0.3012 CPU seconds (cross-reference to FIG. 9.).

(97) FIGS. 7, 8 and 9 show example performance results using EDA and GA algorithms according to some embodiments. The results may show that not only does EDA significantly outperform GA in its convergence rate to the best solution, but also even the non-optimal solutions are much closer to the best solution as compared to GA. However, in both cases, the DRUs are significantly more efficient and better balanced than if no techniques according to embodiments were performed at all.

(98) Specifically, referring to FIG. 7, chart 700 shows the quality of service (QoS %) metric between the EDA and GA algorithms for the 19-DRU problem, for example as discussed in FIGS. 4A and 4B. In this case, both EDA and GA algorithms seem to reach the same level of QoS, but GA seems to reach it quicker through an earlier number of generations. Chart 710 shows a number of block calls metric between the EDA and GA algorithms for the 19-DRU problem. As shown, the number of blocked calls is virtually eliminated by implementing techniques of some embodiments. Chart 720 shows the number of handoffs occurring using both EDA and GA algorithms. Here, both algorithms generally result in an 80% reduction, or a five-fold improvement, in the number of handoffs compared to using no techniques according to embodiments of the present invention.

(99) Referring to FIG. 8, chart 800 shows the quality of service (QoS %) metric between the EDA and GA algorithms for the 37-DRU problem, for example as discussed in FIGS. 5A and 5B. In this case, the EDA algorithm seem to reach a higher level of QoS, while it can be clearly seen that both methods drastically improve the QoS compared to if no techniques were performed. Chart 810 shows a number of block calls metric between the EDA and GA algorithms for the 37-DRU problem. As shown, the number of blocked calls is drastically reduced by implementing techniques of some embodiments. Chart 820 shows the number of handoffs occurring using both EDA and GA algorithms. Here, both algorithms generally result in an 75% reduction, or a four-fold improvement, in the number of handoffs compared to using no techniques according to embodiments of the present invention.

(100) Referring to FIG. 9, chart 900 shows the quality of service (QoS %) metric between the EDA and GA algorithms for the 61-DRU problem, for example as discussed in FIGS. 6A and 6B. In this case, the EDA algorithm seem to reach a higher level of QoS, while it can be clearly seen that both methods drastically improve the QoS compared to if no techniques were performed. Chart 910 shows a number of block calls metric between the EDA and GA algorithms for the 61-DRU problem. As shown, the number of blocked calls is drastically reduced by implementing techniques of some embodiments, although the EDA algorithm seems to result in even fewer blocked calls. Chart 920 shows the number of handoffs occurring using both EDA and GA algorithms. Here, both algorithms generally result in a 93% reduction, or a fourteen-fold improvement, in the number of handoffs compared to using no techniques according to embodiments of the present invention.

(101) Obviously, these two algorithms are highly likely to yield a better solution if the algorithm runs more generations. Also, with the same number of generation, the algorithms are likely to produce a better solution if a larger population size is used in each generation. There is a tradeoff between the population size and the number of generation required to achieve a specified performance of the final solution. FIGS. 10, 11 and 12 show this trade off in three different scenarios solved using EDA. Specifically, FIG. 10 corresponds to the 19-DRU problem, FIG. 11 corresponds to the 37-DRU problem, and FIG. 12 corresponds to the 61-DRU problem. One can use this trade off to configure the algorithms to available hardware; e.g., for hardware with a large memory, a large population size is suitable.

(102) Referring to FIG. 13, flowchart 1300 shows an example methodology according to some embodiments. These descriptions may be consistent with any of the previous figures and descriptions discussed herein. The steps in flowchart 1300 may be implemented by various components discussed in FIG. 1, for example.

(103) At block 1302, in some embodiments, the method may provide a DAU associated with a plurality of sectors of a base station. Examples of this provisioning may be shown in FIG. 1, for example. At block 1304, the method may provide a plurality of DRUs associated with the DAU. The DRUs may be located in physically distinct areas from each other, such as what is illustrated in FIGS. 1, 2A, 2B, and 3.

(104) At block 1306, the plurality of DRUs may be partitioned into a plurality of DRU sectors. In some embodiments, the DRU sectors may each be associated with a distinct sector of the base station. In some embodiments, a plurality of base stations may be provided, wherein each base station has a plurality of sectors. In some embodiments, the DRUs may be partitioned into connected sectors. In some embodiments, the partitions may be substantially compact. The descriptions may be consistent with the concepts discussed in FIGS. 2A, 2B and 3, for example.

(105) At block 1308, at least one system metric for traffic conditions may be measured. The system metric may be associated with the plurality of DRU sectors. In some embodiments, the at least one system metric may be a number of blocked calls in the DRU sector. In some embodiments, the at least one system metric may be a number of handoffs occurring along the border of the DRU sector. In some embodiments, the at least one system metric may be a QoS measurement.

(106) At block 1310, the at least one system metric may be compared to a predetermined threshold. For example, the threshold may be 200 calls in a DRU sector, consistent with examples discussed in FIGS. 2A, 2B, and 3. Clearly, other thresholds may be used, including those discussed in relation to any of the other figures in the present disclosures.

(107) At block 1312, it may be determined whether the at least one system metric is greater than the predetermined threshold. For example, the present number of total calls may be determined to be higher than the threshold 200 calls. If it is determined to be greater than the threshold, the method may iterate through the flowchart 1300 again, cycling back to block 1306. In the next iteration, the partitioning in block 1306 may be different than before. In some embodiments, the partitioning may be made according to an optimization algorithm, for example, any of the algorithms described in the present disclosures.

(108) If it is determined that the system metric is lower than the threshold, then the method may end, for it may be determined that the system is in a balanced or properly sectorized state. In some embodiments, the method may continue to monitor traffic, and may cycle back to block 1306 whenever it is determined that the at least one system metric is greater than the predetermined threshold. It should be noted that the example method illustrated in FIG. 13 is suitable for repartitioning in order to drive the system metric to a level below the predetermined threshold. An example could be dynamic repartitioning through iteration to reduce the number of blocked calls to zero. In other implementations, repartitioning can be performed to drive the system metric to a value greater than a predetermined threshold. An example could be the QoS, which can be increased as iteration is performed to reparation the DRU sectors. It will be appreciated that the inverse of the metric could also be employed depending on whether the comparison in process 1312 is that the metric is greater than or less than the threshold. One of ordinary skill in the art would recognize many variations, modifications, and alternatives.

(109) Various examples have been described. These and other examples are within the scope of the following claims.