System and network for wireless network monitoring

Information

  • Patent Grant
  • 8514827
  • Patent Number
    8,514,827
  • Date Filed
    Tuesday, February 14, 2012
    13 years ago
  • Date Issued
    Tuesday, August 20, 2013
    11 years ago
Abstract
A technique for wireless network monitoring involves scanning channels using clients instead of access points. An example of a method according to the technique may include, for example, receiving from a wireless access point a command to perform a channel scanning function, listening on a channel associated with the channel scanning function, and sending RF data found on the channel to the wireless access point. Another example of a method according to the technique may include, for example, scanning a first channel, switching from the first channel to a second channel, sending data on the second channel to an access point, switching from the second channel to the first channel, and resuming scanning on the first channel. A system according to the technique may include one or more scanning clients, proxy clients, multi-channel clients, or other clients that are capable of scanning channels in lieu of an access point.
Description
BACKGROUND

Frame requests proved a way to sense frames transmitted on air on a channel. This can be valuable in a wireless network because it introduces a way to understand who is communicating on a channel, including learning, for example, Received Signal Strength Indication (RSSI) or other values associated with a client.


The 802.11k standard introduces Frame Request in 802.11k D3.0, section 7.3.2.21.7. However, the standard does not help to identify or locate a particular rogue device. For example, with the 802.11k, as it is proposed today, a device cannot query all trusted stations to go and look for a particular rogue device. In addition, the full frame report may or may not include a specific device, based upon the length of the report and what else might be happening on the channel. Moreover, the querying station has to digest a large report, when its needs may be for a single device. The standard also is relatively useless at identifying any disassociation or deauthentication storms or at identifying any CTS storm blocking a particular channel.


These are but a subset of the problems that may exist with the 802.11k standard, as it is proposed today, that are intended to characterize weaknesses in the prior art by way of example. 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.


SUMMARY

The following embodiments and aspects thereof are described and illustrated in conjunction with systems, tools, and methods that are meant to be exemplary and illustrative, not limiting in scope. In various embodiments, one or more of the above-described problems have been reduced or eliminated, while other embodiments are directed to other improvements.


A technique for wireless network monitoring involves scanning channels using clients instead of access points. An example of a method according to the technique may include, for example, receiving from a wireless access point a command to perform a channel scanning function, listening on a channel associated with the channel scanning function, and sending RF data found on the channel to the wireless access point. The command may or may not be sent form a switch to the wireless access point. In an embodiment, data may or may not be filtered using one or more of channel number, mac address, frame type, and frame subtype. Reports generated from the data may be used to determine what countermeasures to use in response.


Another example of a method according to the technique may include, for example, scanning a first channel, switching from the first channel to a second channel, sending data on the second channel to an access point, switching from the second channel to the first channel, and resuming scanning on the first channel. In this way, continuous or nearly continuous scanning of a channel may be possible. Or, all channels could be scanned in this way.


Another example of a method according to the technique may include, for example, sending a command from an access point on a first channel to a proxy client, switching the proxy client to a second channel, forwarding the command from the proxy client to a client on the second channel, generating a report that is responsive to the command, switching the proxy client to the first channel, and forwarding the report from the proxy client to the access point.


A system according to the technique may include one or more scanning clients, proxy clients, multi-channel clients, or other clients that are capable of scanning channels in lieu of an access point.


The proposed system can offer, among other advantages, clients that can scan channels in lieu of an access point scanning the channels. These and other advantages of the present invention will become apparent to those skilled in the art upon a reading of the following descriptions and a study of the several figures of the drawings.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.



FIG. 1 depicts a system including a wireless access domain.



FIG. 2 depicts a computer system for use in the system of FIG. 1.



FIG. 3 depicts an access area with multiple scanning clients.



FIGS. 4-8 depict flowcharts of examples of methods for wireless network monitoring.



FIG. 9 depicts a conceptual diagram of a report.



FIG. 10 depicts a conceptual diagram of an example of a frame request frame.



FIG. 11 depicts a conceptual diagram of an example of a frame report frame.





DETAILED DESCRIPTION

In the following description, several specific details are presented to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or in combination with other components, etc. In other instances, well-known implementations or operations are not shown or described in detail to avoid obscuring aspects of various embodiments, of the invention.



FIG. 1 depicts a system 100 including a wireless access domain. The system 100 includes a computer system 102, a network 104, and a wireless access domain 106. The system 100 may or may not include multiple wireless access domains. The computer system 102 may be practically any type of device that is capable of communicating with a communications network, such as, by way of example but not limitation, a workstation. The network 104 may be practically any type of communications network, such as, by way of example but not limitation, 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 a non-limiting embodiment, the computer system 102 may be running a program such as, by way of example but not limitation, ethereal, to decode, by way of example but not limitation, IEEE 802.11 standard packets encapsulated in TZSP that are received from the wireless access domain 106. In a non-limiting embodiment, the computer system 102 is connected to a wireless backbone network (not shown), either directly or indirectly through a wireless network.


In a non-limiting embodiment, the network 104 provides a Layer 2 path for Layer 3 traffic, preserving IP addresses, sessions, and other wired Layer 3 attributes as users roam throughout the wireless access domain 106. The network may or may not include a wireless backbone network, or be connected directly or indirectly to a wireless backbone network. Communications between the computer system 102 and the wireless access domain 106 are, therefore, Layer 3 traffic tunneled through Layer 2. Advantageously, by tunneling Layer 3 traffic at Layer 2, users stay connected with the same IP address and keep the same security and Quality of Service (QoS) policies from the wired network while they roam the wireless side. Since Layer 3 attributes are maintained, mobile devices that are connected to the wireless access domain 106 can retain persistent identities.


The seven layers of the Open System Interconnection (OSI) model, of which Layers 2 and 3 are a part, are well-known to those of skill in the relevant art, and are, therefore, not described herein in any substantial detail. It should be noted, however, that Layer 3 is known as the “Network Layer” because it provides switching and routing technologies, creating logical paths, known as virtual circuits, for transmitting data from node to node. Routing and forwarding are functions of this layer, as well as addressing, internetworking, error handling, congestion control and packet sequencing. Layer 2 is known as the “Data Link Layer” because at Layer 2 data packets are encoded and decoded into bits; and Layer 2 furnishes transmission protocol knowledge and management and handles errors in the physical layer, flow control and frame synchronization. The data link layer is divided into two sublayers: The Media Access Control (MAC) layer and the Logical Link Control (LLC) layer. The MAC sublayer controls how a computer on the network gains access to the data and permission to transmit it. The LLC layer controls frame synchronization, flow control, and error checking.


In non-limiting embodiments, the wireless access domain 106 may be referred to as, by way of example but not limitation, a Local Area Network (LAN), virtual LAN (VLAN), and/or wireless LAN (WLAN). The wireless access domain 106 gives each user a persistent identity that can be tracked and managed, no matter where they roam. The wireless access domain 106 may have one or more associated snoop filters. In an embodiment, the wireless access domain 106 may include one or more radios.


In the example of FIG. 1, the wireless access domain 106 includes access areas 108-1 to 108-N (hereinafter collectively referred to as access areas 108). The access areas 108 have characteristics that depend upon, among other things, a radio profile. A radio profile is a group of parameters such as, by way of example but not limitation, beacon interval, fragmentation threshold, and security policies. In an embodiment, the parameters may be configurable in common across a set of radios in one or more access areas 108. In another embodiment, a few parameters, such as the radio name and channel number, must be set separately for each radio. An example of the implementation of a wireless access domain, provided by way of example but not limitation, includes a Trapeze Networks “identity-aware” Mobility Domain™.


In the example of FIG. 1, the following elements are associated with each of the access areas 108: Wireless exchange switches 110-1 to 110-N (hereinafter collectively referred to as wireless exchange switches 110), networks 112-1 to 112-N (hereinafter collectively referred to as networks 112), and access points 114-1 to 114-N (hereinafter collectively referred to as access points 114).


In an embodiment, the wireless exchange switches 110 swap topology data and client information that details each user's identity, location, authentication state, VLAN membership, permissions, roaming history, bandwidth consumption, and/or other attributes assigned by, by way of example but not limitation, an Authentication, Authorization, and Accounting (AAA) backend (not shown). In an embodiment, the wireless exchange switches 110 provide forwarding, queuing, tunneling, and/or some security services for the information the wireless exchange switches 110 receive from their associated access points 114. In another embodiment, the wireless exchange switches 110 coordinate, provide power to, and/or manage the configuration of the associated access points 114. An implementation of a wireless exchange switch, provided by way of example but not limitation, includes a Trapeze Networks Mobility Exchange™ switch. The Trapeze Networks Mobility Exchange™ switches may, in another implementation, be coordinated by means of the Trapeze Access Point Access (TAPA) protocol.


In an embodiment, the networks 112 are simply wired connections from the wireless exchange switches 110 to the access points 114. The networks 112 may or may not be part of a larger network. In a non-limiting embodiment, the networks 112 provides a Layer 2 path for Layer 3 traffic, preserving IP addresses, sessions, and other wired Layer 3 attributes as users roam throughout the wireless access domain 106. Advantageously, by tunneling Layer 3 traffic at Layer 2, users stay connected with the same IP address and keep the same security and Quality of Service (QoS) policies from the wired network while they roam the wireless side.


In a non-limiting embodiment, the access points 114 are hardware units that act as a communication hub by linking wireless mobile 802.11 stations such as PCs to a wired backbone network. In an embodiment, the access points 114 connect users to other users within the network and, in another embodiment, can serve as the point of interconnection between a WLAN and a fixed wire network. The number of users and size of a network help to determine how many access points are desirable for a given implementation. An implementation of an access point, provided by way of example but not limitation, includes a Trapeze Networks Mobility System™ Mobility Point™ (MP™) access point.


The access points 114 are stations that transmit and receive data (and may therefore be referred to as transceivers) using one or more radio transmitters. For example, an access point may have two associated radios, one which is configured for IEEE 802.11a standard transmissions, and the other which is configured for IEEE 802.11b standard transmissions. In a non-limiting embodiment, an access point transmits and receives information as radio frequency (RF) signals to and from a wireless client over a 10/100 BASE-T Ethernet connection. The access points 114 transmit and receive information to and from their associated wireless exchange switches 110. Connection to a second wireless exchange switch provides redundancy.


A station, as used herein, may be referred to as a device with a media access control (MAC) address and a physical layer (PHY) interface to the wireless medium that comply with the IEEE 802.11 standard. As such, in a non-limiting embodiment, the access points 114 are stations. Similarly, the wireless client 116 may be implemented as a station. In alternative embodiments, a station may comply with a different standard than IEEE 802.11, and may have different interfaces to a wireless or other medium.


In operation, a wireless client 116 can roam from one of the access areas 108 to another of the access areas 108. For example, in the example of FIG. 1 the wireless client 116 moves from the access area 108-1 to the access area 108-N. In an embodiment, the wireless client 116 can maintain a single IP address and associated data sessions. The ability of the wireless client 116 to roam across the access areas 108 while maintaining a single IP address and associated data sessions may be referred to as subnet mobility. Advantageously, the system 100 may be implemented using identity-based networking, which is a technique that enforces network authorization attributes to the wireless client 116 based on client identity rather than the port or device through which the wireless client 116 connects to the network. This technique enables both a single persistent login and passport free roaming which permits the introduction of services such as voice to a wireless LAN.



FIG. 2 depicts a computer system 200 for use in the system 100 (FIG. 1). The computer system 200 may be a conventional computer system that can be used as a client computer system, such as a wireless client or a workstation, or a server computer system. The computer system 200 includes a computer 202, I/O devices 204, and a display device 206. The computer 202 includes a processor 208, a communications interface 210, memory 212, display controller 214, non-volatile storage 216, and I/O controller 218. The computer 202 may be coupled to or include the I/O devices 204 and display device 206.


The computer 202 interfaces to external systems through the communications interface 210, which may include a modem or network interface. It will be appreciated that the communications interface 210 can be considered to be part of the computer system 200 or a part of the computer 202. The communications interface 210 can be an analog modem, ISDN modem, cable modem, token ring interface, satellite transmission interface (e.g. “direct PC”), or other interfaces for coupling a computer system to other computer systems.


