Wireless station location detection

- Trapeze Networks, Inc.

A technique for locating a device uses connectivity to find a distance between an access point (AP) and a device. The AP transmits a frame to a device and receives an acknowledgement frame from the device. The amount of time for a signal to pass between the AP and the device is estimated and multiplied by the speed of light to find the distance between the AP and the device.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
BACKGROUND

Devices on a network may be considered client devices or rogue devices. Generally, clients have permission to use the network, and rogues do not. For rogues, elimination is desirable. It may be possible that an operator of the rogue device may attempt to frustrate efforts to find the rogue. A rogue device at an unknown location may be difficult to eliminate, requiring the use of strong countermeasures, e.g. suppression of service.

An existing approach uses a received signal strength indicator (RSSI) to locate devices. RSSI levels may be used to estimate a device distance. High RSSI is indicative of closer proximity than low RSSI. The RSSI approach may yield poor results because client transmit power is usually unknown. Further, a precise model of a radio environment is generally unavailable.

Another existing approach uses time differences of arrival (TDOA). TDOA removes signal attenuation from the calculation. However, TDOA is similarly flawed in that nanosecond clocks are generally not synchronized and synchronizing them is difficult. Further, in TDOA, paths to the location avoids obstacles in different ways. Varying path lengths from varying points may cause TDOA to suffer in quality when higher numbers of different points are used to find a location. This is counter intuitive because a greater number of measurements would seem to lead to a more accurate location.

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 upon a reading of the specification and a study of the drawings.

SUMMARY

The following examples 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 examples, one or more of the above-described problems have been reduced or eliminated, while other examples are directed to other improvements.

A technique for locating a device may involve transmitting a frame to a device and receiving an acknowledgement frame from the device. The amount of time for a signal to pass between the AP and the device may be estimated and multiplied by the speed of light to find the distance between the AP and the device. Many distances calculated from many APs may be used to determine a location of the device. Sometimes a single AP may be used to find possible locations of a device in two dimensions. In three dimensions, a number of APs may by used to locate a device, such in an outdoor network.

Advantageously, locating a device may ease a burden of responding to the device. For example, a located rogue may be eliminated without suppressing service. Advantageously, the rouge is eliminated while service remains unaffected.

Consider, for the purposes of example only, a rogue device operated by a rogue operator that does not have permission to use a network. The rogue device is well hidden in a building. In some cases a network administrator may employ countermeasures, shutting down service to portions of the network that the rogue would use. However, using the technique disclosed herein, the rogue is located, security is dispatched, and the rogue computing device is quickly eliminated without interrupting service. Users of the network may remain unaware that an intruding rogue was ever present.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a diagram of an example of a system including a wireless access domain.

FIG. 2 depicts a diagram of an example of a system transmitting a frame, receiving an acknowledgement frame, calculating a distance to a station, and displaying results.

FIG. 3 depicts a flowchart of an example of a method of estimating a location of a station.

FIG. 4 depicts a diagram of an example of a floor plan including APs for a wireless access domain.

FIG. 5 depicts a diagram of an example of a sequence of transmitting a frame and receiving an acknowledgement frame.

FIG. 6 depicts a diagram of fixed time components as a part of a sequence of transmitting a frame and receiving an acknowledgement frame.

FIG. 7 depicts a diagram of an example of a plurality of possible locations for a station a distance d away from an access point.

FIG. 8 depicts a diagram of an example of two possible locations for a station at points at which the station is a distance d away from the first station and a distance d″ away from the second station.

FIG. 9 depicts a diagram of an example of locating a device using three APs.

FIG. 10 depicts a diagram of an example of locating a device in three dimensional space using an AP.

FIG. 11 depicts a diagram of an example of locating a device in three dimensional space using four APs.

FIG. 12 depicts a diagram of an example of locating a rogue device on a floor plan using a wireless access domain.

FIG. 13 depicts a diagram of a system capable of calculating a distance to another device.

 DETAILED DESCRIPTION

In the following description, several specific details are presented to provide a thorough understanding. One skilled in the relevant art will recognize, however, that the concepts and techniques disclosed herein 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 examples disclosed herein.

FIG. 1 depicts a diagram 100 of an example of a system including a wireless access domain. The system 100 includes network 102, network management module 106, station 108, wireless exchange switch 110-1, wireless exchange switch 110-2, wireless exchange switch 110-N (collectively wireless exchange switches 110), access point 114-1, access point 114-2, access point 114-N (collectively access points 114).

In the example of FIG. 1, the network 102 may be practically any type of communications network. By way of example but not limitation, the wireless access domain 104 may be referred to as, a Local Area Network (LAN), virtual LAN (VLAN), and/or wireless LAN (WLAN).

In the example of FIG. 1, the network management module 106 may be practically any type of component or device that is capable of communicating with a communications network, such as, by way of example but not limitation, a mainframe or a workstation as well as a module coupled to or operating in software on a server, AP, wireless exchange switches or other network component.

In the example of FIG. 1, the station 108 may be any computing device, by way of example but not limitation, a laptop, a wireless telephone, or any device capable of communication on a wireless network. A station, as used herein, may be referred to as a device with a media access control (MAC) address and a physical layer (PHY) interface to the wireless medium that comply with the IEEE 802.11 standard. As such, the access points 114 are typically also stations. In alternative examples, a station may comply with a different standard than IEEE 802.11, and may have different interfaces to a wireless or other medium. The station 108 may include a radio capable of generating signals compatible with communication on one or more networks. The station 108 may be in radio communication with one or more of the access points 114.

In the example of FIG. 1, wireless exchange switches 110 may swap topology data and client information that details each user's identity, location, authentication state, VLAN membership, permissions, roaming history, bandwidth consumption, and/or other attributes assigned by, by way of example but not limitation, an Authentication, Authorization, and Accounting (AAA) backend (not shown).

The wireless exchange switches 110 provide forwarding, queuing, tunneling, and/or some security services for the information the wireless exchange switches 110 receive from their associated access points 114. The wireless exchange switches 110 coordinate, may provide power to, and/or manage the configuration of the associated access points 114. An implementation of a wireless exchange switches, provided by way of example but not limitation, includes a Trapeze Networks Mobility Exchange® switch. The Trapeze Networks Mobility Exchange® switches may, in another implementation, be coordinated by means of the Trapeze Access Point Access™ (TAPA™) protocol.

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

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

FIG. 2 depicts a diagram 200 of an example of a system transmitting a frame, receiving an acknowledgement frame, calculating a distance to a station, and displaying results. In the example of FIG. 2, the diagram 200 includes station 202, access point 204, network management module 206, display 208, frame transmission indicator 222, acknowledgement frame transmission indicator 224, location data communication indicator 226, and display of contents indicator 228.

Station 202 may be a device capable of radio communication with one or more access points. In a non-limiting example, the station 202 may be configured for communication using IEEE 802.11 standard communication, but any known or convenient standard for communication may be used.

Access point 204 may be an access point as discussed in reference to FIG. 2, and may be capable of communication with one or more stations via IEEE 802.11 standard communications. Network management module 106 may be practically any type of component or device that is capable of communicating with a communications network, such as, by way of example but not limitation, a mainframe or a workstation as well as a module coupled to or operating in software on a server, AP, wireless exchange or other network component.

Network management module 206 may be practically any type of component or device that is capable of communicating with a communications network. A workstation as well as a module coupled to or operating in software on a server, AP, wireless exchange or other network component could be used. Access point 204 may be coupled to, or contain network management module 206. AP 204 and network management module 206 may further be modules in another component such as a wireless exchange switch.

Display 208 may provide a view of a layout of a building, floorplan, or other known or convenient manner of visualizing an environment including APs and stations. AP 204 may be displayed on display 208. Station 202 may be displayed on display 208. Display 208 may be connected to network management module 206 and display information provided by network management module 206.

In the example of FIG. 2, in operation, AP 204 transmits a frame to station 202. Frame transmission indicator 222 depicts the transmission of the frame from AP 204 to station 202. The frames may be null frames. Typically, null frames have headers, but not payload. AP 204 records a time of transmission of the frame.

Such frames may be referred to as “ping” frames. Because of variance in acknowledgement over time, a single ping frame may be insufficient to acquire an accurate estimate of a distance between an AP and a device. It may be advantageous to use multiple ping frames and average a round trip time for transmitting a ping frame and receiving an acknowledgement frame. Averaging many values may lead to a more accurate estimate of the distance between the AP and the device. Multiple pings may be coordinated to occur during ActiveScan intervals to avoid interruptions in service.

