Non-circular paging areas

Information

  • Patent Grant
  • 7751835
  • Patent Number
    7,751,835
  • Date Filed
    Tuesday, October 4, 2005
    19 years ago
  • Date Issued
    Tuesday, July 6, 2010
    14 years ago
Abstract
In a radio access network, techniques for defining a non-circular paging area in which an access terminal is to be paged based on distance-based location updating information for a sector of the network.
Description
TECHNICAL FIELD

This description relates to non-circular paging areas.


BACKGROUND

High Data Rate (HDR) is an emerging mobile wireless access technology that enables personal broadband Internet services to be accessed anywhere, anytime (see P. Bender, et al., “CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users”, IEEE Communications Magazine, July 2000, and 3GPP2, “Draft Baseline Text for 1xEV-DO,” Aug. 21, 2000). Developed by Qualcomm, HDR is an air interface optimized for Internet Protocol (IP) packet data services that can deliver a shared forward link transmission rate of up to 2.46 Mbit/s per sector using only (1X) 1.25 MHz of spectrum. Compatible with CDMA2000 radio access (TIA/EIA/IS-2001, “Interoperability Specification (IOS) for CDMA2000 Network Access Interfaces,” May 2000) and wireless IP network interfaces (TIA/EIA/TSB-115, “Wireless IP Architecture Based on IETF Protocols,” Jun. 6, 2000, and TIA/EIA/IS-835, “Wireless IP Network Standard,” 3rd Generation Partnership Project 2 (3GPP2), Version 1.0, Jul. 14, 2000), HDR networks can be built entirely on IP technologies, all the way from the mobile Access Terminal (AT) to the global Internet, thus taking full advantage of the scalability, redundancy and low-cost of IP networks.


An EVolution of the current 1xRTT standard for high-speed data-only (DO) services, also known as the 1xEV-DO protocol has been standardized by the Telecommunication Industry Association (TIA) as TIA/EIA/IS-856, “CDMA2000 High Rate Packet Data Air Interface Specification”, 3GPP2 C.S0024-0, Version 4.0, Oct. 25, 2002, which is incorporated herein by reference. Revision A to this specification has been published as TIA/EIA/IS-856, “CDMA2000 High Rate Packet Data Air Interface Specification”, 3GPP2 C.S0024-A, Version 1.0, March 2004, Ballot Resolution, but has yet not been adopted. Revision A is also incorporated herein by reference.


A 1xEV-DO radio access network (RAN) includes access terminals in communication with radio nodes over airlinks. Each access terminal may be a laptop computer, a Personal Digital Assistant (PDA), a dual-mode voice/data handset, or another device, with built-in 1xEV-DO support. The radio nodes are connected to radio node controllers over a backhaul network that can be implemented using a shared IP or metropolitan Ethernet network which supports many-to-many connectivity between the radio nodes and the radio node controllers. The radio access network also includes a packet data serving node, which is a wireless edge router that connects the radio access network to the Internet.


Typically, each radio node controller controls 25-100 radio nodes and each radio node supports 1-4 carriers each of 1.25 MHz of bandwidth. The geographic area of the radio access network that is served by any given radio node is referred to as a cell. Each cell can be divided into multiple sectors (typically 3 or 6).


Access terminals in a 1xEV-DO radio access network periodically send route update messages to the network. Each route update message identifies the sectors that are “visible” to the access terminal. The sector identification enables the radio access network to keep track of the access terminal's approximate location within the footprint of the network and to maintain the airlink as the access terminal moves between the coverage areas of different sectors.


When the radio access network has to page an access terminal to notify it of an incoming call, the network selects a set of sectors to page the terminal on.


One selection method known as “flood paging” involves selecting all of the sectors in the radio access network. The flood paging method covers a large paging area often at significant expense cost-wise.


Another selection method known as “selective paging” involves selecting a subset of the sectors in the radio access network. In one example, the radio access network reduces the size of the paging area by selecting only those sectors that are within a specified distance (referred to in the IS-856 specification as a “RouteUpdateRadius” or “RUR”) of the sector (“paging reference sector”) from which the access terminal last sent a route update message. The shape of such a paging area is a circle on the surface of the earth, in which the paging reference sector's longitude and latitude co-ordinates represents the center of the circle and the specified distance or the RUR represents the radius of the circle. To determine whether a sector (“sector under test”) in the network is within a circular paging area of a paging reference sector, the radio access network uses the following formula provided in the IS-856 to calculate the distance r between the paging reference sector and the sector under test:






r
=







[


(


x
c

-

x
L


)

×

cos


(


π
180

×


y
L

14400


)



]

2

+


[


y
c

-

y
L


]

2



16







where (xC,yC) represents the longitude and latitude co-ordinates of the paging reference sector, and (xL,yL) represents the longitude and latitude co-ordinates of the sector under test. If the computed value of r is less than RUR, the sector under test is inside the circular paging area and is selected by the radio access network for use in paging the access terminal for an incoming call.


In certain cases, each of the sectors identified by an access terminal in its route update message can be considered a paging reference sector that contributes its own paging area. At the time of paging, a radio access network that uses the above-identified formula to determine whether an individual sector under test is within a paging area of a given paging reference sector has to perform a series of calculations per paging reference sector to identify all of the sectors that are within a union of the paging areas associated with the multiple paging reference sectors. In certain cases in which an identified sector is within the paging areas of more than one paging reference sector, an access terminal may be paged multiple times by a single sector.


