WO2011046704A2 - Self-optimizing wireless network - Google Patents

Self-optimizing wireless network Download PDF

Info

Publication number
WO2011046704A2
WO2011046704A2 PCT/US2010/048927 US2010048927W WO2011046704A2 WO 2011046704 A2 WO2011046704 A2 WO 2011046704A2 US 2010048927 W US2010048927 W US 2010048927W WO 2011046704 A2 WO2011046704 A2 WO 2011046704A2
Authority
WO
WIPO (PCT)
Prior art keywords
modification
optimizing
modifications
groups
sectors
Prior art date
Application number
PCT/US2010/048927
Other languages
French (fr)
Other versions
WO2011046704A3 (en
Inventor
Osama Hussein
Aiman Shabsigh
Original Assignee
Reverb Networks
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 Reverb Networks filed Critical Reverb Networks
Priority to EP10823800.7A priority Critical patent/EP2489160B1/en
Priority to CA2777677A priority patent/CA2777677A1/en
Publication of WO2011046704A2 publication Critical patent/WO2011046704A2/en
Publication of WO2011046704A3 publication Critical patent/WO2011046704A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • H04W24/02Arrangements for optimising operational condition
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18Network planning tools

Definitions

  • the present invention generally relates to planning and optimization for a wireless network.
  • the present invention relates to a system that monitors network performance, and makes changes to network parameters to enhance performance.
  • Network planning of a wireless network relies on static approaches for site locations and dimensioning of the radio resources to meet specified traffic demand at busy hours, in a wireless network, a large number of base stations (i.e., cell sites) can be served by one or more antennas.
  • the base station hardware will send a radio frequency signal to the antennas, which wilt typically be placed on towers or buildings.
  • Each antenna i.e., sector
  • different types of services can be provided (e.g., voice and data services).
  • the coverage area provided by an antenna is determined by antenna
  • Antenna configurations are, for example, the antenna horizontal pointing direction, the azimuth beaniwidih of the antenna, and down tilt angle of the antenna. Modifying these antenna configurations will change the area the antenna is serving (i.e., coverage area) and possibly areas served by other surrounding antennas,
  • Input power i.e., the power sent from the base station or cell site
  • Input power will also affect the coverage of the antenna as well as the interference ihat impacts the coverage areas of neighboring antennas. For example, if an antenna's input power is increased, the coverage area of the antenna may increase as well, thereby causing interference to the coverage area of a neighboring antenna and affecting the quality of service in that neighboring antenna's coverage area.
  • the radio signal quality is better, due to good network planning and performance, higher data rates for voice and data services can be achieved without consuming too many radio power resources.
  • Network planning and optimization is a process of finding the best configuration of the wireless network so as to maximize performance of the network. This process typically starts with an already working wireless network, and then calculations and analysis are done by engineers using software and hardware tools and extensive simulations for the network. Once a better configuration is determined, the new configuration will be manually implemented in the network.
  • An embodiment of the invention is directed to a method for optimizing a plurality cell sites or sectors in a wireless network, the plurality of cell sites or sectors being determined to be within a critical zone of the wireless network where communication has been degraded and needing optimization.
  • the method includes calculating modifications to a plurality of network parameters for optimizing wireless network performance; storing the modifications for optimizing a plurality of network parameters in a modification queue, the modifications being stored within modification groups in the modification queue; evaluating the stored modification groups to determine conflicts between modifications for a same network parameter; and eliminating the conflicts between modifications for the same network parameter within the modification groups.
  • Elimination of a conflict between the modifications in the modification groups includes one of the following; I) canceling all modification groups with conflicting
  • the new modification group is stored in modification queue, and is used for altering at least one network parameter of the critical cell sites or sectors, or of a best neighbor cells sites or sectors for achieving a desired improvement in communications within the wireless network. Altering wireless network parameters of the critical cell sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification groups until, the desired improvement in communications in the wireless network is achieved.
  • the method also includes determining a best previous modification group in the modification queue when performance of the network continues to have degraded performance for a ceil site or sector, which includes: 1 ) determining ali modification groups in the modification queue having a same network parameter most recently modified; and 2 ⁇ determining the modification group with the best previous modification to the same network parameter.
  • the method farther includes identifying cell site or sector for which the degraded condition was detected; and disabling critical cell or sector so that it is no longer considered when determining future modification groups in the modification queue; and re-initialize or recalculating the critical zone.
  • the method includes selecting the best previous modification group in the modification queue, when no critical hour within the critical zone at which the degraded communications occurs is determined; and selecting the best previous modification group in the modification queue, when if the critical cell site or sector in the critical zone has available resources for achieving the desired improvement in communications.
  • the method also includes determining if the criteria lor establishing the critical zone still exist and, if so, continuing to monitor the wireless network for degraded
  • An embodiment of the invention is also directed to program recorded on a computer-readable storage medium for optimizing a plurality eel! sites/sectors in a wireless network.
  • the program causes a computer to execute the features of optimizing method noted above.
  • An em bods niesit of the invention is also directed to a system for optimizing a plurality eel! sites/sectors in a wireless network.
  • the system comprising an optimization apparatus that monitors network data associated with a plurality of cell sites/sectors and perfomis alterations to network parameters wireless network; at least one controiler configured to perform data communications with the optimization apparatus; a least one base station configured to perform data communication with the at least one controller; at least one controllable antenna configured to perform data communication with the at least one base station and a plurality of subscribers distributed in a plurality of coverage areas; and a dynamic load balancing apparatus configured to perform data communication with the optimization apparatus and the at least one controllable antenna.
  • FIG. 1. illustrates a system for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention
  • J f igs. 2A and 2B illustrate a method for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention
  • FIG. 3 illustrates a method for determining a critical zone requiring optimizing of network parameters in accordance with an embodiment of the invention
  • Fig, 4 illustrates a method for determining a best neighbor cell in accordance with an embodiment of the invention.
  • FIG. 5 illustrates an apparatus for optimizing of network parameters in a wireless network in accordance with en embodiment of the invention.
  • Fig. 1 is a system for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention, in particular, the wireless network 100 illustrated in Fig. I includes a network optimization apparatus 101.
  • the wireless network 100 refers to any type of computer network that is wireless, and is commonly associated with a telecommunications network whose interconnections are implemented without the use of wires such as with, electromagnetic waves, such as radio waves or the tike as a carrier.
  • the basic components of the wireless network 100 include the network optimization apparatus 101 , one or more controllers 102, and one or more base stations 103 (i.e., cell sites) for supporting data communications between subscribers distributed throughout coverage areas provided by the wireless network 100 via.
  • antennas 105 i.e., sectors
  • a network database 1 i.e., and a dynamic load balancing apparatus 104.
  • connections between the network optimization apparatus 101 and the one or more network controllers 102, the dynamic load balancing apparatus 104 and the network database 1 10 can be wireless, wired or a combination of wireless and wired.
  • connections between the one or more control lers 102 and the one or more base stations 103 can be wireless, wired or a combination of wireless and wired.
  • the network optimization apparatus 101 receives network statistics and the current network configurations from the network, database 1 10 related to the wireless communication system 100 for assisting in the monitoring and optimization performed.
  • the netw ork statistics may include, but are not limited to, key performance Indicators (KPls).
  • KPls key performance Indicators
  • An example of a KP ! is the dropped calls rate, which is the ratio between the failed call s and the total number of calls requested.
  • Another network statistic is the capacity of the network. Capacity can be measured by total number of calls and/or the amount of delivered data in bits or the throughput (overall data rate) in case of data calls.
  • optimization is the number of handovers of end-user equipments between different sectors.
  • User equipment has serving sectors, as the user moves between the coverage areas of different sectors, the serving sector will be changed as other sectors may have better signal quality.
  • the user will have more than one serving sector in the same time as the signal quality of different sectors are close to each other.
  • the number of handovers between different sectors could be used as indicator of how close sectors are to each other, or an indicator to the dependency between different sectors.
  • the neighbor list includes all the potential neighbors for a sector, and it may include neighbor priorities as well.
  • a potential neighbor is a neighbor sector which may provided services to mobile equipment as part of a handover operation when the mobile equipment is traveling between different coverage areas.
  • the neighbor lists of the sectors which are serving the mobile equipment may be arranged to construct one list to be sent to the mobile equipment. The mobi le equipment will use this longer list to search for additional potential neighbors for handover operations.
  • the network optimization apparatus 101 can be a server or other similar computer device capable of executing an algorithm for performing optimization of network parameters in wireless net work. 100. A more detailed discussion of the structure of the network optimization apparatus 101 is noted below with reference to Fig. 5.
  • the controllers 102 illustrated in Fig. 1 are, for example, base station controllers (BSC), which are part of the wireless system infrastructure that control one or more of the base stations 103 and the corresponding coverage areas provided by the base stations 103.
  • BSC base station controllers
  • the plurality of subscribers ⁇ not shown) is distributed within the coverage areas for participating in wireless data communications provided by the wireless network 100 via the antennas 105.
  • the subscribers have user equipment thai may include various types of fixed, mobile, and portable two way radios, cellular telephones, personal digital assistants (PDAs), or other wireless networking devices.
  • PDAs personal digital assistants
  • Each coverage area behaves as an independent sector serving its own set of subscribers.
  • each coverage area can be used by a single base station 103 or plurality of base stations 103 operating each on a different frequency channel.
  • subscribers of a single coverage area are served by a single base station 103 ihat can be a single frequency channel for OS EE 802. i 6e ⁇ 2005 (or UMTS or Ix-EVDO Rev. B and C) or multiple frequency channels that can be supported by
  • IEEE802.16m (or UMTS or 1 xBVDO Rev. B and C).
  • the dynamic load balancing apparatus 104 may also receive subscriber statistics.
  • the dynamic load balancing apparatus 104 includes an algorithm thai analyzes the elate related to the wireless network 100 and sends control signals to the antennas and/or base stations 103 for altering or shaping the coverage areas.
  • the load balancing algorithm may cluster users based on their instantaneous locations or by means of heuristic approaches; collects statistics to validate previous users clustering decisions and/br predicting new traffic patterns: and continuous learns and adaptively shapes the coverage areas and alters network parameters as the environment or traffic density changes with time.
  • network statistics received by the network optimization apparatus can also be provided to the dynamic load balancing apparatus 104.
  • Figs. 2 A and 2B illustrate a method for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention.
  • the self-optimization apparatus 101 can execute an algorithm stored therein for performing optimization ope rati ons .
  • Identification of a critical zone will be discussed in more detail with reference to Fig. 3,
  • the zones will be identified as a group of cell sites/sectors on which the optimization will be preformed. Identification of the zones needing optimization can be based on the critical cell site/sector that has performance problems based on some criteria. Additionally, different areas of the wireless network can be evaluated using different criteria. The criteria can be based on one or more performance metrics of the wireless network over a past period of time and/or one or more predicted performance metrics. These performance metrics can be based on previous performance and configurations as well as previous traffic and predicted traffic.
  • a performance metrics can be for a voice/data service for all services or for weighted services; and can be for the critical cell site/sector only or for the entire critical zone or for overall weighted performance between different cell sites/sectors.
  • the performance metrics can also be for a specific time slot in a day or over a few days, for all times or for overall weighted times, and can be changed automatically or manual ly between different sets of performance metrics based on some criteria. For the criteria that changes automatically between different performance metrics sets, the criteria can be based on past or predicted configurations, performance metrics and/or traffic.
  • a local zone will be identified as the set of the neighbor cell sites/sectors based on some criteria, which can also be based on one or more performance metrics.
  • the performance metric can be based on the cells/sectors dropped call rate (DCR), which has exceeded certain dropped call rate threshold over certain window of time.
  • DCR dropped call rate
  • the performance metric can also be calculated across specific time slots in different time frames. For example, Mondays to Fridays, Mondays only or Mondays to Fridays morning hours.
  • the local zone may contain only the critical cell/sector, direct neighbors of the critical site/sector or the direct neighbors and the neighbors of neighbors or additional levels of neighbors. For each group of overlapped local zones, critical zones will be identified as the union of these overlapped zones. The final critical zones may not include overlapping zones. The zone identification process is run continuously to identify new zones needing optimization.
  • the old and newly identified critical zones can also be ranked based on the criteria used in identifying the critical zones. Based on the available computing resource in the optimization system as well as the rank of the zones, one or more of the critical zones will be chosen, for optimization in serial, parallel or both. When a critical zone is selected for optimization, the optimization will be conducted continuously as performance metric data and configurations arrive to the optimization apparatus,
  • step 201 the self-optimization apparatus 1.01 monitors the wireless network.
  • the self-optimization apparatus 101 monitors performance after implementing recommended configuration modifications.
  • step 202. the network optimization apparatus 101 determines if new network data has been received. If not, then the wireless network will continue to be monitored, as in step 201 ,
  • the network optimization apparatus 101 will determine whether the operating conditions of the cell sites/sectors in the zones have been degraded based on the new data received.
  • the criteria can be based on one or more of performance metrics similar to those noted above for identifying the zones. ' For example, the performance metric can be based on the DCR of cells/sectors in the zones or capacity increases. If performance in the zone has degraded, then in step 204, the previous recommended configuration modifications are removed until the best previous operation state is established.
  • the search for the best previous state is as follows: I.) find all the previous forwarded groups which have the same parameter of the failed configurations and a value equal to the current value of the parameter; and 2) from these found groups, find the best pre vious state.
  • the critical zone is re-calculated or re-initialized which includes: I ) identifying failed cells in a previous section or the cells for which modifications have been forwarded immediately before the performance degradation is detected: and 2) disabling these cells so they are not considered in any future modifications calculations as follows: a) do not include this critical cells in the modification calculations, and b) for other cells, do not consider them when calculating best neighbor; and 3 ) re-initialize or re-calculate the critical zone.
  • step 214 the critical zone creation criteria are checked to see if they are still valid. If the critical zone creation criteria are not valid, then the optimization process ends in 220, However, if the critical zone creation criteria are valid, then the run time for the network optimization process is determined in step 215. In step 2.15, if a run time threshold, is exceeded, then the network optimization process will end at step 220, If the time threshold has not been exceeded, then the network wi l l continue to he monitored in step 201.
  • step 205 it is determined if an observation window has been reached.
  • An observation window is simply a specified time period such a number or days. For example, the optimization apparatus may determine that it is necessary to monitor network data for a certain numbers of clays. If an observation window has not been reached, then the wireless network will continue to be monitored, as in step 201 , However, once the observation window has been reached, performance metrics can he calculated and compared to performance metrics before the previous recommended
  • step 5 206 it is determined if the operating conditions of the cell sites/sectors in the zones have been degraded. If a degraded condition is determined in step 206, then in step 204 the previous recommeiKled configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 21.5 are performed. After step 215, either the wireless network continues to be monitored or in step 220 the optimization process ends, if in step 206 it is 10 determined that the operating conditions of the cell sites/sectors in the zones have not been degraded, then in step 20? it is determined if a critical hour is found. ' The critical hour may be the specific time a zone suffers from a highly degraded condition.
  • step 208 it is determined if the critical cell/sector has enough available resources for the critical hour.
  • the 15 determination of available resources could be based on, but is not limited to, the number of calls which could be additionally served by the critical cell site/sector; how many calls could be averagely served by any used hardware; or how many calls could be averagely served by the unused power. If the number of calls is determined to be less than or gr eater than a
  • step 207 if the critical hour is not found, then in step 204 the previous recommended configuration modifications are removed until the best previous operation, state is established, and steps 213, 214, 215 are performed. After step 215, either the wireless network continues to be monitored or in step 220 the optimization process ends.
  • step 208 if it is determined that the cell site/sector has available resources, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established. For example, load balancing techniques can be used to address the degradation condition in the zone instead. Then, after step 204, steps 2 i 3, 214, 2 i 5 are performed; and either the wireless network continues to be monitored (step 201.) or in 30 step 220 the optimization process ends.
  • a best neighbor cell site/sector is determined for assisting in addressing the degraded condition. For example, from the critical cell sectors/site neighbor list, the top neighbors are determined based on which neighbors sectors/sites have a high number of handovers with the critical cell site/sector; and/or the neighbor cell sectors/cells with antenna beams looking toward the critical site/sector; and/or the neighbor cell sectors/sites which has high available resources,
  • step 210 if no best neighbor site is ⁇ " bund, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 215 are performed. After step 215, either the wireless network continues to be monitored (step 201) or in step 220 the optimization process ends.
  • the search criteria for a best neighbor cell/sector could be modified or made more flexible, for example, to determine neighbor cells/sectors with a lower number of handovers. Found best neighbor cells/sectors could be in the same cell site sector location or different location from the critical cell site/sector. Additionally, there can be different priorities if the neighbor cell sectors/sites are in different cell site/sector location than for neighbor cell sectors/sites in same cell site/sector location. These priorities can be specified using a weighted metrics and the status of whether the neighbor cell sectors/sites is in the same or different cell site/sector.
  • step 21 1 it is determined if the best neighbor cell has adequate available resources for addressing the degraded condition. If the best neighbor cell/sector does not have adequate available resources, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 215 are performed. After step 2.15, either the wireless network continues to be monitored of in step 220 the optimization, process ends. If the best neighbor ceil has adequate available resources for addressing the degraded condition, then configuration modifications are calculated and added to the
  • step 212 when, a zone with .multiple critical sites/cells is detected,
  • step 212 for each critical site/cell, the initial modifications are calculated as follows ' .
  • the modification group B drat the best neighbor cell site/sector antenna down tilt will be decreased and/or the best neighbor cell site/sector transmitted power will be increased, [0061] Because the modifications are calculated independently for each critical site/cell, the modifications groups (e.g., A and B) can. conflict with each other. For example, for a critical cell A, a modification for the neighbor cell X of down tilt of I degree is calculated. At the same time, for a critical cell B, modification for the neighbor cell X of down tilt of 2 degrees is calculated. Cell X is a neighbor eel! for both cells A and 13, and in this case it has two modifications calculated.
  • step in 221 the modification groups (e.g., A and B) are evaluated for conflicts.
  • step 222 if a conflict between modification groups is found, then in step 223 the following analysts is conducted:
  • the corresponding power changes should be related to the final result and not to the sum of the original group powers as each final down tilt has a recommended power change. For example, a final down tilt of I degree has a recommended power change of -1.5d.B no matter what are the original groups' values or sum of the powers.
  • step 224 the new modification group is created and in step 225, the modification group is stored in ihe modification queue for implementation, to the wireless network for improving network performance.
  • the calculated configuration modification could be that, for example, the critical cell, site/sector antenna down tilt will be increased and/or the critical cell site/sector transmitted power will be decreased; the critical cell site/sector antenna pointing direction will be moved away from the neighbor which has more available resources or away from a neighbor cell/sector which has less available resources; and/or the critical cell site/sector antenna beamwidth will be decreased; and/or the critical cell site/sector transmitted power will be decreased to compensate for the increase in gain cased by decreasing beamwidth.
  • the calculated configuration modification could be that, for example, that the best neighbor cell site/sector antenna down tilt will be decreased and/or the best neighbor cell site/sector transmitted power will be increased; the best neighbor cell site/sector antenna pointing direction, will be moved towards the critical cell site/sector; and/or the best neighbor cell site/sector antenna beamwidth will be increased; and/or the best neighbor cell site/sector transmitted power will be increased to compensate for the decrease in gain cased by increasing beamwidth.
  • the recommendations above can be implemented simultaneously or sequentially or with time delay in between or delayed until the next window is reached or until all delayed recommendations are implemented.
  • the wireless network is monitored, as in step 201 , to determine if the recommendation modifications address the degraded condition. Howe ver, in step 222, if there is no conflict between modification groups, then the process will continue to monitor the wireless network, as in step 201 ,
  • the wireless network is monitored (as in step 201. ) to determine if the recommendation modification address the degraded condition.
  • the critical Hour is identified as Hour 9 (as expected from the traffic model)
  • Fig. 3 illustrates a method for determining a critical zone requiring optimizing of network parameters in accordance with an embodiment of the invention.
  • step 301 neighbor lists are collected for a critical cell/sector.
  • the neighbor list includes all the potential neighbor ceil/sectors for a particular a cell/sector, and it may include neighbor priorities as well.
  • a 5 potential neighbor cell/sector is a cell/sector that provides services to mobile equipment as part of a handover operation when the mobile equipment is traveling from one coverage area to another.
  • the neighbor list can be stored in the network database 1 10.
  • the neighbor list can be stored in the network database 1 10 in the form of table- that includes a list of cells and a corresponding list of zones. For each, critical ceil site/sector
  • a local zone will be identified as the set of the neighbor cell sites/sectors based on some criteria, which can also be based on one or more performance metrics.
  • a "cells table” will be formed to contain all the cells in the local zones of all the critical cells/sectors, and it will contain cell id and smip!e election zoneJd - local zone id for each cell.
  • a "simple zone list” "' saves the cheeked/partially checked local zones during the search, and it contains the simple
  • the "cells list” saves the checked/partially checked cells during the search, and it contains the cell id and the corresponding final zone.
  • step 302 the cells table is sorted by simple zone ID and then by cell ID. Initially both, the cells list and simple zone list are empty. For each entry in the cells table the following operation take place.
  • step 303 an X zone reference is determined from the cell list
  • a Y zone reference is determined from the simple zone list based on. finding a zoneJD that matches the zone ID entered for the cell.
  • step 306 it is determined if the Y zone reference is in a critical zone. If both the X zone reference and the Y zone reference are included in a critical zone, then in step 307 it is determined if the X zone reference and the Y zone reference refer to the same zone, if the X zone reference and the Y zone reference also refer to the same zone, then in step 308, the ceUJD is added to this final critical zone, in step
  • step 30 309 it is determined if any ceils in the cells table has been unchecked. If not, the process is ended in step 320. If there are cells in the cells table that have not been cheeked., then the remaining cells in the cells table are checked by returning to step 303.
  • step 307 if the X zone reference and the Y zone reference are referring to the different zones, then a new critical zone is created in step 310.
  • step 31 1 the X zone reference and the Y zone are included in the new final critical zone, the cell list in the database I 10 is updated for the newly created zone (i.e., by cell ID and zone ID) and the zone in the simple zone list is updated for the newly created zone.
  • step 312 the previous zones for the X zone reference and the Y zone reference are removed.
  • the process then returns to step 309 where it is determined if any cells in the cells table has been unchecked, if not, the process is ended in step 320. However, if there are cells in the cells table that have not been checked, then the remaining cells in the cells table are checked by returning to step 303.
  • step 306 if it is determined that the X zone reference is in a critical zone, but the Y zone reference is not, then in step 313 it is determined that the X zone reference is the final critical zone, as in steps 314 and 308, the Y zone reference is added to the final critical zone that includes X. Hie process then returns to step 309 where it is determined if any cel ls in the cells table has been unchecked, if not, the process is ended in step 320. However, if there are cells in the cells table that have not been checked, then the remaining ceils in the cells table are checked by returning to step 303.
  • step 305 if it is determined that the X zone reference is not in a critical zone then in step 315 it is determined if the Y zone reference is in a critical zone. If it is determined that X zone reference is not in a critical zone, but the Y zone reference is in a critical zone, then in step 316, it is determined that the Y zone reference is the final critical zone, as in steps 3.14 and 308, the X zone reference is added to the final critical zone that includes the Y zone reference. " The process then returns to step 309 where it is determined if any cells in the cells table has been unchecked. If not, the process is ended in step 320, However, if there are ceils in the ceils table that have not. been checked, then the remaining cells in the ceils table are checked by returning to step 303,
  • step 315 if it is determined that the X. zone reference is not in a critical zone, and the Y zone reference is not in a critical zone, then in step 3 17, a new critical zone is created that includes the X zone reference and the Y zone reference. Then in steps in steps 314 and 308, the IDs for the newly added zone are added to cell, list and simple zone list and the X zone reference and the Y zone reference are added to a final critical zone. The process then returns to step 309 where it is determined if any cells in the cells table has been, unchecked. If not, the process is ended in step 320. However, if there are cells in the ceils table that have not been checked, then the remaining cells in the cells table are checked by returning to step 303.
  • Fig. 4 illustrates a method for determining a best neighbor cell, in accordance with an embodiment of the invention. As noted above, if a critical cell site/sector does not have adequate available resources, then it is important (for performing network optimization) to determine neighbor cell sites/sectors that can assisting in addressing any degraded conditions
  • the neighbor ceils/sectors are determined based on the cells list table in the database ⁇ 10.
  • the neighbor list is sorted by network statistics.
  • network statistics may include, but are not limited to, key performance Indicators (KPIs).
  • KPIs key performance Indicators
  • An example of a KPi is the dropped caiis rate or handovers, which is the ratio between the failed calls and the total number of calls requested.
  • the network statistics may also include, but are not limited to the following: Exemplary Switch Statistics
  • the neighbor cells are then grouped based on available resources and network statistics.
  • the grouped neighbor cel ls are sorted based on network statistics.
  • the neighbor cells in the first group are raiiked based on their available resources.
  • the top neighbor cell sites/sectors may have a high number of handovers wi th, the critical cell site/sector, or the top neighbor cell sites/sectors may have antenna beams looking toward the critical site/sector.
  • the best neighbor cells/sectors in the group is deiemisned.
  • step 405 the group is determined, as in step 405, which has resources available to address the degraded condition.
  • step 407 recommended modifications to the wireless network are calculated. If the best neighbor is not found, the next group wil l be searched using the same criteria.
  • the calculated configuration modification could be that, for example, the critical cell site/sector antenna down tilt will be increased and/or the critical cell site/sector transmitted power will be decreased; the critical ceil site/sector antenna pointing direction will be moved away from the neighbor which has more available resources or away 5 from a neighbor cell/sector which has less available resources; and/or the critical cell site/sector antenna beamwidth will be decreased; and/or the critical cell site/sector transmitted power will be decreased to compensate for the increase in gain eased by decreasing beamwidth.
  • the calculated configuration modification could be that, for example, that the best neighbor cell site/ sector antenna down tilt will be decreased and/or the
  • site/sector antenna pointing direction will be moved towards the critical cell site/sector and/or the best neighbor cell site/sector antenna beamwidth will be increased; and/or the best neighbor cell site/sector transmitted power will be increased to compensate for the decrease in gain cased by increasing beamwidth.
  • the recommendations above can be implemented simultaneously or
  • fig. 5 is a more detailed description of optimization apparatus 101 for performing the method of self-optimization as previously described with reference to Figs 2-4.
  • the optimization apparatus 101 includes a -memory 501 , a processor 502, user interlace 503, application programs 504, communication interlace 505, and bus 506.
  • the memory 501 can be computer-readable storage medium used to store executable instructions, or computer program thereon.
  • the memory 501 may include a readonly memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), a smart card, a subscriber identity module (SIM), or any other medium from which a computing device can read
  • ROM read only memory
  • RAM random access memory
  • PROM programmable read-only memory
  • EPROM erasable programmable read-only memory
  • SIM subscriber identity module
  • the computer program is also intended to include an algorithm thai includes executable instructions stored in the memory 50.1 that are executable by one or more processors
  • the application programs 504 may also include; but are not limited to, an operating system or any special computer program, that manages the relationship between application software and any suitable variety of hardware that helps to make-up a computer system or computing environment of the self-optimization apparatus 501.
  • General communication between the components in. the self- optimization apparatus 101 is provided via the bus 506.
  • the self-optimization algorithm as described with reference to Figs 2-4 can be stored, for example, in the memory 501 of the self- optimization apparatus 10 i .
  • the user interface 503 allows for interaction between a user and the seif- optimization apparatus 101.
  • the user interface 503 may include a keypad, a keyboard, microphone, and/or speakers.
  • the communication interface 505 provides for two-way data communications from the self-optimization apparatus 101.
  • communication interface 505 may be a digital subscriber line (DSL) card or modem, an integrated services digital network (ISDN) card, a cable modem, or a telephone modem to provide a data communication connection to a corresponding type of telephone line.
  • communication interlace 505 may be a local area network (TAN) card (e.g., for EthernetTM or an Asynchronous Transfer Model (ATM) network) to provide a data
  • the communication: interface 505 may also include peripheral interface devices, such as a Universal Serial Bus (USB) interface, a Personal Computer Memory Card international Association (PCMCIA) interface, and the like.
  • the communication interface 505 also allows the exchange of information across one or more wireless communication networks.
  • Such networks may include cellular or short-range, such as IEEE 802.1.1 wireless local area networks iWLANSK And, the exchange of information may involve the transmission of radio frequency (RP) signals through an antenna (not shown),

