This description relates to neighbor list provision in a communication network.
Cellular wireless communications systems, for example, are designed to serve many access terminals distributed in a large geographic area by dividing the area into cells. At or near the center of each cell, an access point, also referred to as a base transceiver station, is located to serve access terminals (e.g., cellular telephones, laptops, PDAs) located in the cell. Each cell is often further divided into sectors by using multiple sectorized antennas. In each cell, an access point serves one or more sectors and communicates with multiple access terminals in its cell.
When connecting to a network, an access terminal selects an access point from a list of available access points that are known to be within communication range. The access terminal obtains the list of available access points from “neighbor list information” stored in its memory. In general, neighbor list information includes the set of radio channels (e.g., radio access technology, band classes, frequencies, and channel bandwidths) and other necessary information (such as timing offsets, coding information, details about the particular radio technology in that channel, search window size, etc.) to assist the access terminal in locating access points from which it can potentially receive radio services.
Neighbor list information is typically provided to the access terminal via (1) a preconfigured database programmed into the access terminal in a static way or (2) overhead signaling messages that are transmitted by some or all of the radio access points located within the general vicinity of the access terminal. These mechanisms for providing neighbor list information to an access terminal are generally implemented on static radio access networks in which the locations of radio access points are either permanently fixed or changed infrequently. Access points belonging to radio access networks that implement either of the above mechanisms for providing neighbor list information often operate across a single radio access technology.
In general, in one aspect, the invention features methods and computer programs for providing neighbor list information to an access terminal. From an access terminal, a query for potential access points within communication range of the access terminal is received, and neighbor list information is provided to the access terminal. The neighbor list information is associated with available access points capable of providing the access terminal with access to a network.
In general, in another aspect, the invention features methods and computer programs for receiving a list of information pertaining to available access points. From an access terminal, a signal indicative of a request for information about access points located within communication range of the access terminal is sent. At the access terminal, a list of information is received. The list of information is associated with available access points capable of providing the access terminal with access to a network.
In general, in a further aspect, the invention features a system for neighbor list provision. The system includes a server configured to receive from an access terminal, a query for potential access points within communication range of the access terminal. The server is also configured to provide to the access terminal, neighbor list information associated with available access points capable of providing the access terminal with access to a network.
Implementations may include one or more of the following. Receiving a query may include receiving one or more attributes describing communication features particular to the access terminal; and providing neighbor list information may include selecting the neighbor list information based on the one or more attributes. For example, the one or more attributes may include one or more of: a location, an application service requirement, a hardware specification, a hardware identification number of the access terminal, and a user identification number of a user of the access terminal. Providing neighbor list information may include providing radio channels and radio access protocols that are used by the available access points. Providing neighbor list information may also include delivering the neighbor list information to an access point in communication with the access terminal; and instructing the access point to transmit the neighbor list information to the access terminal as an overhead signaling message. Providing neighbor list information may further include delivering the neighbor list information to the access point as an IP message via an access point in communication with the access terminal. Receiving a query may include receiving the query at a server over a network connected to the access terminal and to the server (e.g., using one or more Internet protocols).
In the system, the network may include an Internet; and the server may include an HTTP server hosting a web page that includes the neighbor list information. The access points may include mobile access points. One or more of the available access points may serve a sub-pico cell located in a cell served by an access point with which the access terminal is in communication. Two or more the available access points may use different radio access technologies. A variety of communication protocols may be used for transmitting the query and the neighbor list information between the access terminal and the server. For example, the communication protocols may include HTTP protocols, XML-based protocols, TCP/UDP over IP protocols, SIP messaging, custom-designed protocols, and non-IP-based protocols.
Advantages that can be seen in particular implementations include one or more of the following. An access terminal can dynamically update its current neighbor list information by sending a query to a neighbor list server (e.g., using standard Internet protocols). Updated neighbor list information sent from the neighbor list server to the access terminal can be tailored to the needs of the access terminal based on many different attributes included in the query. The neighbor list server can apply a local policy to determine which potential access points to include in the neighbor list information. The local policy, for example, may select only those potential access points that can provide services that are required by the access terminal. The local policy may also limit the number of access points that are returned to the access terminal based on practical engineering constraints associated with one or both of the access terminal and potential access points. Examples of such engineering constraints include device limitations (e.g., power), signal quality (e.g., signal-to-noise ratio experienced by the access terminal), and data communication overhead limitations (e.g., size of the response message).
Neighbor list information may be frequently updated to provide an access terminal with an accurate list of potential access points of a dynamically changing radio access network. Such radio access networks may include large numbers of cells of varying size that can be added, removed, and modified dynamically. Using the neighbor list information, access terminals that support several different radio access technologies (referred to as “multi-mode” access terminals) can connect to access points that use different radio access technologies.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.
As discussed above, known methods for providing neighbor list information to an access terminal include pre-programming the information into the access terminal (e.g., during production) and transmitting the information as overhead signaling messages from some or all of the access points. In the latter method, the neighbor list information may be programmed into an access point during the initial setup of the access point. Although these mechanisms are generally adequate for radio access networks that are relatively static in their layout, as the access points of a radio access network are dynamically changed (e.g., added, removed, or modified) and/or configured to support multiple different radio access technologies, the neighbor list information supplied to an access terminal using the conventional mechanisms described above can quickly become outdated.
Here, we describe a system that can frequently update neighbor list information supplied to an access terminal to accommodate dynamic changes in the network and diverse radio access technologies. The system also can tailor list information provided to an access terminal according to various radio access technology requirements of that access terminal.
Referring to
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 1×EV-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 advantage of the scalability, redundancy and low-cost of IP networks.
Examples of communication protocols used by the RAN 100 include, one of the evolution data-only (1×EV-DO) protocol and other CDMA 2000 protocols. The 1×EV-DO protocol is an evolution of the current 1×RTT standard for high-speed data-only (DO) services and 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 2.0, June 2005, and is also incorporated herein by reference.
The RAN 100 includes access points 104a-c, an access IP network 106, and a packet data serving node (PDSN) 112. The access points 104a-c facilitate communication between the RAN 100 and access terminals, one of which (i.e., access terminal 118) is shown to be in communication with the access point 104a via an airlink 120. The access IP network 106 is a private network that is designed and operated exclusively for communication between the PSDN 112 and the access points 104a-c. Other radio nodes, devices, and packet networks (not shown in
The external network 114 is a network of devices that use the TCP/IP network protocols to exchange data and can be implemented in a variety of ways. For example, the external network 114 may include any kind and any combination of networks such as an Internet, a local area network (LAN) or other local network, a private network, a public network, a plain old telephone system (POTS), or other similar wired or wireless networks. The external network 114 can also include additional elements such as communication links, proxy servers, firewalls or other security mechanisms, Internet Service Providers (ISPs), gatekeepers, gateways, switches, routers, hubs, client terminals, and other elements. Communications through the external network 114 can include any kind and any combination of communication links such as modem links, Ethernet links, cables, point-to-point links, infrared connections, fiber optic links, wireless links, cellular links, Bluetooth®, satellite links, and other similar links. Communications through the RAN 100, the external network 114, or both may be secured with a mechanism such as encryption, a security protocol, or other type of similar mechanism.
The access terminals, e.g., access terminal 118, are the client-side of the wireless network and Internet protocol, and may be implemented as a mobile device such as a cellular telephone, a wireless PDA, a handheld gaming device, or a wireless laptop computer or a stationary device such as a desktop computer, or other fixed device with which wireless communication is desired. The access terminals may also include embedded devices such as remote sensing devices, electric meters, vending machines, security cameras, remote recording or logging devices, or any device that includes a wireless communications modem.
The access terminal 118 includes a modem 115 for modulating and demodulating transmissions sent and received over the RAN 100. The modem 115 may include multiple modems, each using a different radio access technology. Examples of modem 115 include BREW® modems available from QUALCOMM Inc., or modems based on a Java library or class.
The application server 108 and neighbor list server 116 connect to the network 114 and communicate with the access terminal 118 over the wireless IP network 110. The application server 108 provides wireless services to the access terminal, examples of which include: voice services, circuit data services, and packet data services. In some embodiments, the application server 108 includes multiple servers. The neighbor list server 116 provides neighbor list information to the access terminal 118 via transmissions sent over the external network 114 and the RAN 100. In some embodiments, the application server 108 and the neighbor list server 116 are integrated into a single server.
Referring to
The access terminal 118 is located within cells 1 and 2 and in communication with access point 104a of cell 1. Although the access terminal 118 is located within both cells 1 and 2, the access terminal 118 may not be aware of the access point 104b if its neighbor list information does not include any information associated with the access point 104b. For example, the access point 104b may be capable of providing the access terminal 118 with a stronger signal, faster data communication speed, and/or more services than the access point 104a, to which the access terminal 118 is connected.
However, unless the access terminal 118 is aware that the access point 104b is within communication range and, in some instances, is capable of providing improved communication services to those of access point 104a, the access terminal 118 will not attempt to connect to the access point 104b. Referring to
The query includes a request for updated neighbor list information. In some embodiments, the query also includes attributes that define various service requirements and technological requirements that are specific to the access terminal 118. Examples of attributes include a location, application service requirements, hardware capabilities, and a hardware identity of the access terminal 118 and a user identity of the end user who is operating the access terminal 118.
Location attributes may express the location of the access terminal 118 as an IP address, a geographical location, or both. In some embodiments, the location of the access terminal 118 is determined by the identity of other access points that are visible from or within communication range of the access terminal 118. In other embodiments, the location is based on geo-location information known to the access terminal 118 or to the RAN 100. For example, the access terminal 118 or the RAN 100 may be equipped with GPS capability or other geo-location services for determining geographic location.
Attributes pertaining to the application service requirements of the access terminal 118 may include all or a subset of the applications and services that the access terminal 118 is capable of providing to an end user. For example, application-service-requirements attributes may include only those applications and services that are desired by the end user at the time just before the query is sent. Examples of applications and services include voice services, access to the World Wide Web, high-speed data transmission, text messaging, etc.
Attributes defining the hardware capabilities of the access terminal 118 may include each of the radio access technologies supported by the access terminal 118 and the hardware limitations associated with each supported radio access technology. Examples of such limitations include bandwidths, data rates, power classes, and the ability to support radio access operations on multiple radio access technologies concurrently.
Attributes describing the hardware identity of the access terminal 118 may include one or more hardware identifiers (such as a mobile equipment identifier or “MEID”) assigned to the access terminal 118. The hardware identifier(s) may be obtained in a secure or insecure manner directly from the access terminal 118 or from the RAN 100.
Similar to the hardware identity attributes, attributes describing the identity of the current end user that is obtaining service with the access terminal 118 may include one or more identifiers associated with the user. Examples of user identifiers include a username, an account number, a UIM identifier, and a SIM card identifier. End-user identifier(s) may be obtained in a secure or insecure manner directly from the access terminal 118 or from the RAN 100.
The access terminal 118 receives access to the external network 114 through its normal radio access procedures and packet data services obtained through access point 104a to which it is connected at the time of sending the query. The query is sent to the neighbor list server 116 using standard or proprietary communication protocols. For example, the access terminal may obtain the location of the neighbor list server 116 dynamically (e.g., using DNS or DHCP communication protocols) or statically (e.g., from a pre-configured IP address programmed into the access terminal 118). The access terminal 118 receives (144) updated neighbor list information from the neighbor list server 116 either immediately or at a later time, depending on how and when the information is delivered.
A variety of communication protocols may be used for transmitting the query and the neighbor list information between the access terminal 118 and the neighbor list server 116. These include, but are not limited to: HTTP protocols, including those that use URLs to identify the neighbor list server 116; application layer protocols including, but are not limited to, XML and XML-based protocols such as SOAP; TCP/UDP over IP protocols, and SIP messaging (e.g., through one or more IMS/MMS network elements). Other possible communication protocols include custom-designed protocols, which may be published or proprietary and non-IP-based protocols (e.g., Layer 3 or upper layer signaling-based protocols of the radio access technology).
The neighbor list information may be transmitted to the access terminal 118 using point-to-point, point-to-multipoint multicast, or point-to-multipoint broadcast versions of the above described protocols. In some embodiments, the neighbor list information may simply be made available on a web page that the access terminal 118 can access over the World Wide Web. In some of these embodiments, the neighbor list server 116 is an HTTP server that hosts the web page containing updated neighbor list information.
Based on the neighbor list information received from the neighbor list server 116 and on any of the access terminal's application policies, the process 140 determines (146) that some or all of the neighboring access points (e.g., access points 104b-c) contained in the neighbor list information are appropriate given the hardware requirements, service requirements, and/or other requirements of the access terminal 118. The process 140 passes (147) the neighboring access points to the modem 115 of the access terminal 118. In some embodiments, the process 140 passes (148) the neighbor access points to the radio modems through an Application Program Interface (API). The modem 115 of the access terminal 118 searches (150) for the neighboring access points (in addition to, or instead of the potential access points that have already been obtained by the traditional methods described in the background section) from which the desired application services can be obtained.
From the neighboring access points located in the searching process 150, the access terminal 118 selects (152) an access point with which to connect to the RAN 100. In some embodiments, the access terminal 118 selects the access point that best meets one or more technical specifications. For example, the access terminal 118 may select the access point that has the highest bandwidth, and/or belongs to a particular service provider. In other embodiments, the access terminal 118 selects an access point at random or in a semi-random fashion (e.g., automatically selecting the first access point from a list of appropriate access points).
The access terminal 118 connects (154) to the selected access point and relinquishes the access point 104a to which it had been connected. Through the newly established connection with the selected access point, the access terminal 118 obtains (156) wireless services (e.g., voice transmission, text messaging, etc.), one or more of which are provided by the application server 108, in the usual manner according to the procedures that are specified by the one or more radio access technologies being used by the access terminal 118 and supported by the selected access point.
Referring to
Based on the attributes contained in the query, the neighbor list server 116 determines (164) those potential neighboring access points that meet some or all of the access terminal's technological and service requirements. The neighbor list server 116 optionally applies (166) a local policy to determine which of the potential neighboring access points determined in step 164 should be returned to the access terminal 118.
The local policy may eliminate one or more of the potential neighboring access points based on one or more technical considerations, legal constraints, business constraints, and other criteria and considerations. Examples of such criteria and considerations include: the identity of the device or user and whether or not it has been authenticated; the eligibility of the access terminal 118 or of the user to obtain service from certain potential neighboring access points (e.g., does the access terminal 118 or user have rights granted by the owner or service provider to access certain radio access points); the time of day or date on which the query is sent; the ability or eligibility of the potential neighboring radio access points to provide the services that are required or requested by the access terminal 118; and the current location of the access terminal 118. The local policy may also limit the number of neighboring access points that can be returned to the access terminal 118. In some embodiments, the number of neighboring access points may be limited based on priorities governing which potential neighboring access points are eligible to serve the access terminal. For example, access points that are capable of supporting particularly high bandwidths and/or a large variety of services may be available only to users who subscribe to more expensive service plans. In some embodiments, the number of neighboring access points may be limited based on practical engineering constraints such as their current usage by other access terminals (e.g., potential access points that are already serving many other access terminals may be eliminated from consideration). Other practical engineering constraints that may limit the number of potential neighboring access points returned to the user include device limitations and data communication overhead limitations (e.g., the size of the message that includes the neighbor list information).
The neighbor list server 116 provides (168) neighbor list information to the access terminal 118. The neighbor list information includes a list of the potential neighboring access points to be returned to the access terminal 118, as determined by the local policy in step 166. In some embodiments, the neighbor list server 116 transmits the neighbor list information to the access terminal 118 through the same application layer protocols used by the access terminal 118 to send the query to the neighbor list server 116 (step 140 of
Referring to
In a second approach 168b, depicted in
As described above with respect to
Although the techniques described above employ the 1×EV-DO air interface standard, the techniques are also applicable to other CDMA and non-CDMA air interface technologies in which an access terminal communicates with a server over a wireless network.
The techniques described herein 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.
To provide for interaction with a user, the techniques described herein can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer (e.g., interact with a user interface element, for example, by clicking a button on such a pointing device). Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input.
The techniques described herein can be implemented in a distributed computing system that includes a back-end component, e.g., as a data server, and/or a middleware component, e.g., an application server, and/or a front-end component, e.g., a client computer having a graphical user interface and/or a Web browser through which a user can interact with an implementation of the invention, or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), e.g., the Internet, and include both wired and wireless networks.
The requesting and delivering of neighbor list information may occur over another non-wireless network or a different wireless network from the one to which the neighbors apply. For example, a device could be connected to an Ethernet network or WiFi (wireless fidelity) wireless network, request and obtain the neighbor list information, and then use that neighbor list information to assist in its operation on the cellular network or, in general, any wireless network.
Neighbor list information may not be restricted to one wireless communication protocol. For example, the neighbor list that may be applicable to CDMA 1×, 1×EV-DO, WiMax, UMTS, GSM, or any subset of these technologies and include rules for determining neighbors within one or more of those technologies and rules that determine when and how the access terminal can or should perform handoffs from one technology to another.
The computing system can include clients and servers. A client and server are generally remote from each other and typically interact over a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
Other embodiments are within the scope of the following claims. The following are examples for illustration only and not to limit the alternatives in any way. The techniques described herein can be performed in a different order and still achieve desirable results.
Number | Name | Date | Kind |
---|---|---|---|
6188904 | Marsan | Feb 2001 | B1 |
6295450 | Lyer et al. | Sep 2001 | B1 |
6711144 | Kim et al. | Mar 2004 | B1 |
6731618 | Chung et al. | May 2004 | B1 |
6741862 | Chung et al. | May 2004 | B2 |
6781999 | Eyuboglu et al. | Aug 2004 | B2 |
7170871 | Eyuboglu et al. | Jan 2007 | B2 |
7200391 | Chung et al. | Apr 2007 | B2 |
7242958 | Chung et al. | Jul 2007 | B2 |
7277446 | Abi-Nassif et al. | Oct 2007 | B1 |
7299278 | Ch'ng | Nov 2007 | B2 |
7356001 | Jones et al. | Apr 2008 | B1 |
7475048 | Weston et al. | Jan 2009 | B2 |
7558356 | Pollman et al. | Jul 2009 | B2 |
7558588 | To et al. | Jul 2009 | B2 |
7623866 | Spitzer | Nov 2009 | B1 |
20020055999 | Takeda | May 2002 | A1 |
20020059453 | Eriksson et al. | May 2002 | A1 |
20020098849 | Bloebaum et al. | Jul 2002 | A1 |
20020151304 | Hogan | Oct 2002 | A1 |
20020191573 | Whitehill et al. | Dec 2002 | A1 |
20020196749 | Eyuboglu et al. | Dec 2002 | A1 |
20030013443 | Willars et al. | Jan 2003 | A1 |
20030100311 | Chung et al. | May 2003 | A1 |
20030174667 | Krishnamurthi et al. | Sep 2003 | A1 |
20030197724 | Reed | Oct 2003 | A1 |
20030227911 | Trossen | Dec 2003 | A1 |
20040019636 | St. Pierre et al. | Jan 2004 | A1 |
20040043769 | Amerga et al. | Mar 2004 | A1 |
20040106408 | Beasley et al. | Jun 2004 | A1 |
20040116110 | Amerga et al. | Jun 2004 | A1 |
20040152480 | Willars et al. | Aug 2004 | A1 |
20040157600 | Stumpert et al. | Aug 2004 | A1 |
20050014492 | Kang et al. | Jan 2005 | A1 |
20050048974 | Kim et al. | Mar 2005 | A1 |
20050118946 | Colban et al. | Jun 2005 | A1 |
20050141464 | Willey et al. | Jun 2005 | A1 |
20050213555 | Eyuboglu et al. | Sep 2005 | A1 |
20050243749 | Mehrabanzad et al. | Nov 2005 | A1 |
20050243870 | Balogh et al. | Nov 2005 | A1 |
20050245279 | Mehrabanzad et al. | Nov 2005 | A1 |
20050255847 | Han et al. | Nov 2005 | A1 |
20060067422 | Chung | Mar 2006 | A1 |
20060067451 | Pollman et al. | Mar 2006 | A1 |
20060092890 | Gupta et al. | May 2006 | A1 |
20060126509 | Abi-Nassif | Jun 2006 | A1 |
20060142027 | Krishnamurthi et al. | Jun 2006 | A1 |
20060159045 | Ananthaiyer et al. | Jul 2006 | A1 |
20060183482 | Ueda | Aug 2006 | A1 |
20060240782 | Pollman et al. | Oct 2006 | A1 |
20060270411 | Grayson | Nov 2006 | A1 |
20060274743 | Yegin et al. | Dec 2006 | A1 |
20060291420 | Ng | Dec 2006 | A1 |
20060294241 | Cherian et al. | Dec 2006 | A1 |
20070005602 | Campadello | Jan 2007 | A1 |
20070026884 | Rao | Feb 2007 | A1 |
20070050360 | Hull et al. | Mar 2007 | A1 |
20070050419 | Weyl et al. | Mar 2007 | A1 |
20070058628 | Rao et al. | Mar 2007 | A1 |
20070077948 | Sharma et al. | Apr 2007 | A1 |
20070097916 | Eyuboglu 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 |
20070155329 | Mehrabanzad et al. | Jul 2007 | A1 |
20070211675 | Jain et al. | Sep 2007 | A1 |
20070220573 | Chiussi et al. | Sep 2007 | A1 |
20070230419 | Raman et al. | Oct 2007 | A1 |
20070237142 | Yang 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 |
20080014991 | Laroia et al. | Jan 2008 | A1 |
20080049702 | Meylan et al. | Feb 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 |
20080117866 | Claussen et al. | 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 |
20090034440 | Samar et al. | Feb 2009 | A1 |
20090082020 | Ch'ng et al. | Mar 2009 | A1 |
20090088155 | Kim | Apr 2009 | A1 |
20090116445 | Samar et al. | May 2009 | A1 |
20090154447 | Humblet | Jun 2009 | A1 |
20090156165 | Raghothaman et al. | Jun 2009 | A1 |
20090156195 | Humblet | Jun 2009 | A1 |
20090156218 | Garg et al. | Jun 2009 | A1 |
20090163202 | Humblet et al. | Jun 2009 | A1 |
20090163216 | Hoang et al. | Jun 2009 | A1 |
20090163238 | Rao et al. | Jun 2009 | A1 |
20090164547 | Ch'ng et al. | Jun 2009 | A1 |
20090168766 | Eyuboglu et al. | Jul 2009 | A1 |
20090168788 | Den et al. | Jul 2009 | A1 |
20090170440 | Eyuboglu et al. | Jul 2009 | A1 |
20090170475 | Ch'Ng et al. | Jul 2009 | A1 |
20090170520 | Jones | Jul 2009 | A1 |
20090170547 | Raghothaman et al. | Jul 2009 | A1 |
20090170557 | Chauhan et al. | Jul 2009 | A1 |
20090172169 | Ch'Ng et al. | Jul 2009 | A1 |
20090172397 | Kim | Jul 2009 | A1 |
20090252136 | Mahany et al. | Oct 2009 | A1 |
20090323680 | Kubler et al. | Dec 2009 | A1 |
Number | Date | Country |
---|---|---|
2322051 | Aug 1998 | GB |
2452688 | Mar 2009 | GB |
WO 03079700 | Sep 2003 | WO |
WO2008077008 | Jun 2008 | WO |
Entry |
---|
International Preliminary Report on Patentability for PCT application No. PCT/US2007/087862 mailed Jul. 2, 2009 (8 pages). |
Paul Bender, et al., “CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users”, IEEE Communications Magazine, Jul. 2000. |
Paul Bender & Ramin Rezalifar, “Draft Baseline Text for the 1xEV-DO Upper Layers (excluding Physical Layer)”, 3GPP2, Aug. 17, 2000. |
3GPP2, “3GPP2 Access Network Interfaces Interoperability Specification 2, Release A,” Jun. 2000. |
TIA/EIA/TSB-115, “Wireless IP Architecture Based on IETF Protocols”, Jun. 6, 2000. |
3GPP2, “Wireless IP Network Standard”, 3rd Generation Partnership Project 2 (3GPP2), Version 1.0.0, Jul. 14, 2000. |
3rd Generation Partnership Project “3GPP2”, cdma2000 High Rate Packet Data Interface Specification, C.S0024-A, version 4.0, Oct. 25, 2002. |
3rd Generation Partnership Project “3GPP2”, cdma2000 High Rate Packet Data Interface Specification, C.S0024-A, version 2.0, Jul. 2005. |
3rd Generation Partnership Project 2 “3GPP2”, “cdma2000 High Rate Packet Data Interface Specification”, C.S0024, version 2, Oct. 27, 2000 (441 pages). |
3rd Generation Partnership Project 2 “3GPP2”, “cdma2000 High Rate Packet Data Interface Specification”, C.S0024-B, version 1, Apr. 2006 (1623 pages). |
3rd Generation Partnership Project 2 “3GPP2”, “cdma2000 High Rate Packet Data Interface Specification”, C.S0024-B, version 2, Mar. 2007 (1627 pages). |
International Search Report and Written Opinion in corresponding PCT application No. PCT/US2007/087862 mailed Apr. 22, 2008 (67 pages). |
Liebsch, et al., “Request for Comments: 4066, Candidate Access Router Discovery (CARD)”, Jul. 2005, URL: ftp://ftp.isi.edu/in-notes/rfc4066.txt, retrieved Apr. 3, 2008. |
“3GPP2 C.S0024-A, cdma2000 High Rate Packet Data Air Interface Specification”, Sep. 2006, URL: http://www.3gpp2.org/Public—html/specs/alltsgscfm.dfm, retrieved Apr. 2, 2008. |
Number | Date | Country | |
---|---|---|---|
20080146232 A1 | Jun 2008 | US |