System and method for network integrity

Information

  • Patent Grant
  • 8638762
  • Patent Number
    8,638,762
  • Date Filed
    Wednesday, February 8, 2006
    20 years ago
  • Date Issued
    Tuesday, January 28, 2014
    12 years ago
Abstract
A technique for maintaining network integrity is disclosed. A system according to the technique may include a wired network, a switch, and a wireless access point. The switch can be coupled to the wired network and the wireless access point can be coupled to the switch. The system may further include a forwarding database that stores a mac address for a plurality of devices seen by the switch on the wired network. A method according to the technique may involve detecting identifying information of a device by a wireless access point. The identifying information can be compared with the mac addresses in a forwarding database. If the device is unknown, the unknown device can be classified as rogue and countermeasures can be taken against the rogue device.
Description
CROSS REFERENCE TO RELATED APPLICATIONS

This Application claims the benefit of U.S. Provisional Application No. 60/727,025 filed on Oct. 13, 2005, which is incorporated by reference.


BACKGROUND

Wireless technology provides a mechanism for either replacing or extending traditional wired networks including, but not limited to, local area networks, personal area networks, and metropolitan area networks among others. Using radio frequency or non-radio frequency technology, wireless networks transmit and receive data over the air, through walls, ceilings and even cement structures without wired cabling.


A wireless network allows a mobile user to connect a local area network through a wireless connection according to a wireless protocol. Wireless protocols include, but are not limited to, IEEE 802.11a, 802.11b, 802.11c, 802.11g, HiperLan 2, or any other protocol for any point-to-point wireless link or network. These wireless protocols are designed to provide high bandwidth allocation while offering flexibility.


Unfortunately, wireless networks are particularly susceptible to unauthorized intrusion and malicious attacks due to the public nature of the radio bands used in enterprise networks. While some intruders are searching for free Internet access, others are intent on gaining access to an enterprise network for malicious purposes. These malicious purposes range from stealing and damaging data to disrupting legitimate communication.


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 improving wireless network integrity involves maintaining a forwarding database that can be used to identify devices on the network. An example of a system according to the technique includes a wired network, a switch, a wireless access point and a forwarding database. The switch can be coupled to the wired network and the wireless access point can be coupled to the switch. The forwarding database can include a medium access control (mac) address for each device seen by the switch on the wired network. In operation, identifying information of an unknown device can be detected by the wireless access point. The identifying information can be compared with the mac addresses in the forwarding database. If the identifying information matches a mac address in the forwarding database, the unknown device can be classified as rogue and countermeasures can be taken against the rogue device.


In alternate embodiments, the unknown device can be an unknown access point or an unknown client. Further, the identifying information collected by the wireless access point can be stored in a collated database located on the switch. In other embodiments, the collated database can be created by the wireless access point operating in promiscuous mode. The forwarding database can also be stored on the switch.


The system can further include an SSID database. An SSID of the unknown device can be detected by the wireless access point. The SSID of the unknown device can be compared with the SSID database. If a match exists, countermeasures can be taken against the unknown device. In another embodiment, a fingerprint can be inserted into packets sent by legitimate devices. If packets from the unknown device do not contain the fingerprint, but the source mac address matches that of one of the infrastructure access points, countermeasures can be taken against the unknown device.


An example of a method according to the technique involves detecting identifying information of a device. The identifying information can be checked to determine whether the identifying information matches wired network information. If a match exists, the device can be classified as rogue and/or countermeasures can be performed against the device.


In alternate embodiments, checking can involve comparing the identifying information of the device to mac addresses of devices seen on the wired network. In other embodiments, the method can further include inserting a fingerprint into packets sent by a legitimate device.


An exemplary switch can include a port, a processor, and memory. The memory may or may not include a forwarding database and a counter measure module. The port can be capable of connecting to a wired network. The processor can be capable of processing network information. The forwarding database can include a mac address for each device seen by the switch on the wired network. In operation, identifying information of an unknown device can be detected and compared with the forwarding database. If a match exists, the unknown device can be classified as rogue and countermeasures can be taken against the rogue device.


In additional embodiments, the identifying information can be detected by a wireless access point. Further, the identifying information can be stored in a collated database on the switch. The collated database can include an access point database and a client database which are created by the wireless access point operating in promiscuous mode. The switch can also be capable of sharing the forwarding database with other switches on the wired network. The countermeasures module can be capable of sending deauthenticate packets or disassociate packets to the rogue device in response to an attack.


The proposed system, method and device can offer, among other advantages, improved network integrity. This can be accomplished in an efficient and robust manner compared to other networks. Advantageously, the proposed system, method and device can identify and perform countermeasures against a variety of attacks, including, for example, wired network attacks, wireless network attacks, spoofing attacks, mac address masquerades and SSID masquerades. 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 inventions are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.