Abstract

Optimizing cell sites or sectors in a wireless network includes calculating modifications to a plurality of network parameters for optimizing wireless network performance; evaluating the modification groups to determine conflicts between modifications for a same network parameter: and eliminating the conflicts between modifications for the same network parameter within the modification groups. The modification groups are used to alter at least one network parameter of the critical ceil sites or sectors, or of a best neighbor ceils sites or sectors for achieving a desired improvement in communications within the wireless network. Optimization is further enhanced by determining the best previous modifications to the wireless network when performance continues to be degraded. Altering wireless network parameters of the critical cell sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification groups until die desired improvement in communications in the wireless network is achieved.

Description

SELF-OPTIMIZING WIRELESS NETWORK
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation-in-part of U.S. application serial no. 12/580,604 filed on October 16, 2009, the content of which are fully incorporated, herein by reference,
BACKGROUND OF THE INVENTION
Field of the Invention
[0001 ] The present invention generally relates to planning and optimization for a wireless network. In particular, the present invention relates to a system that monitors network performance, and makes changes to network parameters to enhance performance.
Description of the Related Art
[0002] Network planning of a wireless network relies on static approaches for site locations and dimensioning of the radio resources to meet specified traffic demand at busy hours, in a wireless network, a large number of base stations (i.e., cell sites) can be served by one or more antennas. The base station hardware will send a radio frequency signal to the antennas, which wilt typically be placed on towers or buildings. Each antenna (i.e., sector) serves end-users located in a coverage area. Within a coverage area different types of services can be provided (e.g., voice and data services).
[0003] The coverage area provided by an antenna is determined by antenna
configurations and input power to the antenna. Antenna configurations are, for example, the antenna horizontal pointing direction, the azimuth beaniwidih of the antenna, and down tilt angle of the antenna. Modifying these antenna configurations will change the area the antenna is serving (i.e., coverage area) and possibly areas served by other surrounding antennas,
[0004] Input power (i.e., the power sent from the base station or cell site) to the antenna will also affect the coverage of the antenna as well as the interference ihat impacts the coverage areas of neighboring antennas. For example, if an antenna's input power is increased, the coverage area of the antenna may increase as well, thereby causing interference to the coverage area of a neighboring antenna and affecting the quality of service in that neighboring antenna's coverage area. When the radio signal, quality is better, due to good network planning and performance, higher data rates for voice and data services can be achieved without consuming too many radio power resources.
[0005] Network planning and optimization is a process of finding the best configuration of the wireless network so as to maximize performance of the network. This process typically starts with an already working wireless network, and then calculations and analysis are done by engineers using software and hardware tools and extensive simulations for the network. Once a better configuration is determined, the new configuration will be manually implemented in the network.
[0006] However, network planning and optimization consumes a high amount of human resourees and it is a lengthy process which is done only when needed or periodically with long periods between implementation. And, because this process is manual and lengthy, it is conducted with low frequency, which results in leaving the network or parts of the network without optimization for long periods of time.
[0007] Thus, network resource usage is not maximized and unused available network resources result in significant revenue loss and quality of service is degraded, which affects the end user's overall customer satisfaction. And, since complex coverage areas have more than one critical site/cell, conflicts can exist between recommendations for optimizing wireless networks, and these conflicts can delay the appl ication of the appropriate recommendations for optimizing wireless network performance. Finally, for more effective optimization of a network, it would be helpful to determine the best previous modifications to the wireless network when performance continues to be degraded.
SUMMARY OF THE INVENTION
[0008] Therefore, it would be useful to implement an automated system for network planning and optimization that adjusts radio resources and network parameters to maximize overall wireless network performance, while avoiding conflicts between recommendations for optimizing the wireless network. Additionally, it would be useful to determine the best previous modification to the wireless network when performance continues to be degraded in order to facilitate wireless network optimization.
[0009] An embodiment of the invention is directed to a method for optimizing a plurality cell sites or sectors in a wireless network, the plurality of cell sites or sectors being determined to be within a critical zone of the wireless network where communication has been degraded and needing optimization. The method includes calculating modifications to a plurality of network parameters for optimizing wireless network performance; storing the modifications for optimizing a plurality of network parameters in a modification queue, the modifications being stored within modification groups in the modification queue; evaluating the stored modification groups to determine conflicts between modifications for a same network parameter; and eliminating the conflicts between modifications for the same network parameter within the modification groups.
[0010] Elimination of a conflict between the modifications in the modification groups includes one of the following; I) canceling all modification groups with conflicting
modifications for the same network parameter, 2) creating a new modification group that sums all conflicting modifications for the same network parameter in the modification groups, or 3) creating a new group that sums only the minimum modifications for the same network parameter in the modification groups.
[0011] The new modification group is stored in modification queue, and is used for altering at least one network parameter of the critical cell sites or sectors, or of a best neighbor cells sites or sectors for achieving a desired improvement in communications within the wireless network. Altering wireless network parameters of the critical cell sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification groups until, the desired improvement in communications in the wireless network is achieved.
[0012] The method also includes determining a best previous modification group in the modification queue when performance of the network continues to have degraded performance for a ceil site or sector, which includes: 1 ) determining ali modification groups in the modification queue having a same network parameter most recently modified; and 2} determining the modification group with the best previous modification to the same network parameter.
[00 S 3 J The method farther includes identifying cell site or sector for which the degraded condition was detected; and disabling critical cell or sector so that it is no longer considered when determining future modification groups in the modification queue; and re-initialize or recalculating the critical zone.
[0014] The method includes selecting the best previous modification group in the modification queue, when no critical hour within the critical zone at which the degraded communications occurs is determined; and selecting the best previous modification group in the modification queue, when if the critical cell site or sector in the critical zone has available resources for achieving the desired improvement in communications.
[001 5] The method also includes determining if the criteria lor establishing the critical zone still exist and, if so, continuing to monitor the wireless network for degraded
communication conditions.
[0016] An embodiment of the invention is also directed to program recorded on a computer-readable storage medium for optimizing a plurality eel! sites/sectors in a wireless network. The program causes a computer to execute the features of optimizing method noted above.
[0017] An em bods niesit of the invention is also directed to a system for optimizing a plurality eel! sites/sectors in a wireless network. The system comprising an optimization apparatus that monitors network data associated with a plurality of cell sites/sectors and perfomis alterations to network parameters wireless network; at least one controiler configured to perform data communications with the optimization apparatus; a least one base station configured to perform data communication with the at least one controller; at least one controllable antenna configured to perform data communication with the at least one base station and a plurality of subscribers distributed in a plurality of coverage areas; and a dynamic load balancing apparatus configured to perform data communication with the optimization apparatus and the at least one controllable antenna.
[0018] An embodiment of the invention is also directed an apparatus for optimizing a plurality cell sites/sectors in a wireless network comprises a communication interface; at least one processor; and. a memory, the memory storing a. optimizing program for causing ihe apparatus to perform optimizing operations.
BRIEF DESCRIPTION OF THE DRAWINGS
[0019] in the drawings, like reference numbers generally indicate identical,, functionally similar and/or structurally similar elements. Embodiments of the invention will be described with reference to the accompanying drawings, wherein:
[0020] Fig. 1. illustrates a system for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention;
[002] "J f igs. 2A and 2B illustrate a method for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention;
[0022] Fig. 3 illustrates a method for determining a critical zone requiring optimizing of network parameters in accordance with an embodiment of the invention;
[0023] Fig, 4 illustrates a method for determining a best neighbor cell in accordance with an embodiment of the invention; and
[0024] Fig, 5 illustrates an apparatus for optimizing of network parameters in a wireless network in accordance with en embodiment of the invention.
[0025] Additional features are described herein, and will be apparent from the following description of the figures. DETAILED .DESCRIPTION OF THE INVENTION
[0026] In the description that .follows, numerous details are set forth in order to provide a thorough understanding of the invention. It will be appreciated by those skilled in the art that variations of these specific details are possible while still achieving the results of the invention. Well-known elements and processing steps are generally not described in detail in order to avoid unnecessarily obscuring the description of the invention.
[0027] In the drawings accompanying the description that follows, often both reference numerals and legends (labels, text descriptions) may be used to identify elements. If legends are provided, they are intended merely as aids to the reader, and should not in any way be interpreted as limiting.
[0028] Fig. 1 is a system for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention, in particular, the wireless network 100 illustrated in Fig. I includes a network optimization apparatus 101. The wireless network 100 refers to any type of computer network that is wireless, and is commonly associated with a telecommunications network whose interconnections are implemented without the use of wires such as with, electromagnetic waves, such as radio waves or the tike as a carrier. The basic components of the wireless network 100 include the network optimization apparatus 101 , one or more controllers 102, and one or more base stations 103 (i.e., cell sites) for supporting data communications between subscribers distributed throughout coverage areas provided by the wireless network 100 via. antennas 105 (i.e., sectors), a. network database 1 10, and a dynamic load balancing apparatus 104.
[0029] it should be understood by one of ordinary skill in the art. that, the connections between the network optimization apparatus 101 and the one or more network controllers 102, the dynamic load balancing apparatus 104 and the network database 1 10 can be wireless, wired or a combination of wireless and wired. Similarly, it should be understood by one of ordinary skill in the art that the connections between the one or more control lers 102 and the one or more base stations 103 can be wireless, wired or a combination of wireless and wired.
[0030] As seen in Fig. I , the network optimization apparatus 101 receives network statistics and the current network configurations from the network, database 1 10 related to the wireless communication system 100 for assisting in the monitoring and optimization performed. The netw ork statistics may include, but are not limited to, key performance Indicators (KPls). An example of a KP ! is the dropped calls rate, which is the ratio between the failed call s and the total number of calls requested. Another network statistic is the capacity of the network. Capacity can be measured by total number of calls and/or the amount of delivered data in bits or the throughput (overall data rate) in case of data calls.
[003 1] A network parameter important to consider when performing network
optimization is the number of handovers of end-user equipments between different sectors. User equipment has serving sectors, as the user moves between the coverage areas of different sectors, the serving sector will be changed as other sectors may have better signal quality. in a soft handover, the user will have more than one serving sector in the same time as the signal quality of different sectors are close to each other. The number of handovers between different sectors could be used as indicator of how close sectors are to each other, or an indicator to the dependency between different sectors.
[0032] Another network parameter important to consider when performing network optimization is a neighbor list. The neighbor list includes all the potential neighbors for a sector, and it may include neighbor priorities as well. A potential neighbor is a neighbor sector which may provided services to mobile equipment as part of a handover operation when the mobile equipment is traveling between different coverage areas. The neighbor lists of the sectors which are serving the mobile equipment may be arranged to construct one list to be sent to the mobile equipment. The mobi le equipment will use this longer list to search for additional potential neighbors for handover operations.
[0033] The network optimization apparatus 101 can be a server or other similar computer device capable of executing an algorithm for performing optimization of network parameters in wireless net work. 100. A more detailed discussion of the structure of the network optimization apparatus 101 is noted below with reference to Fig. 5.
[0034] The controllers 102 illustrated in Fig. 1 are, for example, base station controllers (BSC), which are part of the wireless system infrastructure that control one or more of the base stations 103 and the corresponding coverage areas provided by the base stations 103. A.
plurality of subscribers {not shown) is distributed within the coverage areas for participating in wireless data communications provided by the wireless network 100 via the antennas 105. The subscribers have user equipment thai may include various types of fixed, mobile, and portable two way radios, cellular telephones, personal digital assistants (PDAs), or other wireless networking devices.
[0035 ] Each coverage area behaves as an independent sector serving its own set of subscribers. For fixed wireless systems, such as 1 EEE802.16-2004, each coverage area can be used by a single base station 103 or plurality of base stations 103 operating each on a different frequency channel. For mobile systems, subscribers of a single coverage area are served by a single base station 103 ihat can be a single frequency channel for OS EE 802. i 6e~2005 (or UMTS or Ix-EVDO Rev. B and C) or multiple frequency channels that can be supported by
IEEE802.16m (or UMTS or 1 xBVDO Rev. B and C).
[0036] As illustrated in Fig. i , the dynamic load balancing apparatus 104 may also receive subscriber statistics. The dynamic load balancing apparatus 104 includes an algorithm thai analyzes the elate related to the wireless network 100 and sends control signals to the antennas and/or base stations 103 for altering or shaping the coverage areas. The load balancing algorithm may cluster users based on their instantaneous locations or by means of heuristic approaches; collects statistics to validate previous users clustering decisions and/br predicting new traffic patterns: and continuous learns and adaptively shapes the coverage areas and alters network parameters as the environment or traffic density changes with time. As seen in Fig. 1 , network statistics received by the network optimization apparatus can also be provided to the dynamic load balancing apparatus 104.
[0037] Figs. 2 A and 2B illustrate a method for optimizing of network parameters in a wireless network in accordance with an embodiment of the invention. By way of example, the self-optimization apparatus 101 can execute an algorithm stored therein for performing optimization ope rati ons .
[0038] Prior to optimizing operations on the wireless network, there needs to be an identification of zones (i.e., critical zones) in the wireless network requiring optimization.
Identification of a critical zone will be discussed in more detail with reference to Fig. 3, The zones will be identified as a group of cell sites/sectors on which the optimization will be preformed. Identification of the zones needing optimization can be based on the critical cell site/sector that has performance problems based on some criteria. Additionally, different areas of the wireless network can be evaluated using different criteria. The criteria can be based on one or more performance metrics of the wireless network over a past period of time and/or one or more predicted performance metrics. These performance metrics can be based on previous performance and configurations as well as previous traffic and predicted traffic.
[0039] A performance metrics can be for a voice/data service for all services or for weighted services; and can be for the critical cell site/sector only or for the entire critical zone or for overall weighted performance between different cell sites/sectors. The performance metrics can also be for a specific time slot in a day or over a few days, for all times or for overall weighted times, and can be changed automatically or manual ly between different sets of performance metrics based on some criteria. For the criteria that changes automatically between different performance metrics sets, the criteria can be based on past or predicted configurations, performance metrics and/or traffic.
[0040] For each critical cell site/sector needing optimization, a local zone will be identified as the set of the neighbor cell sites/sectors based on some criteria, which can also be based on one or more performance metrics. For example, the performance metric can be based on the cells/sectors dropped call rate (DCR), which has exceeded certain dropped call rate threshold over certain window of time. The performance metric can also be calculated across specific time slots in different time frames. For example, Mondays to Fridays, Mondays only or Mondays to Fridays morning hours.
[004] ] The local zone may contain only the critical cell/sector, direct neighbors of the critical site/sector or the direct neighbors and the neighbors of neighbors or additional levels of neighbors. For each group of overlapped local zones, critical zones will be identified as the union of these overlapped zones. The final critical zones may not include overlapping zones. The zone identification process is run continuously to identify new zones needing optimization.
[0042] The old and newly identified critical zones can also be ranked based on the criteria used in identifying the critical zones. Based on the available computing resource in the optimization system as well as the rank of the zones, one or more of the critical zones will be chosen, for optimization in serial, parallel or both. When a critical zone is selected for optimization, the optimization will be conducted continuously as performance metric data and configurations arrive to the optimization apparatus,
[0043] Referring now to Fig. 2A. in. step 201 , the self-optimization apparatus 1.01 monitors the wireless network. The self-optimization apparatus 101 monitors performance after implementing recommended configuration modifications. In step 202. the network optimization apparatus 101 determines if new network data has been received. If not, then the wireless network will continue to be monitored, as in step 201 ,
[0044] Otherwise, in step 203, the network optimization apparatus 101 will determine whether the operating conditions of the cell sites/sectors in the zones have been degraded based on the new data received. The criteria can be based on one or more of performance metrics similar to those noted above for identifying the zones. 'For example, the performance metric can be based on the DCR of cells/sectors in the zones or capacity increases. If performance in the zone has degraded, then in step 204, the previous recommended configuration modifications are removed until the best previous operation state is established.
[0045] For example, all the configuration parameter changes are .identified in all the modification groups created and the original value for each one of there parameters is found, if a modification group A and a modification group B are implemented sequentially and cell e had a down tilt of 3 degrees before implementing the modification group A. The modification group A change is io increase the down hit of I degree for cell c and the modification group 8 change is an additional increase for down tilt of another I degree for cell c. Here, the down tilt for cell c is identified as a configuration parameter to be reverted to a value of 3 degrees. This process is conducted to insure that all the changes are reverted to the best previous state while eliminating the undoing all the modification groups one by one.
[0046] However, in the cases where the reverting to the best previous configuration fails, the search for the best previous state is as follows: I.) find all the previous forwarded groups which have the same parameter of the failed configurations and a value equal to the current value of the parameter; and 2) from these found groups, find the best pre vious state.
[0047] After revetting back to the best previous state in step 204, in step 213 the critical zone is re-calculated or re-initialized which includes: I ) identifying failed cells in a previous section or the cells for which modifications have been forwarded immediately before the performance degradation is detected: and 2) disabling these cells so they are not considered in any future modifications calculations as follows: a) do not include this critical cells in the modification calculations, and b) for other cells, do not consider them when calculating best neighbor; and 3 ) re-initialize or re-calculate the critical zone.
[0048] In step 214, the critical zone creation criteria are checked to see if they are still valid. If the critical zone creation criteria are not valid, then the optimization process ends in 220, However, if the critical zone creation criteria are valid, then the run time for the network optimization process is determined in step 215. In step 2.15, if a run time threshold, is exceeded, then the network optimization process will end at step 220, If the time threshold has not been exceeded, then the network wi l l continue to he monitored in step 201.
[0049] However, if the operating conditions of the zones have not been degraded based on the previous recommended configuration modifications, then in step 205 it is determined if an observation window has been reached. An observation window is simply a specified time period such a number or days. For example, the optimization apparatus may determine that it is necessary to monitor network data for a certain numbers of clays. If an observation window has not been reached, then the wireless network will continue to be monitored, as in step 201 , However, once the observation window has been reached, performance metrics can he calculated and compared to performance metrics before the previous recommended
configuration modifications or compared to the first K.PIs. An algorithm will evaluate the KPls after the previous observation windows have been reached and find the configurations which resulted in the best KPIs. if the current network performance is better, then the previous recommended configuration modifications will be accepted. However, if performance is degraded, then the previous recommended configuration modifications are removed.
[0050] Thus, after the observation window has been reached in step 205 then, in step 5 206 it is determined if the operating conditions of the cell sites/sectors in the zones have been degraded. If a degraded condition is determined in step 206, then in step 204 the previous recommeiKled configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 21.5 are performed. After step 215, either the wireless network continues to be monitored or in step 220 the optimization process ends, if in step 206 it is 10 determined that the operating conditions of the cell sites/sectors in the zones have not been degraded, then in step 20? it is determined if a critical hour is found. 'The critical hour may be the specific time a zone suffers from a highly degraded condition.
[0051 ] in step 207, if the critical hour is found, then in step 208 it is determined if the critical cell/sector has enough available resources for the critical hour. For example, the 15 determination of available resources could be based on, but is not limited to, the number of calls which could be additionally served by the critical cell site/sector; how many calls could be averagely served by any used hardware; or how many calls could be averagely served by the unused power. If the number of calls is determined to be less than or gr eater than a
preset/dynamie threshold, then it can be determined if the critical cell site/sector has adequate 20 available resources to address the degraded condition.
[0052] In step 207, if the critical hour is not found, then in step 204 the previous recommended configuration modifications are removed until the best previous operation, state is established, and steps 213, 214, 215 are performed. After step 215, either the wireless network continues to be monitored or in step 220 the optimization process ends.
25 [0053] in step 208, if it is determined that the cell site/sector has available resources, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established. For example, load balancing techniques can be used to address the degradation condition in the zone instead. Then, after step 204, steps 2 i 3, 214, 2 i 5 are performed; and either the wireless network continues to be monitored (step 201.) or in 30 step 220 the optimization process ends.
[0054] in step 208, if it. is determined that the cell site/sector does not have adequate available resources, then in step 209 a best neighbor cell site/sector is determined for assisting in addressing the degraded condition. For example, from the critical cell sectors/site neighbor list, the top neighbors are determined based on which neighbors sectors/sites have a high number of handovers with the critical cell site/sector; and/or the neighbor cell sectors/cells with antenna beams looking toward the critical site/sector; and/or the neighbor cell sectors/sites which has high available resources,
[0055] in step 210, if no best neighbor site is {"bund, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 215 are performed. After step 215, either the wireless network continues to be monitored (step 201) or in step 220 the optimization process ends.
[0056] In the alternative, if no best neighbor is found using the current criteria, then the search criteria for a best neighbor cell/sector could be modified or made more flexible, for example, to determine neighbor cells/sectors with a lower number of handovers. Found best neighbor cells/sectors could be in the same cell site sector location or different location from the critical cell site/sector. Additionally, there can be different priorities if the neighbor cell sectors/sites are in different cell site/sector location than for neighbor cell sectors/sites in same cell site/sector location. These priorities can be specified using a weighted metrics and the status of whether the neighbor cell sectors/sites is in the same or different cell site/sector.
[0057] if a best neighbor site/or cell is found in step 210, then in step 21 1 it is determined if the best neighbor cell has adequate available resources for addressing the degraded condition. If the best neighbor cell/sector does not have adequate available resources, then in step 204 the previous recommended configuration modifications are removed until the best previous operation state is established, and steps 213, 214, 215 are performed. After step 2.15, either the wireless network continues to be monitored of in step 220 the optimization, process ends. If the best neighbor ceil has adequate available resources for addressing the degraded condition, then configuration modifications are calculated and added to the
modification queue in step 212 for application to the wireless network.
[0058] in step 212, when, a zone with .multiple critical sites/cells is detected,
configuration modifications will be calculated taking into considerations that the configurations recommendations for same or different critical/neighbor site/cell do not conflict with each other. For example, in step 212, for each critical site/cell, the initial modifications are calculated as follows'.
[0059] 1) the modification group A; the critical cell site/sector antenna down tilt will be increased and/or the critical cell site/sector transmitted power will be decreased; and/or
[0060] 2) the modification group B: drat the best neighbor cell site/sector antenna down tilt will be decreased and/or the best neighbor cell site/sector transmitted power will be increased, [0061] Because the modifications are calculated independently for each critical site/cell, the modifications groups (e.g., A and B) can. conflict with each other. For example, for a critical cell A, a modification for the neighbor cell X of down tilt of I degree is calculated. At the same time, for a critical cell B, modification for the neighbor cell X of down tilt of 2 degrees is calculated. Cell X is a neighbor eel! for both cells A and 13, and in this case it has two modifications calculated.
[0062] Elimination of the conflict between modification groups is illustrated in more detail with reference to fig. 2B. In step in 221 the modification groups (e.g., A and B) are evaluated for conflicts. In step 222, if a conflict between modification groups is found, then in step 223 the following analysts is conducted:
[0063] I ) search for the groups which shares at least one configuration parameter modification for the same antenna/beam or cell;
[0064] 2) when groups are found, one of the following modifications shall be used: a) cancel all groups, b) create a new group which has the sum of all changes in the groups, and c) create a new group which has the sum of minimum of groups, which is done as follows:
[0065] i ) if all groups are sharing the same sign of the values, then use the minimum change. For example if GI has down tilt of 1 degree and G2 has up tilt of 2 degrees, then the final new group created group will, has up tilt of 1 degree;
[0066] ii) if the groups have different signs for its values,, then use the
minimum/maximum/average of both the positive and the negative groups.
[0067] For example, if 01 , G2 has up tilt of I and 2 degrees (respectively) and G3, 04 has down tilt of 3 and 2 degrees (respectively), then choose the group with lowest up tilt (GI ) and the group with the lowest down tilt change (04), and then find the sum of up/down tilting for G I and G4 which will be total down tilt of -1 +2 -1 degree down tilt.
[0068] When summing the up tilt and down tilt, the corresponding power changes should be related to the final result and not to the sum of the original group powers as each final down tilt has a recommended power change. For example, a final down tilt of I degree has a recommended power change of -1.5d.B no matter what are the original groups' values or sum of the powers.
[0069] If 01 has down tilt of 1 and decreasing the power by L5db, and G4 had up tilt of
1 and no power change, then the total sum will be no up tilt/down tilt and no power change. In another case if GI has down tilt of 2 and decreasing the power by 3dB, and 04 had UT of 1 and no power change, then the total sum wi ll be down tilt by 1 degree and power reduction of 1.5 degree. [0070] in step 224, the new modification group is created and in step 225, the modification group is stored in ihe modification queue for implementation, to the wireless network for improving network performance.
[0071] As noted above, the calculated configuration modification could be that, for example, the critical cell, site/sector antenna down tilt will be increased and/or the critical cell site/sector transmitted power will be decreased; the critical cell site/sector antenna pointing direction will be moved away from the neighbor which has more available resources or away from a neighbor cell/sector which has less available resources; and/or the critical cell site/sector antenna beamwidth will be decreased; and/or the critical cell site/sector transmitted power will be decreased to compensate for the increase in gain cased by decreasing beamwidth.
[0072] Additionally the calculated configuration modification could be that, for example, that the best neighbor cell site/sector antenna down tilt will be decreased and/or the best neighbor cell site/sector transmitted power will be increased; the best neighbor cell site/sector antenna pointing direction, will be moved towards the critical cell site/sector; and/or the best neighbor cell site/sector antenna beamwidth will be increased; and/or the best neighbor cell site/sector transmitted power will be increased to compensate for the decrease in gain cased by increasing beamwidth. The recommendations above can be implemented simultaneously or sequentially or with time delay in between or delayed until the next window is reached or until all delayed recommendations are implemented.
[0073] Once the recommendation modifications are determined, the wireless network is monitored, as in step 201 , to determine if the recommendation modifications address the degraded condition. Howe ver, in step 222, if there is no conflict between modification groups, then the process will continue to monitor the wireless network, as in step 201 ,
[0074] Once the recommendation modifications are determined, the wireless network is monitored (as in step 201. ) to determine if the recommendation modification address the degraded condition.
[0075] Exemplary A pplkation
[0076] The following is an example of the method of optimizing a wireless network that is consistent the method described above with reference to Fig. 2.
1. The critical Hour is identified as Hour 9 (as expected from the traffic model)
2. For cell 4_2, Hour 9, the available resources is below the threshold; hence load balancing could help resolving it.
3. Best Neighbor search result is Cell 194J 4. The Zone accumulated DCR is recorded (32.94) before implementing any changes
5. Change Cell 4 2 configuration as follows:
a. Increase the down tilt of the critical cell 4_J2 by I Deg
b. Decrease the Power By 1 .5 dB
6. Monitor the performance for n days (in this case 5 days)
7. After n days, the 5 days accumulated DCR is enhanced as the Zone accumulated DCR is changed from 32.94 to 32.601 and me capacity have not degraded
8. Decrease the down tilt of the best neighbor 194 I by 1 deg
9. Monitor the performance for n days (In this case 5 days)
10. After n days, the 5 days accumulated DCR i s found to be degraded to be 32.675 However it is still below the original accumulated DCR of 32,94
1 1. Best Neighbor search result is Cell 10_3
1.2. Change Cell 4_2 configuration as follows:
a. Increase the down tilt of the critical cell 4_2 by I Deg
b. Decrease the Power By 1.5 dB
13. Monitor the performance for n days (In this case 5 days)
14. After n days, the 5 days accumulated DCR is enhanced as the Zone accumulated DCR is changed to 31.962 and the capacity have not degraded
15. Decrease the down tilt of the best neighbor 10 3 by i deg
16. Monitor the performance for n days (in this case 5 days) 1 ?. After n days, the 5 days accumulated DCR is enhanced to be 31.866
18. Repeat 1 1 to 14 and the 5 days accumulated DCR becomes 3 1. J 68
19. Repeat 15 to 17 and the 5 days accumulated DCR becomes 30.997
20. Now Ceil 4 2 has free available resources and load, balancing will not help ' increasing the capaci ty of the network. [0077] Fig. 3 illustrates a method for determining a critical zone requiring optimizing of network parameters in accordance with an embodiment of the invention. In step 301 , neighbor lists are collected for a critical cell/sector. The neighbor list includes all the potential neighbor ceil/sectors for a particular a cell/sector, and it may include neighbor priorities as well. A 5 potential neighbor cell/sector is a cell/sector that provides services to mobile equipment as part of a handover operation when the mobile equipment is traveling from one coverage area to another. The neighbor list can be stored in the network database 1 10.
[0078] The neighbor list can be stored in the network database 1 10 in the form of table- that includes a list of cells and a corresponding list of zones. For each, critical ceil site/sector
10 needing optimization, a local zone will be identified as the set of the neighbor cell sites/sectors based on some criteria, which can also be based on one or more performance metrics. A "cells table" will be formed to contain all the cells in the local zones of all the critical cells/sectors, and it will contain cell id and smip!ezoneJd - local zone id for each cell. A "simple zone list"' saves the cheeked/partially checked local zones during the search, and it contains the simple
15 zone id and the corresponding final, zone. The "cells list" saves the checked/partially checked cells during the search, and it contains the cell id and the corresponding final zone.
[0079] In step 302, the cells table is sorted by simple zone ID and then by cell ID. Initially both, the cells list and simple zone list are empty. For each entry in the cells table the following operation take place. In step 303, an X zone reference is determined from the cell list
20 based on finding a cell ID that matches the cell ID entered for a ceil In step 304, a Y zone reference is determined from the simple zone list based on. finding a zoneJD that matches the zone ID entered for the cell. Once the X zone reference and Y zone reterence are determined for the critical cel l, it then needs to be determined if the X zone reference and the Y zone reference are included in a critical zone. In step 305, it is determined if the X zone reference is
25 in a critical zone. If the X zone reference is in. a critical zone, then in step 306 it is determined if the Y zone reference is in a critical zone. If both the X zone reference and the Y zone reference are included in a critical zone, then in step 307 it is determined if the X zone reference and the Y zone reference refer to the same zone, if the X zone reference and the Y zone reference also refer to the same zone, then in step 308, the ceUJD is added to this final critical zone, in step
30 309, it is determined if any ceils in the cells table has been unchecked. If not, the process is ended in step 320. If there are cells in the cells table that have not been cheeked., then the remaining cells in the cells table are checked by returning to step 303.
[0080] In step 307, if the X zone reference and the Y zone reference are referring to the different zones, then a new critical zone is created in step 310. In step 31 1 , the X zone reference and the Y zone are included in the new final critical zone, the cell list in the database I 10 is updated for the newly created zone (i.e., by cell ID and zone ID) and the zone in the simple zone list is updated for the newly created zone. Also, in step 312 the previous zones for the X zone reference and the Y zone reference are removed. The process then returns to step 309 where it is determined if any cells in the cells table has been unchecked, if not, the process is ended in step 320. However, if there are cells in the cells table that have not been checked, then the remaining cells in the cells table are checked by returning to step 303.
[0081] In step 306, if it is determined that the X zone reference is in a critical zone, but the Y zone reference is not, then in step 313 it is determined that the X zone reference is the final critical zone, as in steps 314 and 308, the Y zone reference is added to the final critical zone that includes X. Hie process then returns to step 309 where it is determined if any cel ls in the cells table has been unchecked, if not, the process is ended in step 320. However, if there are cells in the cells table that have not been checked, then the remaining ceils in the cells table are checked by returning to step 303.
[0082] In step 305, if it is determined that the X zone reference is not in a critical zone then in step 315 it is determined if the Y zone reference is in a critical zone. If it is determined that X zone reference is not in a critical zone, but the Y zone reference is in a critical zone, then in step 316, it is determined that the Y zone reference is the final critical zone, as in steps 3.14 and 308, the X zone reference is added to the final critical zone that includes the Y zone reference. "The process then returns to step 309 where it is determined if any cells in the cells table has been unchecked. If not, the process is ended in step 320, However, if there are ceils in the ceils table that have not. been checked, then the remaining cells in the ceils table are checked by returning to step 303,
[0083] In step 315, if it is determined that the X. zone reference is not in a critical zone, and the Y zone reference is not in a critical zone, then in step 3 17, a new critical zone is created that includes the X zone reference and the Y zone reference. Then in steps in steps 314 and 308, the IDs for the newly added zone are added to cell, list and simple zone list and the X zone reference and the Y zone reference are added to a final critical zone. The process then returns to step 309 where it is determined if any cells in the cells table has been, unchecked. If not, the process is ended in step 320. However, if there are cells in the ceils table that have not been checked, then the remaining cells in the cells table are checked by returning to step 303.
[0084] Fig. 4 illustrates a method for determining a best neighbor cell, in accordance with an embodiment of the invention. As noted above, if a critical cell site/sector does not have adequate available resources, then it is important (for performing network optimization) to determine neighbor cell sites/sectors that can assisting in addressing any degraded conditions
[0085 ] In step 401 , the neighbor ceils/sectors are determined based on the cells list table in the database ί 10. in step 402, the neighbor list is sorted by network statistics. As noted above, network statistics may include, but are not limited to, key performance Indicators (KPIs). An example of a KPi is the dropped caiis rate or handovers, which is the ratio between the failed calls and the total number of calls requested. The network statistics may also include, but are not limited to the following: Exemplary Switch Statistics
[0086] UL and DL Stats For Each Sector/Carrier: Load, Brlangs and Throughput
[0087] Capacity For Each Sector/Carrier
[0088] Sensitive KPIs To Operators Per Sector/Carrier Such as Dropped Calls and
Blocked Calls
[0089] Location Of M ost Users (Cl usters)
[0090] Year/Montn/Day/Tune
[0091 ] Cell ID
[0092] Antenna ID
[0093] Carrier Frequency
[0094] Number Of Established Calls
[0095] CSian.net Elements (CE) .Primary Use
[0096] % Primary Traffic CE Usage
[0097] % Secondary Traffic CE Usage
[0098] Total CE Usage (Erlang)
[0099] Peak # of Walsh Codes
[00 S 00] Soft Handover Overhead %
[00101 ] Soft or hard hando ver counts
[00102] Peak DL Power
[Oil 103] Number Of Dropped And Lost Cai Is
[00104] Number Of Blocked Calls
[00105] UL Thermal Noise Floor (main)
[00106] UL thermal Noise Floor (diversity)
[00107] Average DL Power
[00 S 08] Pilot, Paging and Sync Channels Powers [00109] Peak Number of Primary Walsh codes
[001 10] Reported Or Calculated Sector Load For UL
Exemplary Network Parameters
[001 1 1 ] Site Latitude And Longitude
[001 12] Type: Macro-Cell, Micro-Cell, Repeater
[00 ! 13] Handoff Parameters (T__Add, T_prop, h Drop. T_Comp)
[001 14] PA Output Power
[001 15] Antenna Direction
[001 16] Antenna Height Above Ground And Sea Level
[001 17] Antenna Model, Azimuth BW, Elevation BW, Gain, Electrical And
Mechanical Tilt
[001 18] FN Offset Per Sector
[001 19] Morphology: Urban, Highway, Suburban, Rural Dense Urban
[00120] Number Of RF Carriers Per Sector And Their Frequenc ies
[00121] Equipment Multi-Antenna Capability: Rx Diversity, STC, MIMO
[00122] Losses From PA Output To Antenna Ports If Applicable
[00123] Multi-Carriers To Antennas Mapping
[00124] Technology: W1MAX, UMTS, HSxPA , CDMA2000, IxRTT, Ix-EVDO Rev. A, B or C, GSM , etc., And Supported Features By The Equipment
[00125] In step 403, the neighbor cells are then grouped based on available resources and network statistics. The grouped neighbor cel ls are sorted based on network statistics. Then, in step 404, the neighbor cells in the first group are raiiked based on their available resources. For example, the top neighbor cell sites/sectors may have a high number of handovers wi th, the critical cell site/sector, or the top neighbor cell sites/sectors may have antenna beams looking toward the critical site/sector. In step 405 the best neighbor cells/sectors in the group is deiemisned. In step 406, it is determined if the best neighbor cell has adequate available resources to address the degraded condition, if not, then another best neighbor eel! from the group is determined, as in step 405, which has resources available to address the degraded condition. Once a best neighbor cell/sector is determined, then in step 407, recommended modifications to the wireless network are calculated. If the best neighbor is not found, the next group wil l be searched using the same criteria. [00126] As noted above, the calculated configuration modification could be that, for example, the critical cell site/sector antenna down tilt will be increased and/or the critical cell site/sector transmitted power will be decreased; the critical ceil site/sector antenna pointing direction will be moved away from the neighbor which has more available resources or away 5 from a neighbor cell/sector which has less available resources; and/or the critical cell site/sector antenna beamwidth will be decreased; and/or the critical cell site/sector transmitted power will be decreased to compensate for the increase in gain eased by decreasing beamwidth.
[00127] Additionally, the calculated configuration modification could be that, for example, that the best neighbor cell site/ sector antenna down tilt will be decreased and/or the
10 best neighbor cell site/sector transmitted power will be increased; the best neighbor cell
site/sector antenna pointing direction will be moved towards the critical cell site/sector and/or the best neighbor cell site/sector antenna beamwidth will be increased; and/or the best neighbor cell site/sector transmitted power will be increased to compensate for the decrease in gain cased by increasing beamwidth. The recommendations above can be implemented simultaneously or
15 sequentially or with time delay in between.
[00128] fig. 5 is a more detailed description of optimization apparatus 101 for performing the method of self-optimization as previously described with reference to Figs 2-4. In Fig. 5, the optimization apparatus 101 includes a -memory 501 , a processor 502, user interlace 503, application programs 504, communication interlace 505, and bus 506.
20 [00129] The memory 501 can be computer-readable storage medium used to store executable instructions, or computer program thereon. The memory 501 may include a readonly memory (ROM), random access memory (RAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), a smart card, a subscriber identity module (SIM), or any other medium from which a computing device can read
25 executable instructions or a computer program. The term ""computer program" is intended to encompass an executable program that exists permanently or temporarily on any computer- readable storage medium as described above.
[00130] The computer program is also intended to include an algorithm thai includes executable instructions stored in the memory 50.1 that are executable by one or more processors
30 502, which may be facilitated by one or more of the application programs 504. The application programs 504 may also include; but are not limited to, an operating system or any special computer program, that manages the relationship between application software and any suitable variety of hardware that helps to make-up a computer system or computing environment of the self-optimization apparatus 501. General communication between the components in. the self- optimization apparatus 101 is provided via the bus 506. The self-optimization algorithm as described with reference to Figs 2-4 can be stored, for example, in the memory 501 of the self- optimization apparatus 10 i .
[00131] The user interface 503 allows for interaction between a user and the seif- optimization apparatus 101. The user interface 503 may include a keypad, a keyboard, microphone, and/or speakers. The communication interface 505 provides for two-way data communications from the self-optimization apparatus 101. By way of example,, the
communication interface 505 may be a digital subscriber line (DSL) card or modem, an integrated services digital network (ISDN) card, a cable modem, or a telephone modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interlace 505 may be a local area network (TAN) card (e.g., for Ethernet™ or an Asynchronous Transfer Model (ATM) network) to provide a data
communication connection to a compatible LAN.
[00132] Further, the communication: interface 505 may also include peripheral interface devices, such as a Universal Serial Bus (USB) interface, a Personal Computer Memory Card international Association (PCMCIA) interface, and the like. The communication interface 505 also allows the exchange of information across one or more wireless communication networks. Such networks may include cellular or short-range, such as IEEE 802.1.1 wireless local area networks iWLANSK And, the exchange of information may involve the transmission of radio frequency (RP) signals through an antenna (not shown),
[00133] From the description provided herein, those skilled in the art are readily able to combine software created as described with the appropriate general purpose or special purpose computer hardware for carrying out the features of the invention.
[00134] Additionally, it should be understood that various changes and modifications to the presently preferred embodiments described herein will he apparent to those skilled in the art. Such changes and modifications can be made without departing from the spirit and scope of the present subject matter and without diminishing its intended advantages. It is therefore intended that such changes and modifications be covered by the appended claim.