A rogue device may encrypt data in transmission, and refuse to respond to frames that do not have proper encryption keys. However, by using a null frame, a rogue device may respond regardless of encryption. A rogue device may refuse to transmit an Acknowledgement frame. A system may respond by denying the rogue device use of system resources, and if necessary, completely suspending service to a portion of the network, or the entire network. This response may be automatic, or may be manually initiated by an administrator.

It may be necessary to “spoof” or supply an inaccurate 802.11 frame control field sequence number to be accepted by a device, however, many 802.11i implementations do not validate an 802.11 frame sequence number. A device may check the TKIP (Temporal Key Integrity Protocol), or CCMP Packet No. (Counter Mode with Cyper Block Chaining Message Authentication Code Protocol) instead. A rogue device may accept the transmitted ping frame, and respond with an acknowledgement frame.

In the example of FIG. 2, acknowledgement frame transmission indicator 224 depicts station 202 transmitting an acknowledgement frame. AP 204 receives the acknowledgement frame, and records a time of receipt of the acknowledgement frame.

In the example of FIG. 2, AP 204 provides location data to network management module 206. Location data communication indicator 226 shows AP 204 communicating time of transmission of the frame and time of receipt of the acknowledgement frame to network management module 206. Network management module 206 calculates a distance d between AP 204 and station 202.

In the example of FIG. 2, display of contents indicator 228 depicts network management module 206 providing location information to display 208. The location information may be based on the distance d between the AP and the station to display 208 as indicated by display of contents indicator 228. Location information may be in the form of an identification of the location of the station, multiple possible locations for the station, or other information about the location of station 202.

FIG. 3 depicts a flowchart 300 of an example of a method of estimating a location of a station. The method is organized as a sequence of modules in the flowchart 300. However, it should be understood that these and modules associated with other methods described herein may be reordered for parallel execution or into different sequences of modules.

In the example of FIG. 3, the flowchart 300 starts at module 302 with transmitting a frame. At the beginning of transmission, a time t0 may be recorded indicating the beginning of transmission.

In the example of FIG. 3, the flowchart 300 continues to module 304 with receiving a second message from a station associated with the first message. Here, the acknowledgement frame is received at a time which is later than t0. This time may be recorded as t1.

In the example of FIG. 3, the flowchart 300 continues to module 306 with calculating a time difference, Δt, between the start of transmission of the first message and receipt of the second message. t0 may be a time of beginning of transmission of the first message. t1 may be a time of receipt of the second message. Δt may be calculated by subtracting to from t1: Δt=t0−t1.

In the example of FIG. 3, the flowchart 300 continues to module 308 with calculating roundtrip propagation time by subtracting fixed periods of time from Δt for components of the frame exchange. Fixed periods of time may include time to complete a physical layer convergence procedure (PLCP), a Media Access Control (MAC) Header, frame check sequence (FCS), short inter-frame space (SIFS), physical layer convergence procedure (PLCP), Media Access Control (MAC) Header, and frame check sequence (FCS). These fixed time periods are known so they may be stored. By subtracting fixed periods of time from Δt, the remaining time is equal to the amount of time that the transmitted frame, and the acknowledgement frame traveled between the station and the AP, or the round trip propagation time.

In the example of FIG. 3, the flowchart 300 continues to module 310 with determining a distance d by multiplying the speed of light by half the round trip propagation time. It is necessary to divide the round trip propagation time by two because the round trip includes traveling the distance between the AP and the station and then traveling between the station and the AP. The speed of light is used because the signals which transmit the frame travel at approximately the speed of light.

In the example of FIG. 3, the flowchart 300 continues to module 312 with using d to estimate a location of the station. In two dimensions, knowing that the station is a distance d from the AP allows a location to be estimated in terms of points on a circle a distance d away from the AP, as depicted in FIG. 7. If more than one AP is used, the intersection of circles may be used to find possible locations of a station as discussed relative to FIG. 8-9. For estimation in three dimensions, refer to the discussions of FIG. 9 and FIG. 10. Having estimated the location of a station, the flowchart ends.

FIG. 4 depicts a diagram 400 of an example of a floor plan including APs for a wireless access domain. FIG. 4 includes floorplan 402, AP 414-1, AP 414-2, AP 414-3, AP 414-4 and AP 414-5 (Collectively, APs 414). In the example of FIG. 4, devices present in the offices depicted in floorplan 402 may connect to one or more of APs 414. APs 414 may be included as a part of a larger wireless access domain including wireless exchange switches and one or more network management modules. The APs may be coupled together via conventional network wiring.

In the example of FIG. 4, five APs may provide high quality service throughout all offices and hallways of the offices depicted in floorplan 402. Some APs may not be accessible from some locations on the floor plan. In a non-limiting example, AP 414-1 may not be accessible from office 54. Similarly parts of office 55 may receive no signal or only a weak signal from AP 414-5, and may receive no signal from AP 414-1. Weak signal strength or a low number of APs may negatively impact the ability of a network of APs to locate a station. For installations in which only a single AP provides a strong signal to an office, a distance to a station may be calculated. However, such a predicted distance to the station may indicate an infinite number of locations on a circle a distance d away from the AP.

The floor plan depicted in FIG. 4 could be a part of a network management module display in which the floor plan is depicted graphically, and clients, and rogues are graphically displayed by their estimated locations.

FIG. 5 depicts a diagram 500 of an example of a sequence of transmitting a frame and receiving an acknowledgement frame. Diagram 500 includes frame transmission indicator 502, and acknowledge frame transmission indicator 504. A first ping frame is sent as shown by frame transmission indicator 502. Next acknowledgement frame transmission indicator 504 shows the transmission of an acknowledgement frame. Time spent between receipt of the transmitted frame but before sending an acknowledgement frame is referred to as a short frame interface space.

FIG. 6 depicts a diagram 600 of fixed time components as a part of a sequence of transmitting a frame and receiving an acknowledgement frame. Diagram 600 includes frame transmission indicator 602, acknowledgement (ACK) frame transmission indicator 604, distributed inter-frame space (DIFS) 606, physical layer convergence procedure (PLCP) 608, Media Access Control (MAC) Header 610, frame check sequence (FCS) 612, short inter-frame space (SIFS) 612, physical layer convergence procedure (PLCP) 616, Media Access Control (MAC) Header 618, and frame check sequence (FCS) 620.

In subtracting time components for PLCP 608, MAC Header 610, FCS 612, PLCP 616, MAC Header 618, and FCS 620 from Δt, the remaining time may be attributed to the travel a round trip between the station and the AP. Half this time may be the amount of time for one frame to travel between the station and the AP.

FIG. 7 depicts a diagram 700 of an example of a plurality of possible locations for a station a distance d away from an access point. Diagram 700 includes access point 706, station 708, and distance (d) 710. This diagram assumes a two dimensional layout, such as a floorplan of an office. In such a case, the station will be a distance d away from the AP at a location that lies approximately on a circle or are around the station with a radius equal to the distance. In order to locate a device with more specificity, it may be necessary to use more than one AP. However, where a floor plan is such that the AP may only identify a limited range of locations, such as in a corner of a building, fewer points than necessary to comprise a whole circle may be used. In such a case, the possible locations will lie on an arc instead of a circle.

FIG. 8 depicts a diagram 800 of an example of two possible locations for a station at points at which the station is a distance d away from the first station and a distance d″ away from the second station. Diagram 800 includes access point (AP) 804, access point (AP) 806, station 808, distance (d) 820, and second distance (d′) 822. Where two APs are used to reduce the number of potential locations for a station, there will be two distances d 820 and d′ 822. The two distances d 820 and d′ 822 will sweep circles around the APs. So long as the APs are not each at exactly the same location and have overlapping coverage areas, they will intersect at two points. Two possible locations are depicted.

FIG. 9 depicts a diagram 900 of an example of locating a device using three APs. Diagram 900 includes Access Point (AP) 902, Access Point (AP) 904, Access Point (AP) 906, station 908, distance (d) 920, second distance (d′) 922, and third distance (d′″) 924. Similarly to FIG. 8, in a two dimensional system, three APs located at different locations may locate a station in exactly one point. AP 902, AP 904, and AP 906 each estimate distances d, d′, and d″ respectively. d, d′, and d″ sweep three circles around AP 902, AP 904, and AP 906.

