System and method for restricting network access to one or more nodes in a wireless communications network

Information

  • Patent Grant
  • 8325653
  • Patent Number
    8,325,653
  • Date Filed
    Tuesday, January 31, 2006
    18 years ago
  • Date Issued
    Tuesday, December 4, 2012
    12 years ago
Abstract
A system and method for providing security to a wireless network by using a mobile node's location as a parameter for deciding if access is to be given to the node. The system and method employ access points, wireless routers and mobile nodes, each including at least one transceiver adapted to transmit and receive communication signals to and from other wireless routers, mobile nodes and other mobile access points. Each access point is connected to a network management system which allows enhanced network monitoring and control. Each network node includes technology which may determine an absolute node location containing latitude, longitude and altitude of a node, or a relative node location containing the distance and angle between nodes, or a combination of both absolute and relative location data.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates to a system and method for providing security for a wireless network, such as an ad-hoc wireless communications network, based on the position information relating to mobile nodes. More particularly, the present invention relates to a system and method for trusted infrastructure devices to compute the location of a mobile node in a wireless communications network, such as an ad-hoc terrestrial wireless communications network, during the authentication process.


2. Description of the Related Art


Wireless communications networks, such as mobile wireless telephone networks, have become increasingly prevalent over the past decade. These wireless communications networks are commonly referred to as “cellular networks” because the network infrastructure is arranged to divide the service area into a plurality of regions called “cells”.


Specifically, a terrestrial cellular network includes a plurality of interconnected base stations that are distributed geographically at designated locations throughout the service area. Each base station includes one or more transceivers that are capable of transmitting and receiving electromagnetic signals, such as radio frequency (RF) communications signals, to and from user nodes, such as wireless telephones, located within the base station coverage area. The communications signals include, for example, voice data that has been modulated according to a desired modulation technique and transmitted as data packets. As can be appreciated by one skilled in the art, the transceiver and user nodes transmit and receive such data packets in multiplexed format, such as time-division multiple access (TDMA) format, code-division multiple access (CDMA) format, or frequency-division multiple access (FDMA) format, which enables a single transceiver at the base station to communicate simultaneously with several user nodes in it's coverage area.


In recent years, a type of mobile communications network known as an “ad-hoc” network has been developed for use by the military. In this type of network, each user node is capable of operating as a base station or router for the other user nodes, thus eliminating the need for a fixed infrastructure of base stations. Details of an ad-hoc network are set forth in U.S. Pat. No. 5,943,322 to Mayor, the entire content of which is incorporated herein by reference.


More sophisticated ad-hoc networks are also being developed which, in addition to enabling user nodes to communicate with each other as in a conventional ad-hoc network, further enable the user nodes to access a fixed network and thus communicate with other user nodes, such as those on the public switched telephone network (PSTN), and on other networks such as the Internet. Details of these types of ad-hoc networks are described in U.S. patent application Ser. No. 09/897,790 entitled “Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks”, filed on Jun. 29, 2001, and in U.S. patent application Ser. No. 09/815,157 entitled “Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel”, filed on Mar. 22, 2001, now U.S. Pat. No. 6,807,165, the entire content of each being incorporated herein by reference.


In either conventional wireless communications networks, or in ad-hoc wireless communications networks, it may be necessary or desirable to know or determine the geographic location of user nodes. Different types of location determining services and techniques for wireless communications networks are described in a publication by Nokia which can be found on the Nokia website at “www.nokia.com/press/background/pdf/mlbs.pdf”, the entire content of which being incorporated herein by reference. In particular, the Nokia document states that location identification services are currently provided in wireless communications networks based on three major technologies. One of these technologies uses cell identification combined with Round Trip Time (RTT), Timing Advance (TA) and Measured Signal level (RX level), Time Difference of Arrival (TDOA) and Angle Of Arrival (AOA) techniques, the details of which can be appreciated by one skilled in the art. A second technology uses cellular signal timing based methods for code division multiple access (CDMA) and wideband code division multiple access (WCDMA). The third technology described in the Nokia document employs Global Positioning System (GPS) techniques.


