CN101370276B - Neighbor section list updating method - Google Patents

Abstract

The invention discloses a method for updating a neighboring cell list, comprising the following steps: when an associated base station learns that a base station having a neighboring cell relationship with it is abnormal, deleting the abnormal cell of the abnormal base station from its neighboring cell list; The cells that have a neighbor cell relationship with it are searched to determine whether a cell of a new base station has entered the neighbor cell list of the associated base station and/or the opposite base station has no subordinate cells in the neighbor cell list of the associated base station; the associated base station is based on the search results Requesting the new base station and/or the peer base station to update the adjacency table of the new base station and/or the peer base station. The invention realizes the automatic optimization of the neighboring cell list by detecting and reporting the abnormality of the cell and the base station, reduces the resource consumption of the network air interface and the power consumption of the UE, and ensures the mobile performance of the user.

Description

Neighbor List Update Method

technical field

The present invention relates to the communication field, and more specifically relates to a method for updating a neighboring cell list.

Background technique

Self-Organizing Network (SON) is a technology for automatic network configuration and optimization. The technology is characterized by self-configuration and self-optimization. The application of this technology in the Long Term Evolution (LTE) system enables the LTE base station (eNB) to automatically configure network parameters according to certain measurements and perform automatic optimization according to network changes. , so as to maintain optimal network performance while saving a lot of manpower and material resources.

The distributed ad hoc network architecture means that there is no unified ad hoc network server in the network, and the ad hoc network functions are distributed in each base station, including functions related only to a single base station and to multiple base stations (as shown in Figure 1). That is to say, the ad hoc network functions of each base station need to complete operations involving multiple base stations through interaction and coordination.

Since the number of base stations in the LTE system may be very large (for example, Home NodeB), and the situation of power-on and power-off or even mobile of the base station will be more frequent than the current Universal Mobile Telecommunications System (UMTS) system , so the adjacent cell list changes more frequently. If the adjacent cell list is not updated in time, more air interface resources will be consumed in the process of broadcasting and delivering the adjacent cell list, and at the same time, user equipment (User Equipment, UE for short) will consume unnecessary resources to detect cells that do not exist. Therefore, when a certain base station or a cell under this base station fails or is closed, the adjacent cells of its neighboring base stations have changed, and automatic update is required.

Contents of the invention

In view of one or more problems described above, the present invention provides a new method for updating a neighbor list.

According to the method for updating the neighbor cell list of the present invention, it includes the following steps: when the associated base station learns that the base station having a neighbor cell relationship with it is abnormal, the abnormal cell of the abnormal base station is deleted from its neighbor cell list; The cells of the neighbor cell relationship are searched to determine whether the cell of the new base station has entered the neighbor cell list of the associated base station and/or the opposite base station has no subordinate cells in the neighbor cell list of the associated base station; the associated base station requests a new cell based on the search results. The base station and/or the peer base station updates the adjacency table of the new base station and/or the peer base station.

Wherein, the new base station updates the adjacency table specifically as follows: if a cell of the new base station enters its neighbor list, the associated base station requests the new base station to add it to the adjacency table of the new base station. The update of the adjacency table of the peer base station is specifically: if the peer base station has no subordinate cell existing in the neighbor cell list of the associated base station, request the peer base station to delete it from the neighbor table of the peer base station.

Wherein, the abnormal situation of the abnormal base station is an abnormal situation that the abnormal base station can report, and the associated base station learns the abnormal situation of the abnormal base station by receiving the abnormality report of the abnormal base station. The abnormal conditions that can be reported by the abnormal base station are: cell abnormality, cell shutdown, and base station abnormality. The abnormality report of the abnormal base station carries the cell identifier of the abnormal cell of the abnormal base station.

Wherein, the abnormal situation occurring in the abnormal base station is an abnormal situation that cannot be reported by the abnormal base station, and the associated base station obtains the abnormal situation that cannot be reported by the abnormal base station through link layer detection. The abnormal conditions that cannot be reported by the abnormal base station are: the base station is shut down and the base station is powered off.

Wherein, the associated base station searches for a cell having a neighbor cell relationship with it according to its own measurement or the measurement of the terminal. The neighbor cell list update method according to the present invention can be applied to a distributed ad hoc network architecture.