Claims

What is claimed is:
1 , A method for optimizing a plurality cell sites or sectors in a wireless network, the plurality of cell sites or sectors being determined to be within a critical zone of the wireless
5network where communication has been degraded and needing optimization, the method comprising:
calculating modifications to a plurality of network parameters for optimizing wireless network performance ;
storing the modifications for optimizing a plurality of network parameters in a 1 Omodifieation queue, the modifications being stored within modification groups in the
modification queue;
evaluating the stored modification groups to determine conflicts between modifications for a same network, parameter;
eliminating the conflicts between modifications lor the same network, parameter I Swithin the modification groups by performing one of the following:
1} canceling all modification groups with conflicting modifications for the same network parameter, 2} creating a new modification group that, sums all conflicting modifications for the same network parameter in the modification groups, or 3) creating a new group that sums only minimum modifications for the same network parameter in the modification groups; and 20 storing the new modification group in modification queue, the new modification group being used for altering at least one network parameter of the critical cell sites or sectors, or of a best neighbor cells sites or sectors for achieving a desired improvement in communications within the wireless network,
wherein, altering wireless network parameters of the critical cell, sites or sectors, or the 5 best neighbor cell sites or sectors is performed continuously using the stored modification groups until the desired improvement in cornmunications in the wireless network is achieved.
2. The method, for optimizing of claim 1. , wherein the creating of a new group that sums only minimum modifications includes: i) if the groups are sharing values with the same sign, then
30use a minimum change: and ii) if the groups have values with different signs, then use the raininuim/maxim«m/average of both positive and negative values of the groups.
3. The method for optimizing of claim 1 , wherein a modification group includes changes to up tilt and down tilt of an antenna, wherein power changes to the antenna are based on a final result of the up till and the down tilt of the antenna,
4. The method for optimizing of claim 1, fun her comprising:
determining a best previous modification group in the modification queue when performance of the network continues to have degraded performance for a cell site or sector, which includes:
determining all modification groups in the modification queue having a same network parameter most recently modi fied, and
determining the modification group with the best previous modification to the same network, parameter.
5. The method for optimizing of claim I , further comprising:
identifying ceil site or sector for which the degraded condition was detected; and disabling critical cell or sector so that it is no longer considered when determining future modification groups in the modification queue; and
re-initialize or re-calculating the critical zone.
6. The method for optimizing of claim 4, further comprising:
selecting the best previous modification group in the modification queue, when no critical hour within the critical zone at which the degraded communications occurs is determined.
7. The method for optimizing of claim 4, further comprising:
selecting the best previous modification group in the modification queue, when if the critical ceil site or sector in the critical zone has available resources for achieving the desired improvement in communications.
8. The method for optimizing of claim 1 , further comprising:
determining if a criteria for establishing the critical zone still, exi st and, if so, continuing to monitor the wireless network for degraded communication conditions.
9. The method for optimizing of claim I , further comprising:
determining a total time the method for optimizing has been performed; comparing the total time to a time threshold value; and
stopping the method of opiim.ixat.ion if the time threshold has been exceeded, wherein, if the time threshold has not been exceeded, the method of optimization will continue.
5
10. A program recorded on a computer-readable storage medium for optimizing a plurality of cell sites or sectors in a wireless network, the plurality of cell sites or sectors being determined to be within a critical zone of the wireless network where communication has been degraded and needing optimization, the program causing a computer to execute optimizing steps Ocomprising:
calculating modifications to a plurality of network parameters for optimizing wireless network performance :
storing the modifications for optimizing a plurality of network parameters in a modification queue, the modifications being stored within modification groups in a the
Smodifjcation queue;
evaluating the stored modification groups to determine conflicts between modifications for a same network parameter;
eliminating the conflicts between modifications for the same network, parameter within the modification groups by performing one of the following:
0 1} canceling all modification groups with conflicting niodi.ficai.ioos for the same network parameter, .2) creating a new modification group that sums all conflicting .modifications for the same network parameter in the modification groups, or 3) creating a new group that sums only minimum modifications for the same network parameter in the modification groups; and storing the new modification group in modification queue, the new mod.ifica.tion5group being used for altering at least one network parameter of the critical cell, sites or sectors, or of a best neighbor cells sites or sectors for achieving a desired improvement in communications within the wireless network,
wherein altering wireless network parameters of the critical cell sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification0 groups until the desired improvement in communications in the wireless network is achieved,
1 1. The program for optimizing of claim 10, wherein the creating of a new group that sums only minimum modifications includes; i) if the groups are sharing values with the same sign, then use a minimum change; and ii) if the groups have values with different signs, then use the mimmira/maxironra/average of both positive and negative values of the groups.
12. The program for optimizing of claim 10, wherein a modification group includes changes to up tilt ant! down tilt of an antenna, wherein power changes to the antenna are based on a final result of the up tilt and the down tilt of the antenna.
13. The program for optimizing of claim 10, further comprising:
determining a best previous modification group in the modification queue when per formance of the network continues have degraded, performance for a cell site or sector, which includes:
determining all modification groups in the modification queue having a same network, parameter most recently modified, and
determining the modification group with the best previous modification to the same network parameter.
14. The program for optimizing of claim 1.0, further comprising:
identifying cell site or sector for which the degraded condition was detected; and disabling critical cell or sector so that it is no longer considered when determine future modification groups in the modification queue; and
re-initialize or re-calculating the critical zone.
15. The program for optimizing of claim 13, further comprising:
selecting the best previous modification group in the modification queue, when no critical hour within the critical zone at which the degraded communications occurs is determined.
Hi The program for optimizing of claim 13, further comprising:
selecting the best previous modification group in the modification queue, when if the critical cell site or sector in the critical zone has available resources for achieving the desired improvement in communications.
17. The method for optimizing of claim 10, further comprising: determining if a criteria for establishing the critical zone still exist and, if so, the wireless network will continue to be monitored for degraded communication conditions.
18. The method for optimizing of claim 10, further comprising:
determining a total time determining the method for optimizing has been performed; comparing the total time performed to a time threshold valise; and
stopping the method of optimization if the time threshold has been exceeded, wherein, tithe time threshold has not been exceeded, the method of optimization will continue.
19. A system for optimizing a plurality cell sites in a wireless network, the system comprising:
an optimization apparatus that monitors network data associated with a plurality of cell sites or sectors and performs alterations to network parameters wireless network:
at least one controller configured to perform data communications with said optimization apparatus;
a least one base station configured to perform data communication with said at least one controller;
at least one controllable antenna configured to perform data communication with said at least one base station and a plurality of subscribers distributed in a plurality of coverage areas; and
a dynamic load balancing apparatus configured to perform data communication with said optimization apparatus and said at least one controllable antenna,
said optimization apparatus being configured to:
calculate modifications to a plurality of network parameters for optimizing wireless network performance;
store the modifications for optimizing a plurality of network parameters in a modification queue, the modifications being stored within modification groups in a the modi fi eati on queue;
evaluate the stored modification groups to determine conflicts between modifications for a same network parameter;
eliminate the conflicts between modi fications for the same network, parameter within the modification groups by performing one of the following: 1 ) canceling all modification groups with conflicting modifications for the same network parameter, 2} creating a new modification group that sums ail conflicting modifications for the same network parameter in the modification groups, or 3) creating a new group that sums only minimum modifications for the same network parameter in the modification groups; and store the new modification group in modification queue, the new modification group being used for altering at least one network parameter of the critical eel! sites or sectors, or of a best neighbor cells sites or sectors for achieving a desired improvement in communications within the wireless network,
wherein altering wireless network parameters of the critical cell sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification groups until the desired improvement in communications in the wireless network is achieved.
20. An apparatus for optimizing a plurality cell sites in a wireless network, the apparatus comprising:
a communication interface;
at least one processor; and
a memory, the memory storing an optimizing program for causing the apparatus to perform optimizing steps comprising:
calculating modifications to a plurality of network parameters for optimizing wirelessnetwork performance;
storing the modifications for optimizing a plurality of network parameters in a modification queue, the modifications being stored within modification groups in a the modification queue;
evaluating the stored modification groups to determine conflicts between modi fi cati ons for a same network parameter;
eliminating the conflicts between modifications for the same network parameter within the modification groups by performing one of the following:
I ) canceling all modification groups with conflicting modifications for the same network parameter, 2) creating a new modification group that sums all conflicting modificationsfor the same network parameter in the modification groups, or 3) creating a new group that sums only minimum modifications for the same network parameter in the modification groups; and storing the new modification group in modification queue, the new modi fication group being used for altering at least one network parameter of the critical cell sites or sectors, or of a best neighbor ceils sites or sectors for achieving a desired improvement in communications within the wireless network,
wherein altering wireless network parameters of the critical ceil sites or sectors, or the best neighbor cell sites or sectors is performed continuously using the stored modification groupsuntil the desired improvement in communications in the wireless network is achieved.
PCT/US2010/048927 2009-10-16 2010-09-15 Self-optimizing wireless network WO2011046704A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP10823800.7A EP2489160B1 (en) 2009-10-16 2010-09-15 Self-optimizing wireless network
CA2777677A CA2777677A1 (en) 2009-10-16 2010-09-15 Self-optimizing wireless network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/580,604 US20110090820A1 (en) 2009-10-16 2009-10-16 Self-optimizing wireless network
US12/580,604 2009-10-16