The processor 208 may be, for example, a conventional microprocessor such as an Intel Pentium microprocessor or Motorola power PC microprocessor. The memory 212 is coupled to the processor 208 by a bus 220. The memory 212 can be Dynamic Random Access Memory (DRAM) and can also include Static RAM (SRAM). The bus 220 couples the processor 208 to the memory 212, also to the non-volatile storage 216, to the display controller 214, and to the I/O controller 218.


The I/O devices 204 can include a keyboard, disk drives, printers, a scanner, and other input and output devices, including a mouse or other pointing device. The display controller 214 may control in the conventional manner a display on the display device 206, which can be, for example, a cathode ray tube (CRT) or liquid crystal display (LCD). The display controller 214 and the I/O controller 218 can be implemented with conventional well known technology.


The non-volatile storage 216 is often a magnetic hard disk, an optical disk, or another form of storage for large amounts of data. Some of this data is often written, by a direct memory access process, into memory 212 during execution of software in the computer 202. One of skill in the art will immediately recognize that the terms “machine-readable medium” or “computer-readable medium” includes any type of storage device that is accessible by the processor 208 and also encompasses a carrier wave that encodes a data signal.


The computer system 200 is one example of many possible computer systems which have different architectures. For example, personal computers based on an Intel microprocessor often have multiple buses, one of which can be an I/O bus for the peripherals and one that directly connects the processor 208 and the memory 212 (often referred to as a memory bus). The buses are connected together through bridge components that perform any necessary translation due to differing bus protocols.


Network computers are another type of computer system that can be used in conjunction with the teachings provided herein. Network computers do not usually include a hard disk or other mass storage, and the executable programs are loaded from a network connection into the memory 212 for execution by the processor 208. A Web TV system, which is known in the art, is also considered to be a computer system, but it may lack some of the features shown in FIG. 2, such as certain input or output devices. A typical computer system will usually include at least a processor, memory, and a bus coupling the memory to the processor.


In addition, the computer system 200 is controlled by operating system software which includes a file management system, such as a disk operating system, which is part of the operating system software. One example of operating system software with its associated file management system software is the family of operating systems known as Windows® from Microsoft Corporation of Redmond, Wash., and their associated file management systems. Another example of operating system software with its associated file management system software is the Linux operating system and its associated file management system. The file management system is typically stored in the non-volatile storage 216 and causes the processor 208 to execute the various acts required by the operating system to input and output data and to store data in memory, including storing files on the non-volatile storage 216.


Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


The present invention, in some embodiments, also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.


The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language, and various embodiments may thus be implemented using a variety of programming languages.



FIG. 3 depicts an access area 300 with multiple scanning clients. In the example of FIG. 3, the access area includes a switch 302, Access Points (APs) 304-1 to 304-N (hereinafter collectively referred to as APs 304), clients 306, and (for illustrative purposes) a rogue device 308. Advantageously, using multiple clients for scanning channels provides significantly better location detection than would be achieved using a single AP. When multiple clients, for example, look for a particular mac address, it becomes easier to triangulate thanks to the increased number of points of reference. The enhanced location detection can be useful not only for detecting and locating a rogue device 308, but also for interfering clients, or just to acquire information about where a client is.


Advantageously, by finding out which clients are on a particular set of channels, it may be possible to do load balancing. For example, if more clients are on one channel than another, the clients could be instructed to change channels.


Rogues may try to spoof an AP. In an embodiment, when the clients 306 look for a rogue channel, they also know the signal strength, which is passed to APs 304 and to the switch 302. The switch 302 knows where the APs 304 are (all of which may be passing RSSI information). There will be a large discrepancy between signal strengths of the APs 304 and the rogue device 308.



FIG. 4 depicts a flowchart 400 of a method for wireless network monitoring. This method and other methods are depicted as serially arranged modules. However, modules of the methods may be reordered, or arranged for parallel execution as appropriate. FIG. 4 is intended to illustrate a first example of operation of a system such as that depicted in FIG. 3, using the techniques described herein. The flowchart 400 continues from a determination that a trigger has occurred to the conclusion of activity that is a result of the trigger. When describing the flowchart 400, for illustrative purposes only, reference is made to components depicted in FIG. 3. However, it should be noted that the method of FIG. 4 is not intended to be limited to the components depicted in FIG. 3, and may be applicable to other systems and configurations.


In the example of FIG. 4, the flowchart 400 starts at decision point 402 where it is determined whether a trigger has occurred. In the context of FIG. 4, a trigger is any event that stimulates the system to take the steps necessary to generate a report regarding a rogue device, a client, a channel, or some other aspect or component of a wireless network. The trigger may include, but is not limited to a random trigger, an unscheduled trigger, or a scheduled trigger. The trigger may or may not be in response to analysis of prior reports, instructions from an administrator, messages from another switch, an apparent network outage, messages from a client, messages from an AP, or practically any other stimulus that is deemed to be potentially indicative of a problem, or useful in helping to detect a problem, in a wireless network. The commands should be appropriate for the trigger. For example, in response to an apparent network outage on a particular channel, a switch may send a command to listen for beacons on that channel.


In the example of FIG. 4, if it is determined that a trigger has not occurred (402-N), then the flowchart 400 repeats decision point 402 until a trigger does occur. It may be noted that the loop need not be an active check for a triggering condition; rather the loop could simply represent the time lag until a trigger actually occurs. The stimulus for a trigger may originate within a switch, or higher up.


In the example of FIG. 4, when it is determined that a trigger has occurred (402-Y), the flowchart 400 continues at module 404 with the switch 302 sending to one or more of the APs 304 a command to find out more about a device, such as the rogue device 308 or one or more of the clients 306, or channel. The command could be sent to a single AP or multiple APs. When sending to multiple APs, the command may be sent to each AP for a given switch, all of the APs of a mobile domain, or some subset of the APs of a mobile domain. In some implementations, it may even be desirable to send the command to APs of multiple mobile domains.


In the example of FIG. 4, the flowchart 400 continues at module 406 with sending the command to clients associated with and/or within range of the AP. The clients may include all clients 306, or a subset of clients 306 within the access area of the relevant APs 304. The command may include, for example, instructions for the client to go to a particular channel and listen for a specified time. Each of the clients may be given a slightly different command. For example, a first client may be instructed to go to channel 1, and a second client may be instructed to go to a channel 2. In a specific embodiment, an AP may have multiple dedicated clients. In this specific embodiment, it may be unnecessary to send the command to clients other than the dedicated clients, since the dedicated clients perform all of the scanning routines. Of course, other clients could serve a backup function, such as when the dedicated clients are all busy or otherwise unavailable.


In the example of FIG. 4, the flowchart 400 continues at module 408 with one or more clients 306 going to a channel specified in the command and listening (or scanning) for a period of time specified in the command. In alternative embodiments, the command need not specify a channel. By way of example but not limitation, each client may be pre-configured to scan a particular channel, obviating the need for a command to specify the channel. In alternative embodiments, the command need not specify a period of time. By way of example but not limitation, each client (or all of the clients 306) may be pre-configured to scan for a set amount of time, obviating the need for a command to specify a period of time.


In the example of FIG. 4, the flowchart 400 continues at module 410 with the clients going back to the AP's channel to send raw data. APs typically operate on a single channel, so it may be assumed that clients will also operate on a single channel, which would have the benefit of more inexpensive client devices. Thus, the clients must typically switch between channels to respectively scan and to send data (assuming they are scanning a channel other than the one on which the AP is operating). In alternative embodiments, the clients may operate on multiple channels. In such a case, it may not be necessary for the client to switch from a scanned channel to the AP's channel; rather, the client may scan on a channel, and send on another channel without switching.


In order to reduce the amount of data sent from the clients 306 to the APs 304, it may be desirable to give the clients 306 the ability to generate reports from the raw data collected. Alternatively, the clients 306 could be given the ability to pre-process some of the raw data.


In the example of FIG. 4, the flowchart 400 continues at module 412 with the AP reporting to the switch 302. The APs 304 may be given the task of analyzing raw data from the clients 306, depending upon the devices and/or the implementation. For example, the APs 304 could generate a report similar to that depicted in FIG. 9 from the raw data received from the clients 306. One of skill in the relevant art would recognize that such a report can be used to diagnose certain problems, and perform countermeasures in response if desired or available.


Alternatively, the APs 304 could be configured to perforin some pre-processing of raw data and allow the switch 302 (or a device that is higher up) generate the desired reports. Or, the APs 304 could simply pass the raw data on to the switch 302 (or a device that is higher up) for processing. This is an implementation decision. When pre-processing data at the APs 304, it may be desirable to remove some raw data if it can be omitted. It is believed that clients 306, when properly configured, can obtain as much information for the reports as an AP, so the AP should not be required to add additional data when pre-processing the raw data. Nevertheless, if it is determined that the AP can add data to the reports, then the APs 304 may be so configured.


In the example of FIG. 4, the flowchart 400 ends at module 414 with the switch performing countermeasures. The switch 302 may or may not analyze the reports. For example, the analysis could be done at the AP or, in the alternative, higher up. The switch 302 (or some other device) may decide upon and set into action countermeasures to respond to the rogue device 308, if the rogue device 308 is detected. The countermeasures could be in response to some other stimulus than the detection of the rogue device 308, as well.


Countermeasure techniques are known to those of skill in the relevant arts, and generally include measures that attack rogue devices within an access area, shore up the defenses of the network against such devices, or improve the network in some other way in response to a network problem. However, in the example of FIG. 4, these measures are intended to include any procedure that is a response to an analyzed report, including but not limited to sending a notification to an administrator, shutting down an access point, rebooting, or gathering additional information. As the reports include raw data, the problems detected may include anything that can be detected using the raw data. The number of problems or attacks that can be detected is practically impossible to list in its entirety, but includes and is not limited to spoofed network detection, CTS storms, rogue devices, etc.


Advantageously, these techniques obviate the need for the APs to scan any of the channels. It may be desirable for APs to scan channels if client scanning is not deemed sufficient, but the need for the APs to scan channels is at least reduced. Consequentially, service disruptions at the AP can be reduced.



FIG. 5 depicts a flowchart 500 of a method for wireless network monitoring. FIG. 5 is intended to illustrate a second example of operation of a system such as that depicted in FIG. 3, using the techniques described herein, such as client sensors. In the example of FIG. 5, it is assumed that the client sensors are dedicated wireless sensors, rather than active clients spending time on channels to perform scanning. This is not required, but since dedicated wireless sensors may be considered extremely useful, considering their relatively low cost compared to an AP, and relatively simple deployment within a wireless network, it is appropriate to illustrate this advantage with reference to at least one flowchart—in this case FIG. 5. When describing the flowchart 500, for illustrative purposes only, reference is made to components depicted in FIG. 3. However, it should be noted that the method of FIG. 5 is not intended to be limited to the components depicted in FIG. 3, and may be applicable to other systems and configurations.


In the example of FIG. 5, the flowchart 500 starts at module 502 with using the client sensors 306 to scan a plurality of channels. For example, 802.11b may operate on 11 channels (in the United States, at least). So, 11 of the clients 306 may operate on the 11 channels (or a smaller number of clients 306 may operate on a smaller number of channels). Advantageously, this allows each of the client sensors 306 to generate nearly continuous reports. It should be noted that, in this example, a trigger may not be necessary since the channels can be scanned continuously and, if a threat is detected, countermeasures can be executed. In some cases, it may be desirable to include a trigger as well.


It should be noted that promiscuous listening might encounter thousands of nodes for a given period of time. Since large reports increase network usage, it may be desirable to provide more accurate detection so that reports can be smaller. Therefore, continuous reports may not be a desirable outcome. The balance between continuous, complete reports and deterministic rogue detection (or, for example, security detection, location detection, etc.) is an implementation decision that may be impacted one way or another depending upon the embodiment or configuration that is used. Advantageously, the techniques provided herein allow for either a broader (e.g., complete) report than ever before in 802.11, or for a more focused report than ever before in 802.11.