FIG. 1 depicts an example of a system having components that may improve network integrity.



FIG. 2 depicts an example of a system having components that may facilitate detection of an SSID masquerade.



FIG. 3 depicts an example of a system having components that may facilitate detection of a mac masquerade.



FIG. 4 depicts an example of a system having components that may facilitate detection and prevent attacks.



FIG. 5 depicts a flowchart of an example of a method for classifying an unknown device.



FIG. 6 depicts a flowchart of an example of a method for detecting a mac address masquerade.



FIG. 7 depicts a flowchart of an example of a method for detecting an SSID masquerade.



FIG. 8 depicts an example of a switch.





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 an example of a system 100 having components that may improve network integrity. In the example of FIG. 1, the system 100 includes a wired network 102, a switch 104, and an access point 106. In the example of FIG. 1, the switch 104 includes a forwarding database 108. The switch 104 is coupled to the wired network 102 and the access point 106 is coupled to the switch 104. In an embodiment, the switch 104 is connected to the wired network 102 via a wired connection, and the access point 106 is connected to the switch 104 via a wired connection. In alternate embodiments, one or both of these connections could be wireless. The forwarding database 108 may include mac addresses of devices connected to the wired network 102. The forwarding database 108 can be populated by analyzing each device coupled to each port of the switch 104. If a device is coupled to the switch 104, the device's mac address is automatically entered into the forwarding database 108. In another embodiment, the mac address of a device can be manually inputted into the forwarding database 108.


For illustrative purposes only, an unknown access point 110 is coupled to the wired network 102 and an unknown client 112 is wirelessly coupled to the unknown access point 110. Because the unknown access point 110 is coupled to the wired network 102, the mac address of the unknown access point 110 is located in the forwarding database 108.


In operation, the access point 106 detects packets sent from the unknown access point 110 to the unknown client 112. The packets presumably contain identifying information such as, for example, the mac address of the unknown access point 110. To, for example, determine whether the unknown access point 110 is a threat to the wired network 102, the access point 106 relays the identifying information to the switch 104 which performs a lookup in the forwarding database 108. If the mac address of the unknown access point 110 is in the forwarding database 108, the unknown access point 110 is connected to the wired network 102. An unknown access point connected to the wired network is typically considered a threat to the wired network. Therefore, in an embodiment, if the mac address of the unknown access point 110 is in the forwarding database 108, the unknown access point 110 is classified as a threat to the wired network 102. As such, countermeasures can be initiated against the unknown access point 110 and unknown client 112.


In other embodiments, the components of the system 100 and arrangement thereof can vary greatly. For example, the forwarding database 108 can be coupled to the system 100 in any convenient and/or known manner, including, by way of example, being on an access point, a client, another switch, a router, or any other device capable of storing a database and/or communicating over a network, locally or remotely.


In additional embodiments, the access point 106 can detect identifying information from unknown devices using any convenient and/or known technique, including, for example, active scan, promiscuous mode, or any other convenient and/or known scanning technique. For example, an access point operating in active scan can cycle through channels 1-14 of the 802.11 standard. An access point operating in promiscuous mode can sniff for all packets transmitted on a particular channel. In certain embodiments utilizing both active scan and promiscuous mode, the access point can go off channel for 30 milliseconds per second, or any other desired time interval, and sniff for packets to detect identifying information. The identifying information can include any wired and/or wireless network information including, but not limited to, a device mac address, source mac address, destination mac address, client mac address, SSID, BSSID, fingerprint and digital signature.


One or more radios can be coupled to the access point 106. In other embodiments, the radios can operate, by way of example but not limitation, in the 2.4 Ghz range (802.11 11b/11g) and/or the 5.0 GHz range (802.11 11a). In other embodiments, additional access points can be added and/or removed from the switch 104, additional switches can be added and/or removed from the wired network, additional unknown devices can be detected by the system, and additional databases can be added and/or removed from the system.



FIG. 2 depicts an example of a system 120 having components that may facilitate detection of an SSID masquerade. In the example of FIG. 2, the system 120 further includes an optional router 122, a first switch 124, a first access point 126, a second switch 128, a second access point 130 and a wired network 132. In the example of FIG. 2, the system 120 includes a forwarding database 134 and an SSID database 136. In an embodiment, the router 122, first switch 124, and second switch 128 are connected to the wired network 132 via wired connections. The first access point 126 is coupled to the first switch 124 via a wired connection and the second access point 130 is coupled to the second switch 128 via a wired connection. The first switch 124 and the second switch 128 are both coupled to the router 122 via wired connections. The forwarding database 134 and the SSID database 136 are also connected to the system 120 via wired connections. In alternate embodiments, one, some, or all of the wired connections could be wireless. The SSID database 136 contains an SSID of all legitimate devices coupled to the wired network 132.