Another list of methods and techniques currently used in the wireless communications industry for providing location services can be found at “www.911dispatch.com/911_file/location_tech.html”, the entire content of which being incorporated herein by reference. Although the GPS technique is the last technique mentioned in this list, it is generally viewed as being more accurate than all of the other methods. Further details and descriptions of GPS based methods are set forth in a publication by J. J. Spilker Jr. entitled “Satellite Constellation and Geometric Dilution of Precision”, in a publication by P. Axelrad et al. entitled “GPS Navigation Algorithms”, in a publication by Bradford W. Parkinson entitled “GPS Error Analysis”, and in a publication by N. Ashby et al. Entitled “Introduction to Relativistic Effects on the Global Positioning System”, each found in “GPS—Theory and Applications”, American Institute of Astronautics, 1996, the entire content of each being incorporated herein by reference.


Despite the fact that the GPS technique has been in use for a considerable period of time and most of the world's navigation relies on this technique, the GPS technique is very susceptible to errors in measurement. Therefore, the GPS technique is capable of providing location determination results with very high accuracy only after performing a relatively large number of measurements to remove such errors. A description of the shortcomings of GPS is set forth in a document by IMA entitled “Mathematical Challenges in Global Positioning Systems (GPS)” which can be found at “www.ima.umn.edu/gps”, the entire content of this document being incorporated herein by reference. Certain other tests also demonstrate that the GPS technique is unsuitable for terrestrial-based networks.


In addition, other methods and techniques which do not use GPS satellites for determining mobile station locations in a wireless communications network typically require that the signal from the mobile station be received by at least two cell sites that can measure and process the delay between signal arrivals, identify the direction of the signal based on “path signature”, and determine the distance between mobile station and the cell towers. In all of these methods, information processing is executed in a designated central processing unit (CPU) which is typically located at a cell tower next to the base station (BTS). Also, most of these methods were designed to comply with E911 requirements without requiring that excessive modifications be made to existing wireless communications systems. Examples of other location determining techniques are set forth in a document by CERN—European Organization for Nuclear Research, which can be found at “rkb.home.cern.ch/rkb/ANI16 pp/node98.html#SECTION00098000000000000000”, in a document by Wendy J Woodbury Straight entitled “Exploring a New Reference System”, which can be found at “menstorsoftwareince.com/profile/newref.html”, and in a document entitled “An Introduction to SnapTrac Server-Aided GPS Technology”, which can be found at “www.snaptrack.com/pdf/ion.pdf”, the entire content of each being incorporated herein by reference. Additional details may also be found in U.S. patent application Ser. No. 09/988,001 entitled “A System and Method for Computing the Location of a Mobile Terminal in a Wireless Communications Network”, filed on Nov. 16, 2001, now U.S. Pat. No. 6,728,545, which describes a system and method for determining location with the use of technologies such as GPS, the entire content being incorporated herein by reference.


Accordingly, a need exists for a system and method for determining the location of a mobile user node in a wireless communications network by trusted infrastructure devices to determine if the device is physically within a predetermined “safe zone”, and provide access to the network based on this location determination.





BRIEF DESCRIPTION OF THE DRAWINGS

These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:



FIG. 1 is a block diagram of an example of an ad-hoc packet switched wireless communications network including a plurality of nodes employing an embodiment of the present invention;



FIG. 2 is a block diagram illustrating an example of a node employed in the network shown in FIG. 1;



FIG. 3 is a diagram illustrating an example of the maximum and secure ranges of an infrastructure device in accordance with an embodiment of the present invention;



FIG. 4 is a diagram illustrating an example of a network layout with multiple infrastructure devices which have radio ranges which extend beyond the desired secure area in accordance with an embodiment of the present invention;



FIG. 5 is a diagram illustrating an example of the secure ranges for each wireless router in FIG. 4 in accordance with an embodiment of the present invention;



FIG. 6 is a diagram illustrating an example location of several mobile nodes which are within radio range of the wireless network in FIG. 4 in accordance with an embodiment of the present invention; and