In the example of FIG. 5, the flowchart 500 continues at module 504 with a client sensor switches to the AP's channel. If a client sensor is scanning on the AP's channel then, of course, the client sensor need not change channels at this step. In other cases, assuming that the client sensor does not have a mechanism for scanning on one channel and transmitting on another, the client sensor may need to change to the AP's channel prior to communicating with the AP.


In the example of FIG. 5, the flowchart 500 continues at module 506 with the client sensor sends raw data to the AP. There is no technical reason why the client sensors 306 would be unable to scan for any RF activity that is within range. So, the amount of raw data can theoretically include all 802.11 RF activity in an embodiment in which 802.11 RF activity is the activity of interest. (In embodiments that do not use 802.11, other RF activity may be included.) In an embodiment, all of the raw data is sent from the client sensor to the AP.


In another embodiment, the raw data may be pre-processed to reduce the amount of data that is sent to the AP. In such an embodiment, the amount of data sent would depend upon the desired implementation of the system. In another embodiment, the client sensor may actually generate a report for sending to the AP. In such an embodiment, the AP (or switch, or other component that is higher up) may not need to perform any report generating functions. Indeed, the client sensors could even be programmed with countermeasure procedures, which could obviate the need for sending a report at all.


In the example of FIG. 5, the flowchart 500 continues at module 508 with the client sensor switches to another channel, and module 510 with the client sensor resumes scanning, and at module 504, which was described previously. (In the example of FIG. 5, the flowchart 500 also continues from module 506 to module 512, which is described later.) In an embodiment, at module 508, the client sensor switches back to the channel that it was scanning previously.


With appropriate configurations, every channel can be scanned continuously. A minimalist example (in which there are, for illustrative purposes, 11 channels) of such a configuration would include an AP and 11 clients. The AP scans its own channel. Periodically, each of the 10 clients switches to the AP's channel to send a report. When the clients switch to the AP's channel to send a report, they cannot continue to scan the previously scanned channel. However, when (or just before) the clients switch to the AP's channel, the 11th client switches to the previously scanned channel so that scanning can be essentially continuous. As each of the 10 clients, in turn, finish their reports, the 11th client switches back to the AP's channel to deliver the report for the previously scanned channel. This can result in continuous scanning of all channels using one client per channel.


Referring once again to FIG. 5, in an alternative embodiment, at module 508 the client sensor may switch to a channel that it was not immediately previously scanning. For example, it may be desirable to have client sensors rotate through channels so that scanning is continuous. If raw data proves to be too much to handle with only 12 (or 11) client sensors, the number could be increased. For example, 21 client sensors could be used to scan 11 channels, two for each channel, except the AP's channel, which may only require one client sensor because the client sensor does not need to change channels to send data. When one of the client sensors on a given channel is sending data to the AP, the other is scanning. When the reporting client sensor switches back, the scanning client sensor can switch to the AP's channel to deliver its data.


In the example of FIG. 5, the flowchart 500 continues at module 512 with the access point generates a report using the raw data, at module 514 with the access point reports to the switch, and at module 516 with the switch performs countermeasures.


Even with continuous scanning of channels, it may be desirable to implement additional redundancy. For example, it may be desirable to deploy, e.g., four clients (or client sensors) at four edges of an access area, and perhaps one client near the AP. This may facilitate detection of relatively distant rogue devices more quickly. It may also be desirable to place a client (or client sensor) approximately equidistant from two adjacent APs, and have the client report to both APs.



FIG. 6 depicts a flowchart 600 of a method for wireless network monitoring. FIG. 6 is intended to illustrate a third example of operation of a system such as that depicted in FIG. 3, in which the amount of data that is sent from the clients 306 to the APs 304 is intelligently reduced. In the example of FIG. 6, it is assumed that the clients 306 have report generating capabilities. This is not required, and this capability could be replaced with data pre-processing capabilities. When describing the flowchart 600, for illustrative purposes only, reference is made to components depicted in FIG. 3. However, it should be noted that the method of FIG. 6 is not intended to be limited to the components depicted in FIG. 3, and may be applicable to other systems and configurations.


In the example of FIG. 6, the flowchart 600 starts at decision point 602 where it is determined whether a trigger has occurred. In the example of FIG. 6, if it is determined that a trigger has not occurred (602-N), then the flowchart 600 repeats decision point 602 until a trigger does occur. When a trigger occurs (602-Y), the flowchart 600 continues at module 604 with the switch sending to one or more of the access points 304 a command.


In the example of FIG. 6, the flowchart 600 continues at module 606 with the AP sending the command to clients 306 associated with the AP. The clients to which the AP sends the command may vary depending upon implementation and/or the command itself. For example, if the command is a directive to listen on a particular channel for a given period of time, then only clients that are configured to listen on that channel would respond to the command. In an embodiment, only those clients that are configured to respond to a given command receive the command. Other commands may include listening for a particular mac address. In such a case, it may be desirable for all of the clients 306 to receive the command.


In the example of FIG. 6, the flowchart 600 continues at module 608 with the clients generating a report in accordance with the command. The amount of raw data that a client retains would depend primarily upon implementation. Very large storage capacities have the benefit of providing better reports in some cases, but at greater expense. Large storage capacities will also tend to increase physical size, and may or may not increase access times as well. Of course, generating reports from a large pool of data also takes longer. One of skill in the relevant art should be able to weigh the advantages and disadvantages to come up with a reasonable compromise between storage capacity and expense (or, e.g., access time).


In the example of FIG. 6, the flowchart 600 continues at module 610 with the client switches to the AP's channel and reports, at module 612 with the APs report to the switch, and at module 614 with the switch performs countermeasures.


In an embodiment, the APs have to switch channels in order to send commands to the various clients (or client sensors). This can result in a service disruption similar to that caused by active scan. To remedy this problem, it may be desirable to implement a proxy client.



FIG. 7 depicts a flowchart 700 of a method for providing commands to client sensors. FIG. 7 is intended to illustrate a fourth example of operation of a system such as that depicted in FIG. 3, in which APs can transmit commands to client sensors without a service disruption.


In the example of FIG. 7, the flowchart 700 starts at module 702 with a switch sending a command to an AP. This may be, for example, in response to a trigger (not shown).


In the example of FIG. 7, the flowchart 700 continues at module 704 with an AP sending the command to a proxy client. The proxy client may be a client sensor that is on the same channel as the AP. The proxy client may or may not also be responsible for scanning on the AP's channel.


In the example of FIG. 7, the flowchart 700 continues at module 706 with the proxy client switching to another channel. The channel to which the proxy client switches may or may not be dependent upon the command. For example, if the command is to scan a particular channel, the proxy client may switch to that channel. As another example, if the command is to scan for a particular type of frame on any channel, then the proxy client may switch to each other channel in turn (or other proxy clients could be used to switch to the channels more quickly). Alternatively, the proxy client could just switch to each channel in turn regardless of the command, and the APs may or may not respond to the command depending upon the command's relevance to them.


In the example of FIG. 7, the flowchart 700 continues at module 708 with the proxy client sending the command to a client. Since the proxy client is a “proxy”, the proxy client by definition passes the command on to a client. It should be noted, however, that a client could wait on the AP's channel until given a command, then switch to an appropriate channel or channels to carry out the command.


In the example of FIG. 7, the flowchart 700 continues at module 710 with the client generating a report. Since, in an embodiment, the client does not leave the channel, the client can amass continuous RF data on the channel. This data can be used to generate reports without any additional scanning. For example, if a command is sent periodically to check whether any suspicious activity is occurring on a channel, recent data may be as valuable as data that is acquired shortly after the command is received. So, the client could use a slightly dated report, and perhaps respond slightly faster to the command.


In the example of FIG. 7, the flowchart 700 continues at module 712 with the client sending the report to the proxy client and at module 714 with the proxy client switching to the AP's channel. In an alternative embodiment, the client and the proxy could switch places. For instance, the client could generate a report and switch to the AP's channel, and the proxy remain on the channel and begin scanning. An advantage of this embodiment is that the report need not be transmitted from client to client.


In the example of FIG. 7, the flowchart 700 continues at module 716 with the proxy client reporting to the AP, and at module 718 with the AP reporting to the switch. It may be noted that since the client generates the report, the AP only needs to forward the report on to the switch. Of course, the AP could perforin additional processing, depending upon the implementation and/or configuration of the AP.



FIG. 8 depicts a flowchart 800 of a method for providing commands to multi-channel clients. FIG. 8 is intended to illustrate a fifth example of operation of a system such as that depicted in FIG. 3, in which continuous scanning of channels is possible without switching between channels.


In the example of FIG. 8, the flowchart 800 begins at module 802 with a switch sending a command to an AP and at module 804 with the AP sending the command to a multi-channel client. A multi-channel client may include a two or more sensors that can be set to different channels. The multi-channel client may further include a link between the two or more sensors. The link allows the multi-channel client to receive data on one channel, and transmit the data to another channel.


Alternatively or in addition, the multi-channel client can receive data on one channel, process the data into, for example, a report, and transmit the processed data to another channel. Alternatively or in addition, the multi-channel client can receive data on multiple channels, process the data into, for example, a report, and transmit the processed data to another channel (or one of the channels on which the data was received). In an embodiment, the multi-channel client could include one sensor for each channel. Thus, by way of example but not limitation, a multi-channel client with 14 channels could operate on all 14 channels of the 802.11b standard in Japan (in the US, 802.11b operates on only 11 channels at 2.4 GHz).


In the example of FIG. 8, the flowchart 800 continues at module 806 with the multi-channel client generating a report for the relevant channel. For example, if the command requires listening on all channels, the report could include data from each of the channels (in an embodiment or implementation wherein the multi-channel client includes a sensor for each channel). A command that only asks for a report on a single channel may only need data from that single channel.


In the example of FIG. 8, the flowchart 800 continues at module 808 with the multi-channel client reporting to the AP. It may be noted that it was not necessary for the multi-channel client to switch between channels. Accordingly, the multi-channel client can continue to scan on, potentially, all channels while reporting to the AP.


In the example of FIG. 8, the flowchart 800 continues at module 810 with the AP reporting to the switch and at module 812 with the switch performing countermeasures.



FIG. 9 depicts a conceptual diagram of a report. In the example of FIG. 9, the report includes zero or more mac addresses and type, subtype, and number of frames associated with the mac addresses. FIG. 9 is intended to illustrate a report that can be generated using data acquired by clients. Those of skill in the relevant art would recognize that this report is similar to, for example, a report generated at an AP after the AP performed an active scan. Advantageously, using the techniques described herein, the report can be generated using clients and without active scan (and the associated service disruption).



FIG. 10 depicts a conceptual diagram of an example of a frame request frame 1000. In the example of FIG. 10, the frame request includes several fields, most of which would be self-explanatory to one of skill in the relevant art. The fields are, therefore, only briefly described, with the exception of field 1010, for which additional explanation is provided. It should be noted that FIG. 10 is intended to illustrate one of many possible frame requests. Other frame request embodiments could easily be created and used without deviating from the teachings provided herein.


In an embodiment, the frame request frame 1000 is part of a measurement request report mechanism. The frame request frame 1000 can be sent to clients in a wireless network. Clients go to the channel indicated in the Channel Number field. The clients then get frames and send data back, such as mac address and an associated RSSI, (plus, if desired, average and last RSSI).


The frame request frame 1000 facilitates looking for frames of a specific type or subtype. Requesting frames of a particular type allows recognition of security attacks, such as, by way of example but not limitation, CTS attack. You can ask stations to look for disassociate frames or disassociate frames from a particular address. Advantageously, in an embodiment, the mac address and frame type/subtype choices are distinct, thereby providing more flexibility in detecting, e.g., CTS storms, spoofed networks, and other attacks. For example, the AP could send a command to a client to scan a channel for a particular mac address and a particular type of frame, allowing for relatively specific reports. In general, it helps to know what kinds of frames, for example, interfering clients are using.


Field 1002 is Channel Number, which indicates the channel number for which the measurement request applies. Channel Number is defined within a Regulatory Class.


Field 1004 is Regulatory Class, which indicates the frequency band for which the measurement request applies.


Field 1006 is Randomization Interval, which specifies the upper bound of the random delay to be used prior to making the measurement in units of TU.


