Optimizing hand-off neighbor lists for improved system performance
View Patent ↗Method for improving hand-off performance in a code-division multiple access (CDMA) cellular telephone system. A preferred embodiment comprises the analysis of saved hand-off information to minimize the size of neighbor lists for each base station in the cellular telephone system. If a requested base station (for example, base station 618 ) is listed in any neighbor list of any base station (for example, base stations 605, 617, and 620 ) involved in the hand-off, then the requested base station is not added to any neighbor list. If the requested base station is not the neighbor lists of any of the base stations involved in the hand-off, then it is added to an initial base station's neighbor list (base station 605 ).
1. A method for creating a neighbor list for use in hand-offs in a cellular communications system comprising:
determining a requested base station from a saved call;
determining a reference base station from the saved call;
determining a list of other base stations from the saved call;
determining if the requested base station is present in a neighbor list of a base station listed in the list of other base stations; and
adding the requested base station to a neighbor list for the reference base station when the requested base station is absent from neighbor lists of the reference base station and all base stations listed in the list of other base stations.
2. The method of claim 1 , wherein the saved call is obtained from a list of saved calls generated during normal use of the cellular communications system, and wherein the method is repeated for each saved call in the list.
3. The method of claim 1 , wherein the saved call is obtained from an ordered list of saved calls generated during normal use of a cellular communications system, wherein the ordered list of saved calls is sorted by a number of base stations in the list of other base stations of each saved call, and wherein the method begins with a saved call with a fewest number of other base stations and continues with saved calls with increasing number of other base stations.
4. The method of claim 1 , wherein the method is executed at a central processor, wherein a neighbor list is created for each base station, and wherein each of the neighbor lists is delivered to a corresponding base station.
5. The method of claim 4 , wherein the central processor is a base station manager (BSM).
6. The method of claim 4 , wherein the central processor is a remotely connected computer.
7. The method of claim 4 , wherein each base station's neighbor list can be different.
8. The method of claim 1 , wherein the cellular communications system is a code-division multiple access (CDMA) cellular communications system.
9. The method of claim 1 , wherein the cellular communications system is an IS95 compliant communications system.
10. The method of claim 1 , wherein the cellular communications system is an IS2000 compliant communications system.
11. The method of claim 1 , wherein the method is executed periodically to generate up-to-date neighbor lists.
12. The method of claim 1 , wherein the addition of the requested base station to the optimal base station's neighbor list results in a minimally sized composite neighbor list.
13. A method for optimizing a neighbor list comprising:
selecting a saved call from a list of saved calls;
determining a requested base station from the saved call,
determining a reference base station from the saved call;
determining a list of other base stations from the saved call;
determining if the requested base station is present in a neighbor list of a base stations listed in the list of other base stations;
adding the requested base station to a neighbor list for the reference base station when the requested base station is absent from neighbor lists of the reference base station and all base stations listed in the list of other base stations; and
repeating for all remaining saved calls in the list of saved calls.
14. The method of claim 13 , wherein the list of saved calls contains saved calls listing N other base stations, wherein N is a number from one (1) to six (6).
15. The method of claim 14 further comprising after the repeating:
incrementing N;
obtaining an additional list of saved calls, wherein the additional list of saved calls contains only saved calls listing N base stations;
repeating the selecting, two determining, adding, and first repeating for the additional list of saved calls.
16. The method of claim 15 , wherein the method is repeated until N is equal to six (6).
17. The method of claim 13 , wherein a neighbor list is created for each base station in a cellular communications system, and wherein the method further comprises sending to each base station its neighbor list.
18. A method for populating a neighbor list comprising:
determining a requested base station from call data,
determining a reference base station from the call data,
determining a list of other base stations from the call data;
searching each base station's neighbor list for an occurrence of the requested base station, wherein each base station is from the list of other base stations;
searching the reference base station's neighbor list for an occurrence of the requested base station; and
adding the requested base station to the reference base station's neighbor list when all searches are negative.
19. The method of claim 18 , wherein if any of the searches is positive, the method is stopped.
20. The method of claim 18 , wherein when added to the reference base station's neighbor list, a position of the requested base station in the reference base station's neighbor list is based on an identifier of the requested base station.
21. The method of claim 18 , wherein the method is repeated for all available call data.