To avoid having to do the processing intensive calculations associated with the above-identified formula on-the-fly at the time of paging, the network may pre-determine and store the sectors to be paged for each sector that can be a paging reference sector. In a distributed system (e.g., a multi-chassis system), updates to such stored information resulting from changes to the set of sectors can be costly and vulnerable to card failures.


SUMMARY

In one aspect, the invention features a method that enables a radio access network to define a non-circular paging area in which an access terminal is to be paged based on distance-based location updating information for a sector of the network.


Implementations of the invention may include one or more of the following. The distance-based location updating information includes a location value and a distance value associated with the sector. The method of enabling includes defining a circle having a center corresponding to the location value and a radius corresponding to the distance value, and defining, for the sector, a non-circular paging area that encompasses at least the circle. The location value includes a longitude co-ordinate and a latitude co-ordinate. The distance value represents a distance from the location value. The non-circular paging area has a size that is based on the distance value associated with the sector.


The method can include receiving a route update message from the access terminal, and based on the received route update message, identifying a sector of the network as being a paging reference sector. The method can further include retrieving, from a data store, information defining the non-circular paging area of the paging reference sector, identifying each sector of the network that is within the non-circular paging area of the paging reference sector, and sending a paging message to each identified sector so as to initiate a page of the access terminal by the identified sector.


The method can include maintaining location value information for sectors of the network. The location values for the sectors can be maintained in a list that is ordered along longitude and latitude values.


The method can include receiving a route update message from the access terminal, and based on the received route update message, identifying sectors of the network as being paging reference sectors. The method can further include retrieving, from a data store, information defining the non-circular paging area of each paging reference sector, generating a non-circular super paging area of the paging reference sectors, the non-circular super paging area including a union of the retrieved non-circular paging areas, identifying each sector of the network that is within the non-circular super paging area of the paging reference sectors, and sending a paging message to each identified sector so as to initiate a page of the access terminal by the identified sector.


The non-circular paging area can be defined by a set of values, each representing a side or corner co-ordinate of the non-circular paging area. The non-circular paging area can be a square-shaped paging area or a rectangular-shaped paging area. The non-circular paging area can be defined based on a curvature of the surface of the earth.


In another aspect, the invention features a machine-readable medium that stores executable instructions for use at a radio node controller of a radio access network, the instructions causing a machine to define a non-circular paging area in which an access terminal is to be paged based on distance-based location updating information for a sector of the network.


Implementations of the invention may include one or more of the following. The machine-readable medium may further include instructions to cause the machine to designate a sector of the network as being a paging reference sector, identify sectors of the network that are within a non-circular paging area of the paging reference sector, and send a paging message to each identified sector so as to initiate a page of the access terminal by the identified sector. The machine-readable medium may further include instructions to cause the machine to designate sectors of the network each as being a paging reference sector, identify sectors of the network that are within a non-circular super paging area of the paging reference sectors, and send a paging message to each identified sector so as to initiate a page of the access terminal by the identified sector.


In another aspect, the invention features a method that includes paging an access terminal from a radio access network in sectors that are selected as lying within a non-circular paging area.


In another aspect, the invention features a method that includes selecting sectors of a paging area in which to page an access terminal from a radio access network, the selection being made at the time of the paging without requiring pre-selection of the sectors.


In another aspect, the invention features a method that includes selecting sectors of a paging area in which to page an access terminal using a comparison of positional values of sectors within boundaries of the paging area.


In other aspects, corresponding computer programs and apparatus are also provided.


Advantages that can be seen in particular implementations of the invention include one or more of the following. The radio access network can pre-calculate and store the non-circular paging area information (e.g., the co-ordinates of the corners of a square-shaped paging area) on a per-sector basis rather than dynamically determine the non-circular paging area on-the-fly at the time of paging, a process that can be processing intensive. When multiple paging reference sectors are identified for an access terminal, the selective paging techniques efficiently combine the non-circular paging areas associated with the respective paging reference sectors to form a super paging area that can be used for determining whether a given sector is to be included in the set of sectors on which the access terminal is paged. The provision of a super paging area allows the network to quickly identify a sector that is within the paging areas of multiple paging reference sectors and eliminate the duplicates so that the access terminal is only paged once via that sector. The selective paging techniques increase the paging capacity of the network through a highly cost effective mechanism as compared to the flood paging techniques. The calculations and comparisons associated with the selective paging techniques are not processing intensive, thus enabling fewer or less costly resource to be used in performing the techniques. The selective paging techniques also enable a distributed system, such as a multi-chassis system, to be more fault tolerant to events, for example, card failures.


The details of one or more examples are set forth in the accompanying drawings and the description below. Further features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.





DESCRIPTION OF DRAWINGS


FIG. 1 shows a radio access network.



FIG. 2 shows a square-shaped paging area on a map projection of the surface of the earth.



FIG. 3 shows a super paging area on a map projection of the surface of the earth.





DETAILED DESCRIPTION


