US 7,529,925 B2Grant
System and method for distributing keys in a wireless network
Issue Date:2009-05-05
•11 Claims
•10 Drawing Sheets
Abstract
A technique for improving authentication speed when a client roams from a first authentication domain to a second authentication domain involves coupling authenticators associated with the first and second authentication domains to an authentication server. A system according to the technique may include, for example, a first authenticator using an encryption key to ensure secure network communication, a second authenticator using the same encryption key to ensure secure network communication, and a server coupled to the first authenticator and the second authenticator wherein the server distributes, to the first authenticator and the second authenticator, information to extract the encryption key from messages that a client sends to the first authenticator and the second authenticator.
Metadata
Assignee
- Trapeze Networks, Inc.
Inventor
- Dan Harkins
Application Information
Application Number:US 11/377,859
Filing Date:2006-03-15
Priority Date:2005-03-15
Art Unit:2434
Classifications
IPC:
H04L9/00H04L9/08H04L9/32
Patent Drawings (10 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims the benefit of U.S. Patent Application No. 60/661,831, filed Mar. 15, 2005, which is incorporated by reference.
Background
[0002] Consumer demand for wireless local area network (WLAN) products (e.g. smart phones) grew rapidly in the recent past as the cost of WLAN chipsets and software fell while efficiencies rose. Along with the popularity, however, came inevitable and necessary security concerns.
[0003] The Institute of Electrical and Electronics Engineers (IEEE) initially attempted to address wireless security issues through the Wired Equivalent Privacy (WEP) standard. Unfortunately, the WEP standard quickly proved inadequate at providing the privacy it advertised and the IEEE developed the 802.11i specification in response. 802.11i provides a framework in which only trusted users are allowed to access WLAN network resources. RFC 2284, setting out an in-depth discussion of Point-to-Point Protocol Extensible Authentication Protocol (PPP EAP) by Merit Network, Inc (available at http://rfc.net/rfc2284.html as of Mar. 9, 2006), is one example of the 802.11i network authentication process and is incorporated by reference.
[0004] A typical wireless network based on the 802.11i specification comprises a supplicant common known as a client (e.g. a laptop computer), a number of wireless access points (AP), and an authentication server. In some implementations, the APs also act as authenticators that keep the WLAN closed to all unauthenticated traffic. To access the WLAN securely, an encryption key known as the Pairwise Master Key (PMK) must first be established between the client and an AP. The client and the AP then exchange a sequence of four messages known as the “four-way handshake.” The four-way handshake produces encryption keys unique to the client that are subsequently used to perform bulk data protection (e.g. message source authentication, message integrity assurance, message confidentiality, etc.).
[0005] A handoff occurs when the client roams from one AP to another. Prior to 802.11i, it was necessary for the client to re-authenticate itself each time it associates with an AP. This renegotiation results in significant latencies and may prove fatal for real-time exchanges such as voice data transfer.
Brief Description of the Drawings
[0006] Embodiments of the present invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the present invention.
[0007] FIG. 1 is a block diagram illustrating an example of a WLAN system.
[0008] FIG. 2 is a block diagram illustrating an example of a WLAN system including one or more authenticators.
[0009] FIG. 3 is a block diagram illustrating an example of a WLAN system including one or more authentication domains.
[0010] FIG. 4 depicts a flowchart of an example of a method for secure network communication.
[0011] FIG. 5 depicts a flowchart of another example of a method for secure network communication.
[0012] FIG. 6 depicts a flowchart of a method to obtain an encryption key for secure network communication.
[0013] The foregoing examples of the related art and limitations related therewith are intended to be illustrative and not exclusive. Other limitations of the related art will become apparent to those of skill in the art upon a reading of the specification and a study of the drawings.
Detailed Description
[0014] In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without one or more of these specific details or in combination with other components or process steps. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
[0015] FIG. 1 is a block diagram illustrating an example of a Wireless Local Area Network (WLAN) system 100. In the example of FIG. 1 , the WLAN system 100 includes an authentication server 102, switches 104-1 to 104-N (referred to collectively hereinafter as switches 104), Access Points (APs) 106-1 to 106-N (referred to collectively hereinafter as APs 106), and clients 108-1 to 108-N (referred to collectively hereinafter as clients 108).
[0016] In the example of FIG. 1 , the authentication server 102 may be any computer system that facilitates authentication of a client in a manner described later with reference to FIGS. 4-6 . The authentication server 102 may be coupled to one or more of the switches 104 through, for example, a wired network, a wireless network, or a network such as the Internet. The term “Internet” as used herein refers to a network of networks which uses certain protocols, such as the TCP/IP protocol, and possibly other protocols such as the hypertext transfer protocol (HTTP) for hypertext markup language (HTML) documents that make up the World Wide Web (the web). The physical connections of the Internet and the protocols and communication procedures of the Internet are well known to those of skill in the art. In an alternative embodiment, the authentication server 102 may reside on one of the switches 104 (or, equivalently, one of the switches 104 may reside on the authentication server).
[0017] In the example of FIG. 1 , the switches 104 may be any computer system that serves as an intermediary between a subset of the APs 106 and the server 102. In an alternative, the APs may include the functionality of the switches 104, obviating the need for the switches 104.
[0018] In the example of FIG. 1 , the APs 106 typically include a communication port for communicating with one or more of the clients 108. The communication port for communicating with the clients 108 typically includes a radio. In an embodiment, at least some of the clients 108 are wireless clients. Accordingly, APs 108 may be referred to in the alternative as “wireless access points” since the APs 106 provide wireless access for the clients 108 to a network, such as a Local Area Network (LAN) or Virtual LAN (VLAN). The APs 106 may be coupled to the network through network interfaces, which can be Ethernet network or other network interfaces. The network may also be coupled to a gateway computer system (not shown) that can provide firewall and other Internet-related services for the network. This gateway computer system may be coupled to an Internet Service Provider (ISP) to provide Internet connectivity to the clients 108. The gateway computer system can be a conventional server computer system.
[0019] In the example of FIG. 1 , the clients 108 may include any wireless device. It should be noted that clients may or not be wireless, but for illustrative purposes only, the clients 108 are assumed to include wireless devices, such as by way of example but not limitation, cell phones, PDAs, laptops, notebook computers, or any other device that makes use of 802.11 or other wireless standards. When the clients 108 are authenticated, they can communicate with the network. For illustrative purposes, clients 108 are coupled to the APs 106 by lines 110, which represent a secure connection.
[0020] In the example of FIG. 1 , in operation, to communicate through data traffic in the WLAN system 100, the clients 108 typically initiate a request to access the network. An authenticator (not shown) logically stands between the clients 108 and the network to authenticate the client's identity and ensure secure communication. The authenticator may reside in any convenient location on the network, such as on one, some, or all of the APs 106, on one, some, or all of the switches 104, or at some other location. Within the 802.11i context, the authenticator ensures secure communication by encryption schemes including the distribution of encryption keys. For example, the authenticator may distribute the encryption keys using existing encryption protocols such as, by way of example but not limitation, the Otway-Rees and the Wide-Mouth Frog protocols. The authenticator may distribute the encryption keys in a known or convenient manner, as described later with reference to FIGS. 4-6 .
[0021] In the example of FIG. 1 , a client may transition from one authenticator to another and establish secure communication via a second authenticator. The change from one authenticator to another is illustrated in FIG. 1 as a dotted line 112 connecting the client 108-N to the AP 106-N. In a non-limiting embodiment, the secure communication via the second authenticator may be accomplished with one encryption key as long as both the first and second authenticators are coupled to the same authentication server 102. In alternative embodiments, this may or may not be the case.
[0022] FIG. 2 is a block diagram illustrating an example of a WLAN system 200 including one or more authenticators. In the example of FIG. 2 , the WLAN system 200 includes authenticators 204-1 to 204-N (referred to hereinafter as the authenticators 204), and a client 208. As was previously indicated with reference to FIG. 1 , the authenticators 204 may reside on APs (see, e.g., FIG. 1 ), switches (see, e.g., FIG. 1 ) or at some other location in a network.
[0023] In the example of FIG. 2 , in a non-limiting embodiment, the client 208 scans different channels for an access point with which to associate in order to access the network. In an alternative embodiment, scanning may or may not be necessary to detect an access point. For example, the client 208 may know of an appropriate access point, obviating the need to scan for one. The access point may or may not have a minimum set of requirements, such as level of security or Quality of Service (QoS). In the example of FIG. 2 , the client 208 determines that access point meets the required level of service and thereafter sends an association request. In an embodiment, the access request includes information such as client ID and cryptographic data. The request may be made in the form of a data packet. In another embodiment, the client 208 may generate and later send information including cryptographic data when that data is requested.
[0024] In the example of FIG. 2 , the authenticator 204-1 authenticates the client 208. By way of example but not limitation, the authenticator 204-1 may first obtain a session encryption key (SEK) in order to authenticate the client 208. In one implementation, the authenticator requests the SEK and relies on an existing protocol (e.g. 802.1X) to generate a PMK as the SEK. In an alternative implementation, the SEK is pre-configured by mapping a preset value (e.g. user password) into a SEK. In the event that a preset value is used, convenient or well-known methods such as periodically resetting the value, or remapping the value with randomly generated numbers, may be employed to ensure security. In this example, once the authenticator 204-1 obtains the SEK, it proceeds to a four-way handshake whereby a new set of session keys are established for data transactions originating from client 208. Typically, the client 208 need not be authenticated again while it communicates via the authenticator 204-1. In the example of FIG. 2 , the connection between the client 208 and the server 204-1 is represented by the line 210.
[0025] In the example of FIG. 2 , the client 208 roams from the authenticator 204-1 to the authenticator 204-N. The connection process is represented by the arrows 212 to 216. In an embodiment, when the client 208 roams, the server 202 verifies the identity of the (new) authenticator 204-N and the client 208. When roaming, the client 208 sends a cryptographic message to authenticator 204-N including the identity of the client 208 (IDc); the identity of the server 202 (IDs); a first payload including the identity of the authenticator 204-N (IDa) and a randomly generated key (k) encrypted by a key that client 208 and the server 202 share (eskey); and a second payload including the SEK encrypted by the random key k. This cryptographic message is represented in FIG. 2 as arrow 212. In an alternative embodiment, the client 208 sends the cryptographic message along with its initial association request.
[0026] In the example of FIG. 2 , in an embodiment, once authenticator 204-N receives the cryptographic message, it keeps a copy of the encrypted SEK, identifies the server 202 by the IDs, and sends a message to the server 202 including the identity of the client IDc and the first payload from the original cryptographic message having the identity of the authenticator IDa and the random key k encrypted by the share key eskey.
[0027] In the example of FIG. 2 , when the server 202 receives the message from authenticator 204-N, it looks up the shared key eskey based on the identity of the client IDc and decrypts the message using the eskey. The server 202 then verifies that a trusted entity known by IDa exists and, if so, constructs another message consisting of the random key k encrypted with a key the server 202 shares with authenticator 204-N (askey) and sends that message to the authenticator 204-N. However, if the server 202 can not verify the authenticator 204-N according to IDa, the process ends and client 201 cannot access the network through the authenticator 204-N. In the event that the authenticator 204-N cannot be verified the client may attempt to access the network via another authenticator after a preset waiting period elapses.
[0028] Upon receipt of the message from the server 202, the authenticator 204-N decrypts the random key k using the shared key askey and uses k to decrypt the encryption key SEK. Having obtained the encryption key SEK, the authenticator 204-N may then proceed with a four-way handshake, which is represented in FIG. 2 for illustrative purposes as arrows 214 and 216, and allow secure data traffic between the client 208 and the network.
[0029] Advantageously, the authentication system illustrated in FIG. 2 enables a client 208 to roam efficiently from authenticator to authenticator by allowing the client 208 to keep the same encryption key SEK when transitioning between authenticators coupled to the same server 202. For example, the client 208 can move the SEK securely between authenticators by using a trusted third party (e.g. the server 202) that negotiates the distribution of the SEK without storing the SEK itself.
[0030] FIG. 3 is a block diagram illustrating an example of a WLAN system 300 including one or more authentication domains. In the example of FIG. 3 , the WLAN system 300 includes a server 302, authentication domains 304-1 to 304-N (referred to hereinafter as authentication domains 304), and a network 306. The server 302 and the network 306 are similar to those described previously with reference to FIGS. 1 and 2 . The authentication domains 304 include any WLANs, including virtual LANs, that are associated with individual authenticators similar to those described with reference to FIGS. 1 and 2 .
[0031] The scope and boundary of the authentication domains 304 may be determined according to parameters such as geographic locations, load balancing requirements, etc. For illustrative purposes, the client 308 is depicted as roaming from the authentication domain 304-1 to the authentication domain 304-N. This may be accomplished by any known or convenient means, such as that described with reference to FIGS. 1 and 2 .
[0032] FIGS. 4 to 6 , which follow, serve only to illustrate by way of example. The modules are interchangeable in order and fewer or more modules may be used to promote additional features such as security or efficiency. For example, in an alternative embodiment, a client may increase security by generating and distributing a unique random key to each authenticator. In another alternative embodiment of the present invention, the authenticator employs a known or convenient encryption protocol (e.g. Otway-Rees, Wide-Mouth Frog, etc.) to obtain the encryption key.
[0033] FIG. 4 depicts a flowchart of an example of a method for secure network communication. In the example of FIG. 4 , the flowchart starts at module 401 where a client sends an association request to an access point. The flowchart continues at decision point 403 where it is determined whether a preconfigured encryption key is used. If it is determined that a preconfigured encryption key is not to be used (403-NO), then the flowchart continues at module 405 with requesting an encryption key and at decision point 407 with waiting for the encryption key to be received.
[0034] In the example of FIG. 4 , if a preconfigured encryption key is provided at module 403, or an encryption key has been received (407-YES), then the flowchart continues at module 409 with a four-way handshake. The flowchart then continues at module 411 where data traffic commences, and the flowchart continues to decision point 413 where it is determined whether the client is ready to transition to a new authentication domain.
[0035] In the example of FIG. 4 , if it is determined that a client is ready to transition to a new authentication domain (413-YES), then the flowchart continues at module 415 when the client sends a cryptographic message to the new authenticator. In an alternative embodiment, the client sends the cryptographic message along with its initial association request and skips module 415.
[0036] The flowchart continues at module 417, where once the new authenticator receives the cryptographic message, the new authenticator sends a message to the server. If at decision point 419 the authenticator is not verified, the flowchart ends. Otherwise, the server sends a message to the authenticator at module 421. The flowchart continues at module 423 where the authenticator obtains an encryption key, at module 424 where the client and the authenticator enter a four-way handshake, and at module 427 where data traffic commences.
[0037] FIG. 5 depicts a flowchart of another example of a method for secure network communication. In the example of FIG. 5 , the flowchart begins at module 501 where a client makes an association request. The flowchart continues at decision point 503, where it is determined whether a preconfigured encryption key is available. If it is determined that a preconfigured encryption key is not available (503-NO) then the flowchart continues at module 505, where an encryption key is requested, and at decision point 507 where it is determined whether an encryption key is received. If it is determined that an encryption is not received (507-NO), the flowchart continues from module 505. If, on the other hand, it is determined that an encryption key is received (507-YES), or if a preconfigured encryption key is available (503-YES), then the flowchart continues at module 509 with a four-way handshake. In the example of FIG. 5 , the flowchart continues at module 511, where data traffic commences, and at decision point 513, where it is determined whether a client is ready to transition. If it is determined that a client is not ready to transition (513-NO), then the flowchart continues at module 511 and at decision point 513 until the client is ready to transition (513-YES). The flowchart continues at module 515, where an authenticator obtains an encryption key using an established cryptographic protocol. The flowchart continues at module 517 with a four-way handshake, and at module 519 where data traffic commences.
[0038] FIG. 6 depicts a flowchart of a method to obtain an encryption key for secure network communication. In one embodiment, a client transitions from a first authenticator to a second authenticator, both of which coupled to the same server, and establishes secure communication with the first and the second authenticator using one encryption key.
[0039] At module 601, a client generates a first key. In one embodiment, the first key is randomly generated. In an alternative embodiment, the first key is generated according to a preset value such as by requesting a value (e.g. password) from a user. In yet another alternative embodiment, the first key is a constant value such as a combination of the current date, time, etc.
[0040] At module 603, the client obtains a second key. In one implementation, the generation of the second key relies on an existing protocol (e.g. 802.1X). In an alternative implementation, the second key is pre-configured (e.g. user password). In yet another alternative implementation, the second key is a combination of a pre-configured value and a randomly generated value.
[0041] At module 605, the client constructs a first message using the first key and the second key. In one embodiment, the message is a data packet comprising cryptographic data using the first and the second key. Furthermore, in one embodiment, the first message comprises the second key encrypted with the first key.
[0042] At module 607, the client sends the first message to an authenticator. In one embodiment, the authenticator is a second authenticator from which the client transitions from a first authenticator.
[0043] At module 609, the authenticator constructs a second message using data from the first message. In one implementation, the authenticator constructs the second message comprising the client's identity, and an encrypted portion having identity of the authenticator and the first key.
[0044] At module 611, the authenticator sends the second message to a server with which the authenticator is coupled. At module 613, the server decrypts an encrypted portion of the second message. In one implementation, the encrypted portion of the second message comprises the identity of the authenticator and the first key.
[0045] Subsequently at module 615, the server verifies the authenticator with the decrypted identity information extracted from the second message. If the server cannot verify the authenticator according to the identification information, as shown at decision point 617, the client cannot communicate through the authenticator. If, on the other hand, the server verifies the authenticator, the server constructs a third message with the first key that it extracted from the second message at module 619. In one implementation, the third message comprises the first key encrypted with a third key that the server shares with the authenticator. The server then sends the third message to the authenticator at module 621.
[0046] After receiving the third message, the authenticator extracts the first key from the message at module 623. In one implementation, the authenticator extracts the first key using a third key it shares with the server. With the first key, the authenticator then decrypts the cryptographic data in the first message and extracts the second key at module 625. Having obtained the second key, the authenticator establishes secure data traffic/communication with the client using the second key. In one embodiment, the authenticator is a second authenticator to which the client transitions from a first authenticator coupled to the server, and the client communicates securely with both the first and the second authenticator using the second key.
[0047] As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation. It may be noted that, in an embodiment, timestamps can be observed to measure roaming time.
[0048] It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present invention. It is intended that all permutations, enhancements, equivalents, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present invention. It is therefore intended that the following appended claims include all such modifications, permutations and equivalents as fall within the true spirit and scope of the present invention.
Claims
What is claimed is:
1. A system comprising:
a first authenticator using an encryption key to ensure secure network communication;
a second authenticator using the encryption key to ensure secure network communication; and
a server coupled to the first authenticator and the second authenticator wherein the server distributes, to the first authenticator and the second authenticator, information to extract the encryption key from messages that a client sends to the first authenticator and the second authenticator;
a client-generated first key that the client uses to encrypt the encryption key when the client sends a first message to the first authenticator, wherein the first message is sent before the messages sent by the client; and
a second key that the server and the client share, wherein the server uses the second key to decrypt and extract the portion of the first message comprising the first key and the identity of the first authenticator, wherein the portion of the first message comprising the first key and the identity of the first authenticator is encrypted with both the first key and the second key.
2. The system of claim 1, wherein the client maintains the encryption key that allows the client to communicate securely with authenticators coupled to the server.
3. The system of claim 1, wherein the first authenticator is implemented in a network switch or an access point.
4. The system of claim 1, wherein the second authenticator is implemented in a network switch or an access point.
5. A system comprising:
a first authentication domain using an encryption key to ensure secure network communication;
a second authentication domain using the encryption key to ensure secure network communication; and
a server coupled to the first authentication domain and the second authentication domain wherein the server acts as a trusted third party for a client that transitions from the first authentication domain to the second authentication domain;
a client-generated first key that the client uses to encrypt the encryption key when the client sends a first message to the first authenticator, wherein the first authenticator forwards the first message to the server;
second key that the server and the client share, wherein the server uses the second key to extract the portion of the first message comprising the first key and the identity of the first authenticator;
a third key that the server and the first authenticator share, wherein the server uses the third key to encrypt the first key and sends the first key encrypted with the third key to the first authenticator, and wherein the first authenticator uses the third key to extract the first key which the first authenticator uses to extract the encryption key in order to establish secure communication with the client;
a client-generated fourth key that the client uses to encrypt the encryption key when the client sends a second message to the second authenticator, wherein the second authenticator forwards the second message to the server;
a fifth key that the server and the client share, wherein the server uses the fifth key to extract the portion of the second message comprising the fourth key and the identity of the second authenticator;
a sixth key that the server and the second authenticator share, wherein the server uses the sixth key to encrypt the fourth key and sends the fourth key encrypted with the sixth key to the second authenticator, and wherein the second authenticator uses the sixth key to extract the fourth key which the second authenticator uses to extract the encryption key in order to establish secure communication with the client.
6. The system of claim 5, wherein the first authentication domain comprises a first authenticator coupled to the server and the second authentication domain comprises a second authenticator coupled to the server.
7. The system of claim 5, wherein the first authentication domain comprises a first authenticator coupled to the server and the second authentication domain comprises a second authenticator coupled to the server, and the client maintains an encryption key that allows the client to communicate securely in authentication domains having authenticators coupled to the server.
8. A system comprising:
a first authenticator using an encryption key to ensure secure network communication;
a second authenticator using the encryption key to ensure secure network communication; and
a server coupled to the first authenticator and the second authenticator wherein the server distributes, to the first authenticator and the second authenticator, information to extract the encryption key from messages that a client sends to the first authenticator and the second authenticator;
a client-generated first key that the client uses to encrypt the encryption key when the client sends a first message to the first authenticator, wherein the first authenticator forwards the first message to the server;
a second key that the server and the client share, wherein the server uses the second key to extract the portion of the first message comprising the first key and the identity of the first authenticator;
a third key that the server and the first authenticator share, wherein the server uses the third key to encrypt the first key and sends the first key encrypted with the third key to the first authenticator, and wherein the first authenticator uses the third key to extract the first key which the first authenticator uses to extract the encryption key in order to establish secure communication with the client;
a client-generated fourth key that the client uses to encrypt the encryption key when the client sends a second message to the second authenticator, wherein the second authenticator forwards the second message to the server;
a fifth key that the server and the client share, wherein the server uses the fifth key to extract the portion of the second message comprising the fourth key and the identity of the second authenticator; and
a sixth key that the server and the second authenticator share, wherein the server uses the sixth key to encrypt the fourth key and sends the fourth key encrypted with the sixth key to the second authenticator, and wherein the second authenticator uses the sixth key to extract the fourth key which the second authenticator uses to extract the encryption key in order to establish secure communication with the client.
9. The system of claim 8, wherein the client maintains the encryption key that allows the client to communicate securely with authenticators coupled to the server.
10. The system of claim 8, wherein the first authenticator is implemented in a network switch or an access point.
11. The system of claim 8, wherein the second authenticator is implemented in a network switch or an access point.
Patent Citations (169)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3641433(A) | 1972-02-01 | Mifflin et al. | Applicant |
| US4168400(A) | 1979-09-01 | De Couasnon et al. | Applicant |
| US4176316(A) | 1979-11-01 | DeRoas et al. | Applicant |
| US4247908(A) | 1981-01-01 | Lockhart et al. | Applicant |
| US4291401(A) | 1981-09-01 | Bachmann | Applicant |
| US4291409(A) | 1981-09-01 | Weinberg et al. | Applicant |
| US4409470(A) | 1983-10-01 | Shepard et al. | Applicant |
| US4460120(A) | 1984-07-01 | Shepard et al. | Applicant |
| US4475208(A) | 1984-10-01 | Ricketts | Applicant |
| US4494238(A) | 1985-01-01 | Groth, Jr. | Applicant |
| US4500987(A) | 1985-02-01 | Hasegawa | Applicant |
| US4503533(A) | 1985-03-01 | Tobagi et al. | Applicant |
| US4550414(A) | 1985-10-01 | Guinon et al. | Applicant |
| US4562415(A) | 1985-12-01 | McBiles | Applicant |
| US4630264(A) | 1986-12-01 | Wah | Applicant |
| US4635221(A) | 1987-01-01 | Kerr | Applicant |
| US4639914(A) | 1987-01-01 | Winters | Applicant |
| US4644523(A) | 1987-02-01 | Horwitz | Applicant |
| US4672658(A) | 1987-06-01 | Kavehrad | Applicant |
| US4673805(A) | 1987-06-01 | Shepard et al. | Applicant |
| US4707839(A) | 1987-11-01 | Andren et al. | Applicant |
| US4730340(A) | 1988-03-01 | Frazier | Applicant |
| US4736095(A) | 1988-04-01 | Shepard et al. | Applicant |
| US4740792(A) | 1988-04-01 | Sagey et al. | Applicant |
| US4758717(A) | 1988-07-01 | Shepard et al. | Applicant |
| US4760586(A) | 1988-07-01 | Takeda | Applicant |
| US4789983(A) | 1988-12-01 | Acampora et al. | Applicant |
| US4829540(A) | 1989-05-01 | Waggener et al. | Applicant |
| US4850009(A) | 1989-07-01 | Zook et al. | Applicant |
| US4872182(A) | 1989-10-01 | McRae et al. | Applicant |
| US4894842(A) | 1990-01-01 | Brockhoven et al. | Applicant |
| US4901307(A) | 1990-02-01 | Gilhousen et al. | Applicant |
| US4933952(A) | 1990-06-01 | Albrieux et al. | Applicant |
| US4933953(A) | 1990-06-01 | Yagi | Applicant |
| US4995053(A) | 1991-02-01 | Simpson et al. | Applicant |
| US5008899(A) | 1991-04-01 | Yamamoto | Applicant |
| US5029183(A) | 1991-07-01 | Tymes | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5103461(A) | 1992-04-01 | Tymes | Applicant |
| US5109390(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5142550(A) | 1992-08-01 | Tymes | Applicant |
| US5151919(A) | 1992-09-01 | Dent | Applicant |
| US5157687(A) | 1992-10-01 | Tymes | Applicant |
| US5187575(A) | 1993-02-01 | Dent et al. | Applicant |
| US5231633(A) | 1993-07-01 | Hluchyj et al. | Applicant |
| US5280498(A) | 1994-01-01 | Tymes et al. | Applicant |
| US5285494(A) | 1994-02-01 | Sprecher et al. | Applicant |
| US5329531(A) | 1994-07-01 | Diepstraten | Applicant |
| US5418812(A) | 1995-05-01 | Reyes et al. | Applicant |
| US5448569(A) | 1995-09-01 | Huang et al. | Applicant |
| US5450615(A) | 1995-09-01 | Fortune et al. | Applicant |
| US5465401(A) | 1995-11-01 | Thompson | Applicant |
| US5479441(A) | 1995-12-01 | Tymes et al. | Applicant |
| US5483676(A) | 1996-01-01 | Mahany et al. | Applicant |
| US5491644(A) | 1996-02-01 | Pickering et al. | Applicant |
| US5517495(A) | 1996-05-01 | Lund | Applicant |
| US5519762(A) | 1996-05-01 | Bartlett | Applicant |
| US5528621(A) | 1996-06-01 | Heiman et al. | Applicant |
| US5561841(A) | 1996-10-01 | Markus | Applicant |
| US5568513(A) | 1996-10-01 | Croft et al. | Applicant |
| US5584048(A) | 1996-12-01 | Wieczorek | Applicant |
| US5598532(A) | 1997-01-01 | Liron | Applicant |
| US5630207(A) | 1997-05-01 | Gitlin et al. | Applicant |
| US5640414(A) | 1997-06-01 | Blakeney et al. | Applicant |
| US5649289(A) | 1997-07-01 | Wang et al. | Applicant |
| US5668803(A) | 1997-09-01 | Tymes et al. | Applicant |
| US5793303(A) | 1998-08-01 | Koga | Applicant |
| US5794128(A) | 1998-08-01 | Brockel et al. | Applicant |
| US5812589(A) | 1998-09-01 | Sealander et al. | Applicant |
| US5815811(A) | 1998-09-01 | Pinard et al. | Applicant |
| US5828960(A) | 1998-10-01 | Tang et al. | Applicant |
| US5838907(A) | 1998-11-01 | Hansen | Applicant |
| US5844900(A) | 1998-12-01 | Hong et al. | Applicant |
| US5872968(A) | 1999-02-01 | Knox et al. | Applicant |
| US5875179(A) | 1999-02-01 | Tikalsky | Applicant |
| US5896561(A) | 1999-04-01 | Schrader et al. | Applicant |
| US5915214(A) | 1999-06-01 | Reece et al. | Applicant |
| US5920821(A) | 1999-07-01 | Seazholtz et al. | Applicant |
| US5933607(A) | 1999-08-01 | Tate et al. | Applicant |
| US5949988(A) | 1999-09-01 | Feisullin et al. | Applicant |
| US5953669(A) | 1999-09-01 | Stratis et al. | Applicant |
| US5960335(A) | 1999-09-01 | Umemoto et al. | Applicant |
| US5982779(A) | 1999-11-01 | Krishnakumar et al. | Applicant |
| US5987062(A) | 1999-11-01 | Engwer et al. | Applicant |
| US5987328(A) | 1999-11-01 | Ephremides et al. | Applicant |
| US6005853(A) | 1999-12-01 | Wang et al. | Applicant |
| US6011784(A) | 2000-01-01 | Brown | Applicant |
| US6078568(A) | 2000-06-01 | Wright | Applicant |
| US6088591(A) | 2000-07-01 | Trompower | Applicant |
| US6119009(A) | 2000-09-01 | Baranger et al. | Applicant |
| US6160804(A) | 2000-12-01 | Ahmed et al. | Applicant |
| US6188649(B1) | 2001-02-01 | Fine et al. | Applicant |
| US6199032(B1) | 2001-03-01 | Anderson | Applicant |
| US6208629(B1) | 2001-03-01 | Jaszewski et al. | Applicant |
| US6208841(B1) | 2001-03-01 | Wallace et al. | Applicant |
| US6218930(B1) | 2001-04-01 | Katzenberg et al. | Applicant |
| US6240078(B1) | 2001-05-01 | Kuhnel et al. | Applicant |
| US6240083(B1) | 2001-05-01 | Wright | Applicant |
| US6256300(B1) | 2001-07-01 | Ahmed et al. | Applicant |
| US6256334(B1) | 2001-07-01 | Adachi | Applicant |
| US6285662(B1) | 2001-09-01 | Watanabe | Applicant |
| US6317599(B1) | 2001-11-01 | Rappaport et al. | Applicant |
| US6336035(B1) | 2002-01-01 | Somoza et al. | Applicant |
| US6336152(B1) | 2002-01-01 | Richman et al. | Applicant |
| US6347091(B1) | 2002-02-01 | Wallentin et al. | Applicant |
| US6356758(B1) | 2002-03-01 | Almeida et al. | Applicant |
| US6393290(B1) | 2002-05-01 | Ulfongene | Applicant |
| US6404772(B1) | 2002-06-01 | Beach et al. | Applicant |
| US6473449(B1) | 2002-10-01 | Cafarella et al. | Applicant |
| US6493679(B1) | 2002-12-01 | Rappaport et al. | Applicant |
| US6496290(B1) | 2002-12-01 | Lee | Applicant |
| US6512916(B1) | 2003-01-01 | Forbes, Jr. | Applicant |
| US6580700(B1) | 2003-06-01 | Pinard et al. | Applicant |
| US6587680(B1) | 2003-07-01 | Ala-Laurila et al. | Examiner |
| US6614787(B1) | 2003-09-01 | Jain et al. | Applicant |
| US6625454(B1) | 2003-09-01 | Rappaport et al. | Applicant |
| US6631267(B1) | 2003-10-01 | Clarkson et al. | Applicant |
| US6659947(B1) | 2003-12-01 | Carter et al. | Applicant |
| US6687498(B2) | 2004-02-01 | McKenna et al. | Applicant |
| US6725260(B1) | 2004-04-01 | Philyaw | Applicant |
| US6747961(B1) | 2004-06-01 | Ahmed et al. | Applicant |
| US6839338(B1) | 2005-01-01 | Amara et al. | Examiner |
| US6879812(B2) | 2005-04-01 | Agrawal et al. | Applicant |
| US6973622(B1) | 2005-12-01 | Rappaport et al. | Applicant |
| US6978301(B2) | 2005-12-01 | Tindal | Applicant |
| US7020773(B1) | 2006-03-01 | Otway et al. | Examiner |
| US7110756(B2) | 2006-09-01 | Diener | Applicant |
| US2002/0052205(A1) | 2002-05-01 | Belostotsky et al. | Applicant |
| US2002/0068278(A1) | 2002-06-01 | Forslow | Applicant |
| US2002/0095486(A1) | 2002-07-01 | Bahl | Applicant |
| US2002/0101868(A1) | 2002-08-01 | Clear et al. | Applicant |
| US2002/0191572(A1) | 2002-12-01 | Weinstein et al. | Applicant |
| US2003/0014646(A1) | 2003-01-01 | Buddhikot et al. | Examiner |
| US2003/0018889(A1) | 2003-01-01 | Burnett et al. | Applicant |
| US2003/0107590(A1) | 2003-06-01 | Levillain et al. | Applicant |
| US2003/0174706(A1) | 2003-09-01 | Shankar et al. | Applicant |
| US2004/0025044(A1) | 2004-02-01 | Day | Applicant |
| US2004/0047320(A1) | 2004-03-01 | Eglin | Applicant |
| US2004/0064560(A1) | 2004-04-01 | Zhang et al. | Applicant |
| US2004/0095914(A1) | 2004-05-01 | Katsube et al. | Applicant |
| US2004/0095932(A1) | 2004-05-01 | Astarabadi et al. | Applicant |
| US2004/0143428(A1) | 2004-07-01 | Rappaport et al. | Applicant |
| US2004/0120370(A1) | 2004-11-01 | Tzamaloukas | Applicant |
| US2004/0230370(A1) | 2004-11-01 | Tzamaloukas | Applicant |
| US2004/0259555(A1) | 2004-12-01 | Rappaport et al. | Applicant |
| US2005/0030929(A1) | 2005-02-01 | Swier et al. | Applicant |
| US2005/0058132(A1) | 2005-03-01 | Okano et al. | Applicant |
| US2005/0059405(A1) | 2005-03-01 | Thomson et al. | Applicant |
| US2005/0059406(A1) | 2005-03-01 | Thomson et al. | Applicant |
| US2005/0064873(A1) | 2005-03-01 | Karaoguz et al. | Applicant |
| US2005/0068925(A1) | 2005-03-01 | Palm et al. | Applicant |
| US2005/0073980(A1) | 2005-04-01 | Thomson et al. | Applicant |
| US2005/0128989(A1) | 2005-06-01 | Bhagwat et al. | Applicant |
| US2005/0157730(A1) | 2005-07-01 | Grant et al. | Applicant |
| US2005/0180358(A1) | 2005-08-01 | Kolar et al. | Applicant |
| US2005/0181805(A1) | 2005-08-01 | Gallagher | Applicant |
| US2005/0193103(A1) | 2005-09-01 | Drabik | Applicant |
| US2005/0223111(A1) | 2005-10-01 | Bhandaru et al. | Applicant |
| US2005/0240665(A1) | 2005-10-01 | Gu et al. | Applicant |
| US2005/0259597(A1) | 2005-11-01 | Benedetotto et al. | Applicant |
| US2005/0273442(A1) | 2005-12-01 | Bennett | Applicant |
| US2005/0276218(A1) | 2005-12-01 | Ooghe et al. | Applicant |
| US2006/0045050(A1) | 2006-03-01 | Floros et al. | Applicant |
| US2006/0200862(A1) | 2006-09-01 | Olson et al. | Applicant |
| WO94/03986 | 1994-02-01 | Applicant | |
| WO99/11003 | 1999-03-01 | Applicant | |
| WO3/085544(A1) | 2003-10-01 | Applicant | |
| WO2004/095192(A2) | 2004-11-01 | Applicant | |
| WO2004/095800(A1) | 2004-11-01 | Applicant |
Non-Patent Literature (47)
- U.S. Appl. No. 11/326,966, filed Jan. 5, 2006, Taylor.Applicant
- U.S. Appl. No. 11/330,877, filed Jan. 11, 2006, Matta.Applicant
- U.S. Appl. No. 11/331,789, filed Jan. 14, 2006, Matta et al.Applicant
- U.S. Appl. No. 11/351,104, filed Feb. 8, 2006, Tiwari.Applicant
- U.S. Appl. No. 11/400,165, filed Apr. 5, 2006, Tiwari.Applicant
- U.S. Appl. No. 11/445,750, filed May 3, 2006, Matta.Applicant
- U.S. Appl. No. 11/417,830, filed May 30, 2006, Morain.Applicant
- U.S. Appl. No. 11/417,993, filed May 3, 2006, Jar et al.Applicant
- U.S. Appl. No. 11/437,537, filed May 19, 2006, Freund et al.Applicant
- U.S. Appl. No. 11/437,538, filed May 19, 2006, Zeldin.Applicant
- U.S. Appl. No. 11/437,387, filed May 19, 2006, Zeldin et al.Applicant
- U.S. Appl. No. 11/437,582, filed May 19, 2006, Bugwadia et al.Applicant
- U.S. Appl. No. 11/451,704, filed Jun. 12, 2006, Riley.Applicant
- Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).Applicant
- Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).Applicant
- Bing and Subramanian, IEEE, 1318-1322 (1997).Applicant
- Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.Applicant
- Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.Applicant
- Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, p. 58-68 (1995).Applicant
- Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.Applicant
- Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.Applicant
- Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Kleinrock and Scholl, Conference record 1977 ICC Volume 2 of 3, Jun. 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).Applicant
- LAN/MAN Standars Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).Applicant
- Okamoto and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant
- Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.Applicant
- Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).Applicant
- Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions in Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.Applicant
- Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).Applicant
- Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.Applicant
- U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy.Applicant
- U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy.Applicant
- U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.Applicant
- U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari.Applicant
- U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.Applicant
- U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.Applicant
- U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.Applicant
- U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast.Applicant
- U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.Applicant
- U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast.Applicant
- U.S. Appl. No. 11/966,912, filed Dec. 2007, Chestnutt et al.Applicant
- U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast.Applicant
- U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.Applicant
- U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast.Applicant
- Puttini, R., Percher, J., Me, L., and de Sousa, R. 2004. A fully distributed IDS for MANET. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 Volume 2 (Iscc″04)—Volume 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.Applicant