Method and apparatus for tracking area planning and optimization in a wireless network

Patent metadata

Field	Value
Publication number	US-9191835-B2
Application number	US-201314092855-A
Country	US
Kind code	B2
Filing date	Nov 27, 2013
Priority date	Nov 27, 2013
Publication date	Nov 17, 2015
Grant date	Nov 17, 2015

Abstract

A method, computer-readable storage device and an apparatus for planning tracking areas in a wireless network are disclosed. For example, the method represents geographical neighbor relations between each pair of base stations in a first set, and represents in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in a second set, represents the historical data on paging traffic among the base stations in the first set via a first parameter, and represents the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter, and determines for each base station in the first set, the optimal assignment of a tracking area in the second set.

First claim

What is claimed is:

1. A method for determining an optimal assignment in a wireless network, comprising:
obtaining, by a processor, a list of base stations, a list of tracking areas, historical data on paging traffic and historical data on tracking area update traffic;
representing, by the processor, the list of base stations in a first set and the list of tracking areas in a second set;
representing, by the processor, geographical neighbor relations between each pair of base stations in the first set, and representing in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in the second set;
representing, by the processor, the historical data on paging traffic among the base stations in the first set via a first parameter, and representing the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter; and
determining, by the processor, for each base station in the first set, the optimal assignment of a tracking area in the second set, in accordance with the first and the second parameters, wherein the optimal assignment for a particular base station assigns a tracking area from among the plurality of potential assignment options in the third set.

2. The method of claim 1 , further comprising:
configuring the wireless network in accordance with the optimal assignment of the tracking area in the second set for each base station in the first set.

3. The method of claim 1 , wherein the optimal assignment is determined for each base station in accordance with an optimization technique that assigns each pair of base stations in the first set with tracking area update traffic of a predetermined volume into a same tracking area.

4. The method of claim 1 , wherein the optimal assignment is determined for each base station where each base station is assigned only to one tracking area.

5. The method of claim 1 , wherein the optimal assignment is determined, for each base station, where a total of a paging traffic for the base station is less than a predetermined threshold on the paging traffic for the base station.

6. The method of claim 5 , wherein each base station is associated with a respective predetermined threshold.

7. The method of claim 5 , wherein, for a particular base station, the predetermined threshold on the paging traffic comprises a threshold on an air link of physical channels.

8. The method of claim 7 , wherein the air link physical channels comprise physical downlink control channels.

9. The method of claim 7 , wherein the air link physical channels comprise physical downlink shared channels.

10. The method of claim 5 , wherein, for a particular base station, the predetermined threshold on the paging traffic comprises a threshold on a blocking probability.

11. The method of claim 1 , wherein the optimal assignment is determined, for each base station, where a total number of re-homings of all base stations in the first set is below a threshold on a number of re-homings.

12. The method of claim 11 , wherein the threshold on the number of re-homings comprises a threshold based on a budgetary limitation.

13. The method of claim 11 , wherein the threshold on the number of re-homings comprises a threshold based on a limitation on labor.

14. The method of claim 11 , wherein the threshold on the number of re-homings comprises a threshold based on a time limitation.

15. The method of claim 11 , wherein the threshold on the number of re-homings comprises a threshold based on a number of service interruptions.

16. The method of claim 1 , wherein the wireless network comprises a long term evolution based wireless network.

17. The method of claim 1 , wherein the plurality of potential assignment options for a particular base station of the first set comprises a set of tracking areas, wherein the set of tracking areas comprises a tracking area of the set of tracking areas to which the particular base station of the first set is currently assigned, and all tracking areas of the set of tracking areas to which at least one geographical neighbor of the particular base station of the first set is currently assigned.

18. A computer-readable storage device storing a plurality of instructions which, when executed by a processor, cause the processor to perform operations for determining an optimal assignment in a wireless network, the operations comprising:
obtaining a list of base stations, a list of tracking areas, historical data on paging traffic and historical data on tracking area update traffic;
representing the list of base stations in a first set and the list of tracking areas in a second set;
representing geographical neighbor relations between each pair of base stations in the first set, and representing in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in the second set;
representing the historical data on paging traffic among the base stations in the first set via a first parameter, and representing the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter; and
determining for each base station in the first set, the optimal assignment of a tracking area in the second set, in accordance with the first and the second parameters, wherein the optimal assignment for a particular base station assigns a tracking area from among the plurality of potential assignment options in the third set.

19. The computer-readable storage device of claim 18 , further comprising:
configuring the wireless network in accordance with the optimal assignment of the tracking area in the second set for each base station in the first set.

20. An apparatus for determining an optimal assignment in a wireless network, comprising:
a processor; and
a computer-readable storage device storing a plurality of instructions which, when executed by the processor, cause the processor to perform operations, the operations comprising:
obtaining a list of base stations, a list of tracking areas, historical data on paging traffic and historical data on tracking area update traffic;
representing the list of base stations in a first set and the list of tracking areas in a second set;
representing geographical neighbor relations between each pair of base stations in the first set, and representing in a third set a plurality of potential assignment options for each base station of the first set to tracking areas in the second set;
representing the historical data on paging traffic among the base stations in the first set via a first parameter, and representing the historical data on tracking area update traffic among the tracking areas of the second set via a second parameter; and
determining for each base station in the first set, the optimal assignment of a tracking area in the second set, in accordance with the first and the second parameters, wherein the optimal assignment for a particular base station assigns a tracking area from among the plurality of potential assignment options in the third set.

Assignees

• At & T Ip I Lp

Inventors

• Guan Sichong
• Mir Farhan
• Savoor Raghvendra
• Yuan Wei
• Zhao Wenjie

Classifications

• H04W4/028

  Electricity · mapped topic

• H04W4/021

  Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences · CPC title

• H04W24/02 Primary

  Arrangements for optimising operational condition · CPC title

• H04W4/029

  Location-based management or tracking services · CPC title

• H04W60/00

  Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration · CPC title