In the example of FIG. 2, an unknown device 138 is assumed for illustrative purposes to be attacking the system 120 by performing an SSID masquerade. Specifically, the unknown device 138 is using the same SSID as the second access point 130. Because the SSIDs are the same, a known client 140 may send packets to the unknown device 138 instead of the second access point 130. In this way, the unknown device 138 may be able to capture packets, and potentially comprise network security.


In the example of FIG. 2, the system 120 is capable of discovering and disabling an SSID attack. Initially, the first access point 126 detects packets sent from/to the known client 140 to/from the unknown device 138. The packets presumably include identifying information including the SSID of the unknown device 138. The identifying information of the unknown device 138 can include, by way of example but not limitation, the mac address of the unknown device 138.


To determine whether the unknown device 138 is performing an SSID masquerade, the first access point 126 relays the identifying information including the SSID to the first switch 124 which performs a lookup in the SSID database 136. The SSID database 136 contains the SSIDs of all known, legitimate devices. The switches can share the SSIDs of the access points to populate an SSID database of all legitimate devices. Typically, the SSID database is located on each switch and contains the SSID of each access point connected to the switch. Since the access point is connected to the switch the mac address of each access point is associated with the SSID of the access point. Thus, if the SSID of the unknown device 138 matches an SSID in the SSID database, and the mac address of the unknown device is not recognized, it can be surmised that the unknown device 138 is masquerading the SSID of a legitimate device. Assuming the SSID of the unknown device matches the SSID of the access point 130, countermeasures can be initiated against the unknown device 138.


In other embodiments, the components of the system 120 and arrangements thereof can vary greatly. For example, the SSID database can be coupled to the system in any convenient and/or known manner, including, by way of example, being on the access point, a client, a switch, a router, or any other device capable of storing a database and/or communicating over a network, locally or remotely.



FIG. 3 depicts an example of a system 160 having components that may facilitate detection of a spoofing attack or a mac masquerade. In the example of FIG. 3, the system 160 includes a member switch 162, a first access point 164, a seed switch 166, a second access point 168, and a wired network 170. In the example of FIG. 3, the member switch 162 includes a first forwarding database 172 and the seed switch 166 includes a second forwarding database 174. In an embodiment, the member switch 162 and the seed switch 166 are coupled to the wired network 170 via wired connections and the first access point 164 and the second access point 168 are coupled respectively to the first switch 162 and the second switch 166 via a wired connection. In alternative embodiments, one, some, or all of these connections could be wireless.


In the example of FIG. 3, for illustrative purpose only, an unknown device 176 is attacking the system 160 by performing a spoofing attack or a mac masquerade. Specifically, the unknown device 176 is using the same mac address as the first access point 164. In one embodiment, the source mac address may be spoofed so that the known client 178 thinks that the packets are coming from the first access point 164. In other embodiments, the unknown device 176 may be trying to masquerade the mac address of the first access point 164 causing the known client 178 to send packets to the unknown device 176. In either example, because the mac addresses of the unknown device 176 is the same as first access point 164, a known client 178 is sending/receiving packets to/from the unknown device 176 instead of the first access point 164. In this way, the unknown device 176 may be able to capture/send packets, and potentially compromise network integrity.


In the example of FIG. 3, the system 160 is capable of discovering and disabling a spoofing attack or mac masquerade. Initially, the seed switch 166 generates a pseudo-random number which can serve as a fingerprint. The fingerprint can be, by way of example but not limitation, a 32-bit pseudo-random number. In other embodiments, the fingerprint may be any known and/or convenient mechanism for identifying packets. The seed switch 166 sends the fingerprint to the member switch 162 over the wired network 170. In alternative embodiments where more than one member exists, a seed switch can send the fingerprint to all member switches in the mobility domain. The seed switch can also change and resend the fingerprint to all members after a predetermined period of time. For example, the seed switch can change the fingerprint every ten minutes.


Once a fingerprint is generated and transmitted, the seed switch 166 configures the second access point 168 to include the fingerprint in, for example, the management and/or beacon frames transmitted by the second access point 168. The member switch 164 configures the first access point 164 to include the fingerprint in the management and/or beacon frames transmitted by the first access point. In alternative embodiments, all members in the mobility domain configure all connected access points to include the fingerprint in the management and/or beacon frames transmitted by the access points. In other embodiments, the fingerprint can be inserted into any of the packets, or any subset of the packets, transmitted by the access points.


The seed switch can have a forwarding database, a collated database, an access point database, a client database, and/or any other convenient and/or known database capable of storing wired and/or wireless information. Further, a seed and/or member can have any number of access points coupled thereto.


