1. Field of the Invention
The present invention generally relates to dynamic load balancing in a wireless communication network. In particular, the present invention relates to dynamic load balancing by altering the coverage areas and optionally altering network parameters such as frequencies of one or a plurality of coverage areas.
2. Description of the Related Art
Network planning relies on static approaches for site locations and dimensioning of the radio resources to meet a specified traffic demand at busy hours. Dimensioning fixed resources to satisfy traffic demand for busy hours is an ineffective planning practice and is very expensive for service providers since the resources for every site are often over estimated to meet traffic demand that may occur only in limited time durations.
Apart from optimizing the hardware resources, service providers have to dramatically reduce interference in their network to maximize the number of subscribers and/or the quality that those subscribers can achieve. Smart antennas were the leading technology and have been considered for IEEE802.16e-2005 and 3GPP LTE standards. Smart antennas or adaptive beamforming use a plurality of antennas to null interferers or track a desired subscriber by means of a narrow beam. However, complex signal processing is required in the base stations, which increases the cost of wireless equipment. Adaptive digital beamforming, as described in IEEE802.16e-2005 for example, is implemented for each subscriber in a cell.
The above standard (i.e., IEEE802.16e-2005) describes generally ways for setting up the best radiation pattern from base stations to a mobile subscriber and tracking it if necessary according to its mobility in the cell. However, detailed implementation is left unspecified by the standard. Additionally, because of the complexity of the implementation, most of base station vendors have decided not to implement beamforming in their initial products. Initial deployments of products have been more focused on demonstrating the basic features of the broadband technology rather than optional features such as beamforming.
Therefore, it would be useful to implement an apparatus that can dynamically adjust radio resources and network parameters to match a time varying traffic demand. Additionally, it would be useful to use one or more antennas to create multiple coverage areas that are optimized according to actual user distribution in the wireless communication network and to achieve interference reduction capability by narrowing down coverage areas, while deploying standard base stations rather than new ones that are equipped with adaptive beamforming capability.
An embodiment of the invention is directed to a method for dynamic load balancing of coverage areas in a wireless communication network. The method includes evaluating cell congestion based on location information of subscribers in a wireless communication network; collecting network parameters related to the wireless communication network; and altering network parameters based on the evaluated cell congestion. After the network parameters are altered, the coverage areas are narrowed. Improvements in cell congestion and quality of service are then determined based on the narrowing of the coverage areas. Altering of the plurality of network parameters and evaluating of the cell congestion are performed continuously until a target quality of service is achieved.
The narrowing of the coverage area reduces cell congestion by optimizing the coverage area according to actual subscriber distribution within the wireless communication network. Additionally, by narrowing of the coverage areas, for congested areas, overlapping of coverage areas and the number of subscribers in handover zones are reduced. Also, narrowing of the coverage area for some cells increases the range of the coverage areas for other cells. Improvement in the cell congestion and quality of service can be determined based on, for example, a dropped call percentage and a congestion ratio.
An embodiment of the invention is directed to program recorded on a computer-readable storage medium for dynamic load balancing of coverage areas in a wireless communication network. The program causes a computer to execute dynamic load balancing steps that includes evaluating cell congestion based on location information of the subscribers in the wireless communication network; collecting network parameters related to the wireless communication network; altering network parameters based on the evaluated cell congestion; narrowing coverage areas based on the altered network parameter; and determining if there is an improvement in the cell congestion and quality of service based on altered network parameters.
An embodiment of the invention is directed to a system for dynamic load balancing of coverage areas in a wireless communication network. The system includes a network management apparatus that monitors and performs management of the wireless communication network; at least one controller configured to perform data communications with the network management apparatus; at least one base station configured to perform data communication with the controller; at least one antenna array configured to perform data communication with the base station and the subscribers distributed in coverage areas; and a dynamic load balancing apparatus configured to perform data communication with the network management apparatus and the antenna array.
The load balancing apparatus is also configured to evaluate cell congestion based on location information of the subscribers in the wireless communication network; collect network parameters related to the wireless communication network; alter network parameters based on the evaluated cell congestion; narrow coverage areas based on the altered network parameters; and determine if there is an improvement in the cell congestion and quality of service based on the altered network parameters. The altering of the network parameters and evaluating of the cell congestion are performed continuously until a target quality of service in the wireless communication network is achieved.
The system of the invention also includes a location unit configured to gathering location information regarding the subscribers in the wireless communication network. The location unit provides location information to the dynamic load balancing apparatus. Additionally, the system includes an extraction module configured to extract network statistics, network topology and parameters, and a target performance criteria related to the wireless communication network. The extraction module is also configured to perform data communications with the network management apparatus and the dynamic load balancing apparatus.
In an embodiment of the invention, the dynamic load balancing apparatus includes a communication interface; at least one processor; and a memory. The memory is configured to store a dynamic load balancing program that causes the apparatus to perform the load balancing method noted above. The memory includes a computer-readable storage medium such as a CD-ROM, RAM or other external storage device.
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.
The network management apparatus 101 exercises monitoring and control over the wireless communication network 100. The network management apparatus 101 may include, for example, a network operation center (NOC) that analyze problems, perform troubleshooting, communication with site technicians and other NOCs. The network management apparatus 101 may also include any server or other computer implemented to monitor and control the wireless communication network 100. Although
The controllers 102 illustrated in
Each coverage area 105 behaves as an independent sector serving its own set of subscribers 107. Receive diversity can be supported by the same coverage areas 105 generated by means of an orthogonal polarization in the antenna (not shown) or by totally separate antennas (not shown). Alternatively, receive diversity can be supported in angular domain by associating a coverage area 105 to one antenna port and another coverage area 105, typically the adjacent one, to another port. However, both coverage areas 105 are active in the transmit direction.
Similarly, multiple input multiple output (MIMO) modes are supported by feeding similar coverage areas 105 to each MIMO branch using polarization, angle or space domains. For fixed wireless systems, such as IEEE802.16-2004, each coverage area 105 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 107 of a single coverage area 105 are served by a single base station 103 that can be a single frequency channel for supporting communications in accordance with IEEE802.16e-2005 or multiple frequency channels for supporting communications in accordance with IEEE802.16m.
The dynamic load balancing apparatus 109 can be a server or other similar computer device capable of executing an algorithm for performing dynamic load balancing. A more detailed discussion of the structure of the dynamic load balancing apparatus 109 is noted below with reference to
Additionally, the dynamic load balancing apparatus 109 also receives equipment and installation characteristics such as a noise figure, maximum transmit power, losses, a receive diversity flag, supported multi-antenna modes, supported modulation and coding schemes, a duplexing mode, supported sub-carriers permutation scheme; and configuration parameters for each base station or subscriber station equipment such as downlink/uplink TDD ratio, frequency band, center frequency and channel bandwidth.
The dynamic load balancing apparatus 109 may also receive subscribers statistics such as mean and standard deviation of receive strength signal indicator (RSSI) and carrier to interference ratio (CIR), current transmitter power, current uplink and downlink modulation schemes, cyclic redundancy check (CRC) and header check sequence (HCS) errors, receive and transmit throughput for data packets, number of blocked sessions, number of dropped sessions. A full list for WiMAX can be found in IEEE802.16f and IEEE802.16i.
As illustrated in
For example, for a wireless mobile system, subscriber tracking may be determined based on location information embedded in the wireless network components such as the controllers 102. The dynamic load balancing apparatus 109 includes an algorithm that analyzes the data related to the wireless communication network 100 and sends control signals 115 for altering or shaping the coverage areas 105. The load balancing algorithm clustering users based on their instantaneous locations or by means of heuristic approaches; collects statistics to validate previous users clustering decisions and/or predicting new traffic patterns; and continuously learns and adaptively shapes the coverage areas 10, and alters network parameters as the environment or traffic density changes with time. As seen in
Apart from changing coverage areas in terms of pointing directions and azimuth width of some sub-sectors, the load balancing algorithm may alter other parameters such as antenna tilt angles; transmit power values and frequency plan. The load balancing algorithm is not restricted to a single technology and, instead, is adaptable to multiple technologies. The load balancing algorithm can optimize multiple service provider networks if sharing data, such as network statistics and equipments characteristics, between them is possible.
The extraction module 200 extracts the network statistics 110, network topology and parameters 111, and target criteria 112 related to the wireless communication network 100; and provides the information regarding the wireless communication network 100 to the dynamic load balancing apparatus 109. The extraction module 200 can be a server or other computing device that extracts the information (e.g., network statistics 110, network topology and parameters 111 and target criteria 112) from a network database 201. The network topology parameters 111 includes locations of a base station (BS) and a subscriber station (SS), height of BS and SS antennas relative to terrain and sea level, antenna type, antenna pointing direction, antenna tilt direction, antenna radiation pattern, antenna gain and initial frequency plan.
Additionally, the target criteria 112 relates to a certain quality of service to be provided by the wireless communication network 100, which can be set by an operator and stored in the network database 201. Network statistics 110 include a number of established calls, a number of dropped calls; a number of blocked calls and the like. Additionally, network statistics 110 may also include a mean and standard deviation of receive strength signal indicator (RSSI) and a carrier to interference ratio (CIR), current transmitter power, current uplink and downlink modulation schemes, cyclic redundancy check (CRC) and header check sequence (HCS) errors, receive and transmit throughput for data packets, a number of blocked sessions, and a number of dropped sessions.
The extraction module 200 may also provide network statistics 110 and other information regarding the wireless communication network 100 to the network management apparatus 101. The dynamic load balancing apparatus 109 receives information (e.g., network statistics 110, network topology and parameters 111 and target criteria 112) regarding the wireless communication network 100; and provides control signals 115 for controlling coverage areas 105 to the antenna arrays 202. Each antenna array 202 can be a multiple of active antennas coupled to a common source or load to produce a directive radiation pattern forming the coverage areas 105. For example, the antenna array can be an integrated digital antenna array.
In step 301, the dynamic load balancing apparatus 109 receives data regarding switch statistics. The switch statistics can be sampled once an hour or more frequently if needed. The switch statistics may include, but are not limited to the following:
Exemplary Switch Statistics
In step 302, the dynamic loading balancing apparatus 109 determines, based on the switch statistics (and other network parameters), whether the current operating conditions of the wireless communication network 100 have reached or satisfied a target criteria. The target criteria can be predetermined. For example, the target criteria can be operator specific and can be changed or priorities altered to match the quality of service needed or desired in the wireless communication network 100. If the target criteria 112 are currently being met, then the dynamic load balancing apparatus 109 continues to receive and monitor switch statistics related to the wireless communication network 100.
Otherwise, in step 303, the congestion in the coverage areas is evaluated, which is also referred to as cell congestion. Congestion refers to the number of subscribers within the coverage areas. Cell congestion can be defined as a ratio of the average downlink power to the maximum base station transmit power. A high ratio is an indication of a high number of active subscribers in the cell. In step 304, if one or more of the cells are congested, then in step 305 one or more of network parameters are altered. The network parameters include, but are not limited to, the following:
Exemplary Network Parameters
In step 306, the dynamic load balancing apparatus 109 determines if there is any improvement in the operating conditions of the wireless communication network 100 based on the changes made to one or more of the network parameters. If there is improvement, then the one or more of network parameters continued to be changed (as in step 305) until it is determined if there is no improvements in the operating conditions of the wireless communication network 100. In step 307, the optimization direction of the antenna 202 is modified and in step 308 one or more network parameters are changed, if it is determined that there is no improvement in operating conditions of the wireless communication network 100 in step 306.
Similar to step 306, in step 309, it is determined again if there is improvement in the operating conditions in the wireless communication network 100 based on the change in optimization direction and changes in parameters. If there is improvement, then the one or more of network parameters continue to be changed (as in step 308) until it is determined if there is no improvement in the operating conditions of the wireless communication network 100. In step 310, if there is no improvement in network operating conditions, then the previous network parameters set are held. The switch statistics are again received (as in step 301) and it is determined if the target criteria is reached or satisfied (as in step 302).
Also, if the target criteria is not reached, then in step 311, it is determined if there is any improvement in network operating conditions. If there are improvements in network operating conditions then steps 305-310 are performed. If there are no improvements, then steps 307-310 are performed.
Exemplary Implementation
For hotspot regions of any mature wireless communication network, capacity demand is much higher than any other part of the network. After exhausting all the possible improvements in radio transceivers technology and radio resource management algorithms, the only solution left for satisfying high capacity demand is the classical one in cellular networks of considering more cells or sectors in the network. Additionally, finding new sites locations for dense urban areas is very challenging due to the finite number of tall buildings already occupied and the reluctance of building towers impacting the landscape and the historic and economic value of some cities. Moreover, these towers are heavily taxed to avoid or at least limit their appearance in cities. Therefore, antenna counts become of major importance to wireless operators.
The alternative of adding antennas and cell sites is to consider sub-sectorization by means of antenna arrays. A single passive antenna array can be used to create multiple fixed coverage areas but an active antenna array will be preferred to alter the boundaries of coverage areas whenever needed for matching the instantaneous traffic demand. In addition to splitting the azimuth in coverage areas, a two dimensional active antenna array can offer more flexibility in creating and tailoring coverage areas. Although an active antenna array offers the flexibility preferred by load balancing algorithms, it shall not be considered as a restriction or the only means of creating coverage areas of arbitrary wanted shapes.
By way of example, it is assumed that the required number of sectors to meet the peak traffic demand has been determined along with their locations and frequency plan. The present invention, for example, optimizes base station transmit power, antenna tilt, sub-sectors pointing direction and azimuth widths to balance the traffic between sub-sectors and therefore increase subscribers' satisfaction. For each parameter, a minimum, a maximum and a step size values are defined so that a finite number of possibilities are evaluated by the algorithm. Average downlink power, number of used codes or channel elements and noise rise are typical network statistics available.
From an initial network configuration, congested cells can be identified by for example evaluating the ratios previously defined and considering the highest one for a particular cell. Congestion can be alleviated by reducing the coverage for those cells while increasing the coverage of other cells so that no coverage holes are created and the traffic is better distributed. Reducing the coverage can be achieved by reducing base station transmit power or down tilting the antenna or reducing the azimuth width of the sub-sectors or combination of two or more of those actions. Conversely, increasing the coverage is achieved by increasing the base station transmit power or up tilting the antenna or increasing the azimuth width of the sub-sectors or combining two or more of those actions.
The step size for each parameter is evaluated to avoid making dramatic changes that may significantly alter network performance and stability. Gradual parameters changes can be made and validated prior to making further changes. The validation process includes retrieving the most recent statistics, watching critical items such as dropped calls percentage, re-computing the congestion ratios and comparing them with previous values. Further changes are made only if performance improvement, such as fewer dropped calls or better balanced load, is expected. Otherwise, previous parameters won't be altered for some time.
Retrieving and analyzing switch statistics is a continuous process so that when network quality degrades again as a result of imbalanced traffic, the dynamic load balancing algorithm runs until target criteria are met. Since the algorithm implemented in the dynamic load balancing apparatus relies on actual live network statistics rather than assumptions regarding propagation environment and traffic density, the results are more accurate than off-line tools and network improvement will be seen in real-time without the need for additional engineering cost of making drive tests and further data analysis.
As seen in
As seen in
Each coverage area 401 behaves as an independent sector serving its own set of subscribers 402. Receive diversity is supported by the same coverage areas generated by means of an orthogonal polarization in the antenna or totally separate antennas. Alternatively, receive diversity is supported in angular domain by associating a coverage to one base antenna port and another coverage area, typically the adjacent one, to another port. However both coverage areas are active in the transmit direction.
Similarly, multiple input multiple output (MIMO) modes are supported by feeding similar coverage areas to each MIMO branch using polarization, angle or space domains. For fixed wireless systems, such as IEEE802.16-2004, each coverage area can be used by a single base station or plurality of base stations operating each on a different frequency channel. For mobile systems, subscribers of a single coverage area are served by a single base station that can be a single frequency channel for IEEE802.16e-2005 or multiple frequency channels that can be supported by IEEE802.16m.
The memory 601 can be computer-readable storage medium used to store executable instructions, or computer program thereon. The memory 601 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 601 that are executable by one or more processors 602, which may be facilitated by one or more of the application programs 604. The application programs 604 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 dynamic load balancing apparatus 601. General communication between the components in the dynamic load balancing apparatus 601 is provided via the bus 606. The dynamic load balancing algorithm as described with reference to
The user interface 603 allows for interaction between a user and the dynamic load balancing apparatus 601. The user interface 603 may include a keypad, a keyboard, microphone, and/or speakers. The communication interface 605 provides for two-way data communications from the dynamic load balancing apparatus 601. By way of example, the communication interface 605 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 605 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 605 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 605 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).
In an embodiment of the invention, the dynamic load balancing algorithm is based on the following steps: 1) clustering users based on their instantaneous locations or by means of heuristic approaches; and 2) collecting statistics to validate previous users clustering decisions and/or predicting new traffic patterns; and 3) continuous learning and adaptively shaping coverage areas and altering network parameters as the environment or traffic density changes with time.
Retrieving and analyzing switch statistics is a continuous process so that when network quality degrades again as a result of imbalanced traffic, the dynamic load balancing algorithm runs until target criteria are met. Since the algorithm implemented in the dynamic load balancing apparatus relies on actual live network statistics rather than assumptions regarding propagation environment and traffic density, the results are more accurate than off-line tools and network improvement will be seen in real-time without the need for additional engineering cost of making drive tests and further data analysis.
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 claims priority to U.S. Provisional Patent Application No. 61/075,799 entitled “Method and Apparatus for Dynamic Load Balancing in Wireless Communication Networks” filed on Jun. 26, 2008, the contents of which are fully incorporated herein by reference.
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 |
6138016 | Kulkarni et al. | Oct 2000 | A |
6141565 | Feuerstein et al. | Oct 2000 | A |
6253077 | Burt et al. | Jun 2001 | B1 |
6400335 | Weaver et al. | Jun 2002 | B1 |
6549529 | Drabeck et al. | Apr 2003 | B1 |
6574477 | Rathunde | Jun 2003 | B1 |
6829491 | Yea et al. | Dec 2004 | B1 |
6937863 | Gordon et al. | Aug 2005 | B1 |
6999766 | Padovani | Feb 2006 | B1 |
7016685 | Cain et al. | Mar 2006 | B1 |
7149478 | Hawe | Dec 2006 | B2 |
7260415 | Oh | Aug 2007 | B1 |
7349765 | Reaume et al. | Mar 2008 | B2 |
7477920 | Scheinert et al. | Jan 2009 | B2 |
7561876 | Chiou et al. | Jul 2009 | B2 |
7577103 | Diaz et al. | Aug 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 |
7768968 | Plehn et al. | Aug 2010 | B2 |
7877095 | Hubner et al. | Jan 2011 | B2 |
7877108 | Wengerter et al. | Jan 2011 | B2 |
7904080 | Atkins et al. | Mar 2011 | B2 |
7941136 | Reed et al. | May 2011 | B2 |
7969896 | Sheinfeld et al. | Jun 2011 | B2 |
8023529 | Oh et al. | Sep 2011 | B2 |
20030100344 | Garmonev et al. | May 2003 | A1 |
20030191856 | Lewis et al. | Oct 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 |
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 |
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 |
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 |
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 |
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 |
20100216453 | Kallin et al. | Aug 2010 | A1 |
20100216477 | Ryan | Aug 2010 | A1 |
20100232318 | Sarkar | Sep 2010 | A1 |
20100254344 | Wei et al. | Oct 2010 | A1 |
20100278161 | Ore et al. | Nov 2010 | A1 |
20100299419 | Ramankutty et al. | Nov 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 |
20110090820 | Hussein et al. | Apr 2011 | A1 |
20110092195 | Hussein et al. | Apr 2011 | A1 |
20110096687 | Dottling et al. | Apr 2011 | A1 |
20110105139 | On | May 2011 | A1 |
20110130135 | Trigui | Jun 2011 | A1 |
20110136478 | Trigui | Jun 2011 | A1 |
20110141972 | Oh et al. | Jun 2011 | A1 |
20120087269 | Hussein et al. | Apr 2012 | A1 |
20120295609 | Li et al. | Nov 2012 | A1 |
Number | Date | Country |
---|---|---|
2129175 | Dec 2010 | EP |
1952657 | Aug 2011 | EP |
Entry |
---|
International Search Report issued Jun. 18, 2010 in International (PCT) Application No. PCT/US2010/31603. |
International Search Report issued Nov. 24, 2010 in International (PCT) Application No. PCT/US2010/050627. |
International Search Report and Written Opnion of the International Searching Authority issued Nov. 15, 2010 in International (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 of the International Search Authority issued Nov. 3, 2010 in International (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 Wanke”. |
U.S. Office Action mailed Feb. 27, 2012 for U.S. Appl. No. 12/385,752, filed Apr. 17, 2009. |
“Self-Optimizing Networks: The Benefits of SON in LTE,” 4G Americas, Jul. 2011. |
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. |
Mueller et al., “A Cell Outage Detection Algorithm Using Neighbor Cell List Reports” Springer-Verlag Berlin Heidelberg, Copyright 2008. |
Number | Date | Country | |
---|---|---|---|
20090323530 A1 | Dec 2009 | US |
Number | Date | Country | |
---|---|---|---|
61075799 | Jun 2008 | US |