Publications (2)

Publication Number Publication Date
WO2011046704A2 true WO2011046704A2 (en) 2011-04-21
WO2011046704A3 WO2011046704A3 (en) 2012-08-02

Family

ID=43876434

Family Applications (2)

Application Number Title Priority Date Filing Date
PCT/US2010/048929 WO2011046705A1 (en) 2009-10-16 2010-09-15 Self-optimizing wireless network
PCT/US2010/048927 WO2011046704A2 (en) 2009-10-16 2010-09-15 Self-optimizing wireless network

Family Applications Before (1)

Application Number Title Priority Date Filing Date
PCT/US2010/048929 WO2011046705A1 (en) 2009-10-16 2010-09-15 Self-optimizing wireless network

Country Status (4)

Country Link
US (4) US20110090820A1 (en)
EP (1) EP2489160B1 (en)
CA (1) CA2777677A1 (en)
WO (2) WO2011046705A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140080493A1 (en) * 2012-09-03 2014-03-20 Vodafone Holding Gmbh Disconnection of Resources of A Radio Access Network with A Low Network Load
CN113169886A (en) * 2018-11-19 2021-07-23 脸谱公司 Communication network optimization

Families Citing this family (79)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10200094B2 (en) 2004-04-02 2019-02-05 Rearden, Llc Interference management, handoff, power control and link adaptation in distributed-input distributed-output (DIDO) communication systems
US10985811B2 (en) 2004-04-02 2021-04-20 Rearden, Llc System and method for distributed antenna wireless communications
US10187133B2 (en) 2004-04-02 2019-01-22 Rearden, Llc System and method for power control and antenna grouping in a distributed-input-distributed-output (DIDO) network
US10749582B2 (en) 2004-04-02 2020-08-18 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US8654815B1 (en) 2004-04-02 2014-02-18 Rearden, Llc System and method for distributed antenna wireless communications
US8542763B2 (en) 2004-04-02 2013-09-24 Rearden, Llc Systems and methods to coordinate transmissions in distributed wireless systems via user clustering
US10886979B2 (en) 2004-04-02 2021-01-05 Rearden, Llc System and method for link adaptation in DIDO multicarrier systems
US10277290B2 (en) 2004-04-02 2019-04-30 Rearden, Llc Systems and methods to exploit areas of coherence in wireless systems
US9819403B2 (en) 2004-04-02 2017-11-14 Rearden, Llc System and method for managing handoff of a client between different distributed-input-distributed-output (DIDO) networks based on detected velocity of the client
US9826537B2 (en) 2004-04-02 2017-11-21 Rearden, Llc System and method for managing inter-cluster handoff of clients which traverse multiple DIDO clusters
US11394436B2 (en) 2004-04-02 2022-07-19 Rearden, Llc System and method for distributed antenna wireless communications
US9312929B2 (en) 2004-04-02 2016-04-12 Rearden, Llc System and methods to compensate for Doppler effects in multi-user (MU) multiple antenna systems (MAS)
US10425134B2 (en) * 2004-04-02 2019-09-24 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US11451275B2 (en) 2004-04-02 2022-09-20 Rearden, Llc System and method for distributed antenna wireless communications
US11309943B2 (en) 2004-04-02 2022-04-19 Rearden, Llc System and methods for planned evolution and obsolescence of multiuser spectrum
US9685997B2 (en) 2007-08-20 2017-06-20 Rearden, Llc Systems and methods to enhance spatial diversity in distributed-input distributed-output wireless systems
US8498207B2 (en) * 2008-06-26 2013-07-30 Reverb Networks Dynamic load balancing
US9826416B2 (en) * 2009-10-16 2017-11-21 Viavi Solutions, Inc. Self-optimizing wireless network
US20110090820A1 (en) 2009-10-16 2011-04-21 Osama Hussein Self-optimizing wireless network
JP4956628B2 (en) * 2010-01-21 2012-06-20 株式会社エヌ・ティ・ティ・ドコモ Mobile communication system, network device, and mobile communication method
JP5081257B2 (en) * 2010-02-04 2012-11-28 株式会社エヌ・ティ・ティ・ドコモ Radio communication system, radio base station apparatus, and communication control method
US20110201336A1 (en) * 2010-02-12 2011-08-18 David Garrett METHOD AND SYSTEM FOR OPTIMIZING USER-LEVEL QoS DURING A LOCATION-BASED HANDOFF OVER HETEROGENEOUS MOBILE ENVIRONMENTS
CN102195917B (en) * 2010-03-09 2014-01-08 华为技术有限公司 Method and device for sharing site and determining site cell identifier during cooperative communication
US8873440B2 (en) * 2010-03-29 2014-10-28 Qualcomm Incorporated Maintaining different virtual active sets for different cell types
US9060269B2 (en) * 2010-12-15 2015-06-16 At&T Intellectual Property I, L.P. Optimization of cellular network architecture based on device type-specific traffic dynamics
FR2974699B1 (en) * 2011-04-29 2013-06-14 Mentum METHOD FOR OPTIMIZING THE QUALITY OF A CELLULAR NETWORK
US8509762B2 (en) 2011-05-20 2013-08-13 ReVerb Networks, Inc. Methods and apparatus for underperforming cell detection and recovery in a wireless network
US9658892B2 (en) 2011-08-31 2017-05-23 International Business Machines Corporation Management of storage cluster performance with hybrid workloads
EP2754271B1 (en) * 2011-09-09 2019-11-13 Reverb Networks Inc. Methods and apparatus for implementing a self optimizing-organizing network manager
EP3419188A1 (en) * 2011-09-14 2018-12-26 Rearden Mova, LLC Systems and methods to exploit areas of coherence in wireless systems
KR20140062501A (en) * 2011-09-28 2014-05-23 후지쯔 가부시끼가이샤 Scheduling and allocation method and device in coordinated multiple point system
US9258719B2 (en) * 2011-11-08 2016-02-09 Viavi Solutions Inc. Methods and apparatus for partitioning wireless network cells into time-based clusters
US9439085B2 (en) * 2011-11-10 2016-09-06 Viavi Solutions Uk Limited Geolocation data prioritization system
JP5927901B2 (en) * 2011-12-26 2016-06-01 シャープ株式会社 Mobile station apparatus, base station apparatus, communication system, uplink transmission control method, and integrated circuit
GB2497991A (en) 2011-12-30 2013-07-03 Aircom Internat Optimising a self organising network
US8983470B1 (en) * 2012-01-23 2015-03-17 Eden Rock Communications, Llc Automatic identification of clustered near neighbor cells in wireless networks
EP2815541B1 (en) * 2012-02-17 2018-06-27 Osama Tarraf Methods and apparatus for coordination in multi-mode networks
US9215597B2 (en) * 2012-03-16 2015-12-15 Alcatel Lucent Method of coordinating concurrent sector optimizations in a wireless communication system
US9332458B2 (en) 2012-03-25 2016-05-03 Cisco Technology, Inc. System and method for optimizing performance of a communication network
EP2871889B1 (en) * 2012-07-31 2019-09-11 Huawei Technologies Co., Ltd. Terminal selection method, network entity, and system based on self-organizing networks
US20140073303A1 (en) * 2012-09-10 2014-03-13 At&T Mobility Ii Llc Historic performance analysis for modification of neighbor relations
US11189917B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for distributing radioheads
US10194346B2 (en) 2012-11-26 2019-01-29 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US11050468B2 (en) 2014-04-16 2021-06-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
US11190947B2 (en) 2014-04-16 2021-11-30 Rearden, Llc Systems and methods for concurrent spectrum usage within actively used spectrum
US10164698B2 (en) 2013-03-12 2018-12-25 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10488535B2 (en) 2013-03-12 2019-11-26 Rearden, Llc Apparatus and method for capturing still images and video using diffraction coded imaging techniques
US9923657B2 (en) 2013-03-12 2018-03-20 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US9973246B2 (en) 2013-03-12 2018-05-15 Rearden, Llc Systems and methods for exploiting inter-cell multiplexing gain in wireless cellular systems via distributed input distributed output technology
US10547358B2 (en) 2013-03-15 2020-01-28 Rearden, Llc Systems and methods for radio frequency calibration exploiting channel reciprocity in distributed input distributed output wireless communications
US20140274055A1 (en) * 2013-03-18 2014-09-18 Alcatel-Lucent Usa Inc. Method and apparatus for network neighbor cell list optimization
US10327157B2 (en) 2013-03-25 2019-06-18 Nokia Solutions And Networks Oy Dynamically targeting optimization of network elements
US9473956B2 (en) * 2013-07-02 2016-10-18 Nokia Solutions And Networks Oy Antenna tilt optimization in a wireless communications network
US10135685B2 (en) 2013-10-10 2018-11-20 Nokia Solutions And Networks Oy Undoing changes made to a communication network
US11290162B2 (en) 2014-04-16 2022-03-29 Rearden, Llc Systems and methods for mitigating interference within actively used spectrum
US11252555B2 (en) * 2014-07-11 2022-02-15 Apple Inc. Receive operation mode indication for power save
US10091725B2 (en) 2014-07-11 2018-10-02 Apple Inc. Outage delay indication and exploitation
IL234002A (en) 2014-08-07 2016-06-30 Wireless Technologies Pte Ltd Cellwize Method of operating a self-organizing network and system thereof
CN106717084B (en) 2014-09-15 2020-02-14 华为技术有限公司 Apparatus and method for overlapping rate partition
US20170251377A1 (en) * 2014-09-25 2017-08-31 Nokia Solutions And Networks Oy Method and system for neighbor tier determination
US10505812B1 (en) 2014-09-25 2019-12-10 Nokia Solutions And Networks Oy Method and system for neighbor tier counting in three dimensions
US9730086B2 (en) * 2015-01-19 2017-08-08 Viavi Solutions Uk Limited Techniques for dynamic network optimization using geolocation and network modeling
US9113353B1 (en) 2015-02-27 2015-08-18 ReVerb Networks, Inc. Methods and apparatus for improving coverage and capacity in a wireless network
US10219261B2 (en) 2015-12-08 2019-02-26 At&T Mobility Ii Llc Method and apparatus for transmitting a control signal to a self organizing network controller
US10609587B2 (en) 2016-05-01 2020-03-31 Teoco Corporation System, method, and computer program product for location-based detection of indicator anomalies
US10327165B2 (en) * 2016-12-21 2019-06-18 Khalifa University Of Science, Technology And Research Methods and systems for monitoring mobile networks
US10448261B2 (en) 2018-01-09 2019-10-15 P.I. Works U.S., Inc. Method for capacity and coverage optimization of a multi-RAT network
CN111385818B (en) * 2018-12-28 2023-04-14 中国移动通信集团重庆有限公司 Method, device and equipment for optimizing wireless network parameters
US11044155B2 (en) 2019-07-31 2021-06-22 International Business Machines Corporation Utilizing unstructured data in self-organized networks
US10555191B1 (en) 2019-08-01 2020-02-04 T-Mobile Usa, Inc. Optimum network performance improvement solutions selection systems and methods
US11343683B2 (en) 2020-04-22 2022-05-24 T-Mobile Usa, Inc. Identification and prioritization of optimum capacity solutions in a telecommunications network
US11350289B2 (en) 2020-05-14 2022-05-31 T-Mobile Usa, Inc. Identification of indoor and outdoor traffic usage of customers of a telecommunications network
US11064382B1 (en) 2020-05-07 2021-07-13 T-Mobile Usa, Inc. Management of telecommunications network congestion on roadways
US11153765B1 (en) 2020-05-15 2021-10-19 T-Mobile Usa, Inc. Capacity planning of telecommunications network by detecting anomalies in site behavior
FI129884B (en) * 2020-06-10 2022-10-14 Elisa Oyj Automated evaluation of effects of changes in communication networks
WO2023279203A1 (en) 2021-07-06 2023-01-12 Sierra Wireless, Inc. Method and apparatus for managing device to device communication
US11800382B1 (en) 2021-09-08 2023-10-24 T-Mobile Usa, Inc. Coverage improvement for 5G new radio wireless communication network
US11606732B1 (en) 2021-09-08 2023-03-14 T-Mobile Usa, Inc. Coverage improvement for 5G new radio wireless communication network, such as for over-shooting cells
WO2024039372A1 (en) * 2022-08-18 2024-02-22 Rakuten Symphony Singapore Pte. Ltd. System, method, and non-transitory computer-readable media for forecasting capacity breaches in a mobile network

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090075648A1 (en) 2007-09-14 2009-03-19 Actix Limited Mobile phone network optimisation systems