In operation, the second access point 168 detects packets sent from/to the known client 178 and to/from the unknown device 176, including the management and/or beacon frames. The second access point 168 relays the packets to the second switch 166. The second switch 166 determines whether the packets sent to/from the unknown device 176 contain the fingerprint that the access points were configured to transmit. If the packets from the unknown device 176 do not contain the fingerprint, the unknown device is presumably not legitimate and countermeasures can be initiated against the unknown device 176.



FIG. 4 depicts an example of a system 190 having components that may facilitate the detection and prevention of attacks. In the example of FIG. 4, the system 190 includes a seed switch 192, a first member switch 194, a first access point 196, a second member switch 198, a second access point 200 and a wired network 202. The system 190 may be referred to as a mobility-domain as a mobility domain typically includes a plurality of switches that share information among themselves. In the example of FIG. 4, the first member switch 194 includes a first forwarding database 204 and a first collated database 206 and the second member switch 198 includes a second forwarding database 208 and a second collated database 210. In an embodiment, the seed switch 192, the first member switch 194 and the second member switch 198 are connected to the wired network 202 via wired connections. Further, the first access point 196 and the second access point 200 are respectively coupled to the first switch 194 and the second switch 198 via a wired connection. In alternative embodiments, one, some, or all of these connections could be wireless.


The collated databases 206, 210 can be coupled to the system 190 in any convenient and/or known manner, including by way of example, being on a switch, an access point, a client, or any other device capable of storing a database and/or communicating over a network. The collated databases 206, 210 can be created by the access point and/or any other convenient and/or known device capable of creating a collated database. In certain embodiments, the collated databases 206, 210 can include an access point database, a client database, and/or any other database of wired and/or wireless network information.


In operation, the first access point 196 detects packets sent from/to an unknown device 212. The first access point 196 relays the identifying information to the first switch 194. The first switch 194 performs a lookup in the first forwarding database 204 and sends a message to the seed switch 192 to determine whether the identifying information is in any other switch's forwarding database. The seed switch 192 then performs a lookup in the second forwarding database 208 which is relayed to the seed switch 192 by the second switch 198. The seed switch 192 then sends a response to the first switch 194 indicating that the identifying information of the unknown device 212 does not match any entries in the second forwarding database 208. The forwarding databases 204, 208 presumably contain the mac addresses of all devices connected to the wired network 202. Since the forwarding databases 204, 208 do not contain the mac address of the unknown device 212, it may be surmised that the unknown device 212 is not connected to the wired network 202. By doing a lookup in the forwarding database of all switches in the mobility-domain and using the result of that lookup along with the information collected by all APs in the mobility-domain, it may be determined which device may be a threat.


In other embodiments, any number of switches can be coupled to the wired network to form a mobility domain. Also, any number of the switches can be designated as seeds, members and/or any other convenient and/or known designation capable of facilitating a mobility domain and/or enterprise network. Each access point can be capable of operating in active scan, promiscuous mode, or any other convenient and/or known scanning technique.



FIG. 5 depicts a flowchart 220 of an example of a method for classifying an unknown device and performing countermeasures. FIG. 5 is intended to illustrate detecting and classifying an unknown device. In the example of FIG. 5, the flowchart 220 starts at module 222 where identifying information of an unknown device is detected. Identifying information can be detected using a variety of techniques including active scan, promiscuous mode or any other convenient and/or known identifying technique. In one example, detecting identifying information can involve sniffing packets from/to the unknown device to determine a mac address, client mac address, and/or a destination mac address.


In the example of FIG. 5, the flowchart 220 continues at decision point 224 where it is determined whether identifying information matches wired network information. In one example, the switch can determine whether the mac address, client mac address, and/or destination mac address matches a mac address in the forwarding database. If the identifying information does not match wired network information (224-No), then at module 226 the unknown device may not be considered a threat to the wired network. If the identifying information does match wired network information (224-Yes), then the flowchart 220 continues at module 228 where the device is classified as rogue and at module 230 where countermeasures are performed against the rogue device. The countermeasures can include any convenient and/or known technique capable of disrupting a wired or wireless device connected to the network, including, but not limited to, a denial of service countermeasure involving sending disassociate and/or deauthenticate packets to the unknown device.



FIG. 6 depicts a flowchart 240 of an example of a method for detecting a mac address masquerade attack. FIG. 6 is intended to illustrate including a fingerprint in packets sent by legitimate devices and checking for the fingerprint in packets sent by an unknown device to determine whether the device is legitimate. In the example of FIG. 6, the flowchart 240 starts at module 242 where a fingerprint is included in packets sent by legitimate devices. The fingerprint can be included by any component connected to the enterprise network, including, but not limited to, an access point, a seed switch, a member switch, or any other convenient and/or known device that is connected to the wired network and is capable including a fingerprint into packets sent by legitimate devices.