Field 1008 is Measurement Duration, which is set to the preferred duration of the requested measurement, expressed in TUs. If the Duration Mandatory bit is set to 1 in the Measurement Request Mode field this is interpreted as a mandatory measurement duration. If the Duration Mandatory bit is set to 0 this shall be interpreted as a target measurement duration.


Field 1010 is Frame Request Parameter Set, which is split, for illustrative purposes, into six subfields, Match Type bit, Match Subtype bit, Match Mac bit, Type, Subtype, and Reserved.


The Match Type bit indicates whether the type fields indicated in the Frame Request Parameter Set 1010 should match for the frames counted for frame report generation. If the bit is set to 1, only frames that match the type should be counted towards the generation of a frame report.


The Match Subtype bit is only valid when the match type bit is set to 1. This bit indicates whether the subtype field indicated in the Frame Request Parameter Set 1010 should match for the frames counted for frame report generation. If the bit is valid and is set to 1, only frames that match the subtype should be counted towards the generation of a frame report.


The Match Mac bit indicates whether the mac address included in the frame request frame 1000 should match for the frames counted for the frame report generation. If the bit is set to 1, only frames that match the Mac Address field 1012 should be counted towards the generation of a frame report. When this bit set to 1, the mac address field 1012 is mandatory.


The Type field is used to indicate the type of packets that would be counted towards the frame report generation. The Type field is only used when the Match Type bit is set to 1.


The Subtype field is used to indicate the subtype of packets that would be counted towards the frame report generation. The Subtype field is only used when the Match Subtype bit is valid and is set to 1.


The Reserved field is set to zeros on transmit and should be ignored on receive.


Field 1012 is Mac Address, which is included in the frame request 1000 if the match mac address field in the frame request parameter set is set to 1. If this field is included, only frames from this mac address are counted towards the frame report generated in response to this frame request.



FIG. 11 depicts a conceptual diagram of an example of a frame report frame 1100. In the example of FIG. 11, the frame report frame 1100 includes several fields, most of which would be self-explanatory to one of skill in the relevant art. The fields are, therefore, only briefly described, with the exception of field 1110, for which additional explanation is provided. It should be noted that FIG. 11 is intended to illustrate one of many possible frame report frames. Other frame report embodiments could easily be created and used without deviating from the teachings provided herein.


Field 1102 is Channel Number, which indicates the channel number for which the measurement request applies. Channel Number is defined within a Regulatory Class.


Field 1104 is Regulatory Class, which indicates the frequency band for which the measurement request applies.


Field 1106 is Actual Measurement Start Time, which is set to the value of the measuring STA's TSF timer at the time the measurement started.


Field 1108 is Measurement Duration, which is set equal to the duration over which the Frame Report was measured, expressed in TUs.


Field 1110 is Frame Report Entry, which includes the fields Transmit Address, BSSID, Phy Type (Phy), Average RCPI (Avg), RSNI Last (RL), RCPI, Antenna ID (Ant ID), and Frame Report Parameter Set. The Transmit Address field contains the Transmit Address from the frames being reported. The BSSID field contains the BSSID from the frames being reported. PHY Type indicates the physical medium type for the frame(s) being reported. Valid entries are coded according to the value of dot11PHYType. Average RCPI indicates the average value for the received channel power of all the frames counted for this report. Average RCPI is reported in dBm, as defined in the RCPI measurement clause for the PHY Type. RSNI indicates the received signal to noise indication of the received frame in dBm. This field is the RSNI value for the most recently received frame. Last RCPI indicates the received channel power of the most recently counted frame in this Frame Report entry. Last RCPI is reported in dBm, as defined in the RCPI measurement clause for the PHY Type. The Antenna ID field contains the identifying number for the antenna used to receive the most recently counted frame in this Frame Report entry.


The Frame Report Parameter has four subfields: Type, Subtype, Reserved, and Number of Frames. The Type field indicates the type of the packets counted towards this frame report parameter set. The Subtype field is used to indicate the subtype of packets that were counted towards this frame report parameter set. Number of Frames is a count of the frames of the type and subtype mentioned in the corresponding frame report parameter set with the indicated Transmit Address and BSSID during the measurement duration. The value 255 indicates a count of 255 or more.


In many of the examples provided herein, multicast packets are assumed to be 802.11-compatible. 802.11-compatible is intended to mean the multicast packet can be sent in accordance with, by way of example but not limitation, 802.11a, 802.11b, 802.11g, or other current or future 802.11 standards. It is to be understood that other wireless implementations other than 802.11 will likely have problems that can be reduced using the techniques described herein. Therefore, although the 802.11 standard is ubiquitous, the teachings provided herein are not limited to the 802.11 standard.


Frame report request methodology of, for example, 802.11k can be improved with techniques described herein. The techniques should be applicable to other 802.11 standards and to wireless network techniques in general.


As used herein, a rogue device is a wireless Access-Point or Client device that is violating policies or hampering legal wireless access in a network. The rogue device is often assumed to be harmful for an enterprise network. An interfering device, on the other hand, is a wireless Access-Point or Client device that is coexisting with a legal enterprise network without causing any intentional damage to it. A known device is a wireless Access-Point or Client device that is part of the legal enterprise network wireless installation. A client sensor is a wireless client device that scans 802.11 (or other) channels and provides information to an AP or set of APs.


As used herein, a wireless network refers to any type of wireless network, including but not limited to a structured network or an ad hoc network. Data on a wireless network is often encrypted. However, data may also be sent in the clear, if desired. With encrypted data, a rogue device will have a very difficult time learning any information (such as passwords, etc.) from clients before countermeasures are taken to deal with the rogue. The rogue may be able to confuse the client, and perhaps obtain some encrypted data, but the risk is minimal (even less than for some wired networks).


Active scan involves sending an AP to other channels (for a short time). One well-known problem with active scanning is service disruption. In addition to the short period of time where an AP is not on its primary channel, the switching can cause annoying problems in other respects. For example, when voice is sent over a wireless channel, active scan can cause an audible click when an AP scans another channel.


As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation.


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
  • 1. A method comprising: receiving, at a proxy client device, a command from an access point on a first channel;forwarding the command from the proxy client device to a client device on the second channel;receiving, at the proxy client device and from the client device, a report that is responsive to the command; andforwarding the report from the proxy client device to the access point.
  • 2. The method of claim 1, wherein the proxy client device is a non-access point.
  • 3. The method of claim 1, wherein the report includes a frame report frame.
  • 4. The method of claim 1, wherein switching the proxy client to the second channel is in response to the command.
  • 5. The method of claim 1, wherein the report is based on one or more of a channel number, a frame type, and a frame subtype.
  • 6. The method of claim 1, furthering comprising listening on the second channel for a predetermined period of time.
  • 7. The method of claim 1, wherein the receiving includes receiving the command by the access point via a switch.
  • 8. An apparatus, comprising: a client device configured to be operatively coupled to a proxy client device that is operatively coupled to an access point,the client device configured to receive, from the proxy client device and on a first channel, a command that was received by the proxy client device on a second channel from the access point,the client device configured to send a report to the proxy client device on the second channel such that the proxy client device forwards the report to the access point on the first channel.
  • 9. The apparatus of claim 8, wherein the report includes a frame report frame.
  • 10. The apparatus of claim 8, wherein the report is based on one or more of a channel number, a frame type, and a frame subtype.
  • 11. The apparatus of claim 8, wherein: the report is a first report,the client device is configured to send the first report, at a first time, to the proxy client device,the client device is configured to send a second report, at a second time before the first time, to the proxy client device on the second channel such that the proxy client device forwards the second report to the access point on the first channel.
  • 12. The apparatus of claim 8, wherein the proxy client device is a non-access point.
  • 13. The apparatus of claim 8, wherein the command is based on a connectivity outage.
  • 14. The apparatus of claim 8, wherein the client device is configured to send the report to the access point on the first channel.
  • 15. A method, comprising: receiving, at a proxy client device at a first time, a first command from an access point on a first channel;forwarding the first command from the proxy client device to a client device on a second channel;receiving, at the proxy client device and from the client device, a report that is responsive to a second command received at a second time prior to the first time; andforwarding the report from the proxy client device to the access point.
  • 16. The method of claim 15, wherein the proxy client device is a non-access point.
  • 17. The method of claim 15, wherein the report includes a frame report frame.
  • 18. The method of claim 15, wherein the report is based on one or more of a channel number, a frame type, and a frame subtype.
  • 19. The method of claim 15, wherein the first command is based on a suspicious network activity trigger and the second command is based on a schedule trigger.
  • 20. The method of claim 15, further comprising forwarding the report from the proxy client device to the access point such that the access point forwards the report to a switch.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/785,362, entitled “SYSTEM AND NETWORK FOR WIRELESS NETWORK MONITORING,” filed May 21, 2010 (now U.S. Pat. No. 8,116,275), which is a continuation of U.S. application Ser. No. 11/331,789, entitled “SYSTEM AND METHOD FOR WIRELESS NETWORK MONITORING,” filed Jan. 14, 2006 (now U.S. Pat. No. 7,724,703), which claims priority to and the benefit of Provisional Patent Application Ser. No. 60/727,025 entitled “WIRELESS NETWORK SYSTEM AND METHOD” Oct. 13, 2005, all of which are incorporated herein by reference in their entireties.