To sum up, the present invention realizes the automatic optimization of the neighboring cell list by detecting and reporting the abnormality of the cell and the base station, reduces the resource consumption of the network air interface and the power consumption of the UE, and ensures the mobile performance of the user.

Description of drawings

The accompanying drawings described here are used to provide a further understanding of the present invention and constitute a part of the application. The schematic embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations to the present invention. In the attached picture:

FIG. 1 is a schematic diagram of a distributed ad hoc network architecture;

FIG. 2 is a schematic flowchart of a method for updating a neighbor list according to a first embodiment of the present invention;

FIG. 3 is a schematic flowchart of a method for updating a neighbor list according to a second embodiment of the present invention; and

Fig. 4 is a schematic diagram of an adjacency relationship table stored by a base station.

Detailed ways

The specific implementation manners of the present invention will be described in detail below with reference to the accompanying drawings.

Referring to Fig. 2, the method for updating the neighbor list according to the first embodiment of the present invention is described. As shown in Figure 2, the neighbor list update method includes the following steps:

S202, the base station 1 finds that its next cell cannot work normally (such as hardware resource damage), and immediately sends an abnormal report to the associated base station 2 (the report contains the cell number of the abnormal cell that cannot work normally), and the associated base station 2 receives the abnormal report Afterwards, the abnormal cell is deleted from the neighbor cell list, and at the same time, since the base station 1 is still working, it also performs the following operation of associating the base station.

S204, the associated base station 2 then performs an automatic neighbor cell search process to determine whether there is a cell of a new base station entering the adjacent cell list of the associated base station 2 and/or the last cell of an abnormal base station leaving the adjacent cell list of the associated base station 2. Wherein, if the cell number of the abnormal cell in step S202 is not in the adjacent cell list of the associated base station 2 (that is to say, there are other cells under the abnormal base station in the adjacent cell list, if the peer adjacency relationship is described to the cell level and Not at the base station level, which can avoid this situation, but will increase some complexity), then there is no need to perform neighbor search and the following steps.

S206, if the associated base station 2 finds that the first cell under the base station 3 has entered its neighbor list, it sends a message to the base station 3, requesting the base station 3 to include it in the peer adjacency table, and if the associated base station 2 finds that there is a base station 1 When the last cell under the cell leaves its neighbor list, it sends a message to base station 1, requesting the opposite base station 1 to remove it from the peer adjacency list.

Referring to FIG. 3 , a method for updating a neighbor list according to a second embodiment of the present invention is described. As shown in Figure 3, the neighbor list update method includes the following steps:

S302, the base station 1 is suddenly powered off, and does not send an abnormal report to the associated base station 2. The associated base station 2 detects that the link with the base station 1 is interrupted through link layer detection, and considers that the base station 1 is abnormal. If the peer of the associated base station 2 is adjacent If there is base station 1 in the relationship table, delete it. If there is a cell under base station 1 among the local adjacent cells associated with base station 2 (indicating that it is an associated base station of an abnormal base station), delete it.

S304, the associated base station 2 then performs an automatic neighbor search process to determine whether there is a cell of the new base station entering the adjacent cell list of the associated base station 2 and/or the last cell of other base stations leaving the adjacent cell list of the associated base station 2.

S306, if the associated base station 2 finds that the first cell under the base station 3 has entered its neighbor list, it will send a message to the base station 3, requesting the other base station 3 to include it in the peer adjacency table, if there is the last cell under other base stations When a cell leaves its neighbor list, it sends a message to the other base station, requesting the other base station to remove it from the neighbor list.