In the example of FIG. 6, the flowchart 240 continues at module 244 where packets sent by the unknown device are analyzed. Analysis can include parsing the packets to determine the fingerprint, comparing sniffed packets to legitimate packets, or any other convenient and/or known technique that can be used to analyze packets for a fingerprint.


In the example of FIG. 6, the flowchart 240 continues at decision point 246 where it is determined whether the fingerprint is in packets sent by the unknown device. If the fingerprint is in the packets sent by the unknown device (246-Yes), then the flowchart 240 continues at module 248 where the unknown device is classified as legitimate. If the fingerprint is not in packets sent by the unknown device (246-No), then the flowchart continues at module 250 where countermeasures are performed against the unknown device. The countermeasures can include any convenient and/or known technique capable of disrupting a wired or wireless device connected to the network, including, but not limited to, a denial of service countermeasure involving sending disassociate and/or deauthenticate packets to the unknown device.



FIG. 7 depicts a flowchart 260 of an example of a method for detecting a SSID masquerade attack. FIG. 7 is intended to illustrate identifying an SSID of an unknown device and determining whether the device is legitimate. In the example of FIG. 7, the flowchart 260 starts at module 262 where an SSID of an unknown device is identified. The SSID of the unknown device can be identified using any convenient and/or known technique, including, but not limited to, sniffing packets from/to the device and analyzing the SSID associated with the packets.


In the example of FIG. 7, the flowchart 260 continues at module 264 where a lookup is performed in an SSID database. The SSID database can be located on any device including, but not limited to, a switch (seed or member), access point, or any other convenient and/or known memory device capable of communicating on a network.


In the example of FIG. 7, the flowchart 260 continues at decision point 266 where it is determined whether the SSID of the unknown device matches an SSID in the database. If no match exits (266-No), then module 268 classifies the device as not performing an SSID masquerade. If a match exits (266-Yes), then module 270 performs countermeasures against the device. The countermeasures can include any convenient and/or known technique capable of disrupting a wired or wireless device connected to the network, including, but not limited to, sending disassociate and/or deauthenticate packets to the unknown device.



