The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Oct. 24, 2000

Filed:

Feb. 26, 1998
Applicant:
Inventors:

Hee C Lee, Plano, TX (US);

Wei Yuan, Plano, TX (US);

Sairam Subramanian, Dallas, TX (US);

Sheng-Chou Lin, Plano, TX (US);

Assignee:

Nortel Networks Limited, Montreal, CA;

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04Q / ;
U.S. Cl.
CPC ...
455453 ; 455435 ; 455456 ;
Abstract

A method for distributing paging load in a multicell wireless communication system establishes a plurality of location areas, with each location area including at least one cell. A load limit is based upon the greatest number of pages that may be transmitted in a particular cell over a given time period for cells of the multicell wireless communication system is determined. A paging load for the cellular wireless communication system is determined based upon historical loading and/or simulations and projections. A plurality of location areas are determined so that the paging load is distributed among the plurality of location areas such that a partial paging load respective to each cell of the multicell wireless communication system is less than a respective load limit. Boundaries of the location areas are then chosen to substantially minimize registration load within the multicell wireless communication system. In reducing registration loading, the location areas may be created so that some of the cells of the multicell wireless communication system reside in a plurality of location areas. A graph partitioning algorithm, such as a modified KL algorithm may be used to create the location areas and set the boundaries. In such operation, weights are determined for each node (cell) and edge in the graph, such weights based upon respective paging loads, non-paging loads and expected mobility between cells for the respective cell. Once these weights have been assigned, a modified KL graph partition is performed to find the location area boundaries which reduce registration loading. A multicell wireless communication system constructed according to the present invention includes a plurality of location areas having boundaries selected to reduce registration loading.


Find Patent Forward Citations

Loading…