FIG. 10 depicts a diagram 1000 of an example of locating a device in three dimensional space using an AP. The system 1000 includes AP 1004, station 1008, and distance (d) 1012. In this case, the AP is able to estimate a distance which can be used to sweep a sphere around the AP. Where AP 1004 is used, station 1008 can, without taking into account physical limitations, may be found at any point, a distance d away from the AP. The multiple locations displayed could be three of many different possible locations lying on the sphere surrounding the AP.

FIG. 11 depicts a diagram 1100 of an example of locating a device in three dimensional space using four APs. The system 1100 includes station 1102, AP 1104, AP 1106, AP 1108, AP 1110, distance (d) 1124, second distance (d′) 1124, third distance (d′″) 1126, fourth distance (d′″) 1128.

In three dimensions, it may be necessary to use four APs to identify a single location for station 1102. This is because the intersection between two spheres representing distances d and d′ away from APs 1106 and 1108 may be a circle. A circle may intersect with the sphere representing the distance d″ away from AP 1108 in two points. Finally, a sphere representing the distance d′″ away from AP 1110 may intersect with a single one of the two points. This may identify a single point in three dimensions for a location of station 1102.

FIG. 12 depicts a diagram of an example of locating a rogue device on a floor plan using a wireless access domain. The diagram 1200 includes network management module 1202, display 1204, rogue 1205, network 1206, and wireless access domain 1207. A floorplan is an exemplary two dimensional model in which to locate a station however, many other two dimensional or three dimensional models could be used; this model is for purposes of example and not limitation. Herein, AP 1214-2, AP 1214-4, and AP 1214-5 (Collectively APs 1214) have, as a group, identified the location of a rouge station a distance d away from AP 1214-2, a distance d′ away from AP 1214-5, and a distance d″ from AP 1214-4. Dashed circles and arcs represent distances away from access points.

In the example of FIG. 12, wireless access domain 1207 contains wireless access areas 108-1 through 108-N, (collectively wireless access areas 1208). Wireless exchange switches 1210-1 to 1210-N (hereinafter collectively referred to as wireless exchange switches 1210), access points 1212-1 to 1212-N (hereinafter collectively referred to as access points 1212), and networks 1214-1 to 1214-N (hereinafter collectively referred to as networks 1214).

In the example of FIG. 12, an operator of station 1220 has placed station 1220 in a hidden area, e.g. an air vent, and has opted to employ station 1220 for malicious purposes, e.g. theft of trade secrets from a system server. A system administrator here may be faced with the options of (1) terminating service on APs 1214, or alternatively (2) eliminating the rogue. Since the system administrator has been given the estimated location of the rogue, security may be dispatched, and the rogue eliminated. This prevents the interruption of service.

Display 1204 may display not only warning messages, such as “Alert,” but also may display an entire floor plan animated with information about the location of rogues, clients, APs and other relevant information. Where the rogue is moving, the display may update the position of the rogue in real time.

FIG. 13 depicts a diagram 1300 of a system capable of calculating a distance to another device. The system 1300 may be a conventional computer system that can be used as a client computer system, such as a wireless client or a workstation, or a server computer system. The computer system 1300 includes a device 1302, I/O devices 1304, radio 1324, and a display device 1306. The device 1302 includes a processor 1308, a communications interface 1310, memory 1312, display controller 1314, non-volatile storage 1316, I/O controller 1318, clock 1320, and distance calculation engine 1322. The device 1302 may be coupled to or include the I/O devices 1304, display device 1306, and radio 1324.

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

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

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

The non-volatile storage 1316 is often a magnetic hard disk, an optical disk, or another form of storage for large amounts of data. Some of this data is often written, by a direct memory access process, into memory 1312 during execution of software in the device 1302. One of skill in the art will immediately recognize that the terms “machine-readable medium” or “computer-readable medium” includes any type of storage device that is accessible by the processor 1308 and is intended to encompass a carrier wave that encodes a data signal to the extent that such a carrier wave is patentable.

Clock 1320 can be any kind of oscillating circuit creating an electrical signal with a precise frequency. In a non-limiting example, clock 1320 could be a crystal oscillator using the mechanical resonance of vibrating crystal to generate the electrical signal.

Distance calculation engine 1322 includes functionality to estimate a distance between a first computing system and a second computing system.

Radio 1324 may be any combination of known or convenient electrical components including by way of example, but not limitation, transistors, capacitors, resistors, multiplexers, wiring, registers, diodes or any other electrical components known or convenient.

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

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

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

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

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

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

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

Claims

1. A system, comprising:

an access point (AP), wherein, in operation: the AP transmits a frame; stores a time of beginning of transmission, t0; if an acknowledgement frame is received the AP stores a time of completion of receiving, t1; and if the acknowledgement frame is not received after one or more frame transmissions, the AP denies future requests for access to a network from the station and sends an instruction to a network management module (NMM) to broadcast an address of the station to other APs in the network to allow the other APs to deny the station access; and
the NMM, coupled to the AP, including: memory having a value, tfixed, stored therein, representing a known frame exchange component period of time, and a value, c, representing the speed of light; a distance calculation engine, in operation, the distance calculation engine determining a distance, d, using a formula d=[(t1−t0−tfixed)/2]·c, d representing an estimated distance of the AP from the station; and a graphical display engine, wherein, in operation, the graphical display engine displays one or more predicted locations the distance, d, from the AP in a graphically rendered environment.

2. The system of claim 1 wherein, in operation, the AP transmits a plurality of frames, receives a responding acknowledgement paired to each frame transmitted; and wherein, in operation, the distance calculating engine calculates a plurality of distance values for paired frames from the plurality of times for t0 and t1 and averages the plurality of distance values to find an estimated distance.

3. The system of claim 1 wherein the graphically rendered environment is two dimensional.

4. The system of claim 1 wherein the one or more predicted locations are displayed on a circle, a location of the AP being at a center of the circle, the circle having a radius of length d.

5. The system of claim 1 further comprising:

a second AP, wherein, in operation, the second AP transmits a second frame; stores a second time of beginning of transmission, t0′; receives a second acknowledgement frame from the station; stores a second time of completion of receiving, t1′;
wherein, in operation, the distance calculating engine calculates a second distance d′ using a second formua d′=[(t1′−t0′−tfixed)/2]·c and d′ is used to reduce the one or more predicted locations to two or fewer predicted locations; wherein the two or fewer predicted locations are displayed at intersecting points of two circles, a location of the AP being at a center of a first circle having a radius of length d, a second location of the second AP being at a second center of the second circle having a radius of length d′.

6. The system of claim 5 further comprising:

a third AP; wherein, in operation, the third AP transmits a third frame; stores a third time of beginning of transmission, t0′; receives a third acknowledgement frame from the station; stores a third time of completion of receiving, t1′ wherein, in operation, the distance calculating engine is used to calculate a third distance d″ and the third distance d″ is used to reduce the one or more predicted locations to one location; the one location is at a point a distance d from the AP, a distance d′ from the second AP, and a distance d″ from the third AP.

7. The system of claim 1 wherein the graphically rendered environment is rendered in three dimensions.

8. The system of claim 1 further comprising:

a second AP, wherein, in operation, the second AP transmits a second frame; stores a second time of beginning of transmission, t0′; receives a second acknowledgement frame from the station; stores a second time of completion of receiving, t1′;
a third AP a third AP; wherein, in operation, the third AP transmits a third frame; stores a third time of beginning of transmission, t0″; receives a third acknowledgement frame from the station; stores a second time of completion of receiving, t1″;
a fourth AP a fourth AP; wherein, in operation, the fourth AP transmits a fourth frame; stores a fourth time of beginning of transmission, t0′″; receives a fourth acknowledgement frame from the station; stores a second time of completion of receiving, t1′″;
wherein in operation, the second AP calculates a second distance d′=[(t1′−t0′−tfixed)/2]·c, the third AP calculates a third distance d″=[(t1″−t0″−tfixed)/2]·c, the fourth AP calculates a fourth distance d′″=[(t1′″−t0′″−tfixed)/2]·c; wherein the distance d, the second distance d′, the third distance d″, and the fourth distance d′″ are used to identify a single point on the graphically rendered environment as a location of a station; the one location is at a point a distance d from the AP, a distance d′ from the second AP, a distance d″ from the third AP, and a distance d′″ from the fourth AP.

9. The system of claim 1 wherein the frame is a null frame.

10. A method, comprising:

transmitting a first message from a first access point (AP);
if a second message, associated with the first message, is not received from the station, (1) disabling future access to a network by a station and (2) broadcasting an address of the station to a second AP in the network to allow the second AP to deny the station access; and
predicting a location of the station if the second message is received from the station, comprising: calculating a time difference, Δt, between the start of transmission of the first message, t0 and receipt of the second message, t1, wherein Δt=t0−t1. calculating roundtrip propagation time by subtracting one or more fixed periods of time from Δt for one or more components of a frame exchange; determining a distance d by multiplying the speed of light by half the round trip propagation time; and predicting a location of the station based on d.

11. The method of claim 10 wherein the one or more fixed periods time subtracted from Δt include times used to prepare the first message for transmission and to prepare the second message for transmission.

12. The method of claim 10 wherein the one or more components of the frame exchange comprise:

a transmission frame physical layer convergence procedure;
a transmission frame mac header;
a transmission frame check sequence;
a short inter-frame space;
an acknowledge frame physical layer convergence procedure;
an acknowledge frame mac header;
an acknowledge frame check sequence.

13. The method of claim 10 wherein the method is performed in numerous iterations and an estimated distance is found by averaging the distance d from each of the numerous iterations.

14. The method of claim 10 wherein the first message includes a header and a body, and the body is null.

15. A device, comprising:

a radio;
a propagation distance calculating engine;
wherein, in operation: the radio sends a frame to a station, the propagation distance calculating engine records a time of start of transmission of the frame, when the radio does not receive an acknowledgement frame from the station, the device (1) denies future access to a network by the station through the device and (2) broadcasts an address of the station to other devices in the network to allow the other devices to deny access to the network by the station; and when the radio receives an acknowledgement frame from the station: the propagation distance calculating engine stores a time of completion of receiving the acknowledgement frame, and the propagation distance calculating engine calculates a distance by d=[(Δt−tfixed)/2]·c, c being the speed of light, Δt being the time of completion of receiving minus the time of start of transmission, and tfixed being a known frame exchange component period of time.

16. The device of claim 15 wherein, in operation, the radio sends a plurality of frames, the propagation distance calculating engine calculates a plurality of distance values, and the propagation distance calculating engine averages the distance values to calculate an estimate of the distance d.

17. The device of claim 15 wherein tfixed includes time components for a transmission frame physical layer convergence procedure, a transmission frame mac header, a transmission frame check sequence, a short inter-frame space, an acknowledgement frame physical layer convergence procedure, an acknowledge frame mac header, an acknowledge frame check sequence.

18. The device of claim 15 wherein the frame is a data null frame.