FIG. 7 is a ladder diagram illustrating an example of the flow of messages between devices during the authorization process in accordance with an embodiment of the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Wireless nodes wishing to obtain access to an enterprise LAN are typically required to authenticate themselves via the IP standard. Although this verifies that the user has the required challenge information, it does not prevent a computer that has been compromised from accessing the network. Due to the wireless interface, a user doesn't have to be inside the building in order to obtain access. Thus, a compromised computer with a wireless interface could be outside a business' secured environment, such as sitting in a parking lot, and obtain full access to the network services within a business building. Unlike a wired network, the wireless user doesn't need to pass the physical security checks such as a guard desk to obtain building access prior to plugging into the LAN.


In an embodiment of the present invention, or any other wireless technology which could be extended to add a location measurement (e.g. 802.11), the authentication server can request the wireless routers or access points to take time of flight measurements and report either the time of flight or the calculated distance. The authentication server can then determine if the location of the wireless user is within a defined space, such as a building outline, and the authentication server may reject users that are outside the perimeter.



FIG. 1 is a block diagram illustrating an example of a wireless communications network 100 employing mobile access nodes, or terminals, according to an embodiment of the present invention. As shown in FIG. 1, network 100 includes a plurality of devices, including access points (101-1 to 101-2), wireless routers (102-1 to 102-n) and mobile nodes (103-1 to 103-n) on the wireless side of the network, and a Network Operations Center 104 on the wired part of the network. Further details of the network 100 and its operation will now be described. For purposes of this discussion, the terms “user terminal” and “mobile node” will be used interchangeably.


As shown in FIG. 2, each access point 101, wireless routers 102 and mobile node 103 includes at least one transceiver 106 and at least one controller 107. Each transceiver 106 is coupled to an antenna 109 and can transmit and receive data packets over any frequency band, for example, over the 2nd Institutional Scientific Medical (ISM) band.


The frequency and modulation scheme used by the transceiver 106 however, do not impact the implementation of the mobile access points 101, wireless routers 102, or nodes 103. Each node 101, 102 and 103 further includes a memory 108, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network 100. Certain nodes, in particular, mobile nodes 103-1 through 103-n, can be coupled to a host device 110, such as a personal computer (PC), personal data assistant (PDA), or any other suitable device for use by a user.


Each access point 101 and wireless router 102 maintains knowledge of their geographic location. This information may be manually entered, or the devices may include positioning functionality, such as global positioning system (GPS) functionality, differential navigation functionality, or other positioning functionality such as various triangulation techniques as can be appreciated by one skilled in the art, or as described in U.S. Pat. No. 6,728,545 referenced above, and in a U.S. Patent Application of Eric A. Whitehill, Ser. No. 09/973,799, for “A System And Method For Efficiently Performing Two-Way Ranging To Determine The Location Of A Wireless Node In A Communications Network”, filed on Oct. 11, 2001, now U.S. Pat. No. 6,768,730, the entire contents of which being incorporated herein by reference.


Referring to FIG. 1, each node 101, 102 and 103 can be in communication with the Network Operations Center 104, either directly or via other nodes. The Network Communication Center typically consists of equipment used to configure and manage the wireless network, however, for the purposes of this description, only the Authentication, Authorization and Accounting (AAA) server 105 is shown.


Coverage graph 112 of FIG. 3 shows an example of a network 100 deployment where a single access point 101 is used to provide wireless coverage to an area, such as an office, bounded by an office perimeter 114. In this example, the range of the transceiver 106 of the access point 101, shown bounded by 116, is greater than the perimeter 114 of the office. This could potentially allow an unauthorized user, located beyond the perimeter 114 but within the bounded area 116, to access the network 100. As part of the configuration of the network 100, however, the maximum radius of the transceiver range of access point 101 which guarantees that the user is physically in the secure space is determined. This range, shown bounded by 118, is subsequently used during the authorization process to determine if a node requesting access is within a network access restrict boundary.


