This invention relates to cellular base station information management and more particularly to systems and methods for managing base station handoff information.
Mobile communication systems rely on handoffs between base stations to accommodate movement of the wireless station (user) into and out of transmission range. It is, of course, desired that these handoffs be accomplished as smoothly as possible and standards exist to accomplish the handoff task in an orderly manner.
However, the effectiveness of the handoff is controlled in large measure on the knowledge of a base station with respect to the surrounding base stations. Existing systems “know” about their neighbors because the information may be programmed in at start-up and changed from time to time manually. The standard, however, does not specify how this knowledge is to be obtained. There can be situations where the base station which is attempting to make a handoff does not have the latest information on the surrounding base stations, thus causing, at least temporarily, some confusion which can result in a less than perfect handoff.
Further, problems exist in that even when a base station knows that a neighbor is present, it does not necessarily know the current status of the neighbor nor does it necessarily know the protocol, such as the modulation scheme, or the preferred frequencies or sub-frequencies, etc., that are currently being used. Knowing the latest protocol increases the efficiency of the attempted handoff.
The present invention is directed to a system and method which base stations send informational messages to neighbor base stations when conditions change, so that the neighbor base stations can update its database to keep itself current on the parameters (including availability, traffic load, modulation scheme, etc.) to use in effecting efficient base station to base station handoffs. In one embodiment, the receiving base station marks the time of the received message from a neighbor base station and if a new updated message is not received within a time window then the receiving base station assumes that there is a problem with that neighbor.
In some embodiments, different messages go to different neighbors setting handoff parameters that are different for each. Also, in some embodiments, the time frame for a next message can be contained in the message that is sent.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.
For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawing, in which:
When these transmission points are served from the same base station, the base station “knows” all of the necessary parameters (such as, for example, modulation scheme) and the handoff from transmission point to transmission point is seamless. However, when handoffs are required between a transmission point of one base station (the serving base station) and a transmission point of a neighboring base station (the target base station), the information concerning the receiving base station may not be current and thus the handoff may not be as smooth as desired.
With respect to
Process 202 then searches its database for the current status (active or inactive) of the target station. The active/inactive status will be discussed hereinafter but suffice to say that when a neighbor station is given the inactive flag condition it can be supposed that the parameters for that station currently on file at the serving base station are compromised in some manner. This compromise can be that the station is temporarily out of service, over-crowed with traffic, has a processing glitch causing excessive delays, or the like. If the target is inactive (i.e., the parameters associated with that station are not currently valid for use) then process 203 determines, based on criteria established by the serving station what the next course of action is to be. For example, a secondary target station can be selected, or the call can be dropped, or an attempt can be made to handoff to the original target or a message may be delivered to the user informing the user of the problem.
If the target is active, then process 204 uses the latest stored parameters, as contained in the last message received from the target station, and begins the handoff based on the parameters that have been recently provided to the serving station as shown by process 205. Note that since the latest parameters can and will change from time to time, they can easily then be made to suit the current traffic conditions of the target station and also can be tailored for different neighboring stations individually.
Process 301 determines when it is time to send an updated set of working parameters and in response thereto process 302 gathers the latest parameters (or if desired just the parameters that have changed from the last transmission) and prepares them in a message for delivery to at least one neighbor station.
Process 303 determines if these parameters are for all neighbor base stations or only for selected ones. Processes 305, 306 and 307 control the situation where different parameters go to different base stations.
Process 304 sends the parameters, for example in the form of BS_INFO_RSP. This can be sent by user datagram protocol (UDP). This information can contain any number of parameters, including Downlink Channel Description (DCD) and Uplink Channel Description (UCD) informational changes, and hand-off (HO) optimization information. This transmission can be accomplished preferably over a back channel that interconnects base stations. The back channel, or backbone network, interconnects base stations via a wired or wireless communication link, typically including a dedicated communication link.
The information that is sent can include, if desired, the time of the next message so that the receiving station knows exactly when to expect a communication. As will be discussed, if the communication does not come at that time (or if there is not a set time, then after a certain interval) the station is marked inactive.
When a message has arrived, that message is stored in a database under control of process 404 and if an inactive flag had been set, the flag is now set for active via process 405. If the flag for a neighbor base station goes from inactive to active, the serving base station collects information contained in the messages, and broadcasts the updated information concerning neighbor base stations. Process 406 determines if the message contains a time for the next update and if it does, that time is set by process 408. However, if a preset time is to be used by process 402, then process 407 establishes that time.
Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.
Number | Date | Country | Kind |
---|---|---|---|
2006 1 0162236 | Dec 2006 | CN | national |
This application is continuation of U.S. patent application Ser. No. 11/651,307 filed Jan. 9, 2007 entitled “SYSTEM AND METHOD FOR MANAGING WIRELESS BASE STATION HANDOFF INFORMATION” which is related to and claims priority to Chinese Application No. 200610162236.0 filed Dec. 8, 2006 entitled “SYSTEM AND METHOD FOR MANAGING WIRELESS BASE STATION HANDOFF INFORMATION”, the disclosures of which are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5113278 | Degura et al. | May 1992 | A |
5678184 | Cutler et al. | Oct 1997 | A |
6834192 | Watanabe et al. | Dec 2004 | B1 |
7027482 | Nomura | Apr 2006 | B1 |
7046967 | Raissinia et al. | May 2006 | B2 |
7085570 | Tigerstedt et al. | Aug 2006 | B2 |
7127267 | McGowan et al. | Oct 2006 | B2 |
7205842 | Gustavsson et al. | Apr 2007 | B2 |
7606201 | Zhang et al. | Oct 2009 | B2 |
7890106 | Kim et al. | Feb 2011 | B2 |
8036173 | Zhang et al. | Oct 2011 | B2 |
20020187799 | Haartsen | Dec 2002 | A1 |
20030100328 | Klein et al. | May 2003 | A1 |
20040185780 | Coupechoux et al. | Sep 2004 | A1 |
20040242199 | Edlund et al. | Dec 2004 | A1 |
20050088993 | Jung et al. | Apr 2005 | A1 |
20050163080 | Suh et al. | Jul 2005 | A1 |
20050266845 | Aerrabotu et al. | Dec 2005 | A1 |
20060046763 | Schwent et al. | Mar 2006 | A1 |
20060093074 | Chang et al. | May 2006 | A1 |
20060120480 | Klomsdorf et al. | Jun 2006 | A1 |
20060152285 | Gustavsson et al. | Jul 2006 | A1 |
20060185012 | Olivereau et al. | Aug 2006 | A1 |
20060223538 | Haseba et al. | Oct 2006 | A1 |
20060251022 | Zhang et al. | Nov 2006 | A1 |
20070037576 | Subramanian et al. | Feb 2007 | A1 |
20070086388 | Kang et al. | Apr 2007 | A1 |
20070105593 | Marinier | May 2007 | A1 |
20080139233 | Wang | Jun 2008 | A1 |
20120009971 | Zhang et al. | Jan 2012 | A1 |
Entry |
---|
International Search Report and Written Opinion issued for PCT/US2007/086241; Dated: Apr. 10, 2008; 10 Pages. |
International Search Report and Written Opinion issued for PCT/US2007/086245; Dated: Jul. 28, 2008; 13 Pages. |
Number | Date | Country | |
---|---|---|---|
20120009971 A1 | Jan 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11651307 | Jan 2007 | US |
Child | 13236192 | US |