Family Cites Families (194)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US699766A (en) * 1901-08-26 1902-05-13 Henry A Robinson Washing-machine.
US20010050943A1 (en) * 1989-08-03 2001-12-13 Mahany Ronald L. Radio frequency communication network having adaptive communication parameters
US5425051A (en) * 1992-11-09 1995-06-13 Norand Corporation Radio frequency communication network having adaptive parameters
DE3932015A1 (en) * 1988-12-15 1991-04-04 Hoechst Ag GENE AND GENE STRUCTURE, CODING AN AMINOTRANSFERASE, MICROORGANISMS EXPRESSING THIS GENE, AND TRANSAMINATION METHOD USING THE EXPRESSION PRODUCT
US6115393A (en) 1991-04-12 2000-09-05 Concord Communications, Inc. Network monitoring
US5802144A (en) * 1996-04-15 1998-09-01 Mci Corporation Minimum common span network outage detection and isolation
US5796722A (en) * 1996-05-17 1998-08-18 Motorola, Inc. Method and apparatus for dynamic load balancing using handoff
US6138016A (en) * 1996-12-04 2000-10-24 Nortel Networks Corporation Distributing location tracking functionality in wireless telephone systems
US6253077B1 (en) * 1997-05-16 2001-06-26 Texas Instruments Incorporated Downstream power control in point-to-multipoint systems
US6999766B1 (en) 1997-05-19 2006-02-14 Qualcomm Incorporated Method and apparatus for optimization of a cellular network
US5859839A (en) * 1997-06-30 1999-01-12 Motorola, Inc. Method for automatically selecting channel powers in a wireless communication system
US6069871A (en) * 1997-07-21 2000-05-30 Nortel Networks Corporation Traffic allocation and dynamic load balancing in a multiple carrier cellular wireless communication system
US6141565A (en) * 1997-11-13 2000-10-31 Metawave Communications Corporation Dynamic mobile parameter optimization
US6304556B1 (en) 1998-08-24 2001-10-16 Cornell Research Foundation, Inc. Routing and mobility management protocols for ad-hoc networks
US7006805B1 (en) 1999-01-22 2006-02-28 Parker Vision, Inc. Aliasing communication system with multi-mode and multi-band functionality and embodiments thereof, such as the family radio service
US6549529B1 (en) * 1999-02-01 2003-04-15 Lucent Technologies Inc. System and method for controlling antenna downtilt/uptilt in a wireless communication network
US6729929B1 (en) 1999-03-17 2004-05-04 Cisco Systems, Inc. Method and apparatus for controlling wireless networks
US7243054B2 (en) * 1999-07-14 2007-07-10 Wireless Valley Communications, Inc. Method and system for displaying network performance, cost, maintenance, and infrastructure wiring diagram
TW449713B (en) * 1999-08-27 2001-08-11 Darfon Electronics Corp A pointing stick device that enables to increase the sensitivity of vertical direction
US6545690B1 (en) 1999-09-29 2003-04-08 Lucent Technologies Inc. Liaison interface
US6574477B1 (en) * 1999-10-06 2003-06-03 Lucent Technologies Inc. Dynamic load balancing during message processing in a wireless communication service network
US6842431B2 (en) 1999-11-04 2005-01-11 Lucent Technologies Inc. Methods and apparatus for characterization, adjustment and optimization of wireless networks
US6400335B1 (en) 2000-08-09 2002-06-04 Lucent Technologies Inc. Dynamic load sharing system and method using a cylindrical antenna array
US7016685B1 (en) * 2000-08-24 2006-03-21 Santera Systems, Inc. System and methods of dynamic load balancing across processor nodes
FI114749B (en) 2000-09-11 2004-12-15 Nokia Corp Anomaly detection system and method for teaching it
US6760882B1 (en) 2000-09-19 2004-07-06 Intel Corporation Mode selection for data transmission in wireless communication channels based on statistical parameters
US8010469B2 (en) 2000-09-25 2011-08-30 Crossbeam Systems, Inc. Systems and methods for processing data flows
US6647597B2 (en) * 2001-01-19 2003-11-18 Lodestone Fasteners, Llc Adjustable magnetic snap fastener
US6973229B1 (en) * 2001-02-28 2005-12-06 Lambda Opticalsystems Corporation Node architecture for modularized and reconfigurable optical networks, and methods and apparatus therefor
DE60136491D1 (en) 2001-03-30 2008-12-18 Nokia Corp METHOD FOR CONFIGURING A NETWORK BY DEFINING CLUSTERS
US7260415B1 (en) * 2001-05-31 2007-08-21 Sprint Spectrum L.P. Method and system for location-based power control in wireless communications
US6937863B1 (en) * 2001-08-15 2005-08-30 Kathrein-Werke Kg System and method for dynamically adjusting cell sectorization
US6829491B1 (en) * 2001-08-15 2004-12-07 Kathrein-Werke Kg Dynamic and self-optimizing smart network
US7277679B1 (en) 2001-09-28 2007-10-02 Arraycomm, Llc Method and apparatus to provide multiple-mode spatial processing to a terminal unit
US20040266442A1 (en) * 2001-10-25 2004-12-30 Adrian Flanagan Method and system for optimising the performance of a network
SE0103873D0 (en) * 2001-11-20 2001-11-20 Ericsson Telefon Ab L M Method in a cellular radio communication network
RU2232485C2 (en) * 2001-11-27 2004-07-10 Корпорация "Самсунг Электроникс" Procedure to form directivity pattern of antenna and device for its realization
US20030191856A1 (en) * 2002-04-08 2003-10-09 Paul Lewis Wireless networking with dynamic load sharing and balancing
US6985704B2 (en) 2002-05-01 2006-01-10 Dali Yang System and method for digital memorized predistortion for wireless communication
US20030228857A1 (en) * 2002-06-06 2003-12-11 Hitachi, Ltd. Optimum scan for fixed-wireless smart antennas
AU2003237454A1 (en) * 2002-06-06 2003-12-22 Motorola, Inc., A Corporation Of The State Of Delaware Protocol and structure for mobile nodes in a self-organizing communication network
KR100450407B1 (en) 2002-08-28 2004-09-30 한국전자통신연구원 A Multi QoS Path Computation Method
US7477920B2 (en) * 2002-10-25 2009-01-13 Intel Corporation System and method for automatically configuring and integrating a radio base station into an existing wireless cellular communication network with full bi-directional roaming and handover capability
US7839882B2 (en) 2002-10-31 2010-11-23 Qualcomm Incorporated Resource allocation in a wireless communication system
DE10251993B4 (en) * 2002-11-06 2012-09-27 Actix Gmbh Method and apparatus for optimizing cellular wireless communication networks
DE10307408B3 (en) 2003-02-20 2004-09-02 Radioplan Gmbh Process for the sequential control of sequential object-oriented system simulations of communication in mobile radio networks
US7561876B2 (en) * 2003-02-21 2009-07-14 Groundhog Technologies Inc. System with user interface for network planning and mobility management optimization in a mobile communication network and method thereof
US7248574B2 (en) * 2003-02-24 2007-07-24 Autocell Laboratories, Inc. Apparatus for selecting an optimum access point in a wireless network
US7150044B2 (en) * 2003-03-10 2006-12-12 Mci, Llc Secure self-organizing and self-provisioning anomalous event detection systems
US7953372B2 (en) * 2003-04-07 2011-05-31 Yoram Ofek Directional antenna sectoring system and methodology
US7162250B2 (en) * 2003-05-16 2007-01-09 International Business Machines Corporation Method and apparatus for load sharing in wireless access networks based on dynamic transmission power adjustment of access points
US7480234B1 (en) 2003-10-31 2009-01-20 Cisco Technology, Inc. Initial timing estimation in a wireless network receiver
US8068845B2 (en) 2003-11-06 2011-11-29 Panasonic Corporation Transmission power level setting during channel assignment for interference balancing in a cellular wireless communication system
EP1530387A1 (en) * 2003-11-06 2005-05-11 Matsushita Electric Industrial Co., Ltd. Transmission power range setting during channel assignment for interference balancing in a cellular wireless communication system
US7529215B2 (en) 2003-11-17 2009-05-05 Telefonaktiebolaget Lm Ericsson (Publ) Encapsulation of independent transmissions over internal interface of distributed radio base station
US7461037B2 (en) 2003-12-31 2008-12-02 Nokia Siemens Networks Oy Clustering technique for cyclic phenomena
FR2865095B1 (en) 2004-01-08 2006-04-28 Nortel Networks Ltd METHOD FOR ALLOCATING COMMUNICATION RESOURCES AND RADIO COMMUNICATION SYSTEM FOR IMPLEMENTING THE METHOD
DE102004002145B4 (en) * 2004-01-15 2007-11-22 Radioplan Gmbh Method and device for adapting a radio network model to the conditions of a real radio network
DE602004028661D1 (en) * 2004-01-27 2010-09-23 Actix Ltd TRAFFIC MONITORING SYSTEM FOR A MOBILE RADIO NETWORK FOR TRAFFIC ANALYSIS WITH A HIERARCHICAL APPROACH
US7310526B2 (en) * 2004-02-06 2007-12-18 Nec Laboratories America, Inc. Load-aware handoff and site selection scheme
TWI373925B (en) 2004-02-10 2012-10-01 Tridev Res L L C Tunable resonant circuit, tunable voltage controlled oscillator circuit, tunable low noise amplifier circuit and method of tuning a resonant circuit
US7599420B2 (en) 2004-07-30 2009-10-06 Rearden, Llc System and method for distributed input distributed output wireless communications
FR2869746B1 (en) * 2004-04-29 2006-07-28 Alcatel Sa MULTI-CRITERIA LOAD DISTRIBUTION DEVICE FOR PERIPHERAL EQUIPMENT OF A LABEL-SWITCHING COMMITATION NETWORK
US7536205B2 (en) 2004-06-15 2009-05-19 Samsung Electronics Co., Ltd. Apparatus and method for downlink spatial division multiple access scheduling in a wireless network
US7590589B2 (en) 2004-09-10 2009-09-15 Hoffberg Steven M Game theoretic prioritization scheme for mobile ad hoc networks permitting hierarchal deference
US7663555B2 (en) 2004-10-15 2010-02-16 Sky Cross Inc. Method and apparatus for adaptively controlling antenna parameters to enhance efficiency and maintain antenna size compactness
US7929459B2 (en) * 2004-10-19 2011-04-19 At&T Mobility Ii Llc Method and apparatus for automatically determining the manner in which to allocate available capital to achieve a desired level of network quality performance
SE528018C2 (en) 2004-11-26 2006-08-08 Powerwave Technologies Sweden antenna control system
JP4636282B2 (en) * 2005-01-12 2011-02-23 日本電気株式会社 User throughput geographical distribution estimation system and user throughput geographical distribution estimation method
US7349765B2 (en) * 2005-02-18 2008-03-25 General Motors Corporation System and method for managing utility consumption
US8218477B2 (en) * 2005-03-31 2012-07-10 Alcatel Lucent Method of detecting wireless network faults
US7668530B2 (en) 2005-04-01 2010-02-23 Adaptix, Inc. Systems and methods for coordinating the coverage and capacity of a wireless base station
US7623455B2 (en) * 2005-04-02 2009-11-24 Cisco Technology, Inc. Method and apparatus for dynamic load balancing over a network link bundle
US8369271B2 (en) * 2005-04-22 2013-02-05 Alcatel Lucent Method of configuring a cell of a wireless communication system for improved resource utilization
US20060246844A1 (en) * 2005-04-28 2006-11-02 Kroboth Robert H Method and apparatus for depicting quality of service in mobile networks
US7577103B2 (en) 2005-06-30 2009-08-18 Alcatel-Lucent Usa Inc. Dynamic methods for improving a wireless network
US7535839B2 (en) * 2005-06-30 2009-05-19 Alcatel-Lucent Usa Inc. Method and apparatus for quality-of-service based admission control using prediction of scheduling gain
JP4578346B2 (en) * 2005-07-25 2010-11-10 株式会社エヌ・ティ・ティ・ドコモ Radio control apparatus and communication method
KR101302607B1 (en) 2005-09-01 2013-09-02 프라운호퍼-게젤샤프트 츄어 푀르더룽 데어 안게반텐 포르슝에.파우. Stand-alone miniaturised communication module
GB2430330B (en) * 2005-09-19 2010-03-10 Agilent Technologies Inc Allocation of a performance indicator among cells in a cellular communication system
US8874477B2 (en) 2005-10-04 2014-10-28 Steven Mark Hoffberg Multifactorial optimization system and method
CA2626883A1 (en) * 2005-10-24 2007-05-03 Seeker Wireless Pty Limited Detection in mobile service maintenance
HRP20050953B1 (en) 2005-11-08 2012-04-30 T-Mobile Hrvatska D.O.O. Base station system performance measurement system in a gsm radio communicatioon network
US20070147297A1 (en) * 2005-12-28 2007-06-28 Diaz Alvaro H Dynamic baseline technique for analyzing wireless networks
EP2733872B1 (en) * 2006-03-03 2015-09-09 KTFreetel Co., Ltd. Method for measuring quality of wireless network
US20070218862A1 (en) * 2006-03-14 2007-09-20 Tatman Lance A System and method for making measurements in customer devices across different service provider networks
US8491159B2 (en) 2006-03-28 2013-07-23 Wireless Environment, Llc Wireless emergency lighting system
US8472565B2 (en) 2006-05-23 2013-06-25 Lg Electronics Inc. Apparatus for processing received signal, method thereof, and method for selecting mapping rule
EP2030414B1 (en) 2006-06-12 2018-04-04 Cloudsoft Corporation Limited Self-managed distributed mediation networks
WO2008003815A1 (en) * 2006-07-07 2008-01-10 Nokia Corporation Improved radio resource allocation mechanism
WO2008011149A2 (en) * 2006-07-20 2008-01-24 Bandspeed, Inc. Managing wireless base stations using a distributed virtual base station manager
US7385503B1 (en) 2006-08-03 2008-06-10 Rosemount, Inc. Self powered son device network
US20080039089A1 (en) * 2006-08-11 2008-02-14 Berkman William H System and Method for Providing Dynamically Configurable Wireless Communication Network
US7969896B2 (en) * 2006-08-29 2011-06-28 Cisco Technology, Inc. Method and system for providing connectivity outage detection for MPLS core networks based on service level agreement
US8059009B2 (en) 2006-09-15 2011-11-15 Itron, Inc. Uplink routing without routing table
US7757103B2 (en) * 2006-12-20 2010-07-13 Intel Corporation Method and apparatus to estimate energy consumed by central processing unit core
WO2008087535A2 (en) * 2007-01-18 2008-07-24 Nokia Corporation Network oriented control of self-optimization measurements
WO2008102252A1 (en) * 2007-02-23 2008-08-28 Nokia Corporation Self optimization of forbidden neighbor cell list
KR101422141B1 (en) * 2007-02-27 2014-07-28 아주대학교산학협력단 System and method for using resource in a communication system
US20080225714A1 (en) 2007-03-12 2008-09-18 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic load balancing
WO2008120159A2 (en) * 2007-03-30 2008-10-09 Nokia Corporation System and method for self-optimization of interference coordination in communication systems
US8209071B2 (en) * 2007-04-16 2012-06-26 Raytheon Company Methods and apparatus for aircraft turbulence detection
US20090023477A1 (en) * 2007-07-19 2009-01-22 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for reconfiguring a multi-sector base station
US8165590B2 (en) * 2007-08-13 2012-04-24 Telefonaktiebolaget Lm Ericsson (Publ) Neighbor cell relation list initialization
CN101785339A (en) 2007-08-16 2010-07-21 日本电气株式会社 Radio communication system and method
GB2461242B (en) * 2007-09-14 2010-06-30 Actix Ltd Mobile phone network management systems
US9210042B2 (en) 2007-09-14 2015-12-08 Nec Europe Ltd. Method and system for optimizing network performances
WO2009048088A1 (en) 2007-10-11 2009-04-16 Nec Corporation Wireless communication system and method
US20090112932A1 (en) 2007-10-26 2009-04-30 Microsoft Corporation Visualizing key performance indicators for model-based applications
US20090163223A1 (en) * 2007-12-21 2009-06-25 Elektrobit Wireless Communications Ltd. Load balancing in mobile environment
US8780732B2 (en) * 2008-03-18 2014-07-15 Qualcomm Incorporated Method of network management by assistance from terminal using control-plane signaling between terminal and network
WO2009115541A2 (en) * 2008-03-19 2009-09-24 Nokia Siemens Networks Oy Transmission power reduction in interference limited nodes
EP2120493A1 (en) * 2008-03-19 2009-11-18 Nokia Siemens Networks Oy Mechanism for automated re-configuration of an access network element
US20110034179A1 (en) 2008-04-07 2011-02-10 Seeker Wireless Pty. Limited Location of wireless mobile terminals
MX2010010899A (en) 2008-04-18 2010-11-05 Ericsson Telefon Ab L M Method of operating an access network.
US8583119B2 (en) * 2008-04-21 2013-11-12 Qualcomm Incorporated Method and apparatus for management of automatic neighbor relation function in wireless networks
CA2722931A1 (en) 2008-04-29 2009-11-05 Jamie Hackett Wireless control system using variable power dual modulation transceivers
DE602008004115D1 (en) 2008-05-28 2011-02-03 Alcatel Lucent Method for detecting a radio cell failure
US7747712B2 (en) 2008-06-12 2010-06-29 Telefonaktiebolaget Lm Ericsson Managed node initial operational state
US20090310584A1 (en) 2008-06-13 2009-12-17 Fujitus Microelectronics Limited Self Organizing Network
US8498207B2 (en) 2008-06-26 2013-07-30 Reverb Networks Dynamic load balancing
UA99537C2 (en) 2008-07-01 2012-08-27 Квелкомм Инкорпорейтед Network element configuration scheme
US8117294B2 (en) 2008-07-07 2012-02-14 Nokia Siemens Networks Oy Managing of network equipment
US20100008293A1 (en) * 2008-07-09 2010-01-14 Qualcomm Incorporated X2 interfaces for access point base stations in self-organizing networks (son)
US20100029282A1 (en) 2008-07-31 2010-02-04 Qualcomm Incorporated Resource partitioning in heterogeneous access point networks
EP2335434A1 (en) * 2008-08-22 2011-06-22 Research In Motion Limited Network quality of service update control
US8301156B2 (en) * 2008-09-25 2012-10-30 Optimi Corporation Load balancing for capacity improvement in mobile wireless communication networks
US20100103911A1 (en) * 2008-10-28 2010-04-29 Samsung Electronics, Co., Ltd. Apparatus and method providing an IEEE-802.16 self-organizing network
US8139535B2 (en) 2008-10-31 2012-03-20 Intel Corporation Blind channel detection techniques
US8391252B2 (en) 2008-10-31 2013-03-05 Intel Corporation Techniques to support multiple radio-access technologies
US8611886B2 (en) * 2008-10-31 2013-12-17 At&T Mobility Ii Llc Remote electrical tilting antenna system measurement via downlink antenna
US20100124934A1 (en) * 2008-11-20 2010-05-20 Nokia Corporation Wireless System Improvements Based On Location Positioning System Data
US8422461B2 (en) * 2008-11-24 2013-04-16 Pctel, Inc. Self-configurable wireless network with cooperative interference measurements by base stations
US7796514B2 (en) 2008-12-11 2010-09-14 At&T Intellectual Property I, L.P. System and method for multi-services packet network traffic engineering
US20100149984A1 (en) * 2008-12-13 2010-06-17 Salil Kapoor Self Dimensioning and optimization of telecom Network - SDAOTN
WO2010077318A1 (en) 2008-12-17 2010-07-08 Airhop Communications, Inc. Base station with coordinated multiple air-interface operations
US8213951B2 (en) * 2008-12-23 2012-07-03 At & T Mobility Ii Llc Using mobile communication devices to facilitate coordinating use of resources
US8355728B2 (en) 2009-01-06 2013-01-15 Lg Electronics Inc. Method for operating service unavailable mode of femto base station
ES2368385T3 (en) * 2009-01-29 2011-11-16 Lg Electronics Inc. SIGNAL TRANSMISSION SCHEME FOR EFFECTIVE MANAGEMENT OF THE COMMON IMPROVED DEDICATED CHANNEL.
EP2392099B1 (en) 2009-02-02 2017-10-04 Nokia Solutions and Networks Oy Communicating a network event
CN101801015B (en) * 2009-02-06 2014-03-12 中兴通讯股份有限公司 Method and device for processing out of service faults of cell
US8301149B2 (en) * 2009-02-12 2012-10-30 Optimi Corporation Call quality and coverage improvement in mobile wireless communication networks
KR101617341B1 (en) 2009-02-13 2016-05-19 삼성전자주식회사 Method and system for managing neighbor relation in wireless communication system
US20100216453A1 (en) * 2009-02-20 2010-08-26 Telefonaktiebolaget Lm Ericsson Compensating for cell outage using priorities
US8543121B2 (en) 2009-02-24 2013-09-24 Eden Rock Communications, Llc Systems and methods for usage-based radio resource management of self-optimizing cells
US8406759B2 (en) 2009-02-24 2013-03-26 Eden Rock Communications, Llc Systems and methods for managing radio resources unsing extended management information bases in wireless networks
CN102415186B (en) 2009-02-24 2014-12-17 伊甸石通信股份有限公司 Determining time varying radio frequency isolation characteristics between network cells
US20100232318A1 (en) * 2009-03-10 2010-09-16 Qualcomm Incorporated Random access channel (rach) optimization for a self-organizing network (son)
KR101580151B1 (en) 2009-03-16 2015-12-24 삼성전자주식회사 Method and system for improving call drop due to radio link failure in mobile communication system
US8320850B1 (en) 2009-03-18 2012-11-27 Rf Micro Devices, Inc. Power control loop using a tunable antenna matching circuit
WO2010105443A1 (en) 2009-03-20 2010-09-23 华为技术有限公司 Managed unit device, self-optimization method and system
BRPI0924651A2 (en) 2009-03-20 2016-01-26 Huawei Tech Co Ltd method, apparatus and system for controlling self-optimizing switch
US8717983B2 (en) * 2009-04-07 2014-05-06 National Taiwan University MediaTek Inc. Mechanism of dynamic resource transaction for wireless OFDMA systems
EP2424299B1 (en) 2009-04-23 2019-12-25 Nec Corporation Wireless communication system in which base station apparatus broadcasts identification information of relay apparatus
US9210586B2 (en) 2009-05-08 2015-12-08 Qualcomm Incorporated Method and apparatus for generating and exchanging information for coverage optimization in wireless networks
US20100299419A1 (en) * 2009-05-15 2010-11-25 Cisco Technology, Inc. System and method for a self organizing network
US8050191B2 (en) 2009-05-26 2011-11-01 Motorola Mobility, Inc. Distributed information storage and retrieval of communication network performance data
US20100311421A1 (en) 2009-06-05 2010-12-09 Tomasz Mach Methods and Apparatus for Communications Terminal Enabling Self Optimizing Networks in Air Interface Communications Systems
US9166875B2 (en) 2009-06-22 2015-10-20 Qualcomm Incorporated Method and apparatus for network optimization using SON solutions
US20110009105A1 (en) * 2009-07-13 2011-01-13 Jungwoo Lee Self-organizing networks using directional beam antennas
US8737359B2 (en) * 2009-07-30 2014-05-27 Qualcomm Incorporated Apparatus and method for feedback-based radio resource management (RRM) parameter optimization
US8755299B2 (en) 2009-08-10 2014-06-17 Nokia Siemens Networks Oy Self-organizing network related power capacity status reporting
US8526957B2 (en) * 2009-08-18 2013-09-03 Nokia Siemens Networks Oy De-centralized transmit power optimization
GB2473219B (en) 2009-09-03 2011-11-23 Vodafone Plc Changing parameters in a telecommunications system
KR101613848B1 (en) 2009-09-10 2016-04-21 삼성전자주식회사 Method and apparatus for allocating cell id in self-organizing network
US9826416B2 (en) * 2009-10-16 2017-11-21 Viavi Solutions, Inc. Self-optimizing wireless network
US20110090820A1 (en) 2009-10-16 2011-04-21 Osama Hussein Self-optimizing wireless network
US9100832B2 (en) * 2009-10-30 2015-08-04 Airhop Communications, Inc. Method and apparatus for self organized network
US20110130135A1 (en) * 2009-12-01 2011-06-02 Hafedh Trigui Coverage hole detector
WO2011070733A1 (en) 2009-12-08 2011-06-16 日本電気株式会社 Wireless communication system, base station device, base station control device, transmission power control method for a base station, and computer-readable medium
US8385900B2 (en) * 2009-12-09 2013-02-26 Reverb Networks Self-optimizing networks for fixed wireless access
KR101316682B1 (en) * 2009-12-15 2013-10-10 한국전자통신연구원 TNL Connection Setup Method and Apparatus for Base Station Using Downlink Receiver
US20110151881A1 (en) 2009-12-23 2011-06-23 Joey Chou Techniques for fractional frequency reuse in wireless networks
US8437268B2 (en) 2010-02-12 2013-05-07 Research In Motion Limited System and method for intra-cell frequency reuse in a relay network
WO2011106538A1 (en) 2010-02-24 2011-09-01 Interdigital Patent Holdings, Inc. Method and apparatus for sending an aggregated beacon
US20110252123A1 (en) 2010-04-08 2011-10-13 Kamakshi Sridhar Policy And Charging Rules Function In An Extended Self Optimizing Network
US9288690B2 (en) 2010-05-26 2016-03-15 Qualcomm Incorporated Apparatus for clustering cells using neighbor relations
US9585024B2 (en) 2010-07-27 2017-02-28 Huawei Technologies Co., Ltd. System and method for self-organized inter-cell interference coordination
EP2624621B1 (en) 2010-10-01 2023-07-12 Nec Corporation WIRELESS COMMUNICATION SYSTEM, TERMINAl AND METHOD
US8717920B2 (en) 2010-10-08 2014-05-06 Telefonaktiebolaget L M Ericsson (Publ) Signalling mechanism for multi-tiered intra-band carrier aggregation
US9198226B2 (en) 2010-11-11 2015-11-24 Nokia Solutions And Networks Oy Network management
EP2647239A1 (en) 2010-12-03 2013-10-09 Huawei Technologies Co., Ltd. Method and apparatus of communications
WO2012078105A1 (en) 2010-12-10 2012-06-14 Telefonaktiebolaget L M Ericsson (Publ) Adaptive load prediction for interference suppression receivers
US9313742B2 (en) 2010-12-10 2016-04-12 Telefonaktiebolaget L M Ericsson (Publ) Power control loop stability monitoring
US9462563B2 (en) 2011-01-17 2016-10-04 Optis Cellular Technology, Llc Method and apparatus for compensating signal timing measurements for differences in signal frequencies
WO2012112112A1 (en) 2011-02-15 2012-08-23 Telefonaktiebolaget Lm Ericsson (Publ) A first network node and a second network node and methods therein
EP2698036A4 (en) 2011-04-12 2015-04-15 Public Wireless Inc Common radio element application manager architecture for wireless picocells
US8929880B2 (en) 2011-04-21 2015-01-06 Motorola Solutions, Inc. Uplink interference management for a heterogeneous wireless network
US8509762B2 (en) 2011-05-20 2013-08-13 ReVerb Networks, Inc. Methods and apparatus for underperforming cell detection and recovery in a wireless network
WO2012177204A1 (en) 2011-06-21 2012-12-27 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatuses for accounting of cell change information
US8693397B2 (en) 2011-07-29 2014-04-08 At&T Mobility Ii Llc Macro network optimization with assistance from Femto cells
EP2754271B1 (en) 2011-09-09 2019-11-13 Reverb Networks Inc. Methods and apparatus for implementing a self optimizing-organizing network manager
US9258719B2 (en) 2011-11-08 2016-02-09 Viavi Solutions Inc. Methods and apparatus for partitioning wireless network cells into time-based clusters
EP2815541B1 (en) 2012-02-17 2018-06-27 Osama Tarraf Methods and apparatus for coordination in multi-mode networks

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090075648A1 (en) 2007-09-14 2009-03-19 Actix Limited Mobile phone network optimisation systems

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP2489160A4

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140080493A1 (en) * 2012-09-03 2014-03-20 Vodafone Holding Gmbh Disconnection of Resources of A Radio Access Network with A Low Network Load
US9585092B2 (en) * 2012-09-03 2017-02-28 Vodafone Holding Gmbh Disconnection of resources of a radio access network with a low network load
CN113169886A (en) * 2018-11-19 2021-07-23 脸谱公司 Communication network optimization