Coverage graph 120 of FIG. 4 shows an example of a larger network 100 configuration consisting of a single access point 101 and four wireless routers 102-1, 102-2, 102-3 and 102-4. In this example, the range of the transceiver 106 of each wireless router, shown bounded by 116-1, 116-2, 116-3 and 116-4 respectively, is greater than the perimeter 114 of the office, which could potentially allow an unauthorized user to access the network as described in FIG. 3. Therefore, as in FIG. 3, a maximum radius of each transceiver range which guarantees that the user is physically in the secure space is determined and subsequently used during the authorization process as shown in FIG. 5. As described in greater detail below, in each of FIGS. 3, 4 and 5, nodes requesting access to the network are first located by the fixed devices 101 and 102 within the network. Location of the requesting node is determined by measuring a distance at which the requesting node is located from a fixed device, including both wireless routers 102 and access point 101. If the requesting node is located within the secure space 118, access for the node is allowable on the basis of position.


Due to the placement of the devices in FIGS. 4 and 5 however, simply utilizing the distance of a mobile node to a wireless router may be insufficient for determining if the node is in the secure zone of any one wireless router, shown bounded by 118-1, 118-2, 118-3 and 118-4 respectively. As shown in coverage graph 124 of FIG. 6, mobile nodes 103-2 and 103-3 are both beyond the secure space of each fixed device, however, node 103-2 is located within the perimeter 114 and should be allowed access to the network on the basis of position. As described in greater detail below, the distance between each mobile node 103-1, 103-2 and 103-3 and multiple infrastructure devices must be determined to decide if the “absolute location” of a mobile node is within the perimeter 114, as shown in the coverage graph 124 of FIG. 6.


The ladder diagram 126 of FIG. 7 shows an example of the process flow that occurs for one embodiment of the present invention. Using the coverage graph 124 of FIG. 6 as an example, the process flow of FIG. 7 may be used to accurately locate mobile nodes requesting access and restrict network access based upon improper node location. Referring to FIGS. 6 and 7, the restricted access process of the embodiment of the present invention begins when a mobile node, such as node 103-2, powers up and the transceiver 106 of the node chooses a path to an access point 101, such as via the wireless router 102-1. The mobile node 103-2 sends a request to join the wireless network 100 and the wireless router 102-1 passes the message to the access point 101, which in turn passes the message to the Authentication, Authorization and Accounting (AAA) server 105.


As part of the authentication process, the AAA server 105 sends a message to the access point 101 requesting the range information of the mobile node 103-2, such as the location of the wireless router 102-1, and the distance between wireless router and the mobile device 103-2. The access point 101 receives the message from the AAA server and sends a request to the wireless router 102-1 to determine the distance between the mobile device 103-2 and the wireless router 102-1. The wireless router 102-1 executes a series of measurements, such as time of flight measurements, and determines the requested distance information, which is then sent to the AAA server 105 via the access point 101. The AAA server then calculates a position for the mobile node 103-2 and determines if the mobile node is within a secure zone 118-1, that is, within a zone in which network access by mobile nodes is allowed.


If the mobile node 103-2 is not found within the secure zone 118-1 by measurements provided by the wireless router 102-1, the AAA server 105 sends a request for an “absolute position” determination to the access point 101. The access point then requests neighboring wireless routers, such as 102-2, 102-3 and 102-4, to determine the distance between mobile node 103-2 and each wireless router 102-2, 102-3 and/or 102-4 respectively. In addition, the access point 101 may also determine the distance between the mobile node 103-2 and the access point 101. Each wireless router executes a series of measurements, such as time of flight measurements, and determines the requested distance information, which is then sent to the access point 101.


Upon receiving the additional distance information, the access point 101 calculates the absolute position of the mobile node 103-2 and sends the result to the AAA server 105. The AAA server 105 evaluates the absolute position of the mobile node 103-2 and determines if the mobile node is within the perimeter 114, and if so, sends a response to the original request for access from the wireless router 102-1 to allow the mobile node 103-2 to join the network on the basis of location.