That is to say, the base station that is abnormal or shut down sends a message to the base station that has the neighbor cell relationship of the opposite end (referring to the base station that the opposite end includes the cell under the base station in its neighbor cell list, called the associated base station), or when the base station fails When the message cannot be sent, the associated base station detects that the base station is abnormal through the link layer; the associated base station deletes the cell of the abnormal base station from the neighbor list, and then performs an automatic neighbor search process (according to its own or terminal measurement), It is used to determine whether there are other neighboring cells entering the list (for example, cells that did not enter the original neighboring cell list due to relatively poor signal, or cells that automatically adjust coverage); The base station of the node sends a message requesting the other side to add or remove it from the peer adjacency table. Wherein, the content and format of the peer adjacency table are shown in FIG. 4 . In the peer adjacency table shown in FIG. 4 , "1" means that the peer base station has included the cell under this base station as an adjacent cell, and "0" means not. The peer adjacency list is different from the local neighbor list, and the neighbor relationship may be asymmetric (that is, base station 1 does not list the cell of base station 2 as its neighbor cell, while base station 2 lists the cell of base station 1 as its neighbor list. neighborhood), and the adjacency relationship is symmetric.

It can be seen from the above description that the neighbor cell list update method according to the present invention realizes unified processing for various abnormal situations (including cell abnormality, cell shutdown, base station abnormality, base station shutdown, base station power failure, etc.). The method is simple and fast. If the abnormal base station can report it, the abnormal base station will report it and deal with it in time; for the abnormal base station that cannot be notified, it will be detected by the peer base station, and the detection of the link layer can also achieve relatively high timeliness .

In addition, the method for updating the neighbor list according to the present invention realizes the integration with the automatic update of the neighbor list, and exists as a trigger for searching the neighbor list, reflecting the completeness of the automatic neighbor optimization scheme. At the same time, each base station saves the base station-level peer neighbor relationship. When an exception occurs, it only sends a message to the base station with the peer neighbor relationship instead of sending it to all base stations, which avoids additional overhead and does not send messages to the local end. The base station that belongs to the neighbor cell relationship sends a message, avoiding the omission caused by the asymmetric neighbor cell relationship.

The above description is only an embodiment of the present invention, and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the scope of the claims of the present invention.

Claims (10)

1. a neighbor section list updating method is characterized in that, may further comprise the steps:

Know that at association base station the base station that neighboring BS relationship is arranged with it takes place under the unusual situation the unusual sub-district of unusual base station to be deleted from its Neighboring Cell List;

Said association base station pair has the sub-district of neighboring BS relationship to search for it, Neighboring Cell List and/or the base station, opposite end that gets into said association base station with the sub-district that determines whether new base station do not had in the Neighboring Cell List that the subordinate sub-district is present in said association base station;

Said association base station upgrades the adjacency table of said new base station and/or base station, said opposite end according to said new base station of Search Results request and/or base station, said opposite end.

2. neighbor section list updating method according to claim 1; It is characterized in that; Said new base station is upgraded adjacency table and is specially: if there is the sub-district of new base station to get into its Neighboring Cell List, the new base station of then said association base station request adds the adjacency table of said new base station with it.

3. neighbor section list updating method according to claim 1; It is characterized in that; Base station, said opposite end is upgraded adjacency table and is specially: if the base station, opposite end has not had in the Neighboring Cell List that the subordinate sub-district is present in said association base station, then ask base station, said opposite end that it is deleted from the adjacency table of base station, said opposite end.

4. neighbor section list updating method according to claim 1; It is characterized in that; Said abnormal conditions are the abnormal conditions that said unusual base station can report, and said association base station knows that through the exception reporting that receives said unusual base station unusual situation takes place in said unusual base station.

5. neighbor section list updating method according to claim 4 is characterized in that, the abnormal conditions that said unusual base station can report are: the sub-district is unusual, the sub-district is closed and the base station is unusual.

6. neighbor section list updating method according to claim 5 is characterized in that, carries the cell ID of the unusual sub-district of said unusual base station in the said exception reporting.

7. neighbor section list updating method according to claim 1 is characterized in that, said abnormal conditions are the abnormal conditions that said unusual base station can not report, and said association base station detects through link layer knows the abnormal conditions that said unusual base station can not report.

8. neighbor section list updating method according to claim 7 is characterized in that, the abnormal conditions that said unusual base station can not report are: the base station is closed and base station power-down.

9. according to each described neighbor section list updating method in the claim 1 to 8, it is characterized in that said association base station is searched for the sub-district that neighboring BS relationship is arranged with it according to the measurement of himself or the measurement at terminal.

10. neighbor section list updating method according to claim 9 is characterized in that, said method is applicable to distributed MANET framework.

Images