FIG. 1 shows a 1xEV-DO radio access network 100 with a radio node controller 102 connected to three radio nodes 104a-104c over a packet network 106. The packet network 106 can be implemented as an IP-based network that supports many-to-many connectivity between the radio nodes 104a-104c and the radio node controller 102. The packet network 106 is connected to the Internet 110 via a packet data serving node 108. Other radio nodes, radio node controllers, and packet networks (not shown in FIG. 1) can be included in the radio access network 100.


Defining a Non-Circular Paging Area for a Sector

Each radio node 104a-104c serves one or more sectors and communicates with multiple access terminals in its cell. For each sector, the network 100 defines a set of Route Update Protocol parameters that includes a [Xi] value within a longitude parameter, a [Yi] value within a latitude parameter, and a [Ri] value within a RouteUpdateRadius parameter. Each of the values [Xi, Yi, Ri] are expressed in units of degrees. The [Xi, Yi] values for each sector represent the longitude co-ordinate and the latitude co-ordinate of the sector. When distance-based location updating is enabled by the network 100, the [Ri] value represents the distance from the sector that an access terminal can travel from before triggering a new route update message to the network 100.


The network 100 uses the three values [Xi, Yi, Ri] of a sector 200 to define its non-circular paging area. In some implementations, the network defines a square-shaped paging area 204 that encloses a circle 202 having a radius [Ri] and a center at [Xi, Yi] co-ordinates as shown in FIG. 2. The square-shaped paging area 204 is depicted as a square 206 on a map projection of the earth's surface, where the horizontal axis represents longitude values and the vertical axis represents latitude values. Each latitude value represents a distance, in degrees, north (positive latitude values) or south (negative latitude values) of the Equator. Lines of latitude along the latitude axis of the earth are parallel to and equidistance from one another. Each longitude value represents a distance, in degrees, east (positive longitude values) or west (negative longitude values) of the Prime Meridian. Lines of longitude along the longitude axis of the earth are not parallel, but converge at the poles in order to account for the curvature of the earth's surface. Because of this convergence, the distance between the lines of longitude varies based on latitude, from about 112 km at the Equator to about zero at the poles.


The square-shaped paging area 204 has a center at [Xi, Yi] co-ordinates and sides along the lines of longitude and latitude. These sides are referred to as northern, southern, eastern, or western sides based on the position of the side relative to the center at [Xi, Yi] co-ordinates. The network 100 identifies the northern and southern sides along the lines of latitude by [Xi, Yj] co-ordinates corresponding to points where the circle 202 touches the square 206 directly due north and south of the center at [Xi, Yi] co-ordinates. Similarly, the network 100 identifies the eastern and western sides along the lines of longitude by [Xj, Yi] co-ordinates corresponding to points where the circle touches the square 206 directly due east and west of the center at [Xi, Yi] co-ordinates.


Although the square-shaped paging area 204 is visually depicted in FIG. 2 as having eastern and western sides that are of length 2*Ri, the absolute lengths of these sides are greater than 2*Ri and are not perfectly parallel to each other to take into consideration the earth's curvature. As the values of [Xi, Yi, Ri] are expressed in units of degrees, the calculations used to derive the co-ordinates of the corners of the square-shaped paging area 204 account for the fact that the distance between lines of longitude vary linearly with the cosine of the latitude. As an example, the value of [Xj] on the eastern side of the square-shaped paging area 204 can be calculated using Xj=Xi+Ri/cos(Yi) in instances in which the square-shaped paging area 204 does not straddle the Prime Meridian (longitude numbering wraps around at the Prime Meridian and would therefore need to be accounted for). The [Yj] terms do not need such adjustments since parallels of latitude are considered to be equidistant. As an example, the value of [Yj] on the northern side can be calculated using Yj=Yi+Ri in instance in which the square-shaped paging area 204 does not cover one of the poles of the earth.


The information defining the square-shaped paging area of each sector is stored by the network 100 in a data store for subsequent use in selectively paging an access terminal.


Paging an Access Terminal

When a packet destined for an access terminal 112 is received at the packet data serving node 108, the packet is forwarded to the radio node controller (“serving radio node controller” 102) on which a 1xEV-DO session of the access terminal 112 resides. The serving radio node controller 102 selects a set of sectors on which the access terminal 112 is to be paged, and sends a paging message to the selected sectors. In the examples to follow, the serving radio node controller 102 selects a subset of the sectors in accordance with a selective paging technique.


The serving radio node controller 102 first identifies the sectors over which the access terminal 112 last sent a message (“route update message”) to update the network 100 of the access terminal's current location. In some instances, only one sector is identified and that sector is designated as a paging reference sector. In other instances, multiple sectors are identified and all of those sectors are designated as paging reference sectors.


In the case of a single paging reference sector, the serving radio node controller 102 retrieves, from the data store, the information defining the square-shaped paging area of the paging reference sector. The serving radio node controller 102 then performs a series of comparisons to identify a set of sectors that is located within the square-shaped paging area of the paging reference sector. In one implementation, the network 100 maintains a list of sector information for the network. The sector information includes the longitude and latitude co-ordinates for each sector in the network. The sector information can be ordered, sorted, or grouped along pairs of longitude and latitude values to enable comparison operations to be performed quickly.