There can be variations to the process flow in FIG. 7. For example, in another embodiment of the present invention, the AAA server 105 may request an absolute location without previously requesting the range information. The AAA server 105 may perform the calculations to determine if the mobile node 103 is in the secure zone, or it may send the information to an agent and subsequently use the agent's response. In each embodiment, the AAA server requests and receives location information and uses the location information received as part of the decision to provide service to the node.


In embodiments of the invention described above, security is maintained as the mobile nodes 103 cannot “spoof” the time of flight measurement used, since any attempt at processing the message would only delay the signal's return and effectively cause a greater distance to be calculated. Likewise, the mobile nodes 103 cannot provide an erroneous location since it they never queried for a self-determined location. All location determinations are done by infrastructure devices under control of the network.


Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined.

Claims
  • 1. A method for providing restricted network access to one or more nodes communicating within a wireless communication network, the method comprising: receiving, by an authentication server, a request for network access from a requesting node via an authenticated node;receiving, by the authentication server, a distance information between the requesting node and the authenticated node from the authenticated node;calculating, by the authentication server, a position of the requesting node using the received distance information; andallowing network access, by the authentication server, for the requesting node when the calculated position is within a network access boundary.
  • 2. The method as claimed in claim 1, the method further comprising, prior to the authentication server receiving the distance information: executing, by the authenticated node, a series of measurements;determining, by the authenticated node, the distance information; andtransmitting the distance information from the authenticated node to the authentication server.
  • 3. The method as claimed in claim 2, further comprising, prior to the authenticated node executing the series of measurements: sending a request for the distance information from the authentication server to the authenticated node in response to receiving the request for network access.
  • 4. The method as claimed in claim 2, wherein the series of measurements includes time of flight measurements.
  • 5. The method as claimed in claim 2, wherein the distance information includes a location of the authenticated node, the method further comprising: determining, by the authenticated node, the location of the authenticated node.
  • 6. The method of claim 5, wherein the location of the authenticated node is determined using one of a manual entry, a global position system functionality, a differential navigation functionality, and a triangulation technique.
  • 7. The method as claimed in claim 1, wherein the distance information comprises a location of the authenticated node and a distance between the authenticated node and the requesting node.
  • 8. The method as claimed in claim 1, wherein the authenticated node comprises one of an access point, a wireless router, and a mobile node.
  • 9. The method as claimed in claim 1, wherein the authentication server comprises an authentication, authorization and accounting server.
  • 10. The method as claimed in claim 1, wherein the authentication server is included within a network operations center.
  • 11. The method as claimed in claim 1, wherein the requesting node comprises a mobile node.
  • 12. The method as claimed in claim 1, wherein the network access boundary is independent of a transceiver range of the authenticated node.
  • 13. The method as claimed in claim 1, further comprising prior to the authentication server receiving the request for network access: powering up the requesting node; andselecting a communication path including the authenticated node.
  • 14. The method as claimed in claim 1, further comprising when the calculated position is not within a network access boundary: sending a request for an absolute position of the requesting node from the authentication server to the authenticated node;calculating, by the authenticated node, the absolute position of the requesting node using received corresponding distance information from one or more other authenticated nodes;communicating the absolute position from the authenticated node to the authentication server; andallowing network access, by the authentication server, for the requesting node when the absolute position is within the network access boundary.
  • 15. The method as claimed in claim 14, further comprising prior to the calculating of the absolute position: requesting, by the authenticated node, the corresponding distance information from the one or more other authenticated nodes; andreceiving, by the authenticated node, the corresponding distance information from the one or more other authenticated nodes.
  • 16. A wireless communication network configured to provide restricted network access to one or more nodes, the wireless communication network comprising: at least one requesting node operating to transmit a request for network access;at least one authenticated node communicating within the wireless communication network; andan authentication server, operating to: receive the request for network access from the requesting node via at least one authenticated node;receive a distance information between the requesting node and the authenticated node from the authenticated node;calculate a position of the requesting node using the received distance information; andallow network access, by the authentication server, for the requesting node when the calculated position is within a network access boundary.
Parent Case Info