Also Published As

Publication number Publication date
WO2011046705A1 (en) 2011-04-21
US20160286411A1 (en) 2016-09-29
US8665835B2 (en) 2014-03-04
CA2777677A1 (en) 2011-04-21
US9826420B2 (en) 2017-11-21
US20150011197A1 (en) 2015-01-08
US20120087269A1 (en) 2012-04-12
EP2489160A4 (en) 2016-10-19
WO2011046704A3 (en) 2012-08-02
EP2489160B1 (en) 2019-07-10
US20110090820A1 (en) 2011-04-21
EP2489160A2 (en) 2012-08-22
US9226178B2 (en) 2015-12-29

Similar Documents

Publication Publication Date Title
US9826420B2 (en) Self-optimizing wireless network
US9826416B2 (en) Self-optimizing wireless network
US8498207B2 (en) Dynamic load balancing
US9037174B2 (en) Method and arrangement for improving radio network characteristics
CN103210593B (en) Methods and apparatus for inter-cell interference coordination self-organized network
CN104160725A (en) Evolutionary algorithms for geographic load balancing using a distributed antenna system
JP2002510914A (en) Apparatus and method for increasing CDMA capacity by frequency allocation
US20210410142A1 (en) Communication Method and Device
US8489031B2 (en) Interferer detection and interference reduction for a wireless communications network
Imran et al. Distributed load balancing through self organisation of cell size in cellular systems
Cheng et al. A distributed downlink resource allocation algorithm for dense small cell networks
Fakhri et al. An Interference Mitigation Scheme for Millimetre Wave Heterogeneous Cloud Radio Access Network with Dynamic RRH Clustering
JP4510888B2 (en) Resource distribution and signal routing method in a centralized base station
US20230156484A1 (en) Apparatus and method for ap placement of large-scale wireless lan and adaptive wireless resource management
Papazoglou et al. A dynamic channel assignment simulation system for large scale cellular telecommunications
Xu et al. Call dropping and blocking probability of the integrated cellular ad hoc relaying system
Zhang et al. Reverse link Erlang capacity of OFDMA wireless systems with adaptive resource allocation
Papazoglou et al. On new dynamic channel assignment schemes and their efficient evaluation through a generic simulation system for large scale cellular telecommunications
Koyuncu et al. Dynamic resource assignment using network flows in wireless data networks
Papazoglou et al. Evaluating novel DCA variations for efficient channel assignment in cellular communications through a generic Java simulation system
Bain et al. Brownfield design approach towards minimization of handoff cost in next generation wireless cellular networks with dual-homed RNCS
Sivarajah et al. Ongoing channel selection reassignment scheme for fast dynamic channel allocation in a UTRA-TDD system
Sandalidis et al. Design principles of reliable cellular systems
Rajan et al. Optimal CDMA network design with uplink and downlink rate guarantees
Hong et al. An innovative channel management strategy for highly reliable handoff in cellular networks

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

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 2777677

Country of ref document: CA

NENP Non-entry into the national phase in:

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2010823800

Country of ref document: EP