To identify those sectors that are located within the square-shaped paging area, the serving radio node controller 102 compares the [Xt, Yt] co-ordinates of each sector (“sector under test”) with the [Yj] co-ordinates of the northern and southern sides and [Xj] co-ordinates of the eastern and western sides of the square-shaped paging area. In some implementations, if [Xj(western_side)≦Xt≦Xj(eastern_side), Yj(northern_side)≦Yt≦Yj(southern_side)], the sector under test is identified as being within the square-shaped paging area of the paging reference sector.


Suppose there are three sectors for which sector information is provided in the list. The three sectors are depicted in the example of FIG. 2 as sectors 210, 212, and 214. A comparison of the [Xt, Yt] co ordinates of each sector 210, 212, and 214 with the [Yj] co-ordinates of the northern and southern sides and [Xj] co-ordinates of the eastern and western sides of the square-shaped paging area 204 reveals that two of the sectors 212 and 214 are within the square-shaped paging area 204, while the sector 210 is outside the square-shaped paging area 204. Subsequently, the serving radio node controller 102 sends (210) a paging message to each sector 212 and 214 that is within the square-shaped paging area 204 to selectively page the access terminal 112 for an incoming call.


The above description corresponding to FIG. 2 relates to selective paging techniques related to a single paging reference sector. The techniques are also applicable in the scenario in which multiple paging reference sectors are identified.


In the case of multiple paging reference sectors, the serving radio node controller 102 retrieves, from the data store, the information defining the square-shaped paging area of each paging reference sector. Four square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4) are depicted in FIG. 3. The square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4) can be of different sizes depending on the [Ri] value of respective paging reference sectors. Although all four of the square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4) overlap each other by varying amounts, there are instances in which one or more of the square-shaped paging areas does not overlap any of the other square-shaped paging areas. As can be seen from FIG. 3, a sector 302 that is within the SQ1 paging area can also be within the SQ3 and SQ4 paging areas. If provisions are not made to eliminate multiple pagings by a single sector, an access terminal 112 may be paged three times by the sector 302.


To avoid such a scenario, the radio node controller defines a non-circular paging area (“non-circular super paging area”) that encompasses the four square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4). To do so, the serving radio node controller 102 performs a series of comparisons between the square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4) to identify latitude and longitude values corresponding to the northernmost, southernmost, easternmost, and westernmost points among all of the square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4). For example, the serving radio node controller 102 compares the northern sides of the square-shaped paging areas (SQ1, SQ2, SQ3, and SQ4) against each other to identify the northernmost [Ynorth] co-ordinate, which is then used to designate as the northern side of the super paging area. Similar comparisons are done for each of the other sides to obtain [Ysouth] co-ordinate, [Xeast] co-ordinate and [Xwest] co-ordinate. The super paging area that results from these comparisons may be square-shaped or rectangular-shaped, where the sides of the super paging area are parallel to the longitude axis or lateral axis of the earth as appropriate.


Once the super paging area is defined, the serving radio node controller 102 can easily and quickly identify a set of sectors that is located within the super paging area of the multiple paging reference sectors in a manner similar to that described above with respect to the single paging reference sector example. Specifically, a series of comparisons of the [Xt, Yt] co ordinates of each sector under test with the [Ynorth] and [Ysouth] co-ordinates of the northern and southern sides, respectively, and [Xeast] and [Xwest] co-ordinates of the eastern and western sides, respectively, of the super paging area can be performed. In some implementations, if [Xwest≦Xt≦Xeast, Ynorth≦Yt≦Ysouth], the sector under test is identified as being within the super paging area of the multiple paging reference sectors. Subsequently, the serving radio node controller 102 sends a paging message to each sector that is identified as being located within the non-circular super paging area of the multiple paging reference sectors to selectively page the access terminal 112 for an incoming call.


The techniques described above in relation to FIGS. 1 to 3 provide a dynamic and efficient way in which sectors on which an access terminal 112 is to be paged can be selected at the time of paging. In some implementation, the techniques are further enhanced by allowing a network operator to increase the page success probability by adding, multiplying, or otherwise increasing the [Ri] value within a RouteUpdateRadius parameter of a given sector by a tunable factor. This results in an increase in size of the non-circular paging area associated with the given sector, which in turn ensures a high page success rate for access terminals at the boundary of the circle having a radius corresponding to the RouteUpdateRadius parameter.


Although the techniques described above employ the 1xEV-DO air interface standard, the techniques are also applicable to other CDMA and non-CDMA air interface technologies in which the distance-based updating of an access terminal's location within a network is enabled.


The techniques described above can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The techniques can be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable storage device or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.


Method steps of the techniques described herein can be performed by one or more programmable processors executing a computer program to perform functions of the invention by operating on input data and generating output. Method steps can also be performed by, and apparatus of the invention can be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). Modules can refer to portions of the computer program and/or the processor/special circuitry that implements that functionality.


Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in special purpose logic circuitry.


A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention, and, accordingly, other embodiments are within the scope of the following claims.

