US 7,865,713 B2Grant

Application-aware wireless network system and method

Issue Date:2011-01-04

•20 Claims

•9 Drawing Sheets

Abstract

A technique for dynamically responding to threats in a wireless network involves deploying a single network including APs capable of booting from a plurality of software images. Individual APs can switch (or be switched) between multiple sets of software so that network managers can select the AP software most appropriate for a given instance. For example, if a threat is detected, multiple APs can be switched to sensor mode to deal with the threat. As another example, all of the APs can be switched to sensor mode after hours. Alternatively, a server can provide the software image(s) needed for an AP to operate in accordance with a desired functionality.

Metadata

Assignee

Trapeze Networks, Inc.

Inventors

Stan Chesnutt
Jamsheed Bugwadia
Yun Freund
Roy Gignac
Matthew Stuart Gast
Dan Simone
Gary Eugene Morain

Application Information

Application Number:US 11/966,912

Filing Date:2007-12-28

Priority Date:2006-12-28

Art Unit:2115

Classifications

IPC:

G06F9/00G06F9/24G06F15/177

Patent Drawings (9 sheets)

Description

Cross-Reference to Related Applications

[0001] This application claims priority to U.S. Provisional Patent Application No. 60/877,907, filed Dec. 28, 2006, which is hereby incorporated by reference in its entirety.

Background

[0002] An access point (AP) is a device used by wireless clients to connect to a network. An AP functions as a standalone entity in some implementations and functions in cooperation with distribution hardware in other implementations. Distribution hardware may include a wireless switch used to manage APs and provide network-connectivity to wireless clients. A wireless domain may refer to a group of wireless switches that are configured to exchange relevant information, and using this information make informed decisions. A known device is a station (e.g., a wireless AP or client device) that is part of a network wireless installation. A rogue device is a station that is considered harmful for a network wireless installation because it is, for example, violating policies or hampering wireless access to the network.

[0003] A traditional approach to rogue detection has been to (1) use a second set of hardware in addition to APs, or (2) provide an integrated network that provides both data services and rogue detection services. The advantage of the first approach is that a user can select the best devices for the job, though this often results in higher capital and operational expenditures. The second approach saves money by using a single network and point of administration, but the user may have to compromise product feature sets because of the need to use a single vendor.

[0004] These are but a subset of the problems and issues associated with wireless access point authentication, and 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

[0005] 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.

[0006] A technique for dynamically responding to threats in a wireless network involves deploying a single network including APs capable of booting from a plurality of software images. Individual APs can switch (or be switched) between multiple sets of software so that network managers can select the AP software most appropriate for a given instance. For example, if a threat is detected, multiple APs can be switched to sensor mode to deal with the threat. As another example, all of the APs can be switched to sensor mode after hours. Alternatively, a server can provide the software image(s) needed for an AP to operate in accordance with a desired functionality.

[0007] The proposed system can offer, among other advantages, improved wireless network functionality. This and other advantages of the techniques described herein 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

[0008] 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.

[0009] FIGS. 1A and 1B depict an example of a system having a plurality of multi-boot access points (APs).

[0010] FIGS. 2A, 2B, and 2C depict a wireless domain that includes a plurality of multi-boot APs.

[0011] FIG. 3 depicts an example of a multi-boot AP device.

[0012] FIG. 4 depicts an example of a system for changing boot1 statically at an AP.

[0013] FIG. 5 depicts an example of a system for changing boot1 dynamically at an AP.

[0014] FIG. 6 depicts a flowchart 600 of an example of a method for booting an AP using a boot image.

Detailed Description

[0015] 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.

[0016] FIGS. 1A and 1B depict an example of a system 100 having a plurality of multi-boot access points (APs). In the example of FIGS. 1A and 1B, the system 100 includes distribution system 102, and a plurality of multi-boot APs 104-1 to 104-N (referred to collectively as multi-boot APs 104). In the example of FIG. 1A, the system 100 includes a station 110 that is associated, for illustrative purposes, with the multi-boot AP 104-2. Presumably, since the station 106 has associated with the multi-boot AP 104-2, the multi-boot AP 104-2 has booted software that enables operation as a traditional AP. However, any of the multi-boot APs 104 can be switched to a different mode by booting different software.

[0017] In the example of FIG. 1B, the multi-boot AP 104-2 becomes aware that the station 106 is a rogue 108. When the multi-boot AP 104-2 becomes aware of the rogue 108, the association ends. Although in the example of FIG. 1B the rogue 108 appears to be disassociated from the multi-boot AP 104-2, the rogue 108 could be detected before an actual association with the multi-boot AP 104-2.

[0018] The determination that the station 106 is the rogue 108 may be made at the distribution system 102, or by some other one or more of the multi-boot APs 104 that are configured in, for example, a sensor mode. The multi-boot AP 104-2 can be rebooted with different software that gives the multi-boot 104-2, e.g., sensor functionality to help deal with the rogue 108 with, e.g., countermeasures. In an illustrative embodiment, when the multi-boot AP 104-2 is in sensor mode, no association is possible. Some of the advantages of the system 100 are explored later.

[0019] FIGS. 2A, 2B, and 2C depict a wireless domain 200 that includes a plurality of multi-boot APs. The wireless domain 200 may include, by way of example but not limitation, a Trapeze Networks, Inc. MOBILITY DOMAIN™ wireless domain. In the example of FIG. 2A, the wireless domain 200 includes a plurality of multi-boot APs 202 configured in network connectivity mode (APs 202) and a plurality of multi-boot APs 204 configured in sensor mode (sensors 204). The APs 202 and the sensors 204 are organized in an arbitrary or implementation-specific pattern in the mobility domain 200.

[0020] In the example of FIG. 2B, a rogue 206 is detected in the wireless domain 200. When the rogue 206 is detected, an alarm may be generated. The alarm can lead to a change in the functionality of the APs 202 and/or sensors 204. One example of a change is illustrated in the example of FIG. 2C.