FIG. 8 depicts an example of a switch 280. The switch 280 includes a port 282, a processor 284, a memory 286, a forwarding database 288, and a countermeasure module 290. In the example of FIG. 8, the port 282 is capable of being coupled to a wired network. In other examples, the port can be capable of being coupled to any convenient and/or known network, including, but not limited to a local area network, power line communication network, metropolitan area network, wide area network, personal network, storage area network, server farm, process control network, value added network, SOHO network, Wi-Fi wireless network, or XML appliance network. The processor 284 can be capable of processing network information, which can include for example, access point information, client information, wireless network information, wired network information, SSID information, fingerprint information, and/or any other information capable of being transmitted over a network. In the example of FIG. 8, the forwarding database is stored in the memory 286. In other examples, a collated database can be also be stored in the memory, where the collated database includes an access point database and a client database. In addition examples, the memory 286 can be any convenient and/or known data storage device, including but not limited to, DRAM, EPROM, EEPROM, flash memory, NVRAM, MRAM, RAM, ROM, SRAM, VRAM, or WRAM, which can be removable, nonremovable, volatile and/or nonvolatile. The countermeasure module, in the example of FIG. 8, can be capable of disrupting a wired or wireless device connected to the network utilizing any known and/or convenient countermeasures, including, but not limited to, sending disassociate and/or deauthenticate packets to an unknown device.


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 system, comprising: an access point configured to be coupled to (1) a network associated with a fingerprint unique to the network and (2) a forwarding database storing an identifier for a first device coupled to the network, the fingerprint having a value other than an identifier for the network and the value of the fingerprint being changed after a period of time;the access point configured to detect an identifier of a second device within a packet forwarded on the network;the access point configured to compare the identifier of the second device with the identifier of the first device stored in the forwarding database; andthe access point configured to classify the second device as a rogue device when (1) the identifier of the second device matches the identifier of the first device stored in the forwarding database and (2) the packet does not include the fingerprint.
  • 2. A system as recited in claim 1, wherein the access point is a first access point and the second device is a second access point.
  • 3. A system as recited in claim 1, wherein the access point configured to (1) operate in a promiscuous mode and (2) define a collated database.
  • 4. A system as recited in claim 1, wherein the forwarding database is stored on a switch coupled to the network.
  • 5. A system as recited in claim 1, wherein the identifier of the second device is one of a MAC address or an SSID.
  • 6. A system as recited in claim 5, wherein the second device is performing an SSID masquerade.
  • 7. A system as recited in claim 1 wherein the access point is a first access point, the system further comprising: a second access point configured to be coupled to the network and a second forwarding database storing an identifier of a third device coupled to the network;the first access point configured to compare the identifier of the second device with the identifier of the third device stored in the second forwarding database; andthe first access point configured to classify the second device as a rogue device when (1) the identifier of the second device matches the identifier of the third device stored in the second forwarding database and (2) a packet from the third device does not include the fingerprint.
  • 8. A system as recited in claim 7, wherein the first access point is configured to be coupled to the network via a seed switch and the second access point is coupled to the network via a member switch.
  • 9. A system as recited in claim 1, wherein the access point is configured to disrupt communications between the second device and the network if the second device is classified as the rogue device.
  • 10. A system as recited in claim 1, wherein the second device is an unknown client.
  • 11. The system of claim 1, wherein the access point is configured to be coupled to the network such that the fingerprint is distributed to the first device, which is legitimately coupled to the network and not the second device.
  • 12. The system of claim 1, wherein the access point is configured to be coupled to the network such that the fingerprint is distributed to devices connected to a wired portion the network.
  • 13. The system of claim 1, wherein the fingerprint is a pseudo-random number.
  • 14. The system of claim 1, wherein the period of time is a predetermined period of time.
  • 15. The system of claim 1, wherein the fingerprint has a value other than an identifier for a device.
  • 16. An apparatus, comprising: a countermeasure module configured to be coupled to (1) a network associated with a fingerprint unique to the network and (2) a forwarding database storing an identifier for a first device coupled to the network, the fingerprint having a value other than an identifier for the network and the value of the fingerprint being changed after a period of time;the countermeasure module configured to receive an indication that (1) a second device coupled to the network is assigned with an identifier corresponding to the identifier of the first device and (2) a packet sent from the second device does not include the fingerprint; andthe countermeasure module configured to disrupt communication between the second device and the network in response to the indication.
  • 17. The apparatus as recited in claim 16, further comprising a port configured to be connected to an access point detecting the identifier of the first device and the identifier of the second device.
  • 18. The apparatus as recited in claim 16, further comprising an access point configured to operate in a promiscuous mode to define an access point database and client database.
  • 19. The apparatus as recited in claim 16, wherein the countermeasure module is a first countermeasure module, the apparatus further including the forwarding database, the forwarding database configured to be operatively coupled to a second countermeasure module coupled to the network.
  • 20. The apparatus as recited in claim 16, wherein the countermeasure module is configured to send at least one of a deauthenticate packet or a disassociate packet to the second device.
  • 21. A method, comprising: receiving a packet, from a network associated with a fingerprint, at an access point, the fingerprint being unique to the network and the fingerprint having a value other than an identifier for the network and the value of the fingerprint being changed after a period of time;detecting an identifier of a first device in the packet;comparing the identifier of the first device with an identifier of a second device stored in a database; andclassifying the first device as rogue if (1) the identifier of the first device matches the identifier of the second device stored in the database and (2) the packet from the first device does not include the fingerprint.
  • 22. A method as recited in claim 21, further comprising operating an access point in a promiscuous mode to define the database.
  • 23. A method as recited in claim 21, wherein the database is a first database associated with a first access point further comprising: comparing the identifier of the first device with an identifier of a third device stored in a second database associated with a second access point; andclassifying the first device as a rogue device if (1) the identifier of the first device matches the identifier of the third device stored in the second database and (2) the packet from the first device does not include the fingerprint.
  • 24. A method as recited in claim 21, further comprising disrupting communication between the first device and a network including the access point in response to classifying the first device as a rogue device.