Referenced Cited
U.S. Patent Documents
3641433 February 1972 Mifflin et al.
4168400 September 18, 1979 De Couasnon et al.
4176316 November 27, 1979 DeRosa et al.
4247908 January 27, 1981 Lockart et al.
4291401 September 22, 1981 Bachmann
4291409 September 22, 1981 Weinberg et al.
4409470 October 11, 1983 Shepard et al.
4460120 July 17, 1984 Shepard et al.
4475208 October 2, 1984 Ricketts
4494238 January 15, 1985 Groth, Jr.
4500987 February 19, 1985 Hasegawa
4503533 March 5, 1985 Tobagi et al.
4550414 October 29, 1985 Guinon et al.
4562415 December 31, 1985 McBiles
4630264 December 16, 1986 Wah
4635221 January 6, 1987 Kerr
4639914 January 27, 1987 Winters
4644523 February 17, 1987 Horwitz
4672658 June 9, 1987 Kavehrad
4673805 June 16, 1987 Shepard et al.
4707839 November 17, 1987 Andren et al.
4730340 March 8, 1988 Frazier
4736095 April 5, 1988 Shepard et al.
4740792 April 26, 1988 Sagey et al.
4758717 July 19, 1988 Shepard et al.
4760586 July 26, 1988 Takeda
4789983 December 6, 1988 Acampora et al.
4829540 May 9, 1989 Waggener et al.
4850009 July 18, 1989 Zook et al.
4872182 October 3, 1989 Mcrae et al.
4894842 January 16, 1990 Brockhaven et al.
4901307 February 13, 1990 Gilhousen et al.
4933952 June 12, 1990 Albrieux et al.
4933953 June 12, 1990 Yagi
4955053 September 4, 1990 Siegmund
4995053 February 19, 1991 Simpson et al.
5008899 April 16, 1991 Yamamoto
5027343 June 25, 1991 Chan et al.
5029183 July 2, 1991 Tymes
5103459 April 7, 1992 Gilhousen et al.
5103461 April 7, 1992 Tymes
5109390 April 28, 1992 Gilhousen et al.
5119502 June 2, 1992 Kallin et al.
5142550 August 25, 1992 Tymes
5151919 September 29, 1992 Dent
5157687 October 20, 1992 Tymes
5187675 February 16, 1993 Dent et al.
5231633 July 27, 1993 Hluchyj et al.
5280498 January 18, 1994 Tymes et al.
5285494 February 8, 1994 Sprecher et al.
5327144 July 5, 1994 Stilp et al.
5329531 July 12, 1994 Diepstraten
5339316 August 16, 1994 Diepstraten
5371783 December 6, 1994 Rose et al.
5418812 May 23, 1995 Reyes et al.
5444851 August 22, 1995 Woest
5448569 September 5, 1995 Huang et al.
5450615 September 12, 1995 Fortune et al.
5465401 November 7, 1995 Thompson
5479441 December 26, 1995 Tymes et al.
5483676 January 9, 1996 Mahany et al.
5488569 January 30, 1996 Kaplan et al.
5491644 February 13, 1996 Pickering et al.
5517495 May 14, 1996 Lund
5519762 May 21, 1996 Bartlett
5528621 June 18, 1996 Heiman et al.
5542100 July 30, 1996 Hatakeyama
5546389 August 13, 1996 Wippenbeck et al.
5561841 October 1, 1996 Markus
5568513 October 22, 1996 Croft et al.
5570366 October 29, 1996 Baker et al.
5584048 December 10, 1996 Wieczorek
5598532 January 28, 1997 Liron
5630207 May 13, 1997 Gitlin et al.
5640414 June 17, 1997 Blakeney et al.
5649289 July 15, 1997 Wang et al.
5668803 September 16, 1997 Tymes et al.
5677954 October 14, 1997 Hirata et al.
5706428 January 6, 1998 Boer et al.
5715304 February 3, 1998 Nishida et al.
5729542 March 17, 1998 Dupont
5742592 April 21, 1998 Scholefield et al.
5774460 June 30, 1998 Schiffel et al.
5793303 August 11, 1998 Koga
5794128 August 11, 1998 Brockel et al.
5812589 September 22, 1998 Sealander et al.
5815811 September 29, 1998 Pinard et al.
5828653 October 27, 1998 Goss
5828960 October 27, 1998 Tang et al.
5835061 November 10, 1998 Stewart
5838907 November 17, 1998 Hansen
5844900 December 1, 1998 Hong et al.
5852722 December 22, 1998 Hamilton
5872968 February 16, 1999 Knox et al.
5875179 February 23, 1999 Tikalsky
5887259 March 23, 1999 Zicker et al.
5896561 April 20, 1999 Schrader et al.
5909686 June 1, 1999 Muller et al.
5915214 June 22, 1999 Reece et al.
5920821 July 6, 1999 Seazholtz et al.
5933607 August 3, 1999 Tate et al.
5938721 August 17, 1999 Dussell et al.
5949988 September 7, 1999 Feisullin et al.
5953669 September 14, 1999 Stratis et al.
5960335 September 28, 1999 Umemoto et al.
5969678 October 19, 1999 Stewart
5970066 October 19, 1999 Lowry et al.
5977913 November 2, 1999 Christ
5980078 November 9, 1999 Krivoshein et al.
5982779 November 9, 1999 Krishnakumar et al.
5987062 November 16, 1999 Engwer et al.
5987328 November 16, 1999 Ephremides et al.
5991817 November 23, 1999 Rowett et al.
5999813 December 7, 1999 Lu et al.
6005853 December 21, 1999 Wang et al.
6011784 January 4, 2000 Brown
6012088 January 4, 2000 Li et al.
6029196 February 22, 2000 Lenz
6041240 March 21, 2000 McCarthy et al.
6041358 March 21, 2000 Huang et al.
6070243 May 30, 2000 See et al.
6073075 June 6, 2000 Kondou et al.
6073152 June 6, 2000 De Vries
6078568 June 20, 2000 Wright
6088591 July 11, 2000 Trompower
6101539 August 8, 2000 Kennelly et al.
6115390 September 5, 2000 Chuah
6118771 September 12, 2000 Tajika et al.
6119009 September 12, 2000 Baranger et al.
6122520 September 19, 2000 Want et al.
6144638 November 7, 2000 Obenhuber et al.
6148199 November 14, 2000 Hoffman et al.
6154776 November 28, 2000 Martin
6160804 December 12, 2000 Ahmed et al.
6177905 January 23, 2001 Welch
6188649 February 13, 2001 Fine et al.
6199032 March 6, 2001 Anderson
6208629 March 27, 2001 Jaszewki et al.
6208841 March 27, 2001 Wallace et al.
6212395 April 3, 2001 Lu et al.
6218930 April 17, 2001 Katzenberg et al.
6240078 May 29, 2001 Kuhnel et al.
6240083 May 29, 2001 Wright
6240291 May 29, 2001 Narasimhan et al.
6246751 June 12, 2001 Bergl et al.
6249252 June 19, 2001 Dupray
6256300 July 3, 2001 Ahmed et al.
6256334 July 3, 2001 Adachi
6259405 July 10, 2001 Stewart et al.
6262988 July 17, 2001 Vig
6269246 July 31, 2001 Rao et al.
6285662 September 4, 2001 Watannabe
6304596 October 16, 2001 Yamano et al.
6304906 October 16, 2001 Bhatti et al.
6317599 November 13, 2001 Rappaport et al.
6326918 December 4, 2001 Stewart
6336035 January 1, 2002 Somoza et al.
6336152 January 1, 2002 Richman et al.
6347091 February 12, 2002 Wallentin et al.
6356758 March 12, 2002 Almeida et al.
6393290 May 21, 2002 Ulfongene
6397040 May 28, 2002 Titmuss et al.
6404772 June 11, 2002 Beach et al.
6421714 July 16, 2002 Rai et al.
6429879 August 6, 2002 Sturgeon et al.
6446206 September 3, 2002 Feldbaum
6456239 September 24, 2002 Werb et al.
6470025 October 22, 2002 Wilson et al.
6473449 October 29, 2002 Cafarella et al.
6493679 December 10, 2002 Rappaport et al.
6496290 December 17, 2002 Lee
6512916 January 28, 2003 Forbes, Jr.
6526275 February 25, 2003 Calvert
6535732 March 18, 2003 McIntosh et al.
6564380 May 13, 2003 Murphy
6567146 May 20, 2003 Hirakata et al.
6567416 May 20, 2003 Chuah
6574240 June 3, 2003 Tzeng
6580700 June 17, 2003 Pinard et al.
6587680 July 1, 2003 Ata-Laurila et al.
6587835 July 1, 2003 Treyz et al.
6603970 August 5, 2003 Huelamo Platas et al.
6614787 September 2, 2003 Jain et al.
6615276 September 2, 2003 Mastrianni et al.
6624762 September 23, 2003 End, III
6625454 September 23, 2003 Rappaport et al.
6631267 October 7, 2003 Clarkson et al.
6650912 November 18, 2003 Chen et al.
6658389 December 2, 2003 Alpdemir
6659947 December 9, 2003 Carter et al.
6674403 January 6, 2004 Gray et al.
6677894 January 13, 2004 Sheynblat et al.
6678516 January 13, 2004 Nordman et al.
6678802 January 13, 2004 Hickson
6687498 February 3, 2004 McKenna et al.
6697415 February 24, 2004 Mahany
6721334 April 13, 2004 Ketcham
6725260 April 20, 2004 Philyaw
6738629 May 18, 2004 McCormick et al.
6747961 June 8, 2004 Ahmed et al.
6756940 June 29, 2004 Oh et al.
6760324 July 6, 2004 Scott et al.
6785275 August 31, 2004 Boivie et al.
6798788 September 28, 2004 Viswanath et al.
6801782 October 5, 2004 McCrady et al.
6826399 November 30, 2004 Hoffman et al.
6839338 January 4, 2005 Amara et al.
6839348 January 4, 2005 Tang et al.
6839388 January 4, 2005 Vaidyanathan
6847620 January 25, 2005 Meier
6847892 January 25, 2005 Zhou et al.
6856800 February 15, 2005 Henry et al.
6879812 April 12, 2005 Agrawal et al.
6901439 May 31, 2005 Bonasia et al.
6917688 July 12, 2005 Yu et al.
6934260 August 23, 2005 Kanuri
6937566 August 30, 2005 Forslow
6938079 August 30, 2005 Anderson et al.
6957067 October 18, 2005 Iyer et al.
6973622 December 6, 2005 Rappaport et al.
6978301 December 20, 2005 Tindal
6980533 December 27, 2005 Abraham et al.
6985469 January 10, 2006 Leung
6993683 January 31, 2006 Bhat et al.
6996630 February 7, 2006 Masaki et al.
7013157 March 14, 2006 Norman et al.
7020438 March 28, 2006 Sinivaara et al.
7020773 March 28, 2006 Otway et al.
7024199 April 4, 2006 Massie et al.
7024394 April 4, 2006 Ashour et al.
7027773 April 11, 2006 McMillin
7031705 April 18, 2006 Grootwassink
7035220 April 25, 2006 Simcoe
7039037 May 2, 2006 Wang et al.
7058414 June 6, 2006 Rofheart et al.
7062566 June 13, 2006 Amara et al.
7068999 June 27, 2006 Ballai
7079537 July 18, 2006 Kanuri et al.
7089322 August 8, 2006 Stallmann
7092529 August 15, 2006 Yu et al.
7110756 September 19, 2006 Diener
7116979 October 3, 2006 Backes et al.
7126913 October 24, 2006 Patel et al.
7134012 November 7, 2006 Doyle et al.
7139829 November 21, 2006 Wenzel et al.
7142867 November 28, 2006 Gandhi et al.
7146166 December 5, 2006 Backes et al.
7155236 December 26, 2006 Chen et al.
7155518 December 26, 2006 Forslow
7158777 January 2, 2007 Lee et al.
7159016 January 2, 2007 Baker
7221927 May 22, 2007 Kolar et al.
7224970 May 29, 2007 Smith et al.
7239862 July 3, 2007 Clare et al.
7246243 July 17, 2007 Uchida
7263366 August 28, 2007 Miyashita
7274730 September 25, 2007 Nakabayashi
7280495 October 9, 2007 Zweig et al.
7290051 October 30, 2007 Dobric et al.
7293136 November 6, 2007 More et al.
7310664 December 18, 2007 Merchant et al.
7317914 January 8, 2008 Adya et al.
7320070 January 15, 2008 Baum
7324468 January 29, 2008 Fischer
7324487 January 29, 2008 Saito
7324489 January 29, 2008 Iyer et al.
7350077 March 25, 2008 Meier et al.
7359676 April 15, 2008 Hrastar
7370362 May 6, 2008 Olson et al.
7376080 May 20, 2008 Riddle et al.
7379423 May 27, 2008 Caves et al.
7382756 June 3, 2008 Barber et al.
7417953 August 26, 2008 Hicks et al.
7421248 September 2, 2008 Laux et al.
7421487 September 2, 2008 Peterson et al.
7440416 October 21, 2008 Mahany et al.
7443823 October 28, 2008 Hunkeler et al.
7460855 December 2, 2008 Barkley et al.
7466678 December 16, 2008 Cromer et al.
7475130 January 6, 2009 Silverman
7477894 January 13, 2009 Sinha
7480264 January 20, 2009 Duo et al.
7483390 January 27, 2009 Rover et al.
7489648 February 10, 2009 Griswold
7493407 February 17, 2009 Leedom et al.
7505434 March 17, 2009 Backes
7509096 March 24, 2009 Palm et al.
7529925 May 5, 2009 Harkins
7551574 June 23, 2009 Peden, II et al.
7551619 June 23, 2009 Tiwari
7558266 July 7, 2009 Hu
7570656 August 4, 2009 Raphaeli et al.
7573859 August 11, 2009 Taylor
7577453 August 18, 2009 Matta
7592906 September 22, 2009 Hanna et al.
7636363 December 22, 2009 Chang et al.
7680501 March 16, 2010 Sillasto et al.
7693526 April 6, 2010 Qian et al.
7715432 May 11, 2010 Bennett
7716379 May 11, 2010 Ruan et al.
7724703 May 25, 2010 Matta et al.
7724704 May 25, 2010 Simons et al.
7729278 June 1, 2010 Chari et al.
7733868 June 8, 2010 Van Zijst
7746897 June 29, 2010 Stephenson et al.
7788475 August 31, 2010 Zimmer et al.
7805529 September 28, 2010 Galluzzo et al.
7817554 October 19, 2010 Skog et al.
7844298 November 30, 2010 Riley
7865713 January 4, 2011 Chesnutt et al.
7873061 January 18, 2011 Gast et al.
7912982 March 22, 2011 Murphy
7929922 April 19, 2011 Kubo
7945399 May 17, 2011 Nosovitsky et al.
20010024953 September 27, 2001 Balogh
20020021701 February 21, 2002 Lavian et al.
20020052205 May 2, 2002 Belostofsky et al.
20020060995 May 23, 2002 Cervello et al.
20020062384 May 23, 2002 Tso
20020069278 June 6, 2002 Forslow
20020078361 June 20, 2002 Giroux et al.
20020080790 June 27, 2002 Beshai
20020087699 July 4, 2002 Karagiannis et al.
20020094824 July 18, 2002 Kennedy et al.
20020095486 July 18, 2002 Bahl
20020101868 August 1, 2002 Clear et al.
20020116655 August 22, 2002 Lew et al.
20020157020 October 24, 2002 Royer
20020174137 November 21, 2002 Wolff et al.
20020176437 November 28, 2002 Busch et al.
20020191572 December 19, 2002 Weinstein et al.
20020194251 December 19, 2002 Richter et al.
20030014646 January 16, 2003 Buddhikot et al.
20030018889 January 23, 2003 Burnett et al.
20030043073 March 6, 2003 Gray et al.
20030055959 March 20, 2003 Sato
20030107590 June 12, 2003 Levillain et al.
20030120764 June 26, 2003 Laye et al.
20030133450 July 17, 2003 Baum
20030134642 July 17, 2003 Kostic et al.
20030135762 July 17, 2003 Macaulay
20030156586 August 21, 2003 Lee et al.
20030174706 September 18, 2003 Shankar et al.
20030193910 October 16, 2003 Shoaib et al.
20030204596 October 30, 2003 Yadav
20030227934 December 11, 2003 White et al.
20040002343 January 1, 2004 Brauel et al.
20040003285 January 1, 2004 Whelan et al.
20040019857 January 29, 2004 Teig et al.
20040025044 February 5, 2004 Day
20040029580 February 12, 2004 Haverinen et al.
20040030777 February 12, 2004 Reedy et al.
20040038687 February 26, 2004 Nelson
20040044749 March 4, 2004 Harkin
20040047320 March 11, 2004 Eglin
20040053632 March 18, 2004 Nikkelen et al.
20040054569 March 18, 2004 Pombo et al.
20040054774 March 18, 2004 Barber et al.
20040054926 March 18, 2004 Ocepek et al.
20040062267 April 1, 2004 Minami et al.
20040064560 April 1, 2004 Zhang et al.
20040068668 April 8, 2004 Lor et al.
20040078598 April 22, 2004 Barber et al.
20040093506 May 13, 2004 Grawrock et al.
20040095914 May 20, 2004 Katsube et al.
20040095932 May 20, 2004 Astarabadi et al.
20040106403 June 3, 2004 Mori et al.
20040111640 June 10, 2004 Baum
20040114546 June 17, 2004 Seshadri et al.
20040119641 June 24, 2004 Rapeli
20040120370 June 24, 2004 Lupo
20040143428 July 22, 2004 Rappaport et al.
20040165545 August 26, 2004 Cook
20040174900 September 9, 2004 Volpi et al.
20040184475 September 23, 2004 Meier
20040208570 October 21, 2004 Reader
20040214572 October 28, 2004 Thompson et al.
20040221042 November 4, 2004 Meier
20040230370 November 18, 2004 Tzamaloukas
20040233234 November 25, 2004 Chaudhry et al.
20040236702 November 25, 2004 Fink et al.
20040246937 December 9, 2004 Duong et al.
20040246962 December 9, 2004 Kopeikin et al.
20040255167 December 16, 2004 Knight
20040259542 December 23, 2004 Viitamaki et al.
20040259555 December 23, 2004 Rappaport et al.
20040259575 December 23, 2004 Perez-Breva et al.
20050015592 January 20, 2005 Lin
20050021979 January 27, 2005 Wiedmann et al.
20050025105 February 3, 2005 Rue
20050026611 February 3, 2005 Backes
20050030894 February 10, 2005 Stephens
20050030929 February 10, 2005 Swier et al.
20050037818 February 17, 2005 Seshadri et al.
20050040968 February 24, 2005 Damarla et al.
20050054326 March 10, 2005 Rogers
20050054350 March 10, 2005 Zegelin
20050058132 March 17, 2005 Okano et al.
20050059405 March 17, 2005 Thomson et al.
20050059406 March 17, 2005 Thomson et al.
20050064873 March 24, 2005 Karaoguz et al.
20050068925 March 31, 2005 Palm et al.
20050073980 April 7, 2005 Thomson et al.
20050078644 April 14, 2005 Tsai et al.
20050097618 May 5, 2005 Arling et al.
20050114649 May 26, 2005 Challener et al.
20050120125 June 2, 2005 Morten et al.
20050122927 June 9, 2005 Wentink
20050122977 June 9, 2005 Lieberman
20050128142 June 16, 2005 Shin et al.
20050128989 June 16, 2005 Bhagwat et al.
20050144237 June 30, 2005 Heredia et al.
20050154933 July 14, 2005 Hsu et al.
20050157730 July 21, 2005 Grant et al.
20050159154 July 21, 2005 Goren
20050163078 July 28, 2005 Oba et al.
20050163146 July 28, 2005 Ota et al.
20050175027 August 11, 2005 Miller et al.
20050180345 August 18, 2005 Meier
20050180358 August 18, 2005 Kolar et al.
20050181805 August 18, 2005 Gallagher
20050190714 September 1, 2005 Gorbatov et al.
20050193103 September 1, 2005 Drabik
20050207336 September 22, 2005 Choi et al.
20050213519 September 29, 2005 Relan et al.
20050220033 October 6, 2005 DelRegno et al.
20050223111 October 6, 2005 Bhandaru et al.
20050239461 October 27, 2005 Verma et al.
20050240665 October 27, 2005 Gu et al.
20050243737 November 3, 2005 Dooley et al.
20050245258 November 3, 2005 Classon et al.
20050245269 November 3, 2005 Demirhan et al.
20050259597 November 24, 2005 Benedetto et al.
20050259611 November 24, 2005 Bhagwat et al.
20050270992 December 8, 2005 Sanzgiri et al.
20050273442 December 8, 2005 Bennett
20050276218 December 15, 2005 Ooghe et al.
20050286466 December 29, 2005 Tagg et al.
20060030290 February 9, 2006 Rudolf et al.
20060035662 February 16, 2006 Jeong et al.
20060039395 February 23, 2006 Perez-Costa et al.
20060041683 February 23, 2006 Subramanian et al.
20060045050 March 2, 2006 Floros et al.
20060046744 March 2, 2006 Dublish et al.
20060050742 March 9, 2006 Grandhi et al.
20060073847 April 6, 2006 Pirzada et al.
20060094440 May 4, 2006 Meier et al.
20060098607 May 11, 2006 Zeng et al.
20060104224 May 18, 2006 Singh et al.
20060114872 June 1, 2006 Hamada
20060117174 June 1, 2006 Lee
20060128415 June 15, 2006 Horikoshi et al.
20060143496 June 29, 2006 Silverman
20060152344 July 13, 2006 Mowery
20060160540 July 20, 2006 Strutt et al.
20060161983 July 20, 2006 Cothrell et al.
20060165103 July 27, 2006 Trudeau et al.
20060168383 July 27, 2006 Lin
20060174336 August 3, 2006 Chen
20060178168 August 10, 2006 Roach
20060182118 August 17, 2006 Lam et al.
20060189311 August 24, 2006 Cromer et al.
20060193258 August 31, 2006 Ballai
20060200862 September 7, 2006 Olson et al.
20060206582 September 14, 2006 Finn
20060215601 September 28, 2006 Vieugels et al.
20060217131 September 28, 2006 Alizadeh-Shabdiz et al.
20060245393 November 2, 2006 Bajic
20060248229 November 2, 2006 Saunderson et al.
20060248331 November 2, 2006 Harkins
20060274774 December 7, 2006 Srinivasan et al.
20060276192 December 7, 2006 Dutta et al.
20060285489 December 21, 2006 Francisco et al.
20060292992 December 28, 2006 Tajima et al.
20070002833 January 4, 2007 Bajic
20070008884 January 11, 2007 Tang
20070011318 January 11, 2007 Roth
20070025265 February 1, 2007 Porras et al.
20070025306 February 1, 2007 Cox et al.
20070027964 February 1, 2007 Herrod et al.
20070054616 March 8, 2007 Culbert
20070058598 March 15, 2007 Ling
20070064673 March 22, 2007 Bhandaru et al.
20070064718 March 22, 2007 Ekl et al.
20070067823 March 22, 2007 Shim et al.
20070070937 March 29, 2007 Demirhan et al.
20070076694 April 5, 2007 Iyer et al.
20070083924 April 12, 2007 Lu
20070086378 April 19, 2007 Matta et al.
20070086397 April 19, 2007 Taylor
20070086398 April 19, 2007 Tiwari
20070091845 April 26, 2007 Brideglall
20070091889 April 26, 2007 Xiao et al.
20070098086 May 3, 2007 Bhaskaran
20070115842 May 24, 2007 Matsuda et al.
20070133494 June 14, 2007 Lai et al.
20070135866 June 14, 2007 Baker et al.
20070136372 June 14, 2007 Proctor et al.
20070160046 July 12, 2007 Matta
20070171909 July 26, 2007 Pignatelli
20070183375 August 9, 2007 Tiwari
20070189222 August 16, 2007 Kolar et al.
20070195793 August 23, 2007 Grosser et al.
20070230457 October 4, 2007 Kodera et al.
20070248009 October 25, 2007 Petersen
20070253380 November 1, 2007 Jollota et al.
20070255116 November 1, 2007 Mehta et al.
20070258448 November 8, 2007 Hu
20070260720 November 8, 2007 Morain
20070268506 November 22, 2007 Zeldin
20070268514 November 22, 2007 Zeldin et al.
20070268515 November 22, 2007 Freund et al.
20070268516 November 22, 2007 Bugwadia et al.
20070286208 December 13, 2007 Kanada et al.
20070287390 December 13, 2007 Murphy et al.
20070291689 December 20, 2007 Kapur et al.
20070297329 December 27, 2007 Park et al.
20080002588 January 3, 2008 McCaughan et al.
20080008117 January 10, 2008 Alizadeh-Shabdiz
20080013481 January 17, 2008 Simons et al.
20080014916 January 17, 2008 Chen
20080031257 February 7, 2008 He
20080056200 March 6, 2008 Johnson
20080056211 March 6, 2008 Kim et al.
20080064356 March 13, 2008 Khayrallah
20080069018 March 20, 2008 Gast
20080080441 April 3, 2008 Park et al.
20080102815 May 1, 2008 Sengupta et al.
20080107077 May 8, 2008 Murphy
20080114784 May 15, 2008 Murphy
20080117822 May 22, 2008 Murphy et al.
20080151844 June 26, 2008 Tiwari
20080159319 July 3, 2008 Gast et al.
20080162921 July 3, 2008 Chesnutt et al.
20080226075 September 18, 2008 Gast
20080228942 September 18, 2008 Lor et al.
20080250496 October 9, 2008 Namihira
20080261615 October 23, 2008 Kalhan
20080276303 November 6, 2008 Gast
20090031044 January 29, 2009 Barrack et al.
20090046688 February 19, 2009 Volpi et al.
20090059930 March 5, 2009 Ryan et al.
20090067436 March 12, 2009 Gast
20090073905 March 19, 2009 Gast
20090198999 August 6, 2009 Harkins
20090247103 October 1, 2009 Aragon
20090257437 October 15, 2009 Tiwari
20090260083 October 15, 2009 Szeto et al.
20090274060 November 5, 2009 Taylor
20090287816 November 19, 2009 Matta et al.
20090293106 November 26, 2009 Peden, II et al.
20100002610 January 7, 2010 Bowser et al.
20100024007 January 28, 2010 Gast
20100040059 February 18, 2010 Hu
20100067379 March 18, 2010 Zhao et al.
20100172276 July 8, 2010 Aragon
20100180016 July 15, 2010 Bugwadia et al.
20100195549 August 5, 2010 Aragon et al.
20100261475 October 14, 2010 Kim et al.
20100329177 December 30, 2010 Murphy et al.
20110128858 June 2, 2011 Matta et al.
20110158122 June 30, 2011 Murphy et al.
Foreign Patent Documents
0 992 921 April 2000 EP
1 542 409 June 2005 EP
2329801 March 1999 GB
2429080 February 2007 GB
2000-215169 August 2000 JP
2003-234751 August 2003 JP
2003274454 September 2003 JP
2004-032525 January 2004 JP
WO 94/03986 February 1994 WO
WO 99/11003 March 1999 WO
WO 00/06271 February 2000 WO
WO 00/18148 March 2000 WO
WO-02089442 November 2002 WO
WO 03/085544 October 2003 WO
WO-2004013986 February 2004 WO
WO 2004/095192 November 2004 WO
WO 2004/095800 November 2004 WO
Other references
  • Co-pending U.S. Appl. No. 10/235,338, filed Sep. 5, 2002.
  • Notice of Allowance Mailed Jul. 29, 2003 in Co-pending U.S. Appl. No. 10/235,338, filed Sep. 5, 2002.
  • Non-Final Offce Action Mailed Jan. 8, 2003 in Co-pending U.S. Appl. No. 10/235,338, filed Sep. 5, 2002.
  • Notice of Allowance Mailed Mar. 23, 2009 in Co-pending U.S. Appl. No. 11/094,987, filed Mar. 31, 2005.
  • Non-Final Offce Action Mailed Oct. 21, 2008 in Co-pending U.S. Appl. No. 11/094,987, filed Mar. 31, 2005.
  • Final Offce Action Mailed May 23, 2008 in Co-pending U.S. Appl. No. 11/094,987, filed Mar. 31, 2005.
  • Non-Final Offce Action Mailed Dec. 27, 2007, 2009 in Co-pending U.S. Appl. No. 11/094,987, filed Mar. 31, 2005.
  • Co-pending U.S. Appl. No. 12/474,020, filed May 28, 2009.
  • Non-Final Offce Action Mailed Jun. 3, 2010 in Co-pending U.S. Appl. No. 12/474,020, filed May 28, 2009.
  • Co-pending U.S. Appl. No. 09/866,474, filed May 29, 2001.
  • Non-Final Office Action Mailed Jun. 10, 2005 in Co-pending U.S. Appl. No. 09/866,474, filed May 29, 2001.
  • International Search Report of PCT/US2002/028090, Aug. 13, 2003, 3 pages.
  • Bahl et al., “User Location and Tracking in an In-Building Radio Network”, Microsoft Research, Feb. 1999.
  • U.S. Appl. No. 11/326,966, filed Jan. 2006, Taylor.
  • U.S. Appl. No. 11/330,877, filed Jan. 2006, Matta.
  • U.S. Appl. No. 11/331,789, filed Jan. 2006, Matta, et al.
  • U.S. Appl. No. 11/351,104, filed Feb. 2006, Tiwari.
  • U.S. Appl. No. 11/377,859, filed Mar. 2006, Harkins.
  • U.S. Appl. No. 11/400,165, filed Apr. 2006, Tiwari.
  • U.S. Appl. No. 11/445,750, filed May 2006, Matta.
  • U.S. Appl. No. 11/417,830, filed May 2006, Morain.
  • U.S. Appl. No. 11/417,993, filed May 2006, Jar et al.
  • U.S. Appl. No. 11/437,537, filed May 2006, Freund et al.
  • U.S. Appl. No. 11/437,538, filed May 2006, Zeldin.
  • U.S. Appl. No. 11/437,387, filed May 2006, Zeldin et al.
  • U.S. Appl. No. 11/437,582, filed May 2006, Bugwadia et al.
  • U.S. Appl. No. 11/451,704, filed Jun. 2006, Riley.
  • 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/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/975,134, filed Oct. 2007, Aragon et al.
  • U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast, Matthew S.
  • 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, 1977, pp. 45-50.
  • Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
  • Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.
  • Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).
  • Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.
  • Puttini, R., Percher, J., Me, L., and de Sousa, R. 2004. A fully distributed IDS for MANET. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 vol. 2 (ISCC 04)—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.
  • U.S. Appl. No. 12/474,020, filed May 28, 2009, Peden, II et al.
  • Radar: An In-Building RF-based User Location and Tracking System, P. Bahl et al., Microsoft Research, Mar. 2000.
  • Evaluation of RSSI-Based Human Tracking, J. Latvala et al, Proceedings for the 2000 European Signal Processing Conference, Sep. 2000.
  • User Location and Tracking in an In-Building Radio Network, P. Bahl et al., Microsoft Research, Feb. 1999.
  • A Software System for Locating Mobile Users: Design, Evaluation, and Lessons, P. Bahl et al., Microsoft Research, Apr. 2000.
  • Chen, et al., “Enabling Location-Based Services on Wireless LANs”, 11.sup.th 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), p. 343-345, Aug. 2001.
  • Ultra wideband (UWB) Radios for Precision Location, Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001.
  • Barber, S., Monitoring 802.1 Networks, IEEE 802.11, Sydney, NSW, May 13-17, 2002.
  • Bahl, P. and V. Padmanabhan, Radar; An In-Building RF-based User Location and Tracking System, Microsoft Research, Mar. 2000.
  • Latvala, J., J. Syrjarinne, S. Niemi and J. Niittylahti, Patient Tracking in a Hospital Environment Using Extended Kalman-filtering, Proceedings of the 1999 Middle East Conference on Networking, Nov. 1999.
  • Myllymaki, P., T. Roos, H. Tirri, P. Misikangas and J. Sievanen, A Probabilistic Approach to WLAN User Location Estimation, Third IEEE Workshop on Wireless Local Area Networks, Sep. 27-28, 2001.
  • 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://sern.uccalgary.ca˜lawa/SENG60921/arch/SDP.htm> [retrieved Aug. 12, 2004] (15 pages).
  • Potter, B., and Fleck, B., 802.11 Security, O'Reilly Media Inc., Dec. 2002, 14 pages.
  • McCann, S., et al., “Emergency Services for 802,” IEEE 802.11-07/0505r1, Mar. 2007, 27 pages.
  • Di Sorte, D., et al., “On the Performance of Service Publishing in IEEE 802.11 Multi-Access Environment,” IEEE Communications Letters, vol. 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/monarch-papers/dsr-chapter00.pdf).
  • Information Sciences Institute, RFC-791—Internet Protocol, DARPA, Sep. 1981.
  • U.S. Appl. No. 12/603,391, filed Oct. 21, 2009.
  • U.S. Appl. No. 12/763,057, filed Apr. 19, 2010.
  • U.S. Appl. No. 13/006,950, filed Jan. 14, 2011.
  • U.S. Appl. No. 13/017,801, filed Jan. 31, 2011.
  • Office Action for U.S. Appl. No. 11/784,307, mailed Sep. 22, 2009.
  • Final Office Action for U.S. Appl. No. 11/784,307, mailed Jun. 14, 2010.
  • Non-Final Office Action for U.S. Appl. No. 11/377,859, mailed Jan. 8, 2008.
  • Final Office Action for U.S. Appl. No. 11/377,859, mailed Aug. 27, 2008.
  • Office Action for U.S. Appl. No. 12/401,073, mailed Aug. 23, 2010.
  • Final Office Action for U.S. Appl. No. 12/401,073, mailed Apr. 1, 2011.
  • Office Action for U.S. Appl. No. 12/401,073, mailed Sep. 20, 2011.
  • Office Action for U.S. Appl. No. 11/326,966, mailed Nov. 14, 2008.
  • Office Action for U.S. Appl. No. 12/500,392, mailed Jun. 20, 2011.
  • Office Action for U.S. Appl. No. 11/400,165, mailed Aug. 19, 2008.
  • Office Action for U.S. Appl. No. 12/489,295, mailed Apr. 27, 2011.
  • Office Action for U.S. Appl. No. 11/330,877, mailed Sep. 11, 2008.
  • Final Office Action for U.S. Appl. No. 11/330,877, mailed Mar. 13, 2009.
  • Office Action for U.S. Appl. No. 11/330,877, mailed Aug. 6, 2009.
  • Final Office Action for U.S. Appl. No. 11/330,877, mailed Apr. 22, 2010.
  • Office Action for U.S. Appl. No. 11/330,877, mailed Jan. 13, 2011.
  • Final Office Action for U.S. Appl. No. 11/330,877, mailed May 27, 2011.
  • Office Action for U.S. Appl. No. 11/351,104, mailed Oct. 28, 2008.
  • Office Action for U.S. Appl. No. 11/351,104, mailed Dec. 2, 2009.
  • Final Office Action for U.S. Appl. No. 11/351,104, mailed Jun. 10, 2009.
  • Office Action for U.S. Appl. No. 11/351,104, mailed May 26, 2010.
  • Office Action for U.S. Appl. No. 11/351,104, mailed Nov. 29, 2010.
  • Office Action for U.S. Appl. No. 11/351,104, mailed Jul. 26, 2011.
  • Office Action for U.S. Appl. No. 11/437,537, mailed Dec. 23, 2008.
  • Final Office Action for U.S. Appl. No. 11/437,537, mailed Jul. 16, 2009.
  • Office Action for U.S. Appl. No. 11/331,789, mailed Jun. 13, 2008.
  • Final Office Action for U.S. Appl. No. 11/331,789, mailed Oct. 23, 2008.
  • Office Action for U.S. Appl. No. 11/331,789, mailed Aug. 5, 2009.
  • Office Action for U.S. Appl. No. 12/785,362, mailed Apr. 22, 2011.
  • Office Action for U.S. Appl. No. 11/417,830, mailed Nov. 14, 2008.
  • Final Office Action for U.S. Appl. No. 11/417,830, mailed May 28, 2009.
  • Office Action for U.S. Appl. No. 11/417,993, mailed Oct. 29, 2008.
  • Office Action for U.S. Appl. No. 12/370,562, mailed Sep. 30, 2010.
  • Office Action for U.S. Appl. No. 12/370,562, mailed Apr. 6, 2011.
  • Office Action for U.S. Appl. No. 11/592,891, mailed Jan. 15, 2009.
  • Final Office Action for U.S. Appl. No. 11/592,891, mailed Jul. 20, 2009.
  • Office Action for U.S. Appl. No. 11/595,119, mailed Jul. 21, 2009.
  • Final Office Action for U.S. Appl. No. 11/595,119, mailed Jan. 5, 2010.
  • Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 19, 2010.
  • Final Office Action for U.S. Appl. No. 11/595,119, mailed Aug. 2, 2011.
  • Office Action for U.S. Appl. No. 11/604,075, mailed May 3, 2010.
  • Office Action for U.S. Appl. No. 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/487,722, mailed Aug. 7, 2009.
  • Office Action for U.S. Appl. No. 11/643,329, mailed Jul. 9, 2010.
  • Office Action for U.S. Appl. No. 11/648,359, mailed Nov. 19, 2009.
  • Office Action for U.S. Appl. No. 12/077,051, mailed Dec. 28, 2010.
  • Office Action for U.S. Appl. No. 12/113,535, mailed Apr. 21, 2011.
  • 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/350,927, mailed Aug. 17, 2011.
  • Office Action for U.S. Appl. No. 12/365,891, mailed Aug. 29, 2011.
  • 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.
  • 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/US05/004702, mailed Aug. 10, 2006.
  • International Search Report and Written Opinion for PCT/US06/40500, mailed Aug. 17, 2007.
  • International Search Report and Written Opinion for PCT/US06/40498, mailed Dec. 28, 2007.
  • International Search Report and Written Opinion for PCT/US2007/012194 dated Feb. 4, 2008.
  • International Search Report and Written Opinion for PCT/US06/40499, mailed Dec. 13, 2007.
  • International Search Report and Written Opinion for PCT/US2007/19696, mailed Feb. 29, 2008.
  • International Search Report and Written Opinion for PCT/US2007/12016, mailed Jan. 4, 2008.
  • International Search Report and Written Opinion for PCT/US2007/012195, mailed Mar. 19, 2008.
  • International Search Report and Written Opinion for PCT/US07/013758 mailed Apr. 3, 2008.
  • First Office Action for Chinese Application No. 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/US07/14847, mailed Apr. 1, 2008.
  • International Search Report and Written Opinion for PCT/US07/089134, mailed Apr. 10, 2008.
  • International Search Report and Written Opinion for PCT/US2008/010708, mailed May 18, 2009.
  • 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.
Patent History
Patent number: 8126481
Type: Grant
Filed: Nov 21, 2007
Date of Patent: Feb 28, 2012
Patent Publication Number: 20090131082
Assignee: Trapeze Networks, Inc. (Pleasanton, CA)
Inventor: Matthew Stuart Gast (San Francisco, CA)
Primary Examiner: Nimesh Patel
Application Number: 11/944,346