[0021] In the example of FIG. 2C, APs 202 in the vicinity of the rogue 206 are switched to sensors 204. For illustrative purposes, the changed sensors are shaded in the example of FIG. 2C. In an illustrative embodiment, the determination as to which APs to change to sensors may depend upon implementation-specific configurations or capabilities. For example, APs may be changed to sensors when a risk score exceeds a threshold value.

[0022] In another illustrative embodiment, the threshold value may be set, and the risk score may increase based upon activities or events associated with a station. In another illustrative embodiment, the number of APs to convert is also either statically or dynamically configurable. For example, the number of APs converted may be based upon the severity of an event that triggers the conversion. In another illustrative embodiment, multiple APs may be converted for other reasons. For example, if at least three APs are in sensor mode, then triangulation may be facilitated. Additional APs may improve the accuracy of a triangulation technique.

[0023] In another illustrative embodiment, the amount of investigation predicted to be required may have a bearing on the number of APs converted. In another illustrative embodiment, the system may convert APs depending upon the location of the event that triggers the conversion. In another illustrative embodiment, the location of the APs may have a bearing upon the choice of APs to convert. In another illustrative embodiment, the amount of load on an AP may have a bearing on whether the AP is converted. For example, if an AP that has a lot of stations associated with it is selected for conversion to a sensor, it may be decided that the conversion is not worth the disruption of service to the associated stations, if any.

[0024] FIG. 3 depicts an example of a multi-boot AP device 300. In the example of FIG. 3, the device 300 includes memory 302, a processor 304, one or more radios 306-1, 306-2 (referred to collectively as radios 306), a primary boot 308, one or more supplemental boots 310-1, 310-2 (referred to collectively as supplemental boots 310), one or more network interfaces 312-1, 312-2 (referred to collectively as network interfaces 312), and a bus 314 to which each of the other components are coupled.

[0025] In an illustrative embodiment, the memory 302 may be primary memory such as random access memory (RAM). Any applicable known or convenient memory may be used. In an illustrative embodiment, the processor 304 may be a central processing unit (CPU), a microprocessor, or some other processor capable of executing code stored in the memory 302. Any applicable known or convenient processor may be used. In an illustrative embodiment, the radios 306 may be set to work on the same technology/protocol. The radios may have different configurations, such as different channel operations or modes. The radios 306 may also be set to work on different technology/protocols, such as 802.11a for one and 802.11b/g for another. Any known or convenient radio technology may be used.

[0026] In an illustrative embodiment, the primary boot 308 is embodied in a computer-readable medium. The computer-readable medium may include, by way of example but not limitation, flash memory. In an illustrative embodiment, the supplemental boots 310 are embodied in a computer-readable medium, as well. In an illustrative embodiment, the network interfaces 312 may include Ethernet interfaces. However, any applicable known or convenient network interfaces could be used.

[0027] In an illustrative embodiment that has two boot partitions, boot0 and boot1, the primary boot 308 is the first boot partition, boot0, and a supplemental boot 310-1 is the second boot partition, boot1. (In this illustrative embodiment, there is only one supplemental boot.) The device 300 will first attempt to boot from the boot1. If that fails, or if the boot1 partition is marked bad, it will fall back to boot0.

[0028] In a specific implementation, Trapeze Networks software may be loaded into boot0, and third-party software into boot1. That way, the device 300 will boot under control of third-party software. To switch back, the boot1 partition is marked bad, which causes the device 300 to fall back to Trapeze Networks software. In at least one implementation, the Trapeze Networks software is read-only so that the image is always available, but this is an implementation-specific decision. In this implementation, only one third-party software image is provided in boot1, but it can be swapped out for another image.

[0029] FIG. 4 depicts an example of a system 400 for changing boot1 statically at an AP. As used herein, changing boot1 statically refers to making the change by an administrator. Dynamically changing boot1 on the other hand, which is discussed later with reference to FIG. 5, involves changing boot1 in accordance with detected events, a schedule, or other environmental stimuli.

[0030] In the example of FIG. 4, the system 400 includes a network administrator 402, a management system 404, a switch 406, and an AP 408. The network administrator 402 may include a human and/or artificial entity. The management system 404 may be embodied in a computer-readable medium and may include, by way of example but not limitation, a TRAPEZE NETWORKS RINGMASTER™ management system. The switch 406 may include, by way of example but not limitation, a MOBILITY EXCHANGE™ or MX® switch. The AP may include a MOBILITY POINT™ or MP® AP.

[0031] In the example of FIG. 4, the switch 406 includes a primary boot image 410, one or more supplemental boot images 412-1 to 412-N (referred to collectively as the supplemental boot images 412), and an AP configuration database 414. The AP 408 includes the primary boot image 410 (boot0) and one of the supplemental boot images 412 (boot1).

[0032] In the example of FIG. 4, in operation, the network administrator 402 may trigger changes to boot1 at the AP 408 using the management system 404. The control application 404, upon receiving an appropriate command from the network administrator 402 sends a command to the switch 406 to change boot1, as appropriate. The network administrator 402 may also enter the appropriate command to the switch 406. The network administrator 402 may or may not be able to also change boot0 at the AP 408 using CLI or other commands. However, it may be desirable to provide the capability of allowing installation of the primary boot image at installation or re-installation.

[0033] When the command is received at the switch 406, the AP configuration database 414 on the switch 406 is updated to indicate that the AP 408 should use one of the supplemental boot images 412. The switch 406 then provides the appropriate boot image of the supplemental boot images 412 to the AP 408, which the AP 408 stores as boot1.

[0034] While the example of FIG. 4 depicts components that may be used for static AP boot image installation, in some embodiments it may be desirable to add dynamic AP boot image installation (or switching between boot images at the AP). Some examples of events leading to dynamic conversion may include by way of example but not limitation:

- [0035] Automatic conversion of an AP to an IDS sensor based on an alarm.
- [0036] Automatic conversion of all APs to IDS sensors based on time, so that the entire wireless network stops offering service when the facility closes and instead runs an intrusion detection application. The conversion would be reversed when the facility re-opens so that service is again provided to users.
- [0037] By automating the conversion in a management system, it may be possible to select the “best” AP for conversion. In the case of a rogue, it will likely be detected by several APs. In an illustrative embodiment, the management system can select an AP based on a policy that includes the strongest signal strength, to pick the “closest” AP, or the least loaded AP, so as to minimize user disruption.
- [0038] The management system can manage AP conversions so as to ensure that a minimum set of APs are being used to provide service and prevent service from falling below a threshold. Likewise, the management system can manage the AP pool so that a minimum level of third-party functionality is maintained.
- [0039] The management system can assess threat levels based on, for example, a risk-based score so that there is a minimum threshold score for conversion, and progressively higher scores result in conversion of larger numbers of APs to security services.
- [0040] The management system can link conversion events to a rollback, so that an AP can be “leased” to a third-party application and reclaimed at the end of a given time duration. It would also be possible for that application to extend its lease.

[0041] FIG. 5 depicts an example of a system 500 for changing boot images dynamically at an AP. The system 500 includes a management system 502, one or more third party applications 504-1 to 504-N (referred to collectively as third party applications 504), one or more wireless domains 506-1 to 506-N (referred to collectively as wireless domains 506), a server 508, a switch 510, and an AP 512.

[0042] The third party applications 504 include applications that provide functionality to the server 508 that may be of use in a wireless domain. For example, the third party applications 504 may include security applications. The wireless domains 506 provide RF data to the server 508. It should be noted that the switch 510 may be included in one of the wireless domains 506, and may provide RF data (not shown).

[0043] The server 508 may include an AP selector 514, a scheduler 516, AP images 518, and a command system 520. The AP selector 514 can receive requests for conversion from multiple sources and unify them. For example, the AP selector 514 may receive input from the third party applications 504, the wireless domains 506 (e.g., in the form of RF data), or from other applicable sources that serve to improve the accuracy of the AP selector 514 (not shown). The AP selector 514 may include an engine for making probabilistic assessments of risk prior to image selection. The AP selector may initially convert a few APs on the first request from a third-party system, and progressively add more if the situation is not resolved. The AP selector 514, after determining a course of action based upon the risk assessment, provides a command to the command system 520.

[0044] The scheduler 516 may include a timer that is set according to implementation-specific parameters. For example, the timer may be associated with a running time between conversion of APs, times when an enterprise is open (e.g., switching to network connectivity mode during work hours), or some other schedule. The scheduler 516 provides a command to the command system 520 based upon the configured schedule(s).

[0045] The AP images 518 are available to the command system 520. It may be that the AP images 518 are not needed even when an AP image is to be changed. For example, the AP 512 may include multiple boot images, including the image to which the switch 510 (as instructed by the command system 520) attempts to switch the AP 512. It may be that the AP images 518 are needed because the AP 512 can only hold a single image (requiring a new image with each AP image change), or because the AP 512 does not include the image that is needed based upon the desired functionality.

[0046] Using techniques described herein, multiple IDS partners may be used for statistical defense against attacks. APs could also be dedicated on-demand to location functions and “spotlighting” particular client devices.

[0047] FIG. 6 depicts a flowchart 600 of an example of a method for booting an AP using a boot image. 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. In the example of FIG. 6, the flowchart 600 starts at module 602 where a plurality of software images are provided. The software images may be provided at a server or at an AP.

[0048] In the example of FIG. 6, the flowchart 600 continues to module 604 where a boot image is selected from the plurality of software images. The boot image may be selected after a determination is made as to the desired functionality for an AP at a given time. The determination may be based upon, for example, risk assessment, according to a schedule, or to sign a spotlight on a particular station.

[0049] In the example of FIG. 6, the flowchart 600 continues to module 606 where an AP is booted using the boot image. Then the flowchart 600 ends. Presumably, the AP then operates in accordance with the functionality of the boot image.

[0050] 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 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).

[0051] As used herein, access point (AP) refers to receiving points for any known or convenient wireless access technology. Specifically, the term AP is not intended to be limited to 802.11 APs.

[0052] 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.

[0053] 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.

[0054] The algorithms and techniques described herein also relate to apparatus for performing the algorithms and techniques. 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.

[0055] It should be noted that not all technologies include the term AP in the literature. For example, SGSN technology does not refer to an access point as an “AP.” However, all wireless access technologies require something comparable (i.e., a node at which wireless communications are received and/or transmitted). For example, an independent basic service set (BSS) includes stations that access the service area by directly communicating with one another; thus, the access nodes are the stations themselves. Accordingly, AP is considered to be generally applicable to any technology, regardless of actual verbiage used to describe a BSS with equivalent functionality.

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

[0057] It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present invention. It is intended that all permutations, enhancements, equivalents, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present invention. It is therefore intended that the following appended claims include all such modifications, permutations and equivalents as fall within the true spirit and scope of the present invention.

Claims

What is claimed is:

1. A device comprising:

a plurality of software images embodied in a computer-readable medium;

a management interface through which one of the plurality of software images is designated as a boot image;

a processor that implements the boot image in a boot procedure;

radio hardware through which functionality associated with the boot image is applied to a wireless domain.

2. The device of claim 1, wherein the plurality of software sets include a primary software set and one or more subordinate software sets.

3. The device of claim 1, wherein at least one of the software sets is associated with wireless network connectivity.

4. The device of claim 1, wherein at least one of the software sets is associated with wireless network security.

5. The device of claim 1, further comprising an interface through which new software images may be received.