This application is a continuation of prior application Ser. No. 10/270,003, filed Oct. 15, 2002, now U.S. Pat. No. 7,042,867, which claims benefit under 35 U.S.C. §119(e) from U.S. provisional patent application Ser. No. 60/398,834 entitled “A System And Method For Determining Physical Location Of A Node In A Wireless Network During An Authentication Check Of The Node”, filed Jul. 29, 2002, the entire contents of each are incorporated herein by reference.

US Referenced Citations (138)
Number Name Date Kind
4494192 Lew et al. Jan 1985 A
4617656 Kobayashi et al. Oct 1986 A
4736371 Tejima et al. Apr 1988 A
4742357 Rackley May 1988 A
4747130 Ho May 1988 A
4910521 Mellon Mar 1990 A
5034961 Adams Jul 1991 A
5068916 Harrison et al. Nov 1991 A
5231634 Giles et al. Jul 1993 A
5233604 Ahmadi et al. Aug 1993 A
5241542 Natarajan et al. Aug 1993 A
5317566 Joshi May 1994 A
5392450 Nossen Feb 1995 A
5412654 Perkins May 1995 A
5424747 Chazelas Jun 1995 A
5502446 Denninger Mar 1996 A
5502722 Fulghum Mar 1996 A
5517491 Nanni et al. May 1996 A
5555425 Zeller et al. Sep 1996 A
5555540 Radke Sep 1996 A
5572528 Shuen Nov 1996 A
5615212 Ruszczyk et al. Mar 1997 A
5618045 Kagan et al. Apr 1997 A
5621732 Osawa Apr 1997 A
5623495 Eng et al. Apr 1997 A
5627976 McFarland et al. May 1997 A
5631897 Pacheco et al. May 1997 A
5644576 Bauchot et al. Jul 1997 A
5652751 Sharony Jul 1997 A
5680392 Semaan Oct 1997 A
5684794 Lopez et al. Nov 1997 A
5687194 Paneth et al. Nov 1997 A
5696903 Mahany Dec 1997 A
5701294 Ward et al. Dec 1997 A
5706428 Boer et al. Jan 1998 A
5717689 Ayanoglu Feb 1998 A
5745483 Nakagawa et al. Apr 1998 A
5774876 Wooley et al. Jun 1998 A
5781540 Malcolm et al. Jul 1998 A
5787080 Hulyalkar et al. Jul 1998 A
5794154 Bar-On et al. Aug 1998 A
5796732 Mazzola et al. Aug 1998 A
5796741 Saito et al. Aug 1998 A
5805593 Busche Sep 1998 A
5805842 Nagaraj et al. Sep 1998 A
5805977 Hill et al. Sep 1998 A
5809518 Lee Sep 1998 A
5822309 Ayanoglu et al. Oct 1998 A
5835857 Otten Nov 1998 A
5844905 McKay et al. Dec 1998 A
5845097 Kang et al. Dec 1998 A
5857084 Klein Jan 1999 A
5870350 Bertin et al. Feb 1999 A
5877724 Davis Mar 1999 A
5881095 Cadd Mar 1999 A
5881372 Kruys Mar 1999 A
5886992 Raatikainen et al. Mar 1999 A
5896561 Schrader et al. Apr 1999 A
5903559 Acharya et al. May 1999 A
5909651 Chander et al. Jun 1999 A
5936953 Simmons Aug 1999 A
5943322 Mayor et al. Aug 1999 A
5987011 Toh Nov 1999 A
5987033 Boer et al. Nov 1999 A
5991279 Haugli et al. Nov 1999 A
6028853 Haartsen Feb 2000 A
6029217 Arimilli et al. Feb 2000 A
6034542 Ridgeway Mar 2000 A
6034950 Sauer et al. Mar 2000 A
6044062 Brownrigg et al. Mar 2000 A
6047330 Stracke, Jr. Apr 2000 A
6052594 Chuang et al. Apr 2000 A
6052752 Kwon Apr 2000 A
6064626 Stevens May 2000 A
6067291 Kamerman et al. May 2000 A
6067297 Beach May 2000 A
6078566 Kikinis Jun 2000 A
6088337 Eastmond et al. Jul 2000 A
6104712 Robert et al. Aug 2000 A
6108738 Chambers et al. Aug 2000 A
6115580 Chuprun et al. Sep 2000 A
6122690 Nannetti et al. Sep 2000 A
6130881 Stiller et al. Oct 2000 A
6132306 Trompower Oct 2000 A
6154172 Piccionelli et al. Nov 2000 A
6163699 Naor et al. Dec 2000 A
6178337 Spartz et al. Jan 2001 B1
6192053 Angelico et al. Feb 2001 B1
6192230 Van Bokhorst et al. Feb 2001 B1
6208870 Lorello et al. Mar 2001 B1
6212390 Rune Apr 2001 B1
6222463 Rai Apr 2001 B1
6223240 Odenwald et al. Apr 2001 B1
6240294 Hamilton et al. May 2001 B1
6246875 Seaholtz et al. Jun 2001 B1
6249516 Brownrigg et al. Jun 2001 B1
6275707 Reed et al. Aug 2001 B1
6285892 Hulyalkar Sep 2001 B1
6304556 Haas Oct 2001 B1
6327300 Souissi et al. Dec 2001 B1
6349091 Li Feb 2002 B1
6349210 Li Feb 2002 B1
6359872 Mahaney et al. Mar 2002 B1
6377636 Paulraj et al. Apr 2002 B1
6404756 Whitehill et al. Jun 2002 B1
6456599 Elliott Sep 2002 B1
6505049 Dorenbosch Jan 2003 B1
6519464 Santhoff et al. Feb 2003 B1
6539232 Hendrey et al. Mar 2003 B2
6574266 Haartsen Jun 2003 B1
6618690 Syrjarinne Sep 2003 B1
6625135 Johnson et al. Sep 2003 B1
6697649 Bennett et al. Feb 2004 B1
6728545 Belcea Apr 2004 B1
6744740 Chen Jun 2004 B2
6768730 Whitehill Jul 2004 B1
6807165 Belcea Oct 2004 B2
6826385 Kujala Nov 2004 B2
7072650 Stanforth Jul 2006 B2
7171216 Choksi Jan 2007 B1
20010053699 McGrady et al. Dec 2001 A1
20020058504 Stanforth May 2002 A1
20020131386 Gwon Sep 2002 A1
20030012168 Elson et al. Jan 2003 A1
20030035437 Garahi et al. Feb 2003 A1
20030053424 Krishnamurthy et al. Mar 2003 A1
20030073406 Benjamin et al. Apr 2003 A1
20030078986 Ayres et al. Apr 2003 A1
20030091010 Garahi et al. May 2003 A1
20030118015 Gunnarsson et al. Jun 2003 A1
20030156558 Cromer et al. Aug 2003 A1
20030177219 Taib et al. Sep 2003 A1
20030232620 Runkle et al. Dec 2003 A1
20030233580 Keeler et al. Dec 2003 A1
20030235175 Naghian et al. Dec 2003 A1
20040203380 Hamdi et al. Oct 2004 A1
20050268330 Di Rienzo Dec 2005 A1
20100262364 Ikeda Oct 2010 A1
Foreign Referenced Citations (17)
Number Date Country
2132180 Mar 1996 CA
9837722 Aug 1998 WO
9955102 Oct 1999 WO
0034932 Jun 2000 WO
0062574 Oct 2000 WO
0110154 Feb 2001 WO
0127649 Apr 2001 WO
0133770 May 2001 WO
0135567 May 2001 WO
0137481 May 2001 WO
0137482 May 2001 WO
0137483 May 2001 WO
0141036 Jun 2001 WO
0141468 Jun 2001 WO
0239710 May 2002 WO
0249379 Jun 2002 WO
2004002113 Dec 2003 WO
Related Publications (1)
Number Date Country
20060153075 A1 Jul 2006 US
Provisional Applications (1)
Number Date Country
60398834 Jul 2002 US
Continuations (1)
Number Date Country
Parent 10270003 Oct 2002 US
Child 11343550 US