Claims
  • 1. A method performed by a radio node controller in a radio access network, the method comprising: retrieving information defining a non-circular paging area for a paging reference sector, the information being based on second information associated with the paging reference sector; andidentifying one or more sectors of the radio access network overlapping the non-circular paging area from which an access terminal is to be paged.
  • 2. The method of claim 1, wherein the second information comprises: a location value and a distance value associated with the paging reference sector.
  • 3. The method of claim 2, wherein the non-circular paging area encompasses at least a circle having a center corresponding to the location value and a radius corresponding to the distance value.
  • 4. The method of claim 2, wherein the location value comprises a longitude co-ordinate and a latitude co-ordinate associated with the paging reference sector.
  • 5. The method of claim 2, wherein the distance value represents a distance from the location value.
  • 6. The method of claim 2, wherein the non-circular paging area has a size that is based on the distance value associated with the paging reference sector.
  • 7. The method of claim 1, further comprising: receiving a route update message from the access terminal; andbased on the route update message, designating a sector of the radio access network as being the paging reference sector.
  • 8. The method of claim 7, wherein the information is retrieved from a data store.
  • 9. The method of claim 7, further comprising: sending a paging message to each of the one or more sectors overlapping the non-circular paging area so as to initiate a page of the access terminal by each of the one or more sectors, wherein each of the one or more sectors has a corresponding longitude co-ordinate, a corresponding latitude co-ordinate, and a corresponding portion of coverage area that overlaps with the non-circular paging area; and wherein for each of the one or more sectors, the corresponding longitude and latitude co-ordinates are within the non-circular paging area.
  • 10. The method of claim 1, further comprising: maintaining location value information for sectors of the radio access network.
  • 11. The method of claim 10, wherein the maintaining comprises: maintaining an ordered list in which the location value information for the sectors are ordered along longitude and latitude values.
  • 12. The method of claim 1, further comprising: receiving a route update message from the access terminal; andbased on the route update message, designating sectors of the radio access network as being the corresponding paging reference sectors.
  • 13. The method of claim 12, wherein the information is retrieved from a data store; and wherein generating the non-circular super paging area comprises: generating the non-circular super paging area using the information.
  • 14. The method of claim 13, further comprising: sending a paging message to each of the one or more sectors overlapping the non-circular super paging area so as to initiate a page of the access terminal by each of the one or more sectors, wherein each of the one or more sectors has a corresponding longitude co-ordinate, a corresponding latitude co-ordinate, and a corresponding portion of coverage area that overlaps with the non-circular super paging area; and wherein for each of the one or more sectors, the corresponding longitude and latitude co-ordinates are within the non-circular paging area.
  • 15. The method of claim 1, wherein the information defining the non-circular paging area comprises a set of values, each value representing a side of the non-circular paging area.
  • 16. The method of claim 1, wherein the non-circular paging area comprises a square-shaped paging area.
  • 17. The method of claim 1, wherein the information defining the non-circular paging area is determined based on a curvature of the surface of the earth.
  • 18. A computer-readable medium that stores executable instructions for use at a radio node controller of a radio access network, the instructions for causing the radio node controller to: retrieve information defining a non-circular paging area for a paging reference sector, the information being based on second information associated with the paging reference sector; andidentify one or more sectors of the radio access network overlapping the non-circular paging area from which an access terminal is to be paged.
  • 19. The computer-readable medium of claim 18, further comprising instructions to cause the machine to: designate a sector of the radio access network as being the paging reference sector based on a route update message received from the access terminal; andsend a paging message to each of the one or more sectors overlapping the non-circular paging area so as to initiate a page of the access terminal by each of the one or more sectors, wherein each of the one or more sectors has a corresponding longitude co-ordinate, a corresponding latitude co-ordinate, and a corresponding portion of coverage area that overlaps with the non-circular paging area; and wherein for each of the one or more sectors, the corresponding longitude and latitude co-ordinates are within the non-circular paging area.
  • 20. A method performed by a radio network controller in a radio access network, the method comprising: selecting sectors as lying within a non-circular paging area for a paging reference sector when an incoming call is detected; andpaging an access terminal from the radio access network in the sectors.
  • 21. A method performed by a radio network controller in a radio access network, the method comprising: identifying sectors and designating the sectors as paging reference sectors;defining a non-circular super paging area to encompass non-circular paging areas corresponding to the paging reference sectors;selecting a first set of sectors overlapping the non-circular super paging area when an incoming call is detected by comparing positional values of a second set of sectors with boundaries of the non-circular super paging area, the second set of sectors comprising at least the first set of sectors; andpaging the access terminal from the first set of sectors.
  • 22. A radio access network comprising a packet data serving node, a radio node controller and at least one radio node, said radio access network configured to: receive, from an access terminal, a route update message;designate a paging reference sector based on the received message;retrieve information defining a non-circular paging area of the paging reference sector;identify one or more sectors that overlap the non-circular paging area; andpage the access terminal from the one or more sectors when an incoming call is detected at the packet data serving node.
  • 23. The method of claim 1, further comprising: retrieving additional information defining additional non-circular paging areas for additional corresponding paging reference sectors, the information being based on additional second information respectively associated with the additional corresponding paging reference sectors; andidentifying, for each of the additional non-circular paging areas, one or more additional sectors of the radio access network overlapping the additional non-circular paging area from which the access terminal is to be paged.
  • 24. A method performed by a radio node controller in a radio access network, the method comprising: retrieving information defining non-circular paging areas for corresponding paging reference sectors, the information being based on corresponding second information respectively associated with the corresponding paging reference sectors;generating a non-circular super paging area of the corresponding paging reference sectors, the non-circular super paging area comprising a union of the non-circular paging areas; andidentifying one or more sectors of the radio access network overlapping the non-circular super paging area from which an access terminal is to be paged.
  • 25. The method of claim 24, wherein the information defining the non-circular paging areas comprises corresponding sets of values, wherein for each non-circular paging area, each value of the corresponding set of values represents a side of the non-circular super paging area.
  • 26. The method of claim 24, wherein the non-circular super paging area comprises a square-shaped super paging area.
  • 27. The method of claim 24, wherein the non-circular super paging area comprises a rectangular-shaped super paging area.
  • 28. The method of claim 24, wherein the information defining the non-circular paging areas is determined based on a curvature of the surface of the earth.
  • 29. The method of claim 7, wherein the route update message is received from the access terminal via a packet data serving node.
  • 30. The method of claim 12, wherein the route update message is received from the access terminal via a packet data serving node.
  • 31. The method of claim 21, wherein the non-circular paging areas are defined by information, the information being determined based on second information respectively associated with the paging reference sectors.