6. The device of claim 1, wherein the management interface is implemented using XML.

7. A system comprising:

an access point (AP), including a management interface, capable of booting from a plurality of software sets;

a management engine embodied in a computer-readable medium;

wherein, in operation, the management engine selects one of the plurality of software sets with which the AP boots through the management interface of the AP.

8. The system of claim 7, wherein the plurality of software sets include a primary software set and one or more subordinate software sets.

9. The system of claim 7, wherein at least one of the software sets is associated with wireless network connectivity.

10. The system of claim 7, wherein at least one of the software sets is associated with wireless network security.

11. The system of claim 7, wherein, in operation, the management engine receives a selection from an administrator and selects the one of the plurality of software sets in accordance with the selection.

12. The system of claim 7, wherein, in operation, the management engine dynamically selects the one of the plurality of software sets.

13. The system of claim 7, wherein, in operation, the management engine uses time of day to select the one of the plurality of software sets.

14. The system of claim 7, wherein, in operation, the management engine prevents observed devices from obtaining wireless connectivity at particular times of day.

15. The system of claim 7, wherein, in operation, the management engine selects the one of the plurality of software sets to enable more detailed investigation of an event.

16. The system of claim 7, further comprising an independent management system, wherein the management engine is included in the independent management system.

17. A method comprising:

providing a plurality of software images;

selecting a boot image from the plurality of software images;

booting an access point (AP) using the boot image.

18. The method of claim 17, further comprising selecting the boot image according to time of day.

19. The method of claim 17, further comprising selecting the boot image to investigate an event.

20. The method of claim 17, wherein the boot image is a first boot image, further comprising:

setting a risk threshold;

assigning a risk score based upon events in a wireless environment;

selecting a second boot image from the plurality of software images if the risk score exceeds the risk threshold.

Patent Citations (269)