US Referenced Citations (651)
Number Name Date Kind
3641433 Mifflin et al. Feb 1972 A
3906166 Cooper et al. Sep 1975 A
4168400 De Couasnon et al. Sep 1979 A
4176316 DeRoas et al. Nov 1979 A
4247908 Lockhart et al. Jan 1981 A
4291401 Bachmann Sep 1981 A
4291409 Weinberg et al. Sep 1981 A
4409470 Shepard et al. Oct 1983 A
4460120 Shepard et al. Jul 1984 A
4475208 Ricketts Oct 1984 A
4494238 Groth, Jr. Jan 1985 A
4500987 Hasegawa Feb 1985 A
4503533 Tobagi et al. Mar 1985 A
4550414 Guinon et al. Oct 1985 A
4562415 McBiles Dec 1985 A
4630264 Wah Dec 1986 A
4635221 Kerr Jan 1987 A
4639914 Winters Jan 1987 A
4644523 Horwitz Feb 1987 A
4672658 Kavehrad Jun 1987 A
4673805 Shepard et al. Jun 1987 A
4707839 Andren et al. Nov 1987 A
4730340 Frazier Mar 1988 A
4736095 Shepard et al. Apr 1988 A
4740792 Sagey et al. Apr 1988 A
4758717 Shepard et al. Jul 1988 A
4760586 Takeda Jul 1988 A
4789983 Acampora et al. Dec 1988 A
4829540 Waggener, et al. May 1989 A
4850009 Zook et al. Jul 1989 A
4872182 Mcrae et al. Oct 1989 A
4894842 Broekhoven et al. Jan 1990 A
4901307 Gilhousen et al. Feb 1990 A
4933952 Albrieux et al. Jun 1990 A
4933953 Yagi Jun 1990 A
4955053 Siegmund Sep 1990 A
4995053 Simpson et al. Feb 1991 A
5008899 Yamamoto Apr 1991 A
5027343 Chan et al. Jun 1991 A
5029183 Tymes Jul 1991 A
5103459 Gilhousen et al. Apr 1992 A
5103461 Tymes Apr 1992 A
5109390 Gilhousen et al. Apr 1992 A
5119502 Kallin et al. Jun 1992 A
5142550 Tymes Aug 1992 A
5151919 Dent Sep 1992 A
5157687 Tymes Oct 1992 A
5187575 Lim Feb 1993 A
5231633 Hluchyj et al. Jul 1993 A
5280498 Tymes et al. Jan 1994 A
5285494 Sprecher et al. Feb 1994 A
5327144 Stilp et al. Jul 1994 A
5329531 Diepstraten Jul 1994 A
5339316 Diepstraten Aug 1994 A
5371783 Rose et al. Dec 1994 A
5418812 Reyes et al. May 1995 A
5432842 Kinoshita Jul 1995 A
5444851 Woest Aug 1995 A
5448569 Huang et al. Sep 1995 A
5450615 Fortune et al. Sep 1995 A
5465401 Thompson Nov 1995 A
5479441 Tymes et al. Dec 1995 A
5483676 Mahany et al. Jan 1996 A
5488569 Kaplan et al. Jan 1996 A
5491644 Pickering et al. Feb 1996 A
5517495 Lund May 1996 A
5519762 Bartlett May 1996 A
5528621 Heiman et al. Jun 1996 A
5542100 Hatakeyama Jul 1996 A
5546389 Wippenbeck et al. Aug 1996 A
5561841 Markus Oct 1996 A
5568513 Croft et al. Oct 1996 A
5570366 Baker et al. Oct 1996 A
5584048 Wieczorek Dec 1996 A
5598532 Liron Jan 1997 A
5630207 Gitlin et al. May 1997 A
5640414 Blakeney, et al. Jun 1997 A
5649289 Wang et al. Jul 1997 A
5668803 Tymes et al. Sep 1997 A
5670964 Dent Sep 1997 A
5677954 Hirata et al. Oct 1997 A
5706428 Boer et al. Jan 1998 A
5715304 Nishida et al. Feb 1998 A
5729542 Dupont Mar 1998 A
5734699 Lu et al. Mar 1998 A
5742592 Scholefield et al. Apr 1998 A
5774460 Schiffel et al. Jun 1998 A
5793303 Koga Aug 1998 A
5794128 Brockel et al. Aug 1998 A
5812589 Sealander et al. Sep 1998 A
5815811 Pinard et al. Sep 1998 A
5818385 Bartholomew Oct 1998 A
5828653 Goss Oct 1998 A
5828960 Tang et al. Oct 1998 A
5835061 Stewart Nov 1998 A
5838907 Hansen Nov 1998 A
5844900 Hong et al. Dec 1998 A
5852722 Hamilton Dec 1998 A
5862475 Zicker et al. Jan 1999 A
5872968 Knox et al. Feb 1999 A
5875179 Tikalsky Feb 1999 A
5887259 Zicker et al. Mar 1999 A
5896561 Schrader et al. Apr 1999 A
5909686 Muller et al. Jun 1999 A
5915214 Reece et al. Jun 1999 A
5920821 Seazholtz et al. Jul 1999 A
5933607 Tate et al. Aug 1999 A
5938721 Dussell et al. Aug 1999 A
5949988 Feisullin et al. Sep 1999 A
5953669 Stratis et al. Sep 1999 A
5960335 Umemoto et al. Sep 1999 A
5969678 Stewart Oct 1999 A
5970066 Lowry et al. Oct 1999 A
5977913 Christ Nov 1999 A
5980078 Krivoshein et al. Nov 1999 A
5982779 Krishnakumar et al. Nov 1999 A
5987062 Engwer et al. Nov 1999 A
5987328 Ephremides et al. Nov 1999 A
5991817 Rowett et al. Nov 1999 A
5999813 Lu et al. Dec 1999 A
6005853 Wang et al. Dec 1999 A
6011784 Brown Jan 2000 A
6012088 Li et al. Jan 2000 A
6029196 Lenz Feb 2000 A
6041240 McCarthy et al. Mar 2000 A
6041358 Huang et al. Mar 2000 A
6070243 See et al. May 2000 A
6073075 Kondou et al. Jun 2000 A
6073152 De Vries Jun 2000 A
6078568 Wright Jun 2000 A
6088591 Trompower et al. Jul 2000 A
6101539 Kennelly et al. Aug 2000 A
6115390 Chuah Sep 2000 A
6118771 Tajika et al. Sep 2000 A
6119009 Baranger et al. Sep 2000 A
6122520 Want et al. Sep 2000 A
6144638 Obenhuber et al. Nov 2000 A
6148199 Hoffman et al. Nov 2000 A
6154776 Martin Nov 2000 A
6160804 Ahmed et al. Dec 2000 A
6177905 Welch Jan 2001 B1
6188649 Birukawa et al. Feb 2001 B1
6199032 Anderson Mar 2001 B1
6208629 Jaszewski et al. Mar 2001 B1
6208841 Wallace et al. Mar 2001 B1
6212395 Lu et al. Apr 2001 B1
6218930 Katzenberg et al. Apr 2001 B1
6240078 Kuhnel et al. May 2001 B1
6240083 Wright May 2001 B1
6240291 Narasimhan et al. May 2001 B1
6246751 Bergl et al. Jun 2001 B1
6249252 Dupray Jun 2001 B1
6256300 Ahmed et al. Jul 2001 B1
6256334 Adachi Jul 2001 B1
6259405 Stewart et al. Jul 2001 B1
6262988 Vig Jul 2001 B1
6269246 Rao et al. Jul 2001 B1
6285662 Watannabe Sep 2001 B1
6304596 Yamano et al. Oct 2001 B1
6304906 Bhatti et al. Oct 2001 B1
6317599 Rappaport et al. Nov 2001 B1
6326918 Stewart Dec 2001 B1
6336035 Somoza et al. Jan 2002 B1
6336152 Richman et al. Jan 2002 B1
6347091 Wallentin et al. Feb 2002 B1
6356758 Almeida et al. Mar 2002 B1
6393290 Ufongene May 2002 B1
6397040 Titmuss et al. May 2002 B1
6404772 Beach et al. Jun 2002 B1
6421714 Rai et al. Jul 2002 B1
6429879 Sturgeon et al. Aug 2002 B1
6446206 Feldbaum Sep 2002 B1
6456239 Werb et al. Sep 2002 B1
6470025 Wilson et al. Oct 2002 B1
6473449 Cafarella et al. Oct 2002 B1
6487604 Rochford et al. Nov 2002 B1
6493679 Rappaport et al. Dec 2002 B1
6496290 Lee Dec 2002 B1
6512916 Forbes, Jr. Jan 2003 B1
6526275 Calvert Feb 2003 B1
6535732 McIntosh et al. Mar 2003 B1
6564380 Murphy May 2003 B1
6567146 Hirakata et al. May 2003 B2
6567416 Chuah May 2003 B1
6570867 Robinson et al. May 2003 B1
6574240 Tzeng Jun 2003 B1
6580700 Pinard et al. Jun 2003 B1
6584494 Manabe et al. Jun 2003 B1
6587680 Ala-Laurila et al. Jul 2003 B1
6587835 Treyz et al. Jul 2003 B1
6603970 Huelamo Platas et al. Aug 2003 B1
6614787 Jain et al. Sep 2003 B1
6615276 Mastrianni et al. Sep 2003 B1
6624762 End, III Sep 2003 B1
6625454 Rappaport et al. Sep 2003 B1
6631267 Clarkson et al. Oct 2003 B1
6650912 Chen et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6659947 Carter et al. Dec 2003 B1
6661787 O'Connell et al. Dec 2003 B1
6674403 Gray et al. Jan 2004 B2
6677894 Sheynblat et al. Jan 2004 B2
6678516 Nordman et al. Jan 2004 B2
6678802 Hickson Jan 2004 B2
6687498 McKenna et al. Feb 2004 B2
6697415 Mahany Feb 2004 B1
6721334 Ketcham Apr 2004 B1
6721548 Mohindra et al. Apr 2004 B1
6725260 Philyaw Apr 2004 B1
6738629 McCormick et al. May 2004 B1
6747961 Ahmed et al. Jun 2004 B1
6756940 Oh et al. Jun 2004 B2
6760324 Scott et al. Jul 2004 B1
6785275 Boivie et al. Aug 2004 B1
6788938 Sugaya et al. Sep 2004 B1
6798788 Viswanath et al. Sep 2004 B1
6801782 McCrady et al. Oct 2004 B2
6826399 Hoffman et al. Nov 2004 B1
6839338 Amara et al. Jan 2005 B1
6839348 Tang et al. Jan 2005 B2
6839388 Vaidyanathan Jan 2005 B2
6847620 Meier Jan 2005 B1
6847892 Zhou et al. Jan 2005 B2
6856800 Henry et al. Feb 2005 B1
6865609 Gubbi et al. Mar 2005 B1
6879812 Agrawal et al. Apr 2005 B2
6901439 Bonasia et al. May 2005 B1
6917688 Yu et al. Jul 2005 B2
6934260 Kanuri Aug 2005 B1
6937566 Forslow Aug 2005 B1
6938079 Anderson et al. Aug 2005 B1
6957067 Iyer et al. Oct 2005 B1
6973622 Rappaport et al. Dec 2005 B1
6978301 Tindal Dec 2005 B2
6980533 Abraham et al. Dec 2005 B1
6985469 Leung Jan 2006 B2
6985697 Smith et al. Jan 2006 B2
6990348 Benveniste Jan 2006 B1
6993683 Bhat et al. Jan 2006 B2
6996630 Masaki et al. Feb 2006 B1
7013157 Norman et al. Mar 2006 B1
7020438 Sinivaara et al. Mar 2006 B2
7020773 Otway et al. Mar 2006 B1
7024199 Massie et al. Apr 2006 B1
7024394 Ashour et al. Apr 2006 B1
7027773 McMillin Apr 2006 B1
7031705 Grootwassink Apr 2006 B2
7035220 Simcoe Apr 2006 B1
7039037 Wang et al. May 2006 B2
7058414 Rofheart et al. Jun 2006 B1
7062566 Amara et al. Jun 2006 B2
7068999 Ballai Jun 2006 B2
7079537 Kanuri et al. Jul 2006 B1
7089322 Stallmann Aug 2006 B1
7092529 Yu et al. Aug 2006 B2
7110756 Diener Sep 2006 B2
7116979 Backes et al. Oct 2006 B2
7126913 Patel et al. Oct 2006 B1
7134012 Doyle et al. Nov 2006 B2
7139829 Wenzel et al. Nov 2006 B2
7142867 Gandhi et al. Nov 2006 B1
7146166 Backes et al. Dec 2006 B2
7155236 Chen et al. Dec 2006 B2
7155518 Forslow Dec 2006 B2
7158777 Lee et al. Jan 2007 B2
7159016 Baker Jan 2007 B2
7221927 Kolar et al. May 2007 B2
7224970 Smith et al. May 2007 B2
7239862 Clare et al. Jul 2007 B1
7246243 Uchida Jul 2007 B2
7263366 Miyashita Aug 2007 B2
7274730 Nakabayashi Sep 2007 B2
7280495 Zweig et al. Oct 2007 B1
7290051 Dobric et al. Oct 2007 B2
7293136 More et al. Nov 2007 B1
7310664 Merchant et al. Dec 2007 B1
7317914 Adya et al. Jan 2008 B2
7320070 Baum Jan 2008 B2
7324468 Fischer Jan 2008 B2
7324487 Saito Jan 2008 B2
7324489 Iyer et al. Jan 2008 B1
7336961 Ngan Feb 2008 B1
7349412 Jones et al. Mar 2008 B1
7350077 Meier et al. Mar 2008 B2
7359676 Hrastar Apr 2008 B2
7370362 Olson et al. May 2008 B2
7376080 Riddle et al. May 2008 B1
7379423 Caves et al. May 2008 B1
7382756 Barber et al. Jun 2008 B2
7417953 Hicks et al. Aug 2008 B2
7421248 Laux et al. Sep 2008 B1
7421487 Peterson et al. Sep 2008 B1
7440416 Mahany et al. Oct 2008 B2
7443823 Hunkeler et al. Oct 2008 B2
7447502 Buckley Nov 2008 B2
7451316 Halasz et al. Nov 2008 B2
7460855 Barkley et al. Dec 2008 B2
7466678 Cromer et al. Dec 2008 B2
7475130 Silverman Jan 2009 B2
7477894 Sinha Jan 2009 B1
7480264 Duo et al. Jan 2009 B1
7483390 Rover et al. Jan 2009 B2
7489648 Griswold Feb 2009 B2
7493407 Leedom et al. Feb 2009 B2
7505434 Backes Mar 2009 B1
7509096 Palm et al. Mar 2009 B2
7519372 MacDonald et al. Apr 2009 B2
7529925 Harkins May 2009 B2
7551574 Peden, II et al. Jun 2009 B1
7551619 Tiwari Jun 2009 B2
7558266 Hu Jul 2009 B2
7570656 Raphaeli et al. Aug 2009 B2
7573859 Taylor Aug 2009 B2
7577453 Matta Aug 2009 B2
7592906 Hanna et al. Sep 2009 B1
7603119 Durig et al. Oct 2009 B1
7603710 Harvey et al. Oct 2009 B2
7636363 Chang et al. Dec 2009 B2
7665132 Hisada et al. Feb 2010 B2
7680501 Sillasto et al. Mar 2010 B2
7693526 Qian et al. Apr 2010 B2
7706749 Ritala Apr 2010 B2
7715432 Bennett May 2010 B2
7716379 Ruan et al. May 2010 B2
7724703 Matta et al. May 2010 B2
7724704 Simons et al. May 2010 B2
7729278 Chari et al. Jun 2010 B2
7733868 Van Zijst Jun 2010 B2
7738433 Tao Jun 2010 B2
7746897 Stephenson et al. Jun 2010 B2
7788475 Zimmer et al. Aug 2010 B2
7805529 Galluzzo et al. Sep 2010 B2
7817554 Skog et al. Oct 2010 B2
7844298 Riley Nov 2010 B2
7856659 Keeler et al. Dec 2010 B2
7865713 Chesnutt et al. Jan 2011 B2
7873061 Gast et al. Jan 2011 B2
7894852 Hansen Feb 2011 B2
7912982 Murphy Mar 2011 B2
7920548 Lor et al. Apr 2011 B2
7929922 Kubo Apr 2011 B2
7945399 Nosovitsky et al. May 2011 B2
7986940 Lee et al. Jul 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8014404 Eki et al. Sep 2011 B2
8019082 Wiedmann et al. Sep 2011 B1
8019352 Rappaport et al. Sep 2011 B2
8116275 Matta et al. Feb 2012 B2
8140845 Buddhikot et al. Mar 2012 B2
8150357 Aragon Apr 2012 B2
8161278 Harkins Apr 2012 B2
8190750 Balachandran et al. May 2012 B2
8238942 Gast Aug 2012 B2
8270384 Cheng et al. Sep 2012 B2
20010007567 Ando et al. Jul 2001 A1
20010024953 Balogh Sep 2001 A1
20020021701 Lavian et al. Feb 2002 A1
20020052205 Belostotsky et al. May 2002 A1
20020060995 Cervello et al. May 2002 A1
20020062384 Tso May 2002 A1
20020069278 Forslow Jun 2002 A1
20020078361 Giroux et al. Jun 2002 A1
20020080790 Beshai Jun 2002 A1
20020082913 Li Jun 2002 A1
20020087699 Karagiannis et al. Jul 2002 A1
20020094824 Kennedy et al. Jul 2002 A1
20020095486 Bahl Jul 2002 A1
20020101868 Clear et al. Aug 2002 A1
20020116655 Lew et al. Aug 2002 A1
20020157020 Royer Oct 2002 A1
20020174137 Wolff et al. Nov 2002 A1
20020176437 Busch et al. Nov 2002 A1
20020188756 Weil et al. Dec 2002 A1
20020191572 Weinstein et al. Dec 2002 A1
20020194251 Richter et al. Dec 2002 A1
20030014646 Buddhikot et al. Jan 2003 A1
20030018889 Burnett et al. Jan 2003 A1
20030043073 Gray et al. Mar 2003 A1
20030055959 Sato Mar 2003 A1
20030107590 Levillain et al. Jun 2003 A1
20030120764 Laye et al. Jun 2003 A1
20030133450 Baum Jul 2003 A1
20030134642 Kostic et al. Jul 2003 A1
20030135762 Macaulay Jul 2003 A1
20030145081 Lau et al. Jul 2003 A1
20030156586 Lee et al. Aug 2003 A1
20030174706 Shankar et al. Sep 2003 A1
20030193910 Shoaib et al. Oct 2003 A1
20030204596 Yadav Oct 2003 A1
20030227934 White et al. Dec 2003 A1
20040002343 Brauel et al. Jan 2004 A1
20040003285 Whelan et al. Jan 2004 A1
20040008652 Tanzella et al. Jan 2004 A1
20040019857 Teig et al. Jan 2004 A1
20040025044 Day Feb 2004 A1
20040029580 Haverinen et al. Feb 2004 A1
20040030777 Reedy et al. Feb 2004 A1
20040030931 Chamandy et al. Feb 2004 A1
20040038687 Nelson Feb 2004 A1
20040044749 Harkin Mar 2004 A1
20040047320 Eglin Mar 2004 A1
20040049699 Griffith et al. Mar 2004 A1
20040053632 Nikkelen et al. Mar 2004 A1
20040054569 Pombo et al. Mar 2004 A1
20040054774 Barber et al. Mar 2004 A1
20040054926 Ocepek et al. Mar 2004 A1
20040062267 Minami et al. Apr 2004 A1
20040064560 Zhang et al. Apr 2004 A1
20040064591 Noble Apr 2004 A1
20040068668 Lor et al. Apr 2004 A1
20040078598 Barber et al. Apr 2004 A1
20040093506 Grawrock et al. May 2004 A1
20040095914 Katsube et al. May 2004 A1
20040095932 Astarabadi et al. May 2004 A1
20040106403 Mori et al. Jun 2004 A1
20040111640 Baum Jun 2004 A1
20040114546 Seshadri et al. Jun 2004 A1
20040119641 Rapeli Jun 2004 A1
20040120370 Lupo Jun 2004 A1
20040132438 White Jul 2004 A1
20040143428 Rappaport et al. Jul 2004 A1
20040143755 Whitaker et al. Jul 2004 A1
20040165545 Cook Aug 2004 A1
20040174900 Volpi et al. Sep 2004 A1
20040184475 Meier Sep 2004 A1
20040193709 Selvaggi et al. Sep 2004 A1
20040208570 Reader Oct 2004 A1
20040214572 Thompson et al. Oct 2004 A1
20040221042 Meier Nov 2004 A1
20040230370 Tzamaloukas Nov 2004 A1
20040233234 Chaudhry et al. Nov 2004 A1
20040236702 Fink et al. Nov 2004 A1
20040246937 Duong et al. Dec 2004 A1
20040246962 Kopeikin et al. Dec 2004 A1
20040252656 Shiu et al. Dec 2004 A1
20040255167 Knight Dec 2004 A1
20040259552 Ihori et al. Dec 2004 A1
20040259555 Rappaport et al. Dec 2004 A1
20040259575 Perez-Breva et al. Dec 2004 A1
20050015592 Lin Jan 2005 A1
20050021979 Wiedmann et al. Jan 2005 A1
20050025103 Ko et al. Feb 2005 A1
20050025105 Rue Feb 2005 A1
20050026611 Backes Feb 2005 A1
20050030894 Stephens Feb 2005 A1
20050030929 Swier et al. Feb 2005 A1
20050037733 Coleman et al. Feb 2005 A1
20050037818 Seshadri et al. Feb 2005 A1
20050040968 Damarla et al. Feb 2005 A1
20050054326 Rogers Mar 2005 A1
20050054350 Zegelin Mar 2005 A1
20050058132 Okano et al. Mar 2005 A1
20050059405 Thomson et al. Mar 2005 A1
20050059406 Thomson et al. Mar 2005 A1
20050064873 Karaoguz et al. Mar 2005 A1
20050068925 Palm et al. Mar 2005 A1
20050073980 Thomson et al. Apr 2005 A1
20050078644 Tsai et al. Apr 2005 A1
20050097618 Arling et al. May 2005 A1
20050114649 Challener et al. May 2005 A1
20050120125 Morten et al. Jun 2005 A1
20050122927 Wentink Jun 2005 A1
20050122977 Lieberman Jun 2005 A1
20050128142 Shin et al. Jun 2005 A1
20050128989 Bhagwat et al. Jun 2005 A1
20050144237 Heredia et al. Jun 2005 A1
20050147032 Lyon et al. Jul 2005 A1
20050157730 Grant et al. Jul 2005 A1
20050159154 Goren Jul 2005 A1
20050163078 Oba et al. Jul 2005 A1
20050163146 Ota et al. Jul 2005 A1
20050166072 Converse et al. Jul 2005 A1
20050175027 Miller et al. Aug 2005 A1
20050180345 Meier Aug 2005 A1
20050180358 Kolar et al. Aug 2005 A1
20050181805 Gallagher Aug 2005 A1
20050193103 Drabik Sep 2005 A1
20050207336 Choi et al. Sep 2005 A1
20050213519 Relan et al. Sep 2005 A1
20050220033 DelRegno et al. Oct 2005 A1
20050223111 Bhandaru et al. Oct 2005 A1
20050239461 Verma et al. Oct 2005 A1
20050240665 Gu et al. Oct 2005 A1
20050243737 Dooley et al. Nov 2005 A1
20050245258 Classon et al. Nov 2005 A1
20050245269 Demirhan et al. Nov 2005 A1
20050259597 Benedetto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050268335 Le et al. Dec 2005 A1
20050270992 Sanzgiri et al. Dec 2005 A1
20050273442 Bennett et al. Dec 2005 A1
20050276218 Ooghe et al. Dec 2005 A1
20050286466 Tagg et al. Dec 2005 A1
20060030290 Rudolf et al. Feb 2006 A1
20060035662 Jeong et al. Feb 2006 A1
20060039395 Perez-Costa et al. Feb 2006 A1
20060041683 Subramanian et al. Feb 2006 A1
20060045050 Floros et al. Mar 2006 A1
20060046744 Dublish et al. Mar 2006 A1
20060050742 Grandhi et al. Mar 2006 A1
20060064480 Lesartre et al. Mar 2006 A1
20060073847 Pirzada et al. Apr 2006 A1
20060094440 Meier et al. May 2006 A1
20060098607 Zeng et al. May 2006 A1
20060104224 Singh et al. May 2006 A1
20060114872 Hamada Jun 2006 A1
20060114938 Kalkunte et al. Jun 2006 A1
20060117174 Lee Jun 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060143496 Silverman Jun 2006 A1
20060143702 Hisada et al. Jun 2006 A1
20060152344 Mowery Jul 2006 A1
20060160540 Strutt et al. Jul 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060165103 Trudeau et al. Jul 2006 A1
20060168383 Lin Jul 2006 A1
20060173844 Zhang et al. Aug 2006 A1
20060174336 Chen Aug 2006 A1
20060178168 Roach Aug 2006 A1
20060182118 Lam et al. Aug 2006 A1
20060187878 Calhoun et al. Aug 2006 A1
20060189311 Cromer et al. Aug 2006 A1
20060190721 Kawakami et al. Aug 2006 A1
20060193258 Ballai Aug 2006 A1
20060200862 Olson et al. Sep 2006 A1
20060206582 Finn Sep 2006 A1
20060215601 Vleugels et al. Sep 2006 A1
20060217131 Alizadeh-Shabdiz et al. Sep 2006 A1
20060245393 Bajic Nov 2006 A1
20060248229 Saunderson et al. Nov 2006 A1
20060248331 Harkins Nov 2006 A1
20060268696 Konstantinov et al. Nov 2006 A1
20060274774 Srinivasan et al. Dec 2006 A1
20060276192 Dutta et al. Dec 2006 A1
20060285489 Francisco et al. Dec 2006 A1
20060292992 Tajima et al. Dec 2006 A1
20070002833 Bajic Jan 2007 A1
20070008884 Tang Jan 2007 A1
20070010248 Dravida et al. Jan 2007 A1
20070011318 Roth Jan 2007 A1
20070025265 Porras et al. Feb 2007 A1
20070025306 Cox et al. Feb 2007 A1
20070027964 Herrod et al. Feb 2007 A1
20070054616 Culbert Mar 2007 A1
20070058598 Ling Mar 2007 A1
20070064673 Bhandaru et al. Mar 2007 A1
20070064718 Ekl et al. Mar 2007 A1
20070067823 Shim et al. Mar 2007 A1
20070070937 Demirhan et al. Mar 2007 A1
20070076694 Iyer et al. Apr 2007 A1
20070081477 Jakkahalli et al. Apr 2007 A1
20070082677 Hart et al. Apr 2007 A1
20070083924 Lu Apr 2007 A1
20070086378 Matta et al. Apr 2007 A1
20070086397 Taylor Apr 2007 A1
20070086398 Tiwari Apr 2007 A1
20070091845 Brideglall Apr 2007 A1
20070091889 Xiao et al. Apr 2007 A1
20070098086 Bhaskaran May 2007 A1
20070104197 King May 2007 A1
20070106776 Konno et al. May 2007 A1
20070109991 Bennett May 2007 A1
20070110035 Bennett May 2007 A1
20070115842 Matsuda et al. May 2007 A1
20070133494 Lai et al. Jun 2007 A1
20070135159 Sinivaara Jun 2007 A1
20070135866 Baker et al. Jun 2007 A1
20070136372 Proctor et al. Jun 2007 A1
20070140163 Meier et al. Jun 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20070147318 Ross et al. Jun 2007 A1
20070150945 Whitaker et al. Jun 2007 A1
20070160046 Matta Jul 2007 A1
20070171909 Pignatelli Jul 2007 A1
20070183375 Tiwari Aug 2007 A1
20070183402 Bennett Aug 2007 A1
20070189222 Kolar et al. Aug 2007 A1
20070195793 Grosser et al. Aug 2007 A1
20070230457 Kodera et al. Oct 2007 A1
20070248009 Petersen Oct 2007 A1
20070253380 Jollota et al. Nov 2007 A1
20070255116 Mehta et al. Nov 2007 A1
20070258448 Hu Nov 2007 A1
20070260720 Morain Nov 2007 A1
20070268506 Zeldin Nov 2007 A1
20070268514 Zeldin et al. Nov 2007 A1
20070268515 Freund et al. Nov 2007 A1
20070268516 Bugwadia et al. Nov 2007 A1
20070286208 Kanada et al. Dec 2007 A1
20070287390 Murphy et al. Dec 2007 A1
20070291689 Kapur et al. Dec 2007 A1
20070297329 Park et al. Dec 2007 A1
20080002588 McCaughan et al. Jan 2008 A1
20080008117 Alizadeh-Shabdiz Jan 2008 A1
20080013481 Simons et al. Jan 2008 A1
20080014916 Chen Jan 2008 A1
20080031257 He Feb 2008 A1
20080039114 Phatak et al. Feb 2008 A1
20080049615 Bugenhagen Feb 2008 A1
20080052393 McNaughton et al. Feb 2008 A1
20080056200 Johnson Mar 2008 A1
20080056211 Kim et al. Mar 2008 A1
20080064356 Khayrallah Mar 2008 A1
20080069018 Gast Mar 2008 A1
20080080441 Park et al. Apr 2008 A1
20080102815 Sengupta et al. May 2008 A1
20080107077 Murphy May 2008 A1
20080114784 Murphy May 2008 A1
20080117822 Murphy et al. May 2008 A1
20080130523 Fridman et al. Jun 2008 A1
20080151844 Tiwari Jun 2008 A1
20080159319 Gast et al. Jul 2008 A1
20080162921 Chesnutt et al. Jul 2008 A1
20080220772 Islam et al. Sep 2008 A1
20080226075 Gast Sep 2008 A1
20080228942 Lor et al. Sep 2008 A1
20080250496 Namihira Oct 2008 A1
20080261615 Kalhan Oct 2008 A1
20080276303 Gast Nov 2008 A1
20090010206 Giaretta et al. Jan 2009 A1
20090028118 Gray et al. Jan 2009 A1
20090031044 Barrack et al. Jan 2009 A1
20090046688 Volpi et al. Feb 2009 A1
20090059930 Ryan et al. Mar 2009 A1
20090067436 Gast Mar 2009 A1
20090073905 Gast Mar 2009 A1
20090131082 Gast May 2009 A1
20090198999 Harkins Aug 2009 A1
20090247103 Aragon Oct 2009 A1
20090252120 Kim et al. Oct 2009 A1
20090257437 Tiwari Oct 2009 A1
20090260083 Szeto et al. Oct 2009 A1
20090274060 Taylor Nov 2009 A1
20090287816 Matta et al. Nov 2009 A1
20090293106 Gray et al. Nov 2009 A1
20100024007 Gast Jan 2010 A1
20100040059 Hu Feb 2010 A1
20100067379 Zhao et al. Mar 2010 A1
20100142478 Forssell et al. Jun 2010 A1
20100159827 Rhodes et al. Jun 2010 A1
20100180016 Bugwadia et al. Jul 2010 A1
20100261475 Kim et al. Oct 2010 A1
20100271188 Nysen Oct 2010 A1
20100329177 Murphy et al. Dec 2010 A1
20110128858 Matta et al. Jun 2011 A1
20110158122 Murphy et al. Jun 2011 A1
20110255466 Gast et al. Oct 2011 A1
20120144462 Pochop Jun 2012 A1
20120190320 Aragon Jul 2012 A1
20120190323 Aragon Jul 2012 A1
20120204031 Harkins Aug 2012 A1
Foreign Referenced Citations (19)
Number Date Country
0 992 921 Apr 2000 EP
1 542 409 Jun 2005 EP
2 329 801 Mar 1999 GB
2429080 Feb 2007 GB
2000-215169 Aug 2000 JP
2003-234751 Aug 2003 JP
2003274454 Sep 2003 JP
2004-032525 Jan 2004 JP
WO 9403986 Feb 1994 WO
WO 9911003 Mar 1999 WO
WO 0006271 Feb 2000 WO
WO 0018148 Mar 2000 WO
WO 02089442 Nov 2002 WO
WO 03085544 Oct 2003 WO
WO 2004013986 Feb 2004 WO
WO 2004095192 Nov 2004 WO
WO 2004095800 Nov 2004 WO
WO 2006014512 Feb 2006 WO
WO 2010130133 Nov 2010 WO
Non-Patent Literature Citations (194)
Entry
Acampora and Winters, “A Wireless Network for Wide-Band Indoor Communications,” IEEE Journal on selected Areas in Communications, vol. SAC-5, No. 5, Jun. 1987, pp. 796-804.
Acampora and Winters, “System Applications for Wireless Indoor Communications” IEEE Communications Magazine, vol. 25, No. 8, Aug. 1987, pp. 11-20.
Bing and Subramanian, “A New Multiaccess Technique for Multimedia Wireless LANs” IEEE Global Telecommunications Conference, Nov. 3-8, 1997, pp. 1318-1322.
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. 1988, pp. 1484-1496.
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, IEEE, 1980, pp. 69.7.1-69.7.4.
Fortune et al., “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, IEEE Computational Science and Engineering, p. 58-68 (1995).
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.
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.
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.
Kleinrock and Scholl, “Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of Data Users”, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois (1977).
LAN/MAN Standards 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).
Okamoto and Xu, IEEE, “Multimedia Communications over Wireless LANs via the SWL Protocol” Proceedings of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).
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.
Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1997, Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).
Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
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.
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).
Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
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 vol. 2 (Iscc''04)—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.
P. Martinez, M. Brunner, J. Quittek, F. Straus, J. SchonwIder, S. Mertens, T. Klie “Using the Script MIB for Policy-based Configuration Management”, Technical University Braunschweig, Braunschweig, Germany, 2002.
Law, A., “New Service Discovery Protocol,” Internet Citation [Online] XP002292473 Retrieved from the Internet: <URL: http://sern.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
P. Bahl et al., RADAR: An In-Building RF-based User Location and Tracking System, Microsoft Research, Mar. 2000, 10 pages.
Latvala J. et al., Evaluation of RSSI-Based Human Tracking, Proceedings for the 2000 European Signal Processing Conference, Sep. 2000, 9 pages.
Bahl P. et al. “User Location and Tracking in an In-Building Radio Network,” Microsoft Research, Feb. 1999, 13 pages.
P. Bahl et al., A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, Microsoft Research, Feb. 1999, 13 pages.
Chen, Yen-Chen et al., “Enabling Location-Based Services on Wireless LANs”, Networks, 2003. ICON2003. The 11th IEEE International Conference, Sep. 28-Oct. 1, 2003, pp. 567-572.
Erten, Y. Murat, “A Layered Security Architecture for Corporate 802.11 Wireless Networks”, Wireless Telecommunications Symposium, May 14-15, 2004, pp. 123-128.
Kleine-Ostmann, T., et al., “A Data Fusion Architecture for Enhanced Position Estimation in Wireless Networks,” IEEE Communications Letters , vol. 5(8), Aug. 2001, p. 343-345.
Pulson, Time Domain Corporation, Ultra wideband (UWB) Radios for Precision Location, Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 8 pages.
Barber, S., Monitoring 802.1 Networks, IEEE 802.11, Sydney, NSW, May 13-17, 2002.
Latvala, J. et al. “Patient Tracking in a Hospital Environment Using Extended Kalman-filtering,” Proceedings of the 1999 Middle East Conference on Networking, Nov. 1999, 5 pages.
Myllymaki, P. et al., “A Probabilistic Approach to WLAN User Location Estimation,” Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001, 12 pages.
Potter, B., and Fleck, B., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14 pages.
McCann, S., et al., “Emergency Services for 802,” IEEE 802.11-07/0505r1, Mar. 2007, 27 pages.
Di Sorte, D., et al., “On the Performance of Service Publishing in IEEE 802.11 Multi-Access Environment,” IEEE Communications Letters, vol. II, No. 4, Apr. 2007, 3 pages.
Microsoft Computer Dictionary, Fifth Edition, Microsoft Corporation, 2002, 2 pages.
Thomson, Allan, Cisco Systems, AP Power Down Notification, Power Point slide show; IEEE standards committee meeting Jul. 15, 2008; doc.: IEEE 802.11-08/0759r0, 14 pages.
3COM, Wireless LAN Mobility System: Wireless LAN Switch and Controller Configuration Guide, 3COM, Revision A, Oct. 2004, 476 pages.
3COM, Wireless LAN Switch Manager (3WXM), 3COM, Revision C, Oct. 2004, 8 pages.
3COM, Wireless LAN Switch and Controller; Quick Start Guide, 3COM, Revision B, Nov. 2004, 10 pages.
3COM, Wireless LAN Mobility System; Wireless LAN Switch and Controller Installation and Basic Configuration Guide, Revision B, Apr. 2005, 496 pages.
Johnson, David B, et al., “DSR The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Computer Science Department, Carnegie Mellon University, Nov. 3, 2005 (http://monarch.cs.rice.edu/monarch-papers/dsr-chapter00.pdf).
Information Sciences Institute, RFC-791 - Internet Protocol, DARPA, Sep. 1981.
Aerohive Blog, posted by Devin Akin, Cooperative Control: Part 3, [Online] Retrieved from the Internet: <URL: http://blog.aerohive.com/blog/?p=71> Mar. 1, 2010 (3 pages).
Wikipedia, Wireless LAN, 2 definitions for wireless LAN roaming, [Online] [retrieved Oct. 4, 2010] Retrieved from the Internet: <URL: http://en.wikipedia.org/wiki/Wireless—LAN> (1 page).
Sangheon Pack et al. “Fast-handoff support in IEEE 802.11 wireless networks,” IEEE Communications Surveys, IEEE, NY, NY, vol. 9, No. 1, Jan. 1, 2007 (pp. 2-12) ISSN: 1553-877X.
U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.
U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.
U.S. Appl. No. 09/866,474 filed May 29, 2001.
U.S. Appl. No. 13/017,801, filed Jan. 31, 2011.
Office Action for U.S. Appl. No. 12/957,997, mailed Aug. 28, 2012.
Office Action for U.S. Appl. No. 11/784,307, mailed Sep. 22, 2009.
Final Office Action for U.S. Appl. No. 11/784,307, mailed Jun. 14, 2010.
Non-Final Office Action for U.S. Appl. No. 11/377,859, mailed Jan. 8, 2008.
Final Office Action for U.S. Appl. No. 11/377,859, mailed Aug. 27, 2008.
Office Action for U.S. Appl. No. 12/401,073, mailed Aug. 23, 2010.
Final Office Action for U.S. Appl. No. 12/401,073, mailed Apr. 1, 2011.
Office Action for U.S. Appl. No. 12/401,073, mailed Sep. 20, 2011.
Office Action for U.S. Appl. No. 11/326,966, mailed Nov. 14, 2008.
Office Action for U.S. Appl. No. 12/500,392, mailed Jun. 20, 2011.
Office Action for U.S. Appl. No. 11/400,165, mailed Aug. 19, 2008.
Office Action for U.S. Appl. No. 12/489,295, mailed Apr. 27, 2011.
Final Office Action for U.S. Appl. No. 12/489,295, mailed Jan. 18, 2012.
Office Action for U.S. Appl. No. 11/330,877, mailed Sep. 11, 2008.
Final Office Action for U.S. Appl. No. 11/330,877, mailed Mar. 13, 2009.
Office Action for U.S. Appl. No. 11/330,877, mailed Aug. 6, 2009.
Final Office Action for U.S. Appl. No. 11/330,877, mailed Apr. 22, 2010.
Office Action for U.S. Appl. No. 11/330,877, mailed Jan. 13, 2011.
Final Office Action for U.S. Appl. No. 11/330,877, mailed May 27, 2011.
Office Action for U.S. Appl. No. 11/351,104, mailed Oct. 28, 2008.
Office Action for U.S. Appl. No. 11/351,104, mailed Dec. 2, 2009.
Final Office Action for U.S. Appl. No. 11/351,104, mailed Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/351,104, mailed May 26, 2010.
Office Action for U.S. Appl. No. 11/351,104, mailed Nov. 29, 2010.
Office Action for U.S. Appl. No. 11/351,104, mailed Jul. 26, 2011.
Office Action for U.S. Appl. No. 11/351,104, mailed Feb. 15, 2012.
Final Office Action for U.S. Appl. No. 11/351,104, mailed Aug. 14, 2012.
Non-Final Office Action for U.S. Appl. No. 11/351,104, mailed Dec. 17, 2012.
Office Action for U.S. Appl. No. 11/437,537, mailed Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,537, mailed Jul. 16, 2009.
Office Action for U.S. Appl. No. 11/331,789, mailed Jun. 13, 2008.
Final Office Action for U.S. Appl. No. 11/331,789, mailed Oct. 23, 2008.
Office Action for U.S. Appl. No. 11/331,789, mailed Aug. 5, 2009.
Office Action for U.S. Appl. No. 12/785,362, mailed Apr. 22, 2011.
Office Action for U.S. Appl. No. 11/417,830, mailed Nov. 14, 2008.
Final Office Action for U.S. Appl. No. 11/417,830, mailed May 28, 2009.
Office Action for U.S. Appl. No. 11/417,993, mailed Oct. 29, 2008.
Office Action for U.S. Appl. No. 12/370,562, mailed Sep. 30, 2010.
Office Action for U.S. Appl. No. 12/370,562, mailed Apr. 6, 2011.
Office Action for U.S. Appl. No. 12/370,562, mailed Jan. 17, 2012.
Final Office Action for U.S. Appl. No. 12/370,562, mailed Jul. 26, 2012.
Office Action for U.S. Appl. No. 11/592,891, mailed Jan. 15, 2009.
Final Office Action for U.S. Appl. No. 11/592,891, mailed Jul. 20, 2009.
Office Action for U.S. Appl. No. 11/595,119, mailed Jul. 21, 2009.
Final Office Action for U.S. Appl. No. 11/595,119, mailed Jan. 5, 2010.
Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 19, 2010.
Final Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 2, 2011.
Office Action for U.S. Appl. No. 11/604,075, mailed May 3, 2010.
Office Action for U.S. Appl. No. 13/437,669, mailed May 30, 2012.
Office Action for U.S. Appl. No. 13/437,673, mailed May 30, 2012.
Office Action for U.S. Appl. No. 11/845,029, mailed Jul. 9, 2009.
Final Office Action for U.S. Appl. No. 11/845,029, mailed Jan. 25, 2010.
Office Action for U.S. Appl. No. 11/845,029, mailed May 14, 2010.
Final Office Action for U.S. Appl. No. 11/845,029, mailed Dec. 9, 2010.
Office Action for U.S. Appl. No. 11/845,029, mailed Sep. 27, 2011.
Office Action for U.S. Appl. No. 11/437,538, mailed Dec. 22, 2008.
Final Office Action for U.S. Appl. No. 11/437,538, mailed Jun. 10, 2009.
Office Action for U.S. Appl. No. 11/437,387, mailed Dec. 23, 2008.
Final Office Action for U.S. Appl. No. 11/437,387, mailed Jul. 15, 2009.
Office Action for U.S. Appl. No. 11/437,582, mailed Jan. 8, 2009.
Final Office Action for U.S. Appl. No. 11/437,582, mailed Jul. 22, 2009.
Office Action for U.S. Appl. No. 12/683,281, mailed Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 12/683,281, mailed Sep. 21, 2012.
Office Action for U.S. Appl. No. 11/801,964, mailed Sep. 17, 2010.
Final Office Action for U.S. Appl. No. 11/801,964, mailed May 11, 2011.
Office Action for U.S. Appl. No. 12/304,100, mailed Jun. 17, 2011.
Final Office Action for U.S. Appl. No. 12/304,100, mailed Feb. 2, 2012.
Office Action for U.S. Appl. No. 12/304,100, mailed May 29, 2012.
Final Office Action for U.S. Appl. No. 12/304,100, mailed Dec. 11, 2012.
Office Action for U.S. Appl. No. 11/487,722, mailed Aug. 7, 2009.
Office Action for U.S. Appl. No. 11/643,329, mailed Jul. 9, 2010.
Office Action for U.S. Appl. No. 11/648,359, mailed Nov. 19, 2009.
Office Action for U.S. Appl. No. 11/944,346, mailed Nov. 23, 2010.
Office Action for U.S. Appl. No. 13/568,861, mailed Oct. 24, 2012.
Office Action for U.S. Appl. No. 12/077,051, mailed Dec. 28, 2010.
Final Office Action for U.S. Appl. No. 12/077,051, mailed Oct. 25, 2011.
Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 21, 2011.
Final Office Action for U.S. Appl. No. 12/113,535, mailed Jan. 3, 2012.
Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 20, 2012.
Office Action for U.S. Appl. No. 12/113,535, mailed Nov. 1, 2012.
Office Action for U.S. Appl. No. 11/852,234, mailed Jun. 29, 2009.
Office Action for U.S. Appl. No. 11/852,234, mailed Jan. 21, 2010.
Office Action for U.S. Appl. No. 11/852,234, mailed Aug. 9, 2010.
Office Action for U.S. Appl. No. 11/852,234, mailed Apr. 27, 2011.
Final Office Action for U.S. Appl. No. 11/852,234, mailed Jan. 20, 2012.
Office Action for U.S. Appl. No. 11/970,484, mailed Nov. 24, 2010.
Final Office Action for U.S. Appl. No. 11/970,484, mailed Jul. 22, 2011.
Office Action for U.S. Appl. No. 11/970,484, mailed Jun. 20, 2012.
Office Action for U.S. Appl. No. 12/172,195, mailed Jun. 1, 2010.
Office Action for U.S. Appl. No. 12/172,195, mailed Nov. 12, 2010.
Office Action for U.S. Appl. No. 12/172,195, mailed Feb. 14, 2013.
Office Action for U.S. Appl. No. 12/336,492, mailed Sep. 15, 2011.
Final Office Action for U.S. Appl. No. 12/336,492, mailed Jun. 15, 2012.
Office Action for U.S. Appl. No. 12/210,917, mailed Nov. 15, 2010.
Final Office Action for U.S. Appl. No. 12/210,917, mailed May 13, 2011.
Office Action for U.S. Appl. No. 12/210,917, mailed Dec. 5, 2011.
Office Action for U.S. Appl. No. 10/235,338, mailed Jan. 8, 2003.
Office Action for U.S. Appl. No. 11/094,987, mailed Dec. 27, 2007.
Final Office Action for U.S. Appl. No. 11/094,987, mailed May 23, 2008.
Office Action for U.S. Appl. No. 11/094,987, mailed Oct. 21, 2008.
Office Action for U.S. Appl. No. 12/474,020, mailed Jun. 3, 2010.
Final Office Action for U.S. Appl. No. 12/474,020, mailed Oct. 4, 2010.
Office Action for U.S. Appl. No. 09/866,474, mailed Nov. 30, 2004.
Final Office Action for U.S. Appl. No. 09/866,474, mailed Jun. 10, 2005.
Office Action for U.S. Appl. No. 10/667,027, mailed Jul. 29, 2005.
Final Office Action for U.S. Appl. No. 10/667,027, mailed Mar. 10, 2006.
Office Action for U.S. Appl. No. 10/667,027, mailed May 5, 2006.
Final Office Action for U.S. Appl. No. 10/667,027, mailed Feb. 26, 2007.
Office Action for U.S. Appl. No. 10/666,848, mailed Mar. 22, 2007.
Office Action for U.S. Appl. No. 10/667,136, mailed Jan. 25, 2006.
Office Action for U.S. Appl. No. 10/667,136, mailed Aug. 28, 2006.
Final Office Action for U.S. Appl. No. 10/667,136, mailed Mar. 9, 2007.
Extended Search Report for European Application No. 11188566.1, mailed Jan. 30, 2012.
International Search Report and Written Opinion for PCT/US05/004702, mailed Aug. 10, 2006.
International Search Report and Written Opinion for PCT/US2006/009525, mailed Sep. 13, 2007.
International Search Report and Written Opinion for PCT/US06/40500, mailed Aug. 17, 2007.
International Search Report and Written Opinion for PCT/US06/40498, mailed Dec. 28, 2007.
International Search Report and Written Opinion for PCT/US2007/012194 dated Feb. 4, 2008.
International Search Report and Written Opinion for PCT/US06/40499, mailed Dec. 13, 2007.
International Search Report and Written Opinion for PCT/US2007/19696, mailed Feb. 29, 2008.
International Search Report and Written Opinion for PCT/US2007/12016, mailed Jan. 4, 2008.
International Search Report and Written Opinion for PCT/US2007/012195, mailed Mar. 19, 2008.
International Search Report and Written Opinion for PCT/US07/013758 mailed Apr. 3, 2008.
First Office Action for Chinese Application No. 200780029623.X, mailed Dec. 31, 2010.
Second Office Action for Chinese Application No. 200780029623.X, mailed Mar. 7, 2012.
Third Office Action for Chinese Application No. 200780029623.X, mailed Sep. 29, 2012.
Extended Supplementary European Search Report for Application No. 07796005.2, mailed Feb. 14, 2012.
European Examination Report for Application No. 07796005.2, mailed Sep. 4, 2012.
International Search Report and Written Opinion for PCT/US07/013757, mailed Jan. 22, 2008.
International Search Report and Written Opinion for PCT/US07/14847, mailed Apr. 1, 2008.
International Search Report and Written Opinion for PCT/US07/089134, mailed Apr. 10, 2008.
International Search Report and Written Opinion for PCT/US2008/010708, mailed May 18, 2009.
Office Action for Canadian Application No. 2,638,754, mailed Oct. 3, 2011.
Supplementary Partial European Search Report for European Application No. 02770460, mailed Aug. 20, 2004.
Supplementary Partial European Search Report for European Application No. 02770460, mailed Dec. 15, 2004.
Examination Report for European Application No. 02770460, Mar. 18, 2005.
Summons for Oral Hearing Proceedings for European Application No. 02770460, Jan. 31, 2006.
International Search Report for PCT/US02/28090, mailed Aug. 13, 2003.
International Preliminary Examination Report for PCT/US02/28090, mailed Oct. 29, 2003.
Examination Report for European Application No. 06006504, mailed Oct. 10, 2006.
English Translation of Office Action for Japanese Application No. 2006-088348, mailed Jan. 4, 2011.
International Search Report and Written Opinion for PCT/US04/30769, mailed Oct. 4, 2005.
International Search Report and Written Opinion for PCT/US04/30683, mailed Feb. 10, 2006.
International Search Report and Written Opinion for PCT/US04/30684, mailed Feb. 10, 2006.
Related Publications (1)
Number Date Country
20120140705 A1 Jun 2012 US
Provisional Applications (1)
Number Date Country
60727025 Oct 2005 US
Continuations (2)
Number Date Country
Parent 12785362 May 2010 US
Child 13396124 US
Parent 11331789 Jan 2006 US
Child 12785362 US