US Referenced Citations (242)
Number Name Date Kind
5239675 Dudczak Aug 1993 A
5377224 Hudson Dec 1994 A
5754945 Lin et al. May 1998 A
5790528 Muszynski Aug 1998 A
5815813 Faruque Sep 1998 A
5852630 Langberg et al. Dec 1998 A
5857154 Laborde et al. Jan 1999 A
5884177 Hanley Mar 1999 A
5930714 Abu-Amara et al. Jul 1999 A
5937345 McGowan et al. Aug 1999 A
5940762 Lee et al. Aug 1999 A
5960349 Chheda et al. Sep 1999 A
5974318 Satarasinghe Oct 1999 A
5983282 Yucebay Nov 1999 A
6011970 McCarthy Jan 2000 A
6014564 Donis et al. Jan 2000 A
6016429 Khafizov et al. Jan 2000 A
6023625 Myers et al. Feb 2000 A
6032033 Morris et al. Feb 2000 A
6047186 Yu et al. Apr 2000 A
6049715 Willhoff et al. Apr 2000 A
6052594 Chuang et al. Apr 2000 A
6061560 Saboorian et al. May 2000 A
6069871 Sharma et al. May 2000 A
6091953 Ho et al. Jul 2000 A
6101394 Illidge Aug 2000 A
6111857 Soliman et al. Aug 2000 A
6112089 Satarasinghe Aug 2000 A
6122513 Bassirat Sep 2000 A
6151512 Chheda et al. Nov 2000 A
6167036 Beven Dec 2000 A
6178328 Tang et al. Jan 2001 B1
6192246 Satarasinghe Feb 2001 B1
6198719 Faruque et al. Mar 2001 B1
6198910 Hanley Mar 2001 B1
6208615 Faruque et al. Mar 2001 B1
6219539 Basu et al. Apr 2001 B1
6233247 Alami et al. May 2001 B1
6252862 Sauer et al. Jun 2001 B1
6256300 Ahmed et al. Jul 2001 B1
6266529 Chheda Jul 2001 B1
6272148 Takagi et al. Aug 2001 B1
6289220 Spear Sep 2001 B1
6320898 Newson et al. Nov 2001 B1
6345185 Yoon et al. Feb 2002 B1
6366961 Subbiah et al. Apr 2002 B1
6370357 Xiao et al. Apr 2002 B1
6370381 Minnick et al. Apr 2002 B1
6393482 Rai et al. May 2002 B1
6400712 Phillips Jun 2002 B1
6404754 Lim Jun 2002 B1
6408182 Davidson et al. Jun 2002 B1
6418306 McConnell Jul 2002 B1
6424834 Chang et al. Jul 2002 B1
6430168 Djurkovic et al. Aug 2002 B1
6438376 Elliott et al. Aug 2002 B1
6438377 Savolainen Aug 2002 B1
6445922 Hiller et al. Sep 2002 B1
6459696 Carpenter et al. Oct 2002 B1
6473399 Johansson et al. Oct 2002 B1
6477159 Yahagi Nov 2002 B1
6480476 Willars Nov 2002 B1
6480718 Tse Nov 2002 B1
6507741 Bassirat Jan 2003 B1
6522885 Tang et al. Feb 2003 B1
6539030 Bender et al. Mar 2003 B1
6542481 Foore et al. Apr 2003 B2
6542752 Illidge Apr 2003 B1
6545984 Simmons Apr 2003 B1
6580699 Manning et al. Jun 2003 B1
6590879 Huang et al. Jul 2003 B1
6611695 Periyalwar Aug 2003 B1
6618585 Robinson Sep 2003 B1
6621811 Chang et al. Sep 2003 B1
6628637 Li et al. Sep 2003 B1
6651105 Bhagwat et al. Nov 2003 B1
6687237 Lee et al. Feb 2004 B1
6701148 Wilson et al. Mar 2004 B1
6701149 Sen et al. Mar 2004 B1
6711144 Kim et al. Mar 2004 B1
6731618 Chung et al. May 2004 B1
6738625 Oom et al. May 2004 B1
6741862 Chung et al. May 2004 B2
6754191 Paranchych et al. Jun 2004 B1
6757319 Parsa et al. Jun 2004 B1
6768903 Fauconnier et al. Jul 2004 B2
6771962 Saifullah et al. Aug 2004 B2
6813498 Durga et al. Nov 2004 B1
6826402 Tran Nov 2004 B1
6834050 Madour et al. Dec 2004 B1
6842630 Periyalwar Jan 2005 B2
6847821 Lewis et al. Jan 2005 B1
6877104 Shimono Apr 2005 B1
6909887 Fauconnier et al. Jun 2005 B2
6944452 Coskun et al. Sep 2005 B2
6996056 Chheda et al. Feb 2006 B2
6999784 Choi Feb 2006 B1
7035636 Lim et al. Apr 2006 B1
7042858 Ma et al. May 2006 B1
7047009 Laroia et al. May 2006 B2
7072663 Ramos et al. Jul 2006 B2
7079511 Abrol et al. Jul 2006 B2
7085251 Rezaiifar Aug 2006 B2
7110785 Paranchych et al. Sep 2006 B1
7130626 Bender et al. Oct 2006 B2
7139575 Chen et al. Nov 2006 B1
7162247 Baba et al. Jan 2007 B2
7170871 Eyuboglu et al. Jan 2007 B2
7177650 Reiger et al. Feb 2007 B1
7200391 Chung et al. Apr 2007 B2
7212822 Vicharelli et al. May 2007 B1
7236764 Zhang et al. Jun 2007 B2
7242958 Chung et al. Jul 2007 B2
7251491 Jha Jul 2007 B2
7277446 Abi-Nassif et al. Oct 2007 B1
7298327 Dupray et al. Nov 2007 B2
7299168 Rappaport et al. Nov 2007 B2
7299278 Ch'ng Nov 2007 B2
7349699 Kelly et al. Mar 2008 B1
7398087 McConnell et al. Jul 2008 B1
7408901 Narayanabhatla Aug 2008 B1
7411996 Kim Aug 2008 B2
7453912 Laroia et al. Nov 2008 B2
7457265 Julka et al. Nov 2008 B2
7512110 Sayeedi et al. Mar 2009 B2
7546124 Tenneti et al. Jun 2009 B1
20020025820 Fauconnier et al. Feb 2002 A1
20020031107 Li et al. Mar 2002 A1
20020032034 Tiedemann, Jr. et al. Mar 2002 A1
20020035699 Crosbie Mar 2002 A1
20020067707 Morales et al. Jun 2002 A1
20020068570 Abrol et al. Jun 2002 A1
20020082018 Coskun et al. Jun 2002 A1
20020085719 Crosbie Jul 2002 A1
20020102976 Newbury et al. Aug 2002 A1
20020136226 Christoffel et al. Sep 2002 A1
20020145990 Sayeedi Oct 2002 A1
20020193110 Julka et al. Dec 2002 A1
20020196749 Eyuboglu et al. Dec 2002 A1
20030438748 Zhang et al. Jan 2003
20030031201 Choi Feb 2003 A1
20030067970 Kim Apr 2003 A1
20030095513 Woodmansee et al. May 2003 A1
20030100311 Chung et al. May 2003 A1
20030469105 Zhang et al. May 2003
20030114162 Chheda et al. Jun 2003 A1
20030117948 Ton et al. Jun 2003 A1
20030125039 Lachtar et al. Jul 2003 A1
20030195016 Periyalwar Oct 2003 A1
20040008649 Wybenga et al. Jan 2004 A1
20040015607 Bender et al. Jan 2004 A1
20040038700 Gibbs Feb 2004 A1
20040068668 Lor et al. Apr 2004 A1
20040179492 Zhang et al. Sep 2004 A1
20040214574 Eyuboglu et al. Oct 2004 A1
20040224687 Rajkotia Nov 2004 A1
20050648187 Schmidt et al. Jan 2005
20050025116 Chen et al. Feb 2005 A1
20050111429 Kim et al. May 2005 A1
20050113117 Bolin et al. May 2005 A1
20050124343 Kubo Jun 2005 A1
20050148297 Lu et al. Jul 2005 A1
20050181795 Mark et al. Aug 2005 A1
20050207368 Nam Sep 2005 A1
20050213555 Eyuboglu et al. Sep 2005 A1
20050713958 Akhtar et al. Sep 2005
20050715281 Fong Sep 2005
20050233746 Laroia et al. Oct 2005 A1
20050728848 Novak et al. Oct 2005
20050243749 Mehrabanzad et al. Nov 2005 A1
20050245279 Mehrabanzad et al. Nov 2005 A1
20050751848 Fong Dec 2005
20060758743 Novak et al. Jan 2006
20060030323 Ode et al. Feb 2006 A1
20060067422 Chung Mar 2006 A1
20060067451 Pollman et al. Mar 2006 A1
20060126509 Abi-Nassif et al. Jun 2006 A1
20060126556 Jiang et al. Jun 2006 A1
20060804343 Fong Jun 2006
20060805670 Novak et al. Jun 2006
20060159045 Ananthaiyer et al. Jul 2006 A1
20060820683 Novak et al. Jul 2006
20060820705 Novak et al. Jul 2006
20060182063 Jia et al. Aug 2006 A1
20060183497 Paranchych et al. Aug 2006 A1
20060822018 Novak et al. Aug 2006
20060209882 Han et al. Sep 2006 A1
20060824848 Novak et al. Sep 2006
20060825360 Novak et al. Sep 2006
20060240782 Pollman et al. Oct 2006 A1
20060828312 Novak et al. Oct 2006
20060829426 Novak et al. Oct 2006
20060264218 Zhang et al. Nov 2006 A1
20060291420 Ng Dec 2006 A1
20060294241 Cherian et al. Dec 2006 A1
20070022396 Attar et al. Jan 2007 A1
20070026884 Rao Feb 2007 A1
20070058628 Palnati et al. Mar 2007 A1
20070077948 Sharma et al. Apr 2007 A1
20070097916 Eyuboglu et al. May 2007 A1
20070105527 Nylander et al. May 2007 A1
20070115896 To et al. May 2007 A1
20070140172 Garg et al. Jun 2007 A1
20070140184 Garg et al. Jun 2007 A1
20070140185 Garg et al. Jun 2007 A1
20070140218 Nair et al. Jun 2007 A1
20070153750 Baglin et al. Jul 2007 A1
20070155329 Mehrabanzad et al. Jul 2007 A1
20070160008 Burgess Jul 2007 A1
20070220573 Chiussi et al. Sep 2007 A1
20070230419 Raman et al. Oct 2007 A1
20070238442 Mate et al. Oct 2007 A1
20070238476 Sharma et al. Oct 2007 A1
20070242648 Garg et al. Oct 2007 A1
20070248042 Harikumar et al. Oct 2007 A1
20080003988 Richardson Jan 2008 A1
20080013488 Garg et al. Jan 2008 A1
20080062925 Mate et al. Mar 2008 A1
20080065752 Ch'ng et al. Mar 2008 A1
20080069020 Richardson Mar 2008 A1
20080069028 Richardson Mar 2008 A1
20080076398 Mate et al. Mar 2008 A1
20080117842 Rao May 2008 A1
20080119172 Rao et al. May 2008 A1
20080120417 Harikumar et al. May 2008 A1
20080139203 Ng et al. Jun 2008 A1
20080146232 Knisely Jun 2008 A1
20080151843 Valmikam et al. Jun 2008 A1
20080159236 Ch'ng et al. Jul 2008 A1
20080162924 Chinitz et al. Jul 2008 A1
20080162926 Xiong et al. Jul 2008 A1
20080253550 Ch'ng et al. Oct 2008 A1
20080254792 Ch'ng Oct 2008 A1
20080273493 Fong et al. Nov 2008 A1
20080287130 Laroia et al. Nov 2008 A1
20090034440 Samar et al. Feb 2009 A1
20090082020 Ch'ng et al. Mar 2009 A1
20090088155 Kim Apr 2009 A1
20090103494 Jia et al. Apr 2009 A1
20090116445 Samar et al. May 2009 A1
20090129334 Fong et al. May 2009 A1
20090156218 Garg et al. Jun 2009 A1
Foreign Referenced Citations (59)
Number Date Country
199872855 Dec 1998 AU
199884574 Feb 1999 AU
200121976 Jun 2001 AU
735575 Jul 2001 AU
2003202721 Oct 2003 AU
2295922 Mar 2004 CA
1265253 Aug 2000 CN
1653844 Oct 2004 CN
101015224 Aug 2007 CN
625863 Nov 1994 EP
0904369 Mar 1999 EP
983694 Mar 2000 EP
983705 Mar 2000 EP
995278 Apr 2000 EP
995296 Apr 2000 EP
1005245 May 2000 EP
1011283 Jun 2000 EP
1014107 Jun 2000 EP
1397929 Mar 2004 EP
1491065 Dec 2004 EP
1751998 Feb 2007 EP
1896980 Mar 2008 EP
1897383 Mar 2008 EP
2447585 Aug 2008 GB
2452688 Mar 2009 GB
1101334 Oct 2007 HK
2007-538476 Dec 2007 JP
2008-547329 Dec 2008 JP
2008-547358 Dec 2008 JP
9833373 Aug 1998 KR
2004046069 Jun 2004 KR
2004089744 Oct 2004 KR
787289 Dec 2007 KR
199910613 Mar 2002 MX
WO9748191 Dec 1997 WO
WO 9808353 Feb 1998 WO
WO 9809460 Mar 1998 WO
WO9853618 Nov 1998 WO
WO9853620 Nov 1998 WO
WO9903245 Jan 1999 WO
WO9904511 Jan 1999 WO
WO0060891 Oct 2000 WO
WO0145308 Jun 2001 WO
W002071633 Sep 2002 WO
WO02071652 Sep 2002 WO
WO03001820 Jan 2003 WO
WO03009576 Jan 2003 WO
WO03081938 Oct 2003 WO
WO200464434 Jul 2004 WO
WO200512520 Dec 2005 WO
WO2005115026 Dec 2005 WO
WO200681527 Aug 2006 WO
WO2007002659 Jan 2007 WO
WO200728122 Mar 2007 WO
WO200728252 Mar 2007 WO
WO2007044099 Apr 2007 WO
WO200745101 Apr 2007 WO
WO 2007075446 Jul 2007 WO
WO 2007078766 Jul 2007 WO
Related Publications (1)
Number Date Country
20070077948 A1 Apr 2007 US