Patent	Date	Inventor	Cited By
US3641433(A)	1972-02-01	Mifflin et al.	Applicant
US4168400(A)	1979-09-01	De Couasnon et al.	Applicant
US4176316(A)	1979-11-01	DeRosa et al.	Applicant
US4247908(A)	1981-01-01	Lockhart et al.	Applicant
US4291401(A)	1981-09-01	Bachmann	Applicant
US4291409(A)	1981-09-01	Weinberg et al.	Applicant
US4409470(A)	1983-10-01	Shepard et al.	Applicant
US4460120(A)	1984-07-01	Shepard et al.	Applicant
US4475208(A)	1984-10-01	Ricketts	Applicant
US4494238(A)	1985-01-01	Groth, Jr.	Applicant
US4500987(A)	1985-02-01	Hasegawa	Applicant
US4503533(A)	1985-03-01	Tobagi et al.	Applicant
US4550414(A)	1985-10-01	Guinon et al.	Applicant
US4562415(A)	1985-12-01	McBiles	Applicant
US4630264(A)	1986-12-01	Wah	Applicant
US4635221(A)	1987-01-01	Kerr	Applicant
US4639914(A)	1987-01-01	Winters	Applicant
US4644523(A)	1987-02-01	Horwitz	Applicant
US4672658(A)	1987-06-01	Kavehrad	Applicant
US4673805(A)	1987-06-01	Shepard et al.	Applicant
US4707839(A)	1987-11-01	Andren et al.	Applicant
US4730340(A)	1988-03-01	Frazier	Applicant
US4736095(A)	1988-04-01	Shepard et al.	Applicant
US4740792(A)	1988-04-01	Sagey et al.	Applicant
US4758717(A)	1988-07-01	Shepard et al.	Applicant
US4760586(A)	1988-07-01	Takeda	Applicant
US4789983(A)	1988-12-01	Acampora et al.	Applicant
US4829540(A)	1989-05-01	Waggener et al.	Applicant
US4850009(A)	1989-07-01	Zook et al.	Applicant
US4872182(A)	1989-10-01	McRae et al.	Applicant
US4894842(A)	1990-01-01	Broekhoven et al.	Applicant
US4901307(A)	1990-02-01	Gilhousen et al.	Applicant
US4933952(A)	1990-06-01	Albrieux et al.	Applicant
US4933953(A)	1990-06-01	Yagi	Applicant
US4995053(A)	1991-02-01	Simpson et al.	Applicant
US5008899(A)	1991-04-01	Yamamoto	Applicant
US5029183(A)	1991-07-01	Tymes	Applicant
US5103459(A)	1992-04-01	Gilhousen et al.	Applicant
US5103461(A)	1992-04-01	Tymes	Applicant
US5109390(A)	1992-04-01	Gilhousen et al.	Applicant
US5142550(A)	1992-08-01	Tymes	Applicant
US5151919(A)	1992-09-01	Dent	Applicant
US5157687(A)	1992-10-01	Tymes	Applicant
US5187575(A)	1993-02-01	Dent et al.	Applicant
US5231633(A)	1993-07-01	Hluchyj et al.	Applicant
US5280498(A)	1994-01-01	Tymes et al.	Applicant
US5285494(A)	1994-02-01	Sprecher et al.	Applicant
US5329531(A)	1994-07-01	Diepstraten	Applicant
US5339316(A)	1994-08-01	Diepstraten	Applicant
US5371783(A)	1994-12-01	Rose et al.	Applicant
US5418812(A)	1995-05-01	Reyes et al.	Applicant
US5450615(A)	1995-09-01	Fortune et al.	Applicant
US5465401(A)	1995-11-01	Thompson	Applicant
US5479441(A)	1995-12-01	Tymes et al.	Applicant
US5483676(A)	1996-01-01	Mahany et al.	Applicant
US5488569(A)	1996-01-01	Kaplan	Applicant
US5491644(A)	1996-02-01	Pickering et al.	Applicant
US5517495(A)	1996-05-01	Lund	Applicant
US5519762(A)	1996-05-01	Bartlett	Applicant
US5528621(A)	1996-06-01	Heiman et al.	Applicant
US5561841(A)	1996-10-01	Markus	Applicant
US5568513(A)	1996-10-01	Croft et al.	Applicant
US5584048(A)	1996-12-01	Wieczorek	Applicant
US5598532(A)	1997-01-01	Liron	Applicant
US5630207(A)	1997-05-01	Gitlin et al.	Applicant
US5640414(A)	1997-06-01	Blakeney et al.	Applicant
US5649289(A)	1997-07-01	Wang et al.	Applicant
US5668803(A)	1997-09-01	Tymes et al.	Applicant
US5774460(A)	1998-06-01	Schiffel et al.	Applicant
US5793303(A)	1998-08-01	Koga	Applicant
US5794128(A)	1998-08-01	Brockel et al.	Applicant
US5812589(A)	1998-09-01	Sealander et al.	Applicant
US5815811(A)	1998-09-01	Pinard et al.	Applicant
US5828960(A)	1998-10-01	Tang et al.	Applicant
US5838907(A)	1998-11-01	Hansen	Applicant
US5844900(A)	1998-12-01	Hong et al.	Applicant
US5872968(A)	1999-02-01	Knox et al.	Applicant
US5875179(A)	1999-02-01	Tikalsky	Applicant
US5887259(A)	1999-03-01	Zicker et al.	Applicant
US5896561(A)	1999-04-01	Schrader et al.	Applicant
US5915214(A)	1999-06-01	Reece et al.	Applicant
US5920821(A)	1999-07-01	Seazholtz et al.	Applicant
US5933607(A)	1999-08-01	Tate et al.	Applicant
US5949988(A)	1999-09-01	Feisullin et al.	Applicant
US5953669(A)	1999-09-01	Stratis et al.	Applicant
US5960335(A)	1999-09-01	Umemoto et al.	Applicant
US5982779(A)	1999-11-01	Krishnakumar et al.	Applicant
US5987062(A)	1999-11-01	Engwer et al.	Applicant
US5987328(A)	1999-11-01	Ephremides et al.	Applicant
US5991817(A)	1999-11-01	Rowett et al.	Examiner
US6005853(A)	1999-12-01	Wang et al.	Applicant
US6011784(A)	2000-01-01	Brown	Applicant
US6041240(A)	2000-03-01	McCarthy et al.	Applicant
US6078568(A)	2000-06-01	Wright	Applicant
US6088591(A)	2000-07-01	Trompower	Applicant
US6101539(A)	2000-08-01	Kennelly et al.	Applicant
US6118771(A)	2000-09-01	Tajika et al.	Applicant
US6119009(A)	2000-09-01	Baranger et al.	Applicant
US6160804(A)	2000-12-01	Ahmed et al.	Applicant
US6188649(B1)	2001-02-01	Fine et al.	Applicant
US6199032(B1)	2001-03-01	Anderson	Applicant
US6208629(B1)	2001-03-01	Jaszewski et al.	Applicant
US6208841(B1)	2001-03-01	Wallace et al.	Applicant
US6218930(B1)	2001-04-01	Katzenberg et al.	Applicant
US6240078(B1)	2001-05-01	Kuhnel et al.	Applicant
US6240083(B1)	2001-05-01	Wright	Applicant
US6256300(B1)	2001-07-01	Ahmed et al.	Applicant
US6256334(B1)	2001-07-01	Adachi	Applicant
US6262988(B1)	2001-07-01	Vig	Applicant
US6285662(B1)	2001-09-01	Watanabe	Applicant
US6304596(B1)	2001-10-01	Yamano et al.	Applicant
US6317599(B1)	2001-11-01	Rappaport et al.	Applicant
US6336035(B1)	2002-01-01	Somoza et al.	Applicant
US6336152(B1)	2002-01-01	Richman et al.	Applicant
US6347091(B1)	2002-02-01	Wallentin et al.	Applicant
US6356758(B1)	2002-03-01	Almeida et al.	Applicant
US6393290(B1)	2002-05-01	Ufongene	Applicant
US6404772(B1)	2002-06-01	Beach et al.	Applicant
US6473449(B1)	2002-10-01	Cafarella et al.	Applicant
US6493679(B1)	2002-12-01	Rappaport et al.	Applicant
US6496290(B1)	2002-12-01	Lee	Applicant
US6512916(B1)	2003-01-01	Forbes, Jr.	Applicant
US6580700(B1)	2003-06-01	Pinard et al.	Applicant
US6587680(B1)	2003-07-01	Ala-Laurila et al.	Applicant
US6614787(B1)	2003-09-01	Jain et al.	Applicant
US6624762(B1)	2003-09-01	End, III	Applicant
US6625454(B1)	2003-09-01	Rappaport et al.	Applicant
US6661787(B1)	2003-09-01	Jain et al.	Applicant
US6631267(B1)	2003-10-01	Thomson et al.	Applicant
US6659947(B1)	2003-12-01	Rappaport et al.	Applicant
US6687498(B2)	2004-02-01	McKenna et al.	Applicant
US6697415(B1)	2004-02-01	Mahany	Applicant
US6725260(B1)	2004-04-01	Philyaw	Applicant
US6760324(B1)	2004-07-01	Scott et al.	Applicant
US6747961(B1)	2004-10-01	Ahmed et al.	Applicant
US6839338(B1)	2005-01-01	Amara et al.	Applicant
US6839348(B2)	2005-01-01	Tang et al.	Applicant
US6879812(B2)	2005-04-01	Rappaport et al.	Applicant
US6957067(B1)	2005-10-01	Iyer et al.	Applicant
US6973622(B1)	2005-12-01	Rappaport et al.	Applicant
US6978301(B2)	2005-12-01	Tindal	Applicant
US7020438(B2)	2006-03-01	Sinivaara et al.	Applicant
US7020773(B1)	2006-03-01	Otway et al.	Applicant
US7024394(B1)	2006-04-01	Ashour et al.	Applicant
US7062566(B2)	2006-06-01	Amara et al.	Applicant
US7068999(B2)	2006-06-01	Ballai	Applicant
US7110756(B2)	2006-09-01	Diener	Applicant
US7116979(B2)	2006-10-01	Backes et al.	Applicant
US7146166(B2)	2006-12-01	Backes et al.	Applicant
US7155518(B2)	2006-12-01	Forslow	Applicant
US7221927(B2)	2007-05-01	Kolar et al.	Applicant
US7224970(B2)	2007-05-01	Smith et al.	Applicant
US7263366(B2)	2007-08-01	Miyashita	Applicant
US7280495(B1)	2007-10-01	Zweig et al.	Applicant
US7317914(B2)	2008-01-01	Adya et al.	Applicant
US7324468(B2)	2008-01-01	Fischer	Applicant
US7324487(B2)	2008-01-01	Saito	Applicant
US7359676(B2)	2008-04-01	Hrastar	Applicant
US7370362(B2)	2008-05-01	Olson et al.	Applicant
US7376080(B1)	2008-05-01	Riddle et al.	Applicant
US7421248(B1)	2008-09-01	Laux et al.	Applicant
US7466678(B2)	2008-12-01	Cromer et al.	Applicant
US7489648(B2)	2009-02-01	Griswold	Applicant
US7509096(B2)	2009-03-01	Palm et al.	Applicant
US7529925(B2)	2009-05-01	Harkins	Applicant
US7551619(B2)	2009-06-01	Tiwari	Applicant
US7573859(B2)	2009-08-01	Taylor	Applicant
US7577453(B2)	2009-08-01	Matta	Applicant
US7788475(B2)	2010-08-01	Zimmer et al.	Examiner
US2001/0024953(A1)	2001-09-01	Balogh	Applicant
US2002/0052205(A1)	2002-05-01	Belostofsky et al.	Applicant
US2002/0060995(A1)	2002-05-01	Cervello et al.	Applicant
US2002/0069278(A1)	2002-06-01	Forslow	Applicant
US2002/0095486(A1)	2002-07-01	Bahl	Applicant
US2002/0101868(A1)	2002-08-01	Clear et al.	Applicant
US2002/0176437(A1)	2002-11-01	Busch et al.	Applicant
US2002/0191572(A1)	2002-12-01	Weinstein et al.	Applicant
US2003/0014646(A1)	2003-01-01	Buddhikot et al.	Applicant
US2003/0018889(A1)	2003-01-01	Burnett et al.	Applicant
US2003/0055959(A1)	2003-03-01	Sato	Applicant
US2003/0107590(A1)	2003-06-01	Levillain et al.	Applicant
US2003/0134642(A1)	2003-07-01	Kostic et al.	Applicant
US2003/0135762(A1)	2003-07-01	Macaulay	Applicant
US2003/0174706(A1)	2003-09-01	Shankar et al.	Applicant
US2003/0227934(A1)	2003-12-01	White et al.	Applicant
US2004/0003285(A1)	2004-01-01	Whelan et al.	Applicant
US2004/0019857(A1)	2004-01-01	Teig et al.	Applicant
US2004/0025044(A1)	2004-02-01	Day	Applicant
US2004/0053632(A1)	2004-03-01	Nikkelen et al.	Applicant
US2004/0062267(A1)	2004-04-01	Minami et al.	Applicant
US2004/0064560(A1)	2004-04-01	Zhang et al.	Applicant
US2004/0068668(A1)	2004-04-01	Lor et al.	Applicant
US2004/0095914(A1)	2004-05-01	Katsube et al.	Applicant
US2004/0095932(A1)	2004-05-01	Astarabadi et al.	Applicant
US2004/0143428(A1)	2004-07-01	Rappaport et al.	Applicant
US2004/0165545(A1)	2004-08-01	Cook	Applicant
US2004/0208570(A1)	2004-10-01	Reader	Applicant
US2004/0047320(A1)	2004-11-01	Eglin	Applicant
US2004/0120370(A1)	2004-11-01	Tzamaloukas	Applicant
US2004/0221042(A1)	2004-11-01	Meier	Applicant
US2004/0230370(A1)	2004-11-01	Tzamaloukas	Applicant
US2004/0236702(A1)	2004-11-01	Fink et al.	Applicant
US2004/0255167(A1)	2004-12-01	Knight	Applicant
US2004/0259555(A1)	2004-12-01	Rappaport et al.	Applicant
US2005/0030929(A1)	2005-02-01	Swier et al.	Applicant
US2005/0037818(A1)	2005-02-01	Seshadri et al.	Applicant
US2005/0054326(A1)	2005-03-01	Rogers	Applicant
US2005/0058132(A1)	2005-03-01	Okano et al.	Applicant
US2005/0059406(A1)	2005-03-01	Thomson et al.	Applicant
US2005/0064873(A1)	2005-03-01	Karaoguz et al.	Applicant
US2005/0068925(A1)	2005-03-01	Palm et al.	Applicant
US2005/0073980(A1)	2005-04-01	Thomson et al.	Applicant
US2005/0097618(A1)	2005-05-01	Arling et al.	Applicant
US2005/0122977(A1)	2005-06-01	Lieberman	Applicant
US2005/0128989(A1)	2005-06-01	Bhagwat et al.	Applicant
US2005/0157730(A1)	2005-07-01	Grant et al.	Applicant
US2005/0180358(A1)	2005-08-01	Kolar et al.	Applicant
US2005/0181805(A1)	2005-08-01	Gallagher	Applicant
US2005/0193103(A1)	2005-09-01	Drabik	Applicant
US2005/0223111(A1)	2005-10-01	Bhandaru et al.	Applicant
US2005/0239461(A1)	2005-10-01	Verma et al.	Applicant
US2005/0240665(A1)	2005-10-01	Gu et al.	Applicant
US2005/0245269(A1)	2005-11-01	Demirhan et al.	Applicant
US2005/0259597(A1)	2005-11-01	Benedetto et al.	Applicant
US2005/0059405(A1)	2005-12-01	Rappaport et al.	Applicant
US2005/0273442(A1)	2005-12-01	Bennett	Applicant
US2005/0276218(A1)	2005-12-01	Ooghe et al.	Applicant
US2006/0045050(A1)	2006-03-01	Floros et al.	Applicant
US2006/0104224(A1)	2006-05-01	Singh et al.	Applicant
US2006/0128415(A1)	2006-06-01	Horikoshi et al.	Applicant
US2006/0161983(A1)	2006-07-01	Cothrell et al.	Applicant
US2006/0174336(A1)	2006-08-01	Chen	Applicant
US2006/0189311(A1)	2006-08-01	Cromer et al.	Applicant
US2006/0200862(A1)	2006-09-01	Olson et al.	Applicant
US2006/0245393(A1)	2006-11-01	Bajic	Applicant
US2006/0248331(A1)	2006-11-01	Harkins	Applicant
US2006/0274774(A1)	2006-12-01	Srinivasan et al.	Examiner
US2006/0276192(A1)	2006-12-01	Dutta et al.	Applicant
US2007/0025265(A1)	2007-02-01	Porras et al.	Applicant
US2007/0064718(A1)	2007-03-01	Ekl et al.	Applicant
US2007/0070937(A1)	2007-03-01	Demirhan et al.	Applicant
US2007/0083924(A1)	2007-04-01	Lu	Applicant
US2007/0086378(A1)	2007-04-01	Matta et al.	Applicant
US2007/0091889(A1)	2007-04-01	Xiao et al.	Applicant
US2007/0189222(A1)	2007-08-01	Kolar et al.	Applicant
US2007/0260720(A1)	2007-11-01	Morain	Applicant
US2008/0008117(A1)	2008-01-01	Alizadeh-Shabdiz	Applicant
US2008/0013481(A1)	2008-01-01	Simons et al.	Applicant
US2008/0014916(A1)	2008-01-01	Chen	Examiner
US2008/0056200(A1)	2008-03-01	Johnson	Applicant
US2008/0056211(A1)	2008-03-01	Kim et al.	Applicant
US2008/0096575(A1)	2008-04-01	Aragon et al.	Applicant
US2008/0107077(A1)	2008-05-01	Murphy	Applicant
US2008/0114784(A1)	2008-05-01	Murphy	Applicant
US2008/0117822(A1)	2008-05-01	Murphy et al.	Applicant
US2008/0151844(A1)	2008-06-01	Tiwari	Applicant
US2009/0031044(A1)	2009-01-01	Barrack et al.	Applicant
US2009/0198999(A1)	2009-08-01	Harkins	Applicant
GB2429080(A)	2007-02-01		Examiner
WO94/03986	1994-02-01		Applicant
WO-9403986	1994-02-01		Applicant
WO99/11003	1999-03-01		Applicant
WO-9911003	1999-03-01		Applicant
WO3/085544(A1)	2003-10-01		Applicant
WO-03085544	2003-10-01		Applicant
WO2004/095192(A2)	2004-11-01		Applicant
WO2004/095800(A1)	2004-11-01		Applicant
WO-2004095192	2004-11-01		Applicant
WO-2004095800	2004-11-01		Applicant