US Referenced Citations (604)
Number Name Date Kind
3641433 Mifflin et al. Feb 1972 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 et al. Jul 1994 A
5339316 Diepstraten Aug 1994 A
5371783 Rose et al. Dec 1994 A
5418812 Reyes et al. May 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
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
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 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 Watanabe 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
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
6574240 Tzeng Jun 2003 B1
6580700 Pinard et al. Jun 2003 B1
6587680 Ala-Laurila et al. Jul 2003 B1
6587835 Treyz et al. Jul 2003 B1
6603970 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
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
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
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
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
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 et al. 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
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
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
7636363 Chang et al. Dec 2009 B2
7680501 Sillasto et al. Mar 2010 B2
7693526 Qian et al. 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
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
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
8019082 Wiedmann et al. Sep 2011 B1
8116275 Matta et al. Feb 2012 B2
8150357 Aragon Apr 2012 B2
8161278 Harkins Apr 2012 B2
20010024953 Balogh Sep 2001 A1
20020021701 Lavian et al. Feb 2002 A1
20020052205 Belostofsky 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
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
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
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
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
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
20040259542 Viitamaki et al. 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
20050154933 Hsu 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
20050190714 Gorbatov et al. Sep 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 Benedetotto et al. Nov 2005 A1
20050259611 Bhagwat et al. Nov 2005 A1
20050270992 Sanzgiri et al. Dec 2005 A1
20050273442 Bennett 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
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
20060117174 Lee Jun 2006 A1
20060128415 Horikoshi et al. Jun 2006 A1
20060143496 Silverman 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
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
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
20070147318 Ross et al. Jun 2007 A1
20070150945 Whitaker et al. Jun 2007 A1
20070160046 Matta Jul 2007 A1
20070171909 Pignatelli Jul 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
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
20080096575 Aragon 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
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
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 Peden, II et al. Nov 2009 A1
20100002610 Bowser et al. Jan 2010 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
20100172276 Aragon Jul 2010 A1
20100180016 Bugwadia et al. Jul 2010 A1
20100195549 Aragon et al. Aug 2010 A1
20100261475 Kim et al. 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
Foreign Referenced Citations (18)
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
WO9403986 Feb 1994 WO
WO9911003 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
Non-Patent Literature Citations (247)
Entry
U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.
U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy, James.
U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy, James.
U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.
U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari, Manish.
U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.
U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.
U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.
U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast, Mathew S.
U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.
U.S. Appl. No. 11/944.346, filed Nov. 2007, Gast, Mathew S.
U.S. Appl. No. 11/966,912, filed Dec. 2007, Chesnutt et al.
U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast, Mathew S.
U.S. Appl. No. 11/495,134, filed Oct. 2007, Aragon et al.
U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Mathew S.
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.
Puttini, R., Percher, J., Me, L., and De Sousa, R. 2004. A Fully Distributed IDS for Manet. In Proceedings of the Ninth international Symposiun on Computers and Communications 2004 vol. 2 (Issc″04)-vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washinaton. DC, 331-338.
Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.
Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.
Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.
Co-pending U.S. Appl. No. 12/401,473, filed Mar. 10, 2009.
Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.
Co-pending U.S. Appl. No. 12/500,392, filed Jul. 9, 2009.
Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.
Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.
Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.
Co-pending U.S. Appl. No. 12/491,201, filed Jun. 24, 2009.
Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.
Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.
Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.
Co-pending U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.
Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.
Co-pending U.S. Appl. No. 11/604,075, filed Nov. 22, 2006.
Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.
Co-pending U.S. Appl. No. 11/643,329, filed Dec. 20, 2006.
Co-pending U.S. Appl. No. 11/975,134, filed Oct. 16, 2007.
Co-pending U.S. Appl. No. 11/966,912, filed Dec. 28, 2007.
Co-pending U.S. Appl. No. 12/131,028, filed May 3, 2008.
Co-pending U.S. Appl. No. 12/336,492, filed Dec. 16, 2008.
Notice of Allowance Mailed Feb. 26, 2007 in Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.
Non-Final Office Action Mailed Sep. 22, 2009 in Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.
Notice of Allowance Mailed Feb. 27, 2009 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.
Final Office Action Mailed Aug. 27, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.
Non-Final Office Action Mailed Jan. 8, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.
Notice of Allowance Mailed Jun. 11, 2009 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.
Non-Final Office Action Mailed Nov. 10, 2008 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.
Non-Final Office Action Mailed Dec. 2, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.
Final Office Action Mailed Jun. 10, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.
Non-Final Office Action Mailed Oct. 28, 2008 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.
Notice of Allowance Mailed Feb. 23, 2010 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.
Non-Final Office Action Mailed Aug. 5, 2009 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.
Final Office Action Mailed Oct. 23, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.
Non-Final Office Action Mailed Jun. 13, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.
Notice of Allowance Mailed Jun. 16, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.
Non-Final Office Action Mailed Feb. 17, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.
Final Office Action Mailed May 28, 2009 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.
Non-Final Office Action Mailed Nov. 14, 2008 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.
Notice of Allowance Mailed Apr. 23, 2009 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.
Non-Final Mailed Aug. 19, 2008 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.
Final Office Action Mailed Jul. 20, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.
Non-Final Office Action Mailed Jan. 14, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.
Final Office Action Mailed Jan. 5, 2010 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.
Non-Final Office Action Mailed Jul. 21, 2009 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.
Non-Final Office Action Mailed Aug. 7, 2009 in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.
International Search Report PCT/US05/004702 dated Aug. 10, 2006, pp. 1-3.
Written Opinion PCT/US05/004702 dated Aug. 10, 2006, pp. 1-5.
International Search Report PCT/US06/09525 dated Sep. 13, 2007, pp. 1-2.
Written Opinion PCT/US06/09525 dated Sep. 13, 2007, pp. 1-7.
International Search Report PCT/US06/40498 dated Dec. 28, 2007, pp. 1-2.
Written Opinion PCT/US06/40498 dated Dec. 28, 2007, pp. 1-5.
International Search Report PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.
Written Opinion PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.
International Search Report PCT/US07/089134 dated Apr. 10, 2008, pp. 1-3.
Written Opinion PCT/US07/089134 dated Apr. 10, 2008, pp. 1-4.
Notice of Allowance Mailed Mar. 19, 2010, in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.
Notice of Allowance Mailed Feb. 23, 2010 in Co-pending U.S. Appl. No. 11/331,789 filed Jan. 14, 2006.
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.
Co-pending U.S. Appl. No. 12/401,073, filed Mar. 10, 2009.
Co-pending U.S. Appl. No. 12/489,295, filed Jun. 22, 2009.
Final Office Action mailed Apr. 22, 2010, in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.
Non-Final Office Action Mailed May 3, 2010, in Co-pending U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.
Co-pending U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.
Co-pending U.S. Appl. No. 12/785,362, filed May 21, 2010.
P. Martinez, M. Brunner, J. Quittek, F. Straus, J. Schonwlder, 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://sem.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 pp.
Di Sorte, D., et al., “On the Performance of Service Publishing in IEEE 802.11 Multi-Access Environment,” IEEE Communications Letters, vol. 11, 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/monarchpapers/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).
U.S. Appl. No. 12/957,997, filed Dec. 1, 2010.
U.S. Appl. No. 09/866,474, filed May 29, 2001.
U.S. Appl. No. 13/017,801, filed Jan. 31, 2011.
Final Office Action for U.S. Appl. No. 11/784,307, mailed Jun. 14, 2010.
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. 12/500,392, mailed Jun. 20, 2011.
Office Action for U.S. Appl. No. 12/489,295, mailed Apr. 27, 2011.
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.
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/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. 12/785,362, mailed Apr. 22, 2011.
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. 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/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. 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.
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. 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. 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.
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. 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/336,492, mailed Sep. 15, 2011.
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. 12/350,927, mailed Aug. 17, 2011.
Office Action for U.S. Appl. No. 12/365,891, mailed Aug. 29, 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.
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/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. 2007800229623.X , mailed Dec. 31, 2010.
International Search Report and Written Opinion for PCT/US07/013757, mailed Jan. 22, 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.
U.S. Patent Application No. 13/437,669, filed Apr. 2, 2012.
U.S. Patent Application No. 13/437,673, filed Apr. 2, 2012.
Final Office Action for U.S. Appl. No. 12/489,295, mailed Jan. 18, 2012.
Office Action for U.S. Appl. No. 12/370,562, mailed Jan. 17, 2012.
Office Action for U.S. Appl. No. 12/683,281, mailed Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 12/304,100, mailed Feb. 2, 2012.
Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 20, 2012.
Final Office Action for U.S. Appl. No. 11/852,234, mailed Jan. 20, 2012.
Final Office Action for U.S. Appl. No. 12/350,927 mailed Jan. 18, 2012.
Second Office Action for Chinese Application No 200780029623.X , mailed Mar. 7, 2012.
Extended Supplementary European Search Report for Application No. 07796005.2, mailed Feb. 14, 2012.
U.S. Appl. No. 11/326,966, filed Jan. 5, 2006, Taylor.
U.S. Appl. No. 11/330,877, filed Jan. 11, 2006, Matta.
U.S. Appl. No. 11/331,789, filed Jan. 14, 2006, Matta, et al.
U.S. Appl. No. 11/377,859, filed Mar. 15, 2006, Harkins.
U.S. Appl. No. 11/400,165, filed Apr. 5, 2006, Tiwari.
U.S. Appl. No. 11/445,750, filed May 3, 2006, Matta.
U.S. Appl. No. 11/417,830, filed May 30, 2006, Morain.
U.S. Appl. No. 11/417,993, filed May 3, 2006, Jar et al.
U.S. Appl. No. 11/437,537, filed May 19, 2006, Freund et al.
U.S. Appl. No. 11/437,538, filed May 19, 2006, Zeldin.
U.S. Appl. No. 11/437,387, filed May 19, 2006, Zeldin et al.
U.S. Appl. No. 11/437,582, filed May 19, 2006, Bugwadia et al.
U.S. Appl. No. 11/451,704, filed Jun. 12, 2006, Riley.
Acampora and Winters, IEEE Communications Magazine, 25 (8):11-20 (1987).
Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).
Bing and Subramanian, IEEE, 1318-1322 (1997).
Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.
Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, 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, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).
LAN/MAN Standars Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).
Okamoto and Xu, IEEE, Proceeding so 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 1977 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.
Related Publications (1)
Number Date Country
20070183375 A1 Aug 2007 US