1. Field of the Invention
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.
2. Description of the Related Art
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 will 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).
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 beamwidth of the antenna, and downtilt 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) to the antenna will also affect the coverage of the antenna as well as the interference that 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.
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.
However, network planning and optimization consumes a high amount of human resources. In addition, it is a lengthy process which is done only when needed or periodically with long periods between implementation. In addition, 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. Thus, network resource usage is not maximized and unused available network resources result in significant revenue loss. Finally, quality of service is degraded, which affects the end user's overall customer satisfaction.
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 network performance.
An embodiment of the invention is directed to a method for optimizing a plurality cell sites/sectors in a wireless network. The method includes receiving network data regarding a plurality of cell sites/sectors, each cell site/sector corresponding to a coverage area for providing communications in a wireless network; evaluating the network data to determine if communications provided by the plurality of cell sites/sectors has been degraded; and determining a critical zone in which communication is degraded. The critical zone includes critical cell sites/sectors needing improved communications and neighbor cell sites/sectors corresponding to the critical cell sites/sectors.
The method also includes determining best neighbor cell sites/sectors among the neighbor cell sites/sectors; determining if the critical cell sites/sectors in the critical zone have available resources for achieving a desired improvement in communications; determining if the best neighbor cell sites/sectors have available resources for achieving the desired improvement in communications, when it is determined that the critical cells sites do not have adequate available resources for achieving the desired improvements in communications; altering wireless network parameters of the critical cell sites/sectors or the best neighbor cells sites for achieving the desired improvement in communications; and determining if the desired improvement in communications has been achieved by altering the wireless network parameters.
Altering wireless network parameters of the critical cell sites/sectors or the best neighbor cell sites/sectors are performed continuously until the desired improvement in communications in the wireless network is achieved.
An embodiment of the invention is also directed to program recorded on a computer-readable storage medium for optimizing a plurality cell sites/sectors in a wireless network. The program causes a computer to execute optimizing steps comprising receiving network data regarding a plurality of cell sites/sectors; evaluating the network data to determine if communications provided by the plurality of cell sites/sectors has been degraded; and determining a critical zone in which communication is degraded.
The program also causes the computer to perform the steps of determining best neighbor cell sites/sectors among the neighbor cell sites/sectors; determining if the critical cell sites/sectors have available resources for achieving a desired improvement in communications; determining if the best neighbor cell sites/sectors have available resources for achieving the desired improvement in communications, when it is determined that the critical cells sites do not have adequate available resources; altering wireless network parameters of the critical cell sites/sectors or the best neighbor cells sites for achieving the desired improvement in communications; and determining if the desired improvement in communications has been achieved by altering the wireless network parameters.
An embodiment of the invention is also directed to a system for optimizing a plurality cell 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 performs alterations to network parameters wireless network; at least one controller 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.
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 the apparatus to perform optimizing operations.
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:
Additional features are described herein, and will be apparent from the following description of the figures.
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.
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 an aid to the reader, and should not in any way be interpreted as limiting.
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 110 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 controllers 102 and the one or more base stations 103 can be wireless, wired or a combination of wireless and wired.
As seen in
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.
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 mobile 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 network 100. A more detailed discussion of the structure of the network optimization apparatus 101 is noted below with reference to
The controllers 102 illustrated in
Each coverage area behaves as an independent sector serving its own set of subscribers. For fixed wireless systems, such as IEEE802.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 that can be a single frequency channel for IEEE802.16e-2005 (or UMTS or 1x-EVDO Rev. B and C) or multiple frequency channels that can be supported by IEEE802.16m (or UMTS or 1xEVDO Rev. B and C).
As illustrated in
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
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 manually 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.
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.
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, as shown in
Referring now to
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 days. 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 be calculated and compared to performance metrics before the previous recommended configuration modifications or compared to the first KPIs. An algorithm will evaluate the KPIs 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.
Thus, after the observation window has been reached in step 205 then, in step 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 recommended configuration modifications are removed until the best previous operation state is achieved, and in step 220 the self-optimization process ends. If in step 206 it is determined that the operating conditions of the cell sites/sectors in the zones have not been degraded, then in step 207 a critical hour is determined.
The critical hour may be the specific time a zone suffers from a highly degraded condition. In step 208, it is determined if the critical cell/sector has enough available resources for the critical hour. For example, the 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 or greater than a preset/dynamic threshold, then it can be determined if the critical cell site/sector has adequate available resources to address the degraded condition.
If it is determined that the cell site/sector has available resources, then the previous recommended configuration modifications are removed (in step 204) and, for example, load balancing techniques can be used to address the degradation condition in the zone instead. The optimization process is then ended in step 220. If 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.
In step 210, if no best neighbor site is found, then the previous recommended configuration modifications are removed in step 204 and the optimization process is ended in step 220. 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.
If a best neighbor site/or cell is found in step 210, then in step 211 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 the previous recommended configuration modifications are removed in step 204 and the optimization process is ended in step 220. If the best neighbor cell 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.
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.
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.
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.
The following is an example of the method of optimizing a wireless network that is consistent the method described above with reference to
The neighbor list can be stored in the network database 110 in the form of table that includes a list of cells and a corresponding list of zones. 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. 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 simple_zone_id=local_zone_id for each cell. A “simple zone list” saves the checked/partially checked local zones during the search, and it contains the simple 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.
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 based on finding a cell_ID that matches the cell_ID entered for a cell. In step 304, a Y zone reference is determined from the simple zone list based on finding a zone_ID that matches the zone_ID entered for the cell. Once the X zone reference and Y zone reference are determined for the critical cell, 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 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 cell_ID is added to this final critical zone. In step 309, it is determined if any cells 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 checked, then the remaining cells in the cells table are checked by returning to step 303.
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 311, the X zone reference and the Y zone are included in the new final critical zone, the cell list in the database 110 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.
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. 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.
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 314 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 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.
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 317, 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 cells table that have not been checked, then the remaining cells in the cells table are checked by returning to step 303.
In step 401, the neighbor cells/sectors are determined based on the cells list table in the database 110. 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 calls 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:
UL and DL Stats For Each Sector/Carrier: Load, Erlangs and Throughput
Capacity For Each Sector/Carrier
Sensitive KPIs To Operators Per Sector/Carrier Such as Dropped Calls and Blocked Calls
Location Of Most Users (Clusters)
Year/Month/Day/Time
Cell ID
Antenna ID
Carrier Frequency
Number Of Established Calls
Channel Elements (CE) Primary Use
% Primary Traffic CE Usage
% Secondary Traffic CE Usage
Total CE Usage (Erlang)
Peak # of Walsh Codes
Soft Handover Overhead %
Soft or hard handover counts
Peak DL Power
Number Of Dropped And Lost Calls
Number Of Blocked Calls
UL Thermal Noise Floor (main)
UL thermal Noise Floor (diversity)
Average DL Power
Pilot, Paging and Sync Channels Powers
Peak Number of Primary Walsh codes
Reported Or Calculated Sector Load For UL
Site Latitude And Longitude
Type: Macro-Cell, Micro-Cell, Repeater
Handoff Parameters (T_Add, T_Drop, Tt_Drop, T_Comp)
PA Output Power
Antenna Direction
Antenna Height Above Ground And Sea Level
Antenna Model, Azimuth BW, Elevation BW, Gain, Electrical And Mechanical Tilt
PN Offset Per Sector
Morphology: Urban, Highway, Suburban, Rural, Dense Urban
Number Of RF Carriers Per Sector And Their Frequencies
Equipment Multi-Antenna Capability: Rx Diversity, STC, MIMO
Losses From PA Output To Antenna Ports If Applicable
Multi-Carriers To Antennas Mapping
Technology: WIMAX, UMTS, HSxPA, CDMA2000, 1xRTT, 1x-EVDO Rev. A, B or C, GSM, etc., And Supported Features By The Equipment
In step 403, the neighbor cells are then grouped based on available resources and network statistics. The grouped neighbor cells are sorted based on network statistics. Then, in step 404, the neighbor cells in the first group are ranked based on their available resources. For example, the top neighbor cell sites/sectors may have a high number of handovers with 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 determined. 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 cell 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 will be searched using the same criteria.
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.
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.
The memory 501 can be computer-readable storage medium used to store executable instructions, or computer program thereon. The memory 501 may include a read-only 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 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.
The computer program is also intended to include an algorithm that includes executable instructions stored in the memory 501 that are executable by one or more processors 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
The user interface 503 allows for interaction between a user and the self-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 interface 505 may be a local area network (LAN) card (e.g., for Ethernet™ or an Asynchronous Transfer Model (ATM) network) to provide a data communication connection to a compatible LAN.
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.11 wireless local area networks (WLANS). And, the exchange of information may involve the transmission of radio frequency (RF) signals through an antenna (not shown).
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.
Additionally, it should be understood that various changes and modifications to the presently preferred embodiments described herein will be 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.
This application is a continuation of U.S. patent application Ser. No. 12/580,604, filed Oct. 16, 2009, and entitled “Self-Optimizing Wireless Networks,” which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5425051 | Mahany | Jun 1995 | A |
5796722 | Kotzin et al. | Aug 1998 | A |
5802144 | Laird et al. | Sep 1998 | A |
5859839 | Ahlenius et al. | Jan 1999 | A |
6051408 | Bartsch et al. | Apr 2000 | A |
6069871 | Sharma et al. | May 2000 | A |
6115393 | Engel et al. | Sep 2000 | A |
6138016 | Kulkarni et al. | Oct 2000 | A |
6141565 | Feuerstein et al. | Oct 2000 | A |
6253077 | Burt et al. | Jun 2001 | B1 |
6304556 | Haas | Oct 2001 | B1 |
6400335 | Weaver et al. | Jun 2002 | B1 |
6545690 | Hernandez | Apr 2003 | B1 |
6549529 | Drabeck et al. | Apr 2003 | B1 |
6574477 | Rathunde | Jun 2003 | B1 |
6729929 | Sayers et al. | May 2004 | B1 |
6829491 | Yea et al. | Dec 2004 | B1 |
6842431 | Clarkson et al. | Jan 2005 | B2 |
6937863 | Gordon et al. | Aug 2005 | B1 |
6985704 | Yang et al. | Jan 2006 | B2 |
6999766 | Padovani | Feb 2006 | B1 |
7006805 | Sorrells et al. | Feb 2006 | B1 |
7016685 | Cain et al. | Mar 2006 | B1 |
7149478 | Hawe | Dec 2006 | B2 |
7260415 | Oh | Aug 2007 | B1 |
7323945 | Cyr et al. | Jan 2008 | B2 |
7349765 | Reaume et al. | Mar 2008 | B2 |
7385503 | Wells et al. | Jun 2008 | B1 |
7461037 | Hätönen et al. | Dec 2008 | B2 |
7477920 | Scheinert et al. | Jan 2009 | B2 |
7505010 | Franzon et al. | Mar 2009 | B2 |
7519860 | Hätönen et al. | Apr 2009 | B2 |
7529215 | Osterling | May 2009 | B2 |
7561876 | Chiou et al. | Jul 2009 | B2 |
7577103 | Diaz et al. | Aug 2009 | B2 |
7590589 | Hoffberg | Sep 2009 | B2 |
7606287 | Mahany | Oct 2009 | B2 |
7609747 | Mahany | Oct 2009 | B2 |
7623455 | Hilla et al. | Nov 2009 | B2 |
7653407 | Backes et al. | Jan 2010 | B2 |
7663555 | Caimi et al. | Feb 2010 | B2 |
7747712 | Petersen et al. | Jun 2010 | B2 |
7768968 | Plehn et al. | Aug 2010 | B2 |
7827268 | Monier et al. | Nov 2010 | B2 |
7839882 | Soliman | Nov 2010 | B2 |
7877095 | Hubner et al. | Jan 2011 | B2 |
7877108 | Wengerter et al. | Jan 2011 | B2 |
7899890 | Petersen et al. | Mar 2011 | B2 |
7904080 | Atkins et al. | Mar 2011 | B2 |
7941136 | Reed et al. | May 2011 | B2 |
7969896 | Sheinfeld et al. | Jun 2011 | B2 |
8010469 | Kapoor et al. | Aug 2011 | B2 |
8018925 | Noriega | Sep 2011 | B2 |
8023529 | Oh et al. | Sep 2011 | B2 |
8032131 | Dobson et al. | Oct 2011 | B2 |
8050191 | Tirpak et al. | Nov 2011 | B2 |
8117294 | Pollakowski et al. | Feb 2012 | B2 |
8144619 | Hoffberg | Mar 2012 | B2 |
8185124 | Antic et al. | May 2012 | B2 |
8208924 | Han et al. | Jun 2012 | B2 |
8295877 | Hui et al. | Oct 2012 | B2 |
8320850 | Khlat | Nov 2012 | B1 |
8355728 | Jung et al. | Jan 2013 | B2 |
20020056066 | Gesbert et al. | May 2002 | A1 |
20030100344 | Garmonev et al. | May 2003 | A1 |
20030191856 | Lewis et al. | Oct 2003 | A1 |
20030228857 | Maeki | Dec 2003 | A1 |
20030229478 | Rappaport et al. | Dec 2003 | A1 |
20040018839 | Andric et al. | Jan 2004 | A1 |
20040117226 | Laiho et al. | Jun 2004 | A1 |
20040196834 | Ofek et al. | Oct 2004 | A1 |
20040229621 | Misra | Nov 2004 | A1 |
20040266442 | Flanagan et al. | Dec 2004 | A1 |
20050009531 | Lindquist et al. | Jan 2005 | A1 |
20050176440 | Sang et al. | Aug 2005 | A1 |
20050243723 | Randriamasy | Nov 2005 | A1 |
20050259571 | Battou | Nov 2005 | A1 |
20050277444 | Rensburg et al. | Dec 2005 | A1 |
20060083170 | Silva et al. | Apr 2006 | A1 |
20060221886 | Rao | Oct 2006 | A1 |
20060239224 | Borst et al. | Oct 2006 | A1 |
20060246844 | Kroboth et al. | Nov 2006 | A1 |
20070002765 | Kadaba et al. | Jan 2007 | A1 |
20070021151 | Mori et al. | Jan 2007 | A1 |
20070066298 | Hurst | Mar 2007 | A1 |
20070087756 | Hoffberg | Apr 2007 | A1 |
20070094729 | Hoefelmeyer et al. | Apr 2007 | A1 |
20070147297 | Diaz et al. | Jun 2007 | A1 |
20070195721 | Backes et al. | Aug 2007 | A1 |
20070218862 | Tatman et al. | Sep 2007 | A1 |
20070248039 | Backes et al. | Oct 2007 | A1 |
20080004078 | Barratt et al. | Jan 2008 | A1 |
20080016198 | Johnston-Watt et al. | Jan 2008 | A1 |
20080020801 | Fesas et al. | Jan 2008 | A1 |
20080039089 | Berkman et al. | Feb 2008 | A1 |
20080207195 | Ranta et al. | Aug 2008 | A1 |
20080225714 | Denis | Sep 2008 | A1 |
20080268833 | Huang et al. | Oct 2008 | A1 |
20080311924 | Lucidarme | Dec 2008 | A1 |
20090003236 | Aoyama et al. | Jan 2009 | A1 |
20090023477 | Staudte | Jan 2009 | A1 |
20090036116 | Kim et al. | Feb 2009 | A1 |
20090047968 | Gunnarsson et al. | Feb 2009 | A1 |
20090075648 | Reed et al. | Mar 2009 | A1 |
20090075655 | Dobson et al. | Mar 2009 | A1 |
20090112932 | Skierkowski et al. | Apr 2009 | A1 |
20090131038 | MacNaughtan et al. | May 2009 | A1 |
20090163223 | Casey | Jun 2009 | A1 |
20090221297 | Wengerter et al. | Sep 2009 | A1 |
20090227261 | Tiirola et al. | Sep 2009 | A1 |
20090257353 | Song et al. | Oct 2009 | A1 |
20090264130 | Catovic et al. | Oct 2009 | A1 |
20090312022 | Viorel et al. | Dec 2009 | A1 |
20090315736 | Reichl et al. | Dec 2009 | A1 |
20090323530 | Trigui et al. | Dec 2009 | A1 |
20100008293 | Gupta et al. | Jan 2010 | A1 |
20100046369 | Zhao et al. | Feb 2010 | A1 |
20100075682 | del Rio-Romero | Mar 2010 | A1 |
20100103911 | Ji | Apr 2010 | A1 |
20100111013 | Chou | May 2010 | A1 |
20100111047 | Yang et al. | May 2010 | A1 |
20100124934 | Mach | May 2010 | A1 |
20100130194 | Dickey | May 2010 | A1 |
20100149984 | Kapoor et al. | Jun 2010 | A1 |
20100159936 | Brisebois et al. | Jun 2010 | A1 |
20100190488 | Jung et al. | Jul 2010 | A1 |
20100203881 | del Rio Romero et al. | Aug 2010 | A1 |
20100214939 | Ryan | Aug 2010 | A1 |
20100216453 | Kallin et al. | Aug 2010 | A1 |
20100216467 | Ryan et al. | Aug 2010 | A1 |
20100216477 | Ryan | Aug 2010 | A1 |
20100232318 | Sarkar | Sep 2010 | A1 |
20100235285 | Hoffberg | Sep 2010 | A1 |
20100254344 | Wei et al. | Oct 2010 | A1 |
20100278161 | Ore et al. | Nov 2010 | A1 |
20100284303 | Catovic et al. | Nov 2010 | A1 |
20100299419 | Ramankutty et al. | Nov 2010 | A1 |
20100311415 | Hamabe et al. | Dec 2010 | A1 |
20100311421 | Mach | Dec 2010 | A1 |
20100325267 | Mishra et al. | Dec 2010 | A1 |
20110009105 | Lee et al. | Jan 2011 | A1 |
20110014925 | Antic et al. | Jan 2011 | A1 |
20110028144 | Catovic et al. | Feb 2011 | A1 |
20110044165 | Ni et al. | Feb 2011 | A1 |
20110045865 | Viering et al. | Feb 2011 | A1 |
20110059744 | Won et al. | Mar 2011 | A1 |
20110090820 | Hussein et al. | Apr 2011 | A1 |
20110092195 | Hussein et al. | Apr 2011 | A1 |
20110096687 | Dottling et al. | Apr 2011 | A1 |
20110096688 | Sachs et al. | Apr 2011 | A1 |
20110105139 | On | May 2011 | A1 |
20110111700 | Hackett | May 2011 | A1 |
20110130135 | Trigui | Jun 2011 | A1 |
20110136478 | Trigui | Jun 2011 | A1 |
20110141972 | Oh et al. | Jun 2011 | A1 |
20110151881 | Chou et al. | Jun 2011 | A1 |
20110190016 | Hamabe et al. | Aug 2011 | A1 |
20110199985 | Cai et al. | Aug 2011 | A1 |
20110230222 | Reudink | Sep 2011 | A1 |
20110280157 | Suerbaum | Nov 2011 | A1 |
20110294527 | Brueck et al. | Dec 2011 | A1 |
20120009912 | Wang et al. | Jan 2012 | A1 |
20120026918 | Won et al. | Feb 2012 | A1 |
20120026941 | Ahmad et al. | Feb 2012 | A1 |
20120028584 | Zhang et al. | Feb 2012 | A1 |
20120028664 | Zhang et al. | Feb 2012 | A1 |
20120034919 | Nakata et al. | Feb 2012 | A1 |
20120066377 | Li et al. | Mar 2012 | A1 |
20120087257 | Larsson et al. | Apr 2012 | A1 |
20120147765 | Wigren | Jun 2012 | A1 |
20120147828 | Wigren | Jun 2012 | A1 |
20120170478 | Doettling et al. | Jul 2012 | A1 |
20120182874 | Siomina et al. | Jul 2012 | A1 |
20120252479 | Morita et al. | Oct 2012 | A1 |
20120264470 | Bajj et al. | Oct 2012 | A1 |
20120270536 | Ratasuk et al. | Oct 2012 | A1 |
20120295609 | Li et al. | Nov 2012 | A1 |
20120327797 | Siomina et al. | Dec 2012 | A1 |
20130114464 | Tarraf et al. | May 2013 | A1 |
Number | Date | Country |
---|---|---|
2129175 | Dec 2010 | EP |
1952657 | Aug 2011 | EP |
WO 2007063426 | Jun 2007 | WO |
WO2012072445 | Jun 2012 | WO |
Entry |
---|
International Search Report and Written Opinion mailed Jun. 18, 2010 for PCT Application No. PCT/US2010/31603. |
U.S. Office Action mailed Oct. 13, 2010 for U.S. Appl. No. 12/385,752, filed Apr. 17, 2009. |
U.S. Office Action mailed May 5, 2011 for U.S. Appl. No. 12/385,752, filed Apr. 17, 2009. |
International Search Report and Written Opinion mailed Nov. 24, 2010 for PCT Application No. PCT/US2010/050627. |
International Search Report and Written Opinion mailed Nov. 15, 2010 for PCT Application No. PCT/US2010/048929. |
U.S. Office Action mailed Dec. 22, 2011 for U.S. Appl. No. 12/718,189, filed Mar. 5, 2010. |
U.S. Office Action mailed Dec. 29, 2011 for U.S. Appl. No. 12/634,057, filed Dec. 9, 2009. |
International Search Report and Written Opinion mailed Nov. 3, 2010 for PCT Application No. PCT/US2010/048927. |
Amirijoo et al., “Cell Outage Management in LTE Networks,” Cost 2100 TD(9)941, Vienna, Austria, Sep. 28-30, 2009. |
Mueller et al., “A Cell Outage Detection Algorithm Using Neighbor Cell List Reports” 2008. |
U.S. Office Action mailed Feb. 27, 2012 for U.S. Appl. No. 12/385,752, filed Apr. 17, 2009. |
U.S. Office Action mailed Jun. 6, 2012 for U.S. Appl. No. 12/634,057, filed Dec. 9, 2009. |
U.S. Final Office Action mailed Jul. 13, 2012 for U.S. Appl. No. 12/385,752, filed Apr. 17, 2009. |
U.S. Final Office Action mailed Aug. 29, 2012 for U.S. Appl. No. 12/718,189, filed Mar. 5, 2010. |
International Search Report and Written Opinion mailed Nov. 5, 2012 for PCT Application No. PCT/US2012/054204. |
“Self-Optimizing Networks: The Benefits of SON in LTE,” 4G americas, Jul. 2011. |
International Search Report and Written Opinion mailed Feb. 5, 2013 for PCT Application No. PCT/US2012/064131. |
U.S. Office Action mailed Mar. 18, 2013 for U.S. U.S. Appl. No. 12/580,604, filed Oct. 16, 2009. |
U.S. Office Action mailed Dec. 3 2012 for U.S. U.S. Appl. No. 12/580,604, filed Oct. 16, 2009. |
Lehtirnaki et al., “A SOM Based Approach for Visualization of GSM Network Performance Data,” Helsinki University of Technology, 2005. |
Blume et al., “Energy Savings in Mobile Networks Based on Adaptation to Traffic Statistics,” Bell Labs Technical Journal 15(2), 77-94 (2010) © 2010 Alcatel-Lucent. |
International Search Report and Written Opinion mailed Apr. 29, 2013 for PCT Application No. PCT/US2013/026102. |
Number | Date | Country | |
---|---|---|---|
20120087269 A1 | Apr 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12580604 | Oct 2009 | US |
Child | 13273354 | US |