Non-Patent Literature (126)

Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.Applicant
Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.Applicant
Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
Co-pending U.S. Appl. No. 12/401,073, filed Mar. 10, 2009.Applicant
Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
Co-pending U.S. Appl. No. 12/500,392, filed Jul. 9, 2009.Applicant
Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
Co-pending U.S. Appl. No. 12/491,201, filed Jun. 24, 2009.Applicant
Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
Co-pending U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.Applicant
Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
Co-pending U.S. Appl. No. 11/604,075, filed Nov. 22, 2006.Applicant
Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
Co-pending U.S. Appl. No. 11/643,329, filed Dec. 20, 2006.Applicant
Co-pending U.S. Appl. No. 11/975,134, filed Oct. 16, 2007.Applicant
Co-pending U.S. Appl. No. 12/131,028, filed May 3, 2008.Applicant
Co-pending U.S. Appl. No. 12/336,492, filed Dec. 16, 2008.Applicant
Co-pending U.S. Appl. No. 12/489,295, filed Jun. 22, 2009.Applicant
Notice of Allowance Mailed Feb. 26, 2007 in Co-pending U.S. Appl. No. 10/778,901, filed Feb. 13, 2004.Applicant
Non-Final Office Action Mailed Sep. 22, 2009 in Co-pending U.S. Appl. No. 11/784,307, filed Apr. 5, 2007.Applicant
Notice of Allowance Mailed Feb. 27, 2009 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
Final Office Action Mailed Aug. 27, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
Non-Final Office Action Mailed Jan. 8, 2008 in Co-pending U.S. Appl. No. 11/377,859, filed Mar. 15, 2006.Applicant
Notice of Allowance Mailed Jun. 11, 2009 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
Non-Final Office Action Mailed Nov. 10, 2008 in Co-pending U.S. Appl. No. 11/326,966, filed Jan. 5, 2006.Applicant
Non-Final Office Action Mailed Aug. 6, 2009 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
Final Office Action Mailed Mar. 13, 2009 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
Non-Final Office Action Mailed Sep. 11, 2008 in Co-pending U.S. Appl. No. 11/330,877, filed Jan. 11, 2006.Applicant
Non-Final Office Action Mailed Dec. 2, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
Final Office Action Mailed Jun. 10, 2009 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
Non-Final Office Action Mailed Oct. 28, 2008 in Co-pending U.S. Appl. No. 11/351,104, filed Feb. 8, 2006.Applicant
Notice of Allowance Mailed Feb. 23, 2010 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
Non-Final Office Action Mailed Aug. 5, 2009 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
Final Office Action Mailed Oct. 23, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
Non-Final Office Action Mailed Jun. 13, 2008 in Co-pending U.S. Appl. No. 11/331,789, filed Jan. 14, 2006.Applicant
Notice of Allowance Mailed Jun. 16, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
Non-Final Office Action Mailed Feb. 17, 2009 in Co-pending U.S. Appl. No. 11/445,750, filed Jun. 1, 2006.Applicant
Final Office Action Mailed May 28, 2009 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
Non-Final Office Action Mailed Nov. 14, 2008 in Co-pending U.S. Appl. No. 11/417,830, filed May 3, 2006.Applicant
Notice of Allowance Mailed Apr. 23, 2009 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
Non-Final Mailed Aug. 19, 2008 in Co-pending U.S. Appl. No. 11/400,165, filed Apr. 5, 2006.Applicant
Final Office Action Mailed Jul. 20, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
Non-Final Office Action Mailed Jan. 14, 2009 in Co-pending U.S. Appl. No. 11/592,891, filed Nov. 3, 2006.Applicant
Final Office Action Mailed Jan. 5, 2010 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
Non-Final Office Action Mailed Jul. 21, 2009 in Co-pending U.S. Appl. No. 11/595,119, filed Nov. 10, 2006.Applicant
Non-Final Office Action Mailed Aug. 7, 2009 in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
Notice of Allowance Mailed Mar. 19, 2010 in Co-pending U.S. Appl. No. 11/487,722, filed Jul. 17, 2006.Applicant
International Search Report PCT/US05/004702 dated Aug. 10, 2006, pp. 1-3.Applicant
Written opinion PCT/US05/004702 dated Aug. 10, 2006, pp. 1-5.Applicant
International Search Report PCT/US06/09525 dated Sep. 13, 2007, pp. 1-2.Applicant
Written Opinlon PCT/US06/09525 dated Sep. 13, 2007, pp. 1-7.Applicant
International Search Report PCT/US06/40498 dated Dec. 28, 2007, pp. 1-2.Applicant
Written Opinion PCT/US06/40498 dated Dec. 28, 2007, pp. 1-5.Applicant
International Seartsh Report PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.Applicant
Written Opinion PCT/US07/14847 dated Apr. 1, 2008, pp. 1-4.Applicant
International Search Report PCT/US07/089134 dated Apr. 10, 2008, pp. 1-3.Applicant
Written Opinion PCT/US07/089134 dated Apr. 10, 2008, pp. 1-4.Applicant
U.S. Appl. No. 11/326,966, filed Jan. 2006, Taylor.Applicant
U.S. Appl. No. 11/330,877, filed Jan. 2006, Matta.Applicant
U.S. Appl. No. 11/331,789, filed Jan. 2006, Matta et al.Applicant
U.S. Appl. No. 11/351,104, filed Feb. 2006, Tiwari.Applicant
U.S. Appl. No. 11/377,859, filed Mar. 2006, Harkins.Applicant
U.S. Appl. No. 11/400,165, filed Apr. 2006, Tiwari.Applicant
U.S. Appl. No. 11/445,750, filed May 2006, Matta.Applicant
U.S. Appl. No. 11/417,830, filed May 2006, Morain.Applicant
U.S. Appl. No. 11/417,993, filed May 2006, Jar et al.Applicant
U.S. Appl. No. 11/437,537, filed May 2006, Freund et al.Applicant
U.S. Appl. No. 11/437,538, filed May 2006, Zeldin.Applicant
U.S. Appl. No. 11/437,387, filed May 2006, Zeldin et al.Applicant
U.S. Appl. No. 11/437,582, filed May 2006, Bugwadia et al.Applicant
U.S. Appl. No. 11/451,704, filed Jun. 2006, Riley.Applicant
U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.Applicant
U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy, James.Applicant
U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy, James.Applicant
U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.Applicant
U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari, Manish.Applicant
U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.Applicant
U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.Applicant
U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.Applicant
U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast, Mathew S.Applicant
U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.Applicant
U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast, Mathew S.Applicant
U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast, Mathew S.Applicant
U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.Applicant
U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Mathew S.Applicant
Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).Applicant
Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).Applicant
Bing and Subramanian, IEEE, 1318-1322 (1997).Applicant
Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.Applicant
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.Applicant
Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, pp. 58-68 (1995).Applicant
Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.Applicant
Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.Applicant
Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, June 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).Applicant
LAN/MAN Standars Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).Applicant
Okamoto and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant
Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.Applicant
Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, April 6-8, pp. 45-50 (1977).Applicant
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.Applicant
Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.Applicant
Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).Applicant
Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
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.Applicant
Acampa and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).Applicant
Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.Applicant
Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, pp. 58-68 (1995).Applicant
Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Coummunications, Conf. Record. Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.Applicant
Geier, Jim. Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.Applicant
Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propogation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.Applicant
Kim at al., “Radio Propogation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, June 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Users”, (1977).Applicant
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. 801.11b (1999).Applicant
Okamoto and Xu, IEEE, Proceedings of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant
Panjawani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.Applicant
Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, April 6-8, pp. 45-50 (1977).Applicant
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.Applicant
Puttini, R., Percher, J., Me, L., and De Sousa, R. 2004. A fully distributed IDS for MANET. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 vol. 2 (Iscc''04)—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society. Washington. DC. 331-338.Applicant
Seidel et al, “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.Applicant
Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus”, IEEE ICUPC '96 Proceedings (1996).Applicant
Ullmo et al., “Wireless Propogation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant