Wireless access points providing hybrid 802.11 and scheduled priority access communications

Information

  • Patent Grant
  • 10785608
  • Patent Number
    10,785,608
  • Date Filed
    Friday, May 5, 2017
    7 years ago
  • Date Issued
    Tuesday, September 22, 2020
    4 years ago
Abstract
Wireless access points providing hybrid 802.11 and scheduled priority access communications are provided herein. An exemplary wireless access point may be configured to communicate with a set of standard access clients using an 802.11 mode of communication during standard access phases, as well as communicate with a set of priority access clients during priority access phases, when the wireless access point is not communicating with the set of standard access clients, using a priority mode of communication.
Description
FIELD OF THE INVENTION

The present invention relates generally to wireless communications, and more specifically, but not by way of limitation, to wireless access points that are configured to service a hybrid collection of standard 802.11 clients and priority access clients.


BACKGROUND

A wireless access point (AP) is a device that allows wireless devices such as computers, telephones, appliances, and other similar network enabled computing devices to connect to a wired network using Wi-Fi, or related standards. The AP allows the network enabled devices to access, for example, the Internet, or allows the network enabled devices to communicate with one another over the network. APs typically utilize one or more protocols specified in the IEEE 802.11 standards. That is, an AP may be configured to service clients that utilize one or more protocols that are IEEE 802.11 standards compliant.


According to some embodiments, the present disclosure is directed to a wireless access point that comprises: (a) a processor; and (b) a memory for storing instructions, wherein the instructions when executed by the processor cause the wireless access point to perform operations comprising: (i) communicating with a set of standard access clients using an 802.11 mode of communication during standard access phases; and (ii) communicating with a set of priority access clients during priority access phases, when the wireless access point is not communicating with the set of standard access clients, using a priority mode of communication.


According to some embodiments, the present disclosure is directed to a method of communicating with standard 802.11 clients and priority access clients that utilize a priority access MAC protocol, using a wireless access point. The method may comprise: (i) silencing both standard access clients and priority access clients prior to standard access phases; (ii) communicating with standard access clients using an 802.11 mode of communication during standard access phases; (iii) silencing both standard access clients and priority access clients prior to priority access phases; and (iv) communicating with groups of priority access clients during priority access phases using the priority access MAC protocol.


According to some embodiments, the present disclosure is directed to a computing device configured to communicate with a wireless access point using a media access control (MAC) protocol. The computing device comprises: (a) a processor; and (b) a memory for storing a MAC protocol, wherein the MAC protocol is executed by the processor to: (i) evaluate a priority activation frame received from the wireless access point to determine if a group identifier included in the priority activation frame corresponds to a group identifier assigned to the computing device by the wireless access point; (ii) communicate with the wireless access point, for a specified period of time specified in the priority activation frame, if the group identifier of the priority activation frame matches the group identifier of the computing device; and (iii) cease communication with the wireless access point if the group identifier of the priority activation frame does not match the group identifier of the computing device.


According to some embodiments, the present disclosure is directed to a node within a wireless communications network that schedules access for both standard 802.11 clients and priority access clients to the Internet, the node comprising: (a) a standard 802.11 client interface for communicating with client devices using a standard 802.11 mode; (b) a priority media access control/physical (MAC/PHY) interface for communicating with client devices using a priority access MAC protocol; and (c) a scheduling module that manages standard access phases and priority access phases, wherein the standard access phases comprise time periods where the node silences client devices using the priority access MAC protocol and allows client devices using a standard 802.11 mode to communicate with the node, and wherein the priority access phases comprise time periods where the node silences client devices using standard 802.11 mode and allows client devices using the priority access MAC protocol to communicate with the node.





BRIEF DESCRIPTION OF THE DRAWINGS

Certain embodiments of the present technology are illustrated by the accompanying figures. It will be understood that the figures are not necessarily to scale and that details not necessary for an understanding of the technology or that render other details difficult to perceive may be omitted. It will be further understood that the technology is not necessarily limited to the particular embodiments illustrated herein.



FIG. 1 is an exemplary WiFi network that may be utilized to practice aspects of the present technology;



FIG. 2 is an exemplary communication schedule for a wireless access point that communicates with both standard 802.11 clients and priority access clients;



FIG. 3 is an exemplary signal flow diagram illustrating the operation of a wireless access point during a standard access phase;



FIG. 4 is an exemplary signal flow diagram illustrating the operation of a wireless access point when switching between standard and priority access phases of operation;



FIG. 5 is a signal flow diagram that illustrates the wireless access point switching between standard and priority access phases, namely when a standard access client is currently transmitting data to the wireless access point after expiration of the duration associated with the standard access phase;



FIG. 6 is a signal flow diagram that illustrates the wireless access point switching between standard and priority access phases, namely when the wireless access point is currently transmitting data to the standard access client after expiration of the duration associated with the standard access phase;



FIG. 7 is an exemplary signal flow diagram illustrating the operation of a wireless access point during a priority access phase, where the wireless access point schedules communications for two client groups of priority access clients;



FIG. 8 is an exemplary signal flow diagram illustrating the operation of a wireless access point during a priority access phase, where the wireless access point utilizes both priority activation and deactivation frames to schedule communications for two client groups of priority access clients;



FIG. 9 is a flowchart of an exemplary method for scheduling communication of standard 802.11 clients and priority access clients that utilize a priority access MAC protocol, using a wireless access point; and



FIG. 10 illustrates an exemplary computing device that may be used to implement an embodiment of the present technology





DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

While this technology is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail several specific embodiments with the understanding that the present disclosure is to be considered as an exemplification of the principles of the technology and is not intended to limit the technology to the embodiments illustrated.


The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.


It will be understood that like or analogous elements and/or components, referred to herein, may be identified throughout the drawings with like reference characters. It will be further understood that several of the figures are merely schematic representations of the present technology. As such, some of the components may have been distorted from their actual scale for pictorial clarity.


The present technology provides a wireless access point (AP) that utilizes both traditional 802.11 AP modes that support standard 802.11 Wi-Fi clients, as well as a priority access MAC-PHY interface for servicing enhanced scheduled priority access clients. The present technology increases the client capacity on the AP by managing individual fixed broadband client airtime fairness, reducing latency, and advantageously providing open service to traditional Wi-Fi devices on the same radio.


By providing timed windows of opportunity during which the AP supports standards compatible 802.11 devices, and then notifying the 802.11 devices to cease transmitting for upcoming intervals, an AP can concurrently leverage those additional intervals for scheduled medium access to better manage the diverse latency sensitive higher throughput demanding fixed client population. Advantageously, a single AP can provide high capacity and improved efficiency fixed and Wi-Fi support, and adapt bandwidths as necessary to respond to the changing needs in fixed and nomadic device types and their varying usage application demands.


Fixed broadband wireless clients at homes and businesses are quite diverse in location and distance from an AP. Additionally, these clients may be directionally oriented with the AP to achieve increased operation distance by leveraging high gain directional antenna radiation patterns. Given these usage scenarios clients may heavily interfere with each other as individual clients are not visible to each other throughout the service footprint. IEEE 802.11 standards implemented at the AP attempt to solve this problem using Carrier Sense Multiple Access (CSMA), but as distance and antenna directionality increase, almost every device becomes a hidden node causing unusable client transmission interference.


Therefore, if an AP uses traditional 802.11 CSMA and does not adapt, if one client channel does not sense the transmission of another client, the client believes it can transmit to the AP and naturally causes interference.


As a result, most fixed broadband wireless implementations implement time division duplexing (TDD) or frequency division duplexing (FDD), fixed scheduling protocols to manage the scheduling between clients using a priority access MAC/PHY layer(s). Unfortunately, these priority access layers are not compatible with the over 10 billion traditional (e.g., standard) 802.11 Wi-Fi devices, which include many smart tablet/phones and laptops.


The 802.11 standards have attempted to support some forms of quality of service improvements using, for example, Point Coordination Function (PCF) and Hybrid Coordination Function (HCF). With PCF, contention free periods are setup by the AP and managed by the AP (Point Coordinator), in which all but a single client device is allowed to transfer frames. Industry support for PCF has been very minimal and it is known that many client devices currently in deployment do not fully comply with contention free periods initiated by PCF. As a consequence, PCF cannot be used to provide reliability with regard to quality of service in networks supporting legacy users.


HCF was introduced in the IEEE 802.11e standard and provides a statistical method for providing quality of service to clients. It will be understood by to those skilled in the art that while HCF provides a level of quality of service in the statistical sense, HCF methods cannot provide the level of quality of service required for carrier/operator-grade networks.


Additionally, both PCF and HCF do not address the issues related to non-compliant devices nor the propensity of hidden nodes in the network which prevent standards based quality of service techniques to operate properly.


With the stunning growth of mobile Wi-Fi devices now representing 50% of Internet traffic, it is critical to enable service providers with flexibility to adapt to service both low latency reliable priority access clients together with nomadic standard 802.11 Wi-Fi devices in a single AP.


The present technology relates to and incorporates aspects of the IEEE 802.11 standards. Namely, the following definitions from various sections of the IEEE 802.11 standards are provided herein for reference purposes. NAV—Network Allocation Vector (also referred to as “Virtual Carrier Sensing”); PCF—Point Coordination Function; DCF—Distributed Coordination Function; PIFS—Point Coordination Function Interframe Space; and DIFS—Distributed Coordination Function Interframe Space.



FIG. 1 is a block diagram of an exemplary WiFi network 100, constructed in accordance with various embodiments of the present technology. The network 100 may include a plurality of end user client devices that include both a standard 802.11 client, hereinafter “standard access client 105” as well as a priority client, hereinafter “priority access client 110.” Generally, the standard access client 105 includes any computing device that is configured to operate on any IEEE 802.11 specified protocol, such as 802.11a through 802.11n.


The priority access client 110 may comprise a processor 115 and a memory 120. The priority access client 110 may include a priority media access control (MAC) protocol 125 that allows the priority access client 110 to communicate with an AP 130. It is noteworthy that AP 130 may communicate with a plurality of standard access clients and a plurality of priority access clients simultaneously, as will be described in greater detail below. In some instances, the priority access client 110 may be configured to utilize both standard and priority protocols to communicate with the AP 130.


It is noteworthy that both the standard access client 105 and the priority access client 110 communicatively couple with the AP 130 in a wireless manner, as will be described in greater detail below. It will be understood that the AP 130 may be coupled with a wired/wireless network 170, such as the Internet.


The AP 130 generally includes a processor 135, a memory 140 having a standard access client 802.11 layer 145 and a priority access MAC layer 150, a cache 155, and a scheduling module 160. The processor 135 of the AP 130 executes instructions within the memory 140 of the AP 130 to allow a hybrid mix of communications between both the standard access client 105 and the priority access client 110. As would be known to one of ordinary skill in the art, both the standard access client 802.11 layer 145 and the priority access MAC layer 150 may be arranged as sublayers of a data link layer of a TCP/IP layer used by the AP 130.


The AP 130 may include, for example, a wireless router or other wireless hub or device that is configured to function as an interface between client devices and a network medium, such as the wired/wireless network 170. In other instances, the AP 130 may include a node within any network that is configured to service both standard access clients and priority access clients, where the priority access clients utilize a priority access MAC layer to communicate with the node. As with the AP 130, this node is configured to schedule access to the network for both the standard access clients and the priority access clients, allowing the node to service a much greater spectrum of client devices.


Returning back to the discussion of the AP 130, there are two phases of operation for the AP 130. The first is a standard access phase of operation. During the standard access phase of operation, the AP 130 services standard non-priority 802.11 clients and/or priority access clients operating in standard 802.11 mode. These clients are able to associate with the AP 130 and send/receive data during this phase.


The second phase of operation for the AP 130 is a priority access phase. During the priority access phase of operation, the AP 130 services priority access clients that run a priority access MAC protocol. Advantageously, the AP 130 allows for the scheduling of both the standard and priority access clients using the scheduling module 160.



FIG. 2 illustrates the operation of the AP 130 in both standard and priority access phases. Notably, the scheduling module 160 of the AP 130 alternates standard access phases with the priority access phases. Because the AP 130 executes this alternation transparently to the client devices, the AP 130 is able to simultaneously offer access to the network 170 to both the standard and priority access clients.


Broadly described, the scheduling module 160 manages standard access phases and priority access phases for the AP 130. A standard access phase comprise a time period where the AP 130 allows only client devices using a standard 802.11 mode to communicate with the AP 130. Conversely, the priority access phases comprise time periods where the scheduling module 160 of the AP 130 allows only client devices using the priority access MAC protocol to communicate with the AP 130. Priority may be referred to as proprietary or fixed-access. In sum, prior to each phase (standard or priority), the AP 130 is configured to transmit a silencing signal to all clients, regardless of the mode of communication utilized by the client device.


More specifically, the phases are implemented by the scheduling module 160 in time divided intervals. For reference purposes, TS is the duration that the AP 130 is allowed to operate in a standard access phase and Tp is the duration of operation in a priority access phase. Again, the scheduling module 160 of the AP 130 alternates these phases such that they repeat over time as shown in FIG. 2.



FIG. 3 illustrates the operation of the AP 130 during a standard access phase. The AP 130 starts operating in the standard access phase by authenticating and associating both standard 802.11 clients and priority access clients operating in a standard 802.11 mode. Standard 802.11 clients are referred to as STASTD1/STASTD2 priority. It will be understood that in some instances the reference “STASTD” may be utilized to refer generally to clients that operate in standard 802.11 mode.


Once the clients have been associated, the AP 130 loads an association context for the clients. In some instances, an association context may include encryption keys for the supported clients, which are stored into the cache 155. During the standard access phase, the AP 130 allows for automatic sharing of the wired or wireless network 170 associated with the AP 130 through the use of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and a random back-off time following a busy medium condition as per the DCF operation described in the IEEE 802.11 standard. The AP 130 may perform Career Sensing (CS) through both virtual and physical mechanisms.



FIG. 4 illustrates the AP 130 switching from a standard access phase to a priority access phase. When the AP 130 has operated in the standard access phase for a time duration T>TS, the AP 130 switches to a priority mode of operation. In some instances, the AP 130 initiates the switch by sending a CTS-to-Self frame 405 with its duration field set to TP in order to silence all client devices.


It is noteworthy that the 802.11 standard allows a maximum CTS-to-Self duration value of NAVMAX=32767, (i.e., 32 ms). If TP>NAVMAX, the AP 130 sets the duration field to NAVMAX. Additionally, the AP 130 sets a timer that is equal to NAVMAX. When the timer is close to expiration, the AP 130 sends another CTS-to-self frame with duration set to TP−NAVMAX (if <NAVMAX). This subsequent CTS-to-self frame forces all standard access clients (STASTD1 and STASTD2) to remain in NAV for the entire TP duration.


The transmission of CTS-to-self frames to all clients functions to silence all clients prior to the AP 130 communicating with priority access clients during the duration of the TP (e.g., a priority access phase). In some instances, the transmission of the CTS-to-self frames functions to silence both standard access clients and all priority access clients that are not in a client group with which the AP 130 is currently communicating. It is noteworthy that the AP 130 may selectively communicate with each group of priority access clients using an association context, such as a group ID and encryption key. As will be described in greater detail below, the AP 130 may selectively communicate with priority access clients using priority activation and deactivation frames, within a given priority access phase.


It will be understood that the AP 130 may send as many CTS-to-Self frames as required for all the standard operating clients to remain in NAV for duration of TP. In some embodiments, the AP 130 may send the CTS-to-Self frames at a data rate such that all standard operating clients, including 802.11n clients that operate in the same band, do not interfere with the AP 130 operation during the priority access phase.



FIG. 4 also illustrates the switching of the AP 130 between standard and priority access phases, and specifically, during instances where the AP 130 is operating in NAV mode. It will be understood that the AP 130 may be put into NAV by virtue of a CTS frame that is received by the AP 130 from a standard access client 420. If the AP 130 is currently operating in NAV mode, the AP 130 waits until the NAV period 410 has expired and sends a CTS-to-self frame 405 after one PIFS interval 415. As per the IEEE 802.11 standard, PIFS<DIFS and hence the AP 130 gains access to the medium, such as the wired network 170 (see FIG. 1) before any standard operating client gains a transmit opportunity.



FIG. 5 is a signal flow diagram that illustrates the AP 130 switching between standard and priority access phases, namely when a standard access client is currently transmitting data to the AP 130 after expiration of the duration TS associated with a standard access phase. If the AP is currently receiving a packet from a standard access client such as STASTD1, the AP 130 waits until the packet is received and sends an Ack frame (if necessary) to the standard access client STASTD1. The AP 130 also sends the CTS-to-Self frame 505.



FIG. 6 is a signal flow diagram that illustrates the AP 130 switching between standard and priority access phases, namely when the AP 130 is currently transmitting data to a standard access client after expiration of the duration TS associated with the standard access phase. If the AP is currently sending a packet to a STASTD1, the AP 130 completes the current ongoing transmission, waits for an Ack frame (if necessary) from the standard access client STASTD1, and sends a CTS-to-Self frame 605 after PIFS interval 610. So at the AP 130, when the TS threshold is reached, the ongoing transmissions are allowed to complete before the AP 130 sends any CTS-to-Self frame, thus switching the AP 130 into the priority access phase.


Immediately after sending a CTS-to-Self frame, the AP 130 switches a TX/RX profile at the AP 130 in order to service priority access clients that belong to Client Group 1 (CG1). One example of this is the reloading of the hardware accelerated encryption key cache 155. Let Gmax be the maximum keys (e.g., association context) that could be cached (currently Gmax=128) at the AP 130 at any point of time. This limits the number of clients that can communicate with the AP with encrypted frames. In some instances, any associated priority access clients and standard access clients that do not have their keys cached will not be able to communicate with AP until their keys are reloaded.



FIGS. 7 and 8 collectively illustrate the operation of the AP 130 during priority access phases. Prior to communicating with the priority access clients, the AP 130 groups the priority access clients into Client Groups (CGs) based on different parameters such as current traffic, client service priority, and so forth. This serves two purposes: (a) to reduce the number of STAPA that are going to contend for the medium at a particular time interval, thereby reducing collisions, and (b) in order to address the hardware limitations that may be encountered in servicing a large number of clients (e.g., encryption key cache). The AP 130 may assign a unique client group identifier to each client group created. The unique client group identifiers assigned to the client groups may be utilized by the AP 130 to coordinate or schedule access for the priority access client groups as will be described in greater detail below.


At the start of the priority access phase, the AP 130 sends a priority Action Frame called here as Priority Activation Frame (PAF) with CG_ID 1 and Duration dcg1(<dp) specified. Broadly, the PAF includes a client group identifier and a duration that specifies how long the client group is allowed to contend for access to the network 170.


The AP 130 then loads the cache 155 with an association context, such as any encryption key for the STAPA (priority access clients) that belong the CG_ID 1 group. Clients that belong to CG_ID 1 begin to contend for a channel opened by the AP 130, upon the clients receiving a PAF from the AP 130 after a duration of dc. The dc duration is a time the AP 130 requires to reload the cache 155 with new keys. This allows clients that belong to CG_ID 1 to access the channel for a duration of dcg1. When the duration dcg1 has passed, using a similar mechanism for switching from standard to priority access phase, the AP 130 waits until current transaction is complete and sends a PAF with CG_ID 2 and duration dcg2 and reloads the cache 155. STAPA that belong to CG_ID 2 start to contend for the channel after expiration of the duration dc. STAPA belonging to a particular group can access the medium only after receiving a PAF from AP 130 for that group and only for the duration specified in the PAF frame.


It will be understood that the “dc” duration may comprise a duration of any desired length. In some instances, the length of the duration may be predicated upon the time required by the AP 130 to reload the cache 155 with encryption keys for a client group. That is, the “dc” duration can include an arbitrary amount of time that defines how long it takes the AP 130 to unload and reload encryption keys in the cache 155. For example, the “dc” duration may be equal to the amount of time it takes to purge the cache 155 of encryption keys for client group CG_ID 1, as well as the time it takes the AP 130 to load encryption keys for client group CG_ID 2.


As an alternative shown in FIG. 8, the AP 130 can also activate and deactivate the groups of priority access clients by sending Priority Activation Frame (PAF) and Priority Deactivation Frame (PDF). In this case, the switch in profile occurs before the transmission of the frames.


The AP 130 divides the nodes into groups and assigns dCG values to the different groups taking the dp into account such that during a single phase, (dCG1+dCG2+ . . . dCGn)<(dp−dc−Tmax), where Tmax is the maximum time for an ongoing transmission opportunity (TXOP) transaction. Therefore, when a STASTD begins to contend for the channel after its NAV, the AP 130 has already loaded an association context of the STASTD in its cache 155 and has switched to the standard access phase of operation. The STASTD are now serviced and the operation repeats over time.


In some embodiments the AP 130 includes an 802.11ac 4×4:4 DL-MU-MIMO processor, configured with four panel antennas fixed 90-degree radiation patterns with limited overlap to achieve a near 360-degree total coverage. Additional details regarding antennas having four panel antennas fixed 90-degree radiation patterns are described in co-pending U.S. Provisional Patent Application Ser. No. 61/774,532, filed on Mar. 7, 2013, entitled “Simultaneous Downlink Transmission to Multiple Single-User MIMO Clients,” which is incorporated by reference herein.



FIG. 9 is a flowchart of an exemplary method for scheduling communication of standard 802.11 clients and priority access clients that utilize a priority access MAC protocol, using a wireless access point. According to some embodiments, the method may include transmitting 905 a silencing signal to all clients prior to standard access phases. For example, the AP may send a CTS-to-self frame to all clients prior to initiating communications with standard access clients. The method may also include communicating 910 with standard access clients during standard access phases.


Next, the method may include transmitting 915 a silencing signal to all clients prior to priority access phases. The method may then include selectively communicating 920 with groups of priority access clients during priority access phases using the priority access MAC protocol. It will be understood that the AP may “selectively” communicate with each of the groups of priority clients by transmitting priority activation and deactivation frames as described above. Thus, the AP may communicate with each group of priority clients within a given priority access phase, while standard access clients are in, for example, an NAV mode.


It is noteworthy that the steps shown in FIG. 9 may not occur in the order specified. That is, the silencing of client devices most frequently occurs prior to allowing other client devices to contend for communication with the AP 130. Thus, standard access clients are silenced before the AP 130 communicates with clients using priority protocols, and vice-versa.



FIG. 10 illustrates an exemplary computing device 1000 that may be used to implement an embodiment of the present technology. The device 1000 of FIG. 10 may be implemented in the contexts of the likes of computing devices, such as the client devices that utilized a priority access MAC/PHY layer to communicate with an AP. The computing device 1000 of FIG. 10 includes a processor 1010 and memory 1020. Memory 1020 stores, in part, instructions and data for execution by processor 1010. Memory 1020 may store the executable code when in operation. The system 1000 of FIG. 10 further includes a mass storage device 1030, portable storage medium drive(s) 1040, output devices 1050, input devices 1060, a graphics display 1070, and peripheral device(s) 1080.


The components shown in FIG. 10 are depicted as being connected via a single bus 1090. The components may be connected through one or more data transport means. Processor 1010 and main memory 1020 may be connected via a local microprocessor bus, and the mass storage device 1030, peripheral device(s) 1080, portable storage medium drive(s) 1040, and graphics display 1070 may be connected via one or more input/output (I/O) buses.


Mass storage device 1030, which may be implemented with a magnetic disk drive or an optical disk drive, is a non-volatile storage device for storing data and instructions for use by processor 1010. Mass storage device 1030 may store the system software for implementing embodiments of the present invention for purposes of loading that software into main memory 1020.


Portable storage medium drive(s) 1040 operates in conjunction with a portable non-volatile storage medium, such as a floppy disk, compact disk, digital video disc, or USB storage device, to input and output data and code to and from the computing system 1000 of FIG. 10. The system software for implementing embodiments of the present invention may be stored on such a portable medium and input to the computing device 1000 via the portable storage medium drive(s) 1040.


Input devices 1060 provide a portion of a user interface. Input devices 1060 may include an alphanumeric keypad, such as a keyboard, for inputting alpha-numeric and other information, or a pointing device, such as a mouse, a trackball, stylus, or cursor direction keys. Additionally, the device 1000 as shown in FIG. 10 includes output devices 1050. Suitable output devices include speakers, printers, network interfaces, and monitors.


Graphics display 1070 may include a liquid crystal display (LCD) or other suitable display device. Graphics display 1070 receives textual and graphical information, and processes the information for output to the display device.


Peripheral device(s) 1080 may include any type of computer support device to add additional functionality to the computing system. Peripheral device(s) 1080 may include a modem or a router.


The components provided in the computing device 1000 of FIG. 10 are those typically found in computing systems that may be suitable for use with embodiments of the present invention and are intended to represent a broad category of such computer components that are well known in the art. Thus, the computing system 1000 of FIG. 10 may be a personal computer, hand held computing system, telephone, mobile computing system, workstation, server, minicomputer, mainframe computer, or any other computing system. The computer may also include different bus configurations, networked platforms, multi-processor platforms, etc. Various operating systems may be used including Unix, Linux, Windows, Macintosh OS, Palm OS, Android, iPhone OS and other suitable operating systems.


Some of the above-described functions may be composed of instructions that are stored on storage media (e.g., computer-readable medium). The instructions may be retrieved and executed by the processor. Some examples of storage media are memory devices, tapes, disks, and the like. The instructions are operational when executed by the processor to direct the processor to operate in accord with the technology. Those skilled in the art are familiar with instructions, processor(s), and storage media.


It is noteworthy that any hardware platform suitable for performing the processing described herein is suitable for use with the technology. The terms “computer-readable storage medium” and “computer-readable storage media” as used herein refer to any medium or media that participate in providing instructions to a CPU for execution. Such media can take many forms, including, but not limited to, non-volatile media, volatile media and transmission media. Non-volatile media include, for example, optical or magnetic disks, such as a fixed disk. Volatile media include dynamic memory, such as system RAM. Transmission media include coaxial cables, copper wire and fiber optics, among others, including the wires that comprise one embodiment of a bus. Transmission media can also take the form of acoustic or light waves, such as those generated during radio frequency (RF) and infrared (IR) data communications. Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, a hard disk, magnetic tape, any other magnetic medium, a CD-ROM disk, digital video disk (DVD), any other optical medium, any other physical medium with patterns of marks or holes, a RAM, a PROM, an EPROM, an EEPROM, a FLASHEPROM, any other memory chip or data exchange adapter, a carrier wave, or any other medium from which a computer can read.


Various forms of computer-readable media may be involved in carrying one or more sequences of one or more instructions to a CPU for execution. A bus carries the data to system RAM, from which a CPU retrieves and executes the instructions. The instructions received by system RAM can optionally be stored on a fixed disk either before or after execution by a CPU.


Computer program code for carrying out operations for aspects of the present technology may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).


The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present technology has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. Exemplary embodiments were chosen and described in order to best explain the principles of the present technology and its practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.


Aspects of the present technology are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.


These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.


The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.


The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present technology. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.


While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. The descriptions are not intended to limit the scope of the technology to the particular forms set forth herein. Thus, the breadth and scope of a preferred embodiment should not be limited by any of the above-described exemplary embodiments. It should be understood that the above description is illustrative and not restrictive. To the contrary, the present descriptions are intended to cover such alternatives, modifications, and equivalents as may be included within the spirit and scope of the technology as defined by the appended claims and otherwise appreciated by one of ordinary skill in the art. The scope of the technology should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the appended claims along with their full scope of equivalents.

Claims
  • 1. A computing device communicating with a wireless access point using a media access control (MAC) protocol, the computing device comprising: a processor; anda memory communicatively coupled to the processor and storing the MAC protocol of a priority access MAC layer, the MAC protocol being executable by the processor to: evaluate a priority activation frame received from the wireless access point to determine whether a group identifier included in the priority activation frame corresponds to a group identifier assigned to the computing device by the wireless access point, the wireless access point comprising a node within a network that is configured to service both standard access clients and priority access clients, where the priority access clients utilize the priority access MAC layer to communicate with the node, the node being configured to schedule access to the network for both the standard access clients and the priority access clients, the node comprising: (a) a standard 802.11 client interface for communicating with client devices using a standard 802.11 mode; and (b) a priority media access control/physical (MAC/PHY) interface for communicating with client devices using the MAC protocol of the priority access MAC layer;communicate with the wireless access point, for a duration of a priority access phase of the wireless access point when the group identifier of the priority activation frame matches the group identifier of the computing device, the duration of the priority access phase of the wireless access point being greater than a network allocation vector (NAV) maximum duration, the wireless access point communicating individually with at least some priority access clients during the priority access phase, a group identifier of the priority access clients matching the group identifier of the priority activation frame; andcease communication with the wireless access point when the group identifier of the priority activation frame does not match the group identifier of the computing device.
  • 2. The computing device according to claim 1, wherein the computing device operates in at least one of a standard 802.11 mode and a priority mode using the MAC protocol.
  • 3. A method, comprising: storing a MAC protocol in a priority access MAC layer;receiving a clear to send (CTS) frame including a network allocation vector (NAV) maximum duration from an access point comprising a node within a network that is configured to service both standard access clients and priority access clients, where the priority access clients utilize the priority access MAC layer to communicate with the node, the node being configured to schedule access to the network for both the standard access clients and the priority access clients, the node comprising: (a) a standard 802.11 client interface for communicating with client devices using a standard 802.11 mode; and (b) a priority media access control/physical (MAC/PHY) interface for communicating with client devices using the MAC protocol of the priority access MAC layer;ceasing transmission with the access point until expiration of the network allocation vector (NAV) maximum duration;extending the cessation of transmission with the access point when an additional CTS frame is received before the expiration of the network allocation vector (NAV) maximum duration, the access point communicating individually with at least some priority access clients during a priority access phase, a duration of the priority access phase including the NAV maximum duration and a duration of the additional CTS frame; andcommunicating with the access point after the expiration of the network allocation vector (NAV) maximum duration using the MAC protocol of the priority access MAC layer.
  • 4. The method according to claim 3, wherein the duration of the additional CTS frame is equal to e the duration of the priority access phase minus the network allocation vector (NAV) maximum duration.
  • 5. The method according to claim 3, wherein the additional CTS frame has a network allocation vector (NAV) maximum duration.
  • 6. The method according to claim 3, wherein communication can occur during a point coordination function interframe space (PIFS) which occurs after the expiration of the network allocation vector (NAV) maximum duration.
  • 7. The method according to claim 3, wherein the node further comprises a scheduling module that manages standard access phases and priority access phases.
  • 8. The method according to claim 7, wherein the scheduling module alternates between the standard access phases and the priority access phases.
  • 9. The method according to claim 7, wherein the scheduling module sets a duration for each of the standard access phases and the priority access phases.
  • 10. A computing device communicating with a wireless access point, the computing device comprising: a processor; anda memory communicatively coupled to the processor and storing logic, the logic being executable by the processor to: store a MAC protocol in a priority access MAC layer;receive a clear to send (CTS) frame including a network allocation vector (NAV) maximum duration from the wireless access point, the wireless access point comprising a node within a network that is configured to service both standard access clients and priority access clients, where the priority access clients utilize the priority access MAC layer to communicate with the node, the node being configured to schedule access to the network for both the standard access clients and the priority access clients, the node comprising: (a) a standard 802.11 client interface for communicating with client devices using a standard 802.11 mode; and (b) a priority media access control/physical (MAC/PHY) interface for communicating with client devices using the MAC protocol of the priority access MAC layer;cease transmission with the wireless access point until expiration of the network allocation vector (NAV) maximum duration;extend the cessation of transmission with the wireless access point when an additional CTS frame is received before the expiration of the network allocation vector (NAV) maximum duration, the wireless access point communicating individually with at least some priority access clients during a priority access phase, a duration of the priority access phase including the NAV maximum duration and a duration of the additional CTS frame; andcommunicate with the wireless access point after the expiration of the network allocation vector (NAV) maximum duration using the MAC protocol of the priority access MAC layer.
  • 11. The computing device according to claim 10, wherein the duration of the additional CTS frame is equal to the duration of the priority access phase minus the network allocation vector (NAV) maximum duration.
  • 12. The computing device according to claim 10, wherein the additional CTS frame has a network allocation vector (NAV) maximum duration.
  • 13. The computing device according to claim 10, wherein the computing device can communicate with the wireless access point after a point coordination function interframe space (PIFS) that occurs after the expiration of the network allocation vector (NAV) maximum duration.
  • 14. The computing device according to claim 13, wherein the computing device can communicate with the wireless access point using the MAC protocol during cessation of transmission during the network allocation vector (NAV) maximum duration.
  • 15. The computing device according to claim 14, wherein the computing device communicates with the wireless access point using the MAC protocol when a priority access frame is received during the network allocation vector (NAV) maximum duration.
  • 16. The computing device according to claim 15, wherein the priority access frame comprises a priority access client group identifier for the computing device and the priority access phase duration.
  • 17. The computing device according to claim 16, wherein the computing device does not communicate with the wireless access point if the priority access client group identifier does not match the priority access client group identifier stored on the computing device.
  • 18. The computing device according to claim 10, wherein the node further comprises a scheduling module that manages standard access phases and priority access phases.
  • 19. The computing device according to claim 18, wherein the scheduling module alternates between the standard access phases and the priority access phases.
  • 20. The computing device according to claim 18, wherein the scheduling module sets a duration for each of the standard access phases and the priority access phases.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of, and claims the priority benefit of, U.S. patent application Ser. No. 14/741,423 filed Jun. 16, 2015, entitled “Wireless Access Points Providing Hybrid 802.11 and Scheduled Priority Access Communications,” which is a continuation of U.S. patent application Ser. No. 14/045,741 filed Oct. 3, 2013, now U.S. Pat. No. 9,161,387, issued Oct. 13, 2015, entitled “Wireless Access Points Providing Hybrid 802.11 and Scheduled Priority Access Communications,” which is a divisional of U.S. patent application Ser. No. 13/906,128 filed May 30, 2013, now U.S. Pat. No. 9,295,103, issued Mar. 22, 2016, entitled “Wireless Access Points Providing Hybrid 802.11 and Scheduled Priority Access Communications,” all of which are incorporated by reference in their entirety herein.

US Referenced Citations (347)
Number Name Date Kind
2735993 Humphrey Feb 1956 A
3182129 Clark et al. May 1965 A
D227476 Kennedy Jun 1973 S
4188633 Frazita Feb 1980 A
4402566 Powell et al. Sep 1983 A
D273111 Hirata et al. Mar 1984 S
4543579 Teshirogi Sep 1985 A
4562416 Sedivec Dec 1985 A
4626863 Knop et al. Dec 1986 A
4835538 McKenna et al. May 1989 A
4866451 Chen Sep 1989 A
4893288 Maier et al. Jan 1990 A
4903033 Tsao et al. Feb 1990 A
4986764 Eaby et al. Jan 1991 A
5015195 Piriz May 1991 A
5087920 Tsurumaru et al. Feb 1992 A
5226837 Cinibulk et al. Jul 1993 A
5231406 Sreenivas Jul 1993 A
D346598 McCay et al. May 1994 S
D355416 McCay et al. Feb 1995 S
5389941 Yu Feb 1995 A
5491833 Hamabe Feb 1996 A
5513380 Ivanov et al. Apr 1996 A
5539361 Davidovitz Jul 1996 A
5561434 Yamazaki Oct 1996 A
D375501 Lee et al. Nov 1996 S
5580264 Aoyama et al. Dec 1996 A
5684495 Dyott et al. Nov 1997 A
D389575 Grasfield et al. Jan 1998 S
5724666 Dent Mar 1998 A
5742911 Dumbrill et al. Apr 1998 A
5746611 Brown et al. May 1998 A
5764696 Barnes et al. Jun 1998 A
5831582 Muhlhauser et al. Nov 1998 A
5966102 Runyon Oct 1999 A
5995063 Somoza et al. Nov 1999 A
6014372 Kent et al. Jan 2000 A
6067053 Runyon et al. May 2000 A
6137449 Kildal Oct 2000 A
6140962 Groenenboom Oct 2000 A
6176739 Denlinger et al. Jan 2001 B1
6216266 Eastman et al. Apr 2001 B1
6271802 Clark et al. Aug 2001 B1
6304762 Myers et al. Oct 2001 B1
D455735 Winslow Apr 2002 S
6421538 Byrne Jul 2002 B1
6716063 Bryant et al. Apr 2004 B1
6754511 Halford et al. Jun 2004 B1
6847653 Smiroldo Jan 2005 B1
D501848 Uehara et al. Feb 2005 S
6864837 Runyon et al. Mar 2005 B2
6877277 Kussel et al. Apr 2005 B2
6962445 Zimmel et al. Nov 2005 B2
7075492 Chen et al. Jul 2006 B1
D533899 Ohashi et al. Dec 2006 S
7173570 Wensink et al. Feb 2007 B1
7187328 Tanaka et al. Mar 2007 B2
7193562 Shtrom et al. Mar 2007 B2
7212162 Jung et al. May 2007 B2
7212163 Huang et al. May 2007 B2
7245265 Kienzle et al. Jul 2007 B2
7253783 Chiang et al. Aug 2007 B2
7264494 Kennedy et al. Sep 2007 B2
7281856 Grzegorzewska et al. Oct 2007 B2
7292198 Shtrom et al. Nov 2007 B2
7306485 Masuzaki Dec 2007 B2
7324057 Argaman et al. Jan 2008 B2
D566698 Choi et al. Apr 2008 S
7362236 Hoiness Apr 2008 B2
7369095 Hirtzlin et al. May 2008 B2
7380984 Wuester Jun 2008 B2
7431602 Corona Oct 2008 B2
7498896 Shi Mar 2009 B2
7498996 Shtrom et al. Mar 2009 B2
7507105 Peters et al. Mar 2009 B1
7522095 Wasiewicz et al. Apr 2009 B1
7542717 Green, Sr. et al. Jun 2009 B2
7581976 Liepold et al. Sep 2009 B2
7586891 Masciulli Sep 2009 B1
7616959 Spenik et al. Nov 2009 B2
7675473 Kienzle et al. Mar 2010 B2
7726997 Kennedy et al. Jun 2010 B2
7778226 Rayzman et al. Aug 2010 B2
7857523 Masuzaki Dec 2010 B2
7929914 Tegreene Apr 2011 B2
RE42522 Zimmel et al. Jul 2011 E
8009646 Lastinger et al. Aug 2011 B2
8069465 Bartholomay et al. Nov 2011 B1
8111678 Lastinger et al. Feb 2012 B2
8270383 Lastinger et al. Sep 2012 B2
8275265 Kobyakov et al. Sep 2012 B2
8325695 Lastinger et al. Dec 2012 B2
D674787 Tsuda et al. Jan 2013 S
8345651 Lastinger et al. Jan 2013 B2
8482478 Hartenstein Jul 2013 B2
8515434 Narendran et al. Aug 2013 B1
8515495 Shang et al. Aug 2013 B2
D694740 Apostolakis Dec 2013 S
8777660 Chiarelli et al. Jul 2014 B2
8792759 Benton et al. Jul 2014 B2
8827729 Gunreben et al. Sep 2014 B2
8836601 Sanford et al. Sep 2014 B2
8848389 Kawamura et al. Sep 2014 B2
8870069 Bellows Oct 2014 B2
8935122 Stisser Jan 2015 B2
9001689 Hinman et al. Apr 2015 B1
9019874 Choudhury et al. Apr 2015 B2
9077071 Shtrom et al. Jul 2015 B2
9107134 Belser et al. Aug 2015 B1
9130305 Ramos et al. Sep 2015 B2
9161387 Fink et al. Oct 2015 B2
9179336 Fink et al. Nov 2015 B2
9191081 Hinman et al. Nov 2015 B2
D752566 Hinman et al. Mar 2016 S
9295103 Fink et al. Mar 2016 B2
9362629 Hinman et al. Jun 2016 B2
9391375 Bales et al. Jul 2016 B1
9407012 Shtrom et al. Aug 2016 B2
9431702 Hartenstein Aug 2016 B2
9504049 Hinman et al. Nov 2016 B2
9531114 Ramos et al. Dec 2016 B2
9537204 Cheng et al. Jan 2017 B2
9577340 Fakharzadeh et al. Feb 2017 B2
9693388 Fink et al. Jun 2017 B2
9780892 Hinman et al. Oct 2017 B2
9843940 Hinman et al. Dec 2017 B2
9871302 Hinman et al. Jan 2018 B2
9888485 Hinman et al. Feb 2018 B2
9930592 Hinman Mar 2018 B2
9949147 Inman et al. Apr 2018 B2
9986565 Fink et al. May 2018 B2
9998246 Inman et al. Jun 2018 B2
10028154 Elson Jul 2018 B2
10090943 Hinman et al. Oct 2018 B2
10096933 Ramos et al. Oct 2018 B2
10117114 Hinman et al. Oct 2018 B2
10186786 Hinman et al. Jan 2019 B2
10200925 Hinman Feb 2019 B2
10257722 Hinman et al. Apr 2019 B2
10425944 Fink et al. Sep 2019 B2
10447417 Hinman et al. Oct 2019 B2
10595253 Hinman Mar 2020 B2
10616903 Hinman et al. Apr 2020 B2
10714805 Eberhardt et al. Jul 2020 B2
20010033600 Yang et al. Oct 2001 A1
20020102948 Stanwood et al. Aug 2002 A1
20020159434 Gosior et al. Oct 2002 A1
20030013452 Hunt et al. Jan 2003 A1
20030027577 Brown et al. Feb 2003 A1
20030169763 Choi et al. Sep 2003 A1
20030222831 Dunlap Dec 2003 A1
20030224741 Sugar et al. Dec 2003 A1
20040002357 Benveniste Jan 2004 A1
20040029549 Fikart Feb 2004 A1
20040110469 Judd et al. Jun 2004 A1
20040120277 Holur et al. Jun 2004 A1
20040155819 Martin et al. Aug 2004 A1
20040196812 Barber Oct 2004 A1
20040196813 Ofek et al. Oct 2004 A1
20040240376 Wang et al. Dec 2004 A1
20040242274 Corbett et al. Dec 2004 A1
20050012665 Runyon et al. Jan 2005 A1
20050032479 Miller et al. Feb 2005 A1
20050058111 Hung et al. Mar 2005 A1
20050124294 Wentink Jun 2005 A1
20050143014 Li et al. Jun 2005 A1
20050152323 Bonnassieux et al. Jul 2005 A1
20050195758 Chitrapu Sep 2005 A1
20050227625 Diener Oct 2005 A1
20050254442 Proctor, Jr. et al. Nov 2005 A1
20050271056 Kaneko Dec 2005 A1
20050275527 Kates Dec 2005 A1
20060025072 Pan Feb 2006 A1
20060072518 Pan et al. Apr 2006 A1
20060098592 Proctor, Jr. et al. May 2006 A1
20060099940 Pfleging et al. May 2006 A1
20060132359 Chang et al. Jun 2006 A1
20060132602 Muto et al. Jun 2006 A1
20060172578 Parsons Aug 2006 A1
20060187952 Kappes et al. Aug 2006 A1
20060211430 Persico Sep 2006 A1
20070001910 Yamanaka et al. Jan 2007 A1
20070019664 Benveniste Jan 2007 A1
20070035463 Hirabayashi Feb 2007 A1
20070060158 Medepalli et al. Mar 2007 A1
20070132643 Durham et al. Jun 2007 A1
20070173199 Sinha Jul 2007 A1
20070173260 Love et al. Jul 2007 A1
20070202809 Lastinger et al. Aug 2007 A1
20070210974 Chiang Sep 2007 A1
20070223701 Emeott et al. Sep 2007 A1
20070238482 Rayzman et al. Oct 2007 A1
20070255797 Dunn et al. Nov 2007 A1
20070268848 Khandekar et al. Nov 2007 A1
20080109051 Splinter et al. May 2008 A1
20080112380 Fischer May 2008 A1
20080192707 Xhafa et al. Aug 2008 A1
20080218418 Gillette Sep 2008 A1
20080231541 Teshirogi et al. Sep 2008 A1
20080242342 Rofougaran Oct 2008 A1
20090046673 Kaidar Feb 2009 A1
20090051597 Wen et al. Feb 2009 A1
20090052362 Meier et al. Feb 2009 A1
20090059794 Frei Mar 2009 A1
20090075606 Shtrom et al. Mar 2009 A1
20090096699 Chiu et al. Apr 2009 A1
20090232026 Lu Sep 2009 A1
20090233475 Mildon et al. Sep 2009 A1
20090291690 Guvenc et al. Nov 2009 A1
20090315792 Miyashita et al. Dec 2009 A1
20100029282 Stamoulis et al. Feb 2010 A1
20100034191 Schulz Feb 2010 A1
20100039340 Brown Feb 2010 A1
20100046650 Jongren et al. Feb 2010 A1
20100067505 Fein Mar 2010 A1
20100085950 Sekiya et al. Apr 2010 A1
20100091818 Sen et al. Apr 2010 A1
20100103065 Shtrom et al. Apr 2010 A1
20100103066 Shtrom et al. Apr 2010 A1
20100136978 Cho et al. Jun 2010 A1
20100151877 Lee et al. Jun 2010 A1
20100167719 Sun et al. Jul 2010 A1
20100171665 Nogami Jul 2010 A1
20100171675 Borja et al. Jul 2010 A1
20100177660 Essinger et al. Jul 2010 A1
20100189005 Bertani et al. Jul 2010 A1
20100202613 Ray et al. Aug 2010 A1
20100210147 Hauser Aug 2010 A1
20100216412 Rofougaran Aug 2010 A1
20100225529 Landreth et al. Sep 2010 A1
20100238083 Malasani Sep 2010 A1
20100315307 Syed et al. Dec 2010 A1
20100322219 Fischer et al. Dec 2010 A1
20110006956 McCown Jan 2011 A1
20110028097 Memik et al. Feb 2011 A1
20110032159 Wu et al. Feb 2011 A1
20110044186 Jung et al. Feb 2011 A1
20110090129 Weily et al. Apr 2011 A1
20110103309 Wang et al. May 2011 A1
20110111715 Buer et al. May 2011 A1
20110112717 Resner May 2011 A1
20110133996 Alapuranen Jun 2011 A1
20110170424 Safavi Jul 2011 A1
20110172916 Pakzad et al. Jul 2011 A1
20110182260 Sivakumar et al. Jul 2011 A1
20110182277 Shapira Jul 2011 A1
20110194644 Liu et al. Aug 2011 A1
20110206012 Youn et al. Aug 2011 A1
20110241969 Zhang et al. Oct 2011 A1
20110243291 McAllister et al. Oct 2011 A1
20110256874 Hayama et al. Oct 2011 A1
20110291914 Lewry et al. Dec 2011 A1
20120008542 Koleszar et al. Jan 2012 A1
20120040700 Gomes et al. Feb 2012 A1
20120057533 Junell et al. Mar 2012 A1
20120093091 Kang et al. Apr 2012 A1
20120115487 Josso May 2012 A1
20120134280 Rotvold et al. May 2012 A1
20120140651 Nicoara et al. Jun 2012 A1
20120200449 Bielas Aug 2012 A1
20120238201 Du et al. Sep 2012 A1
20120263145 Marinier et al. Oct 2012 A1
20120282868 Hahn Nov 2012 A1
20120299789 Orban et al. Nov 2012 A1
20120314634 Sekhar Dec 2012 A1
20130003645 Shapira et al. Jan 2013 A1
20130005350 Campos et al. Jan 2013 A1
20130023216 Moscibroda et al. Jan 2013 A1
20130064161 Hedayat Mar 2013 A1
20130082899 Gomi Apr 2013 A1
20130095747 Moshfeghi Apr 2013 A1
20130128858 Lou et al. May 2013 A1
20130176902 Wentink et al. Jul 2013 A1
20130182652 Tong Jul 2013 A1
20130195081 Merlin et al. Aug 2013 A1
20130210457 Kummetz Aug 2013 A1
20130223398 Li et al. Aug 2013 A1
20130234898 Leung et al. Sep 2013 A1
20130271319 Trerise Oct 2013 A1
20130286950 Pu Oct 2013 A1
20130286959 Lou Oct 2013 A1
20130288735 Guo Oct 2013 A1
20130301438 Li et al. Nov 2013 A1
20130322276 Pelletier et al. Dec 2013 A1
20130322413 Pelletier et al. Dec 2013 A1
20140024328 Balbien et al. Jan 2014 A1
20140051357 Steer et al. Feb 2014 A1
20140098748 Chan et al. Apr 2014 A1
20140113676 Hamalainen et al. Apr 2014 A1
20140145890 Ramberg et al. May 2014 A1
20140185494 Yang et al. Jul 2014 A1
20140191918 Cheng et al. Jul 2014 A1
20140198867 Sturkovich et al. Jul 2014 A1
20140206322 Dimou et al. Jul 2014 A1
20140225788 Schulz et al. Aug 2014 A1
20140233613 Fink et al. Aug 2014 A1
20140235244 Hinman Aug 2014 A1
20140253378 Hinman Sep 2014 A1
20140253402 Hinman et al. Sep 2014 A1
20140254700 Hinman et al. Sep 2014 A1
20140256166 Ramos et al. Sep 2014 A1
20140320306 Winter Oct 2014 A1
20140320377 Cheng et al. Oct 2014 A1
20140328238 Seok Nov 2014 A1
20140341013 Kumar Nov 2014 A1
20140355578 Fink et al. Dec 2014 A1
20140355584 Fink et al. Dec 2014 A1
20150002335 Hinman et al. Jan 2015 A1
20150002354 Knowles Jan 2015 A1
20150015435 Shen et al. Jan 2015 A1
20150116177 Powell et al. Apr 2015 A1
20150156642 Sobczak et al. Jun 2015 A1
20150215952 Hinman et al. Jul 2015 A1
20150256275 Hinman et al. Sep 2015 A1
20150263816 Hinman et al. Sep 2015 A1
20150319584 Fink et al. Nov 2015 A1
20150321017 Perryman et al. Nov 2015 A1
20150325945 Ramos et al. Nov 2015 A1
20150327272 Fink et al. Nov 2015 A1
20150365866 Hinman et al. Dec 2015 A1
20160119018 Lindgren et al. Apr 2016 A1
20160149634 Kalkunte et al. May 2016 A1
20160149635 Hinman et al. May 2016 A1
20160211583 Lee et al. Jul 2016 A1
20160240929 Hinman et al. Aug 2016 A1
20160338076 Hinman et al. Nov 2016 A1
20160365666 Ramos et al. Dec 2016 A1
20160366601 Hinman et al. Dec 2016 A1
20170048647 Jung et al. Feb 2017 A1
20170201028 Eberhardt et al. Jul 2017 A1
20170294975 Hinman et al. Oct 2017 A1
20170353245 Vardarajan et al. Dec 2017 A1
20180034166 Hinman Feb 2018 A1
20180035317 Hinman et al. Feb 2018 A1
20180083365 Hinman et al. Mar 2018 A1
20180084563 Hinman et al. Mar 2018 A1
20180160353 Hinman Jun 2018 A1
20180192305 Hinman et al. Jul 2018 A1
20180199345 Fink et al. Jul 2018 A1
20180241491 Hinman et al. Aug 2018 A1
20190006789 Ramos et al. Jan 2019 A1
20190182686 Hinman et al. Jun 2019 A1
20190214699 Eberhardt et al. Jul 2019 A1
20190215745 Hinman Jul 2019 A1
20190273326 Sanford et al. Sep 2019 A1
20200067164 Eberhardt et al. Feb 2020 A1
20200083614 Sanford et al. Mar 2020 A1
Foreign Referenced Citations (15)
Number Date Country
104335654 Feb 2015 CN
303453662 Nov 2015 CN
105191204 Dec 2015 CN
105191204B May 2019 CN
002640177 Feb 2015 EM
1384285 Jan 2004 EP
3491697 Jun 2019 EP
WO2014137370 Sep 2014 WO
WO2014138292 Sep 2014 WO
WO2014193394 Dec 2014 WO
WO2015112627 Jul 2015 WO
WO2017123558 Jul 2017 WO
WO2018022526 Feb 2018 WO
WO2019136257 Jul 2019 WO
WO2019168800 Sep 2019 WO
Non-Patent Literature Citations (74)
Entry
“Office Action,” Chinese Patent Application No. 201580000078.6, dated Nov. 3, 2017, 5 pages [10 pages including translation].
“International Search Report” and “Written Opinion of the International Searching Authority,” Patent Cooperation Treaty Application No. PCT/US2017/043560, dated Nov. 16, 2017, 11 pages.
Non-Final Office Action, dated Jan. 5, 2015, U.S. Appl. No. 14/183,445, filed Feb. 18, 2014.
Notice of Allowance, dated Jul. 13, 2015, U.S. Appl. No. 14/183,445, filed Feb. 18, 2014.
Non-Final Office Action, dated Jan. 15, 2015, U.S. Appl. No. 14/183,329, filed Feb. 18, 2014.
Notice of Allowance, dated Aug. 19, 2015, U.S. Appl. No. 14/183,329, filed Feb. 18, 2014.
Non-Final Office Action, dated Mar. 18, 2015, U.S. Appl. No. 14/183,375, filed Feb. 18, 2014.
Final Office Action, dated Nov. 24, 2015, U.S. Appl. No. 14/183,375, filed Feb. 18, 2014.
Advisory Action, dated Mar. 2, 2016, U.S. Appl. No. 14/183,375, filed Feb. 18, 2014.
Non-Final Office Action, dated Jan. 2, 2015, U.S. Appl. No. 13/925,566, filed Jun. 24, 2013.
Notice of Allowance, dated Jul. 15, 2015, U.S. Appl. No. 13/925,566, filed Jun. 24, 2013.
Non-Final Office Action, dated Dec. 11, 2013, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Final Office Action, dated Apr. 15, 2014, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Advisory Action, dated Jul. 31, 2014, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Non-Final Office Action, dated Aug. 25, 2014, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Final Office Action, dated Mar. 23, 2015, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Notice of Allowance, dated Oct. 26, 2015, U.S. Appl. No. 13/906,128, filed May 30, 2013.
Non-Final Office Action, dated Jun. 16, 2014, U.S. Appl. No. 14/164,081, filed Jan. 24, 2014.
Notice of Allowance, dated Dec. 30, 2014, U.S. Appl. No. 14/164,081, filed Jan. 24, 2014.
Non-Final Office Action, dated Dec. 24, 2013, U.S. Appl. No. 14/045,741, filed Oct. 3, 2013.
Final Office Action, dated Apr. 16, 2014, U.S. Appl. No. 14/045,741, filed Oct. 3, 2013.
Non-Final Office Action, dated Sep. 22, 2014, U.S. Appl. No. 14/045,741, filed Oct. 3, 2013.
Notice of Allowance, dated Jun. 3, 2015, U.S. Appl. No. 14/045,741, filed Oct. 3, 2013.
Non-Final Office Action, dated Sep. 10, 2015, U.S. Appl. No. 14/198,378, filed Mar. 5, 2014.
Non-Final Office Action, dated Sep. 17, 2015, U.S. Appl. No. 14/741,423, filed Jun. 16, 2015.
Notice of Allowance, dated Jan. 11, 2016, U.S. Appl. No. 29/502,253, filed Sep. 12, 2014.
Non-Final Office Action, dated Mar. 16, 2016, U.S. Appl. No. 14/325,307, filed Jul. 7, 2014.
Notice of Allowance, dated Apr. 6, 2016, U.S. Appl. No. 14/198,378, filed Mar. 5, 2014.
Non-Final Office Action, dated Apr. 7, 2016, U.S. Appl. No. 14/639,976, filed Mar. 5, 2015.
Non-Final Office Action, dated Apr. 26, 2016, U.S. Appl. No. 14/802,829, filed Jul. 17, 2015.
Notice of Allowance, dated Jul. 26, 2016, U.S. Appl. No. 14/325,307, filed Jul. 7, 2014.
Notice of Allowance, dated Aug. 16, 2016, U.S. Appl. No. 14/802,829, filed Jul. 17, 2015.
Non-Final Office Action, dated Sep. 15, 2016, U.S. Appl. No. 14/183,375, filed Feb. 18, 2014.
Non-Final Office Action, dated Sep. 30, 2016, U.S. Appl. No. 14/657,942, filed Mar. 13, 2015.
Final Office Action, dated Oct. 12, 2016, U.S. Appl. No. 14/741,423, filed Jun. 16, 2015.
Final Office Action, dated Oct. 17, 2016, U.S. Appl. No. 14/639,976, filed Mar. 5, 2015.
Non-Final Office Action, dated Oct. 26, 2016, U.S. Appl. No. 15/139,225, filed Apr. 26, 2016.
Advisory Action, dated Jan. 19, 2017, U.S. Appl. No. 14/639,976, filed Mar. 5, 2015.
Non-Final Office Action, dated Jan. 27, 2017, U.S. Appl. No. 14/198,473, filed Mar. 5, 2014.
Non-Final Office Action, dated Feb. 17, 2017, U.S. Appl. No. 14/833,038, filed Aug. 21, 2015.
Non-Final Office Action, dated Feb. 23, 2017, U.S. Appl. No. 15/246,094, filed Aug. 24, 2016.
Notice of Allowance, dated Mar. 1, 2017, U.S. Appl. No. 14/741,423, filed Jun. 16, 2015.
Non-Final Office Action, dated Mar. 22, 2017, U.S. Appl. No. 15/224,412, filed Jul. 29, 2016.
Non-Final Office Action, dated Mar. 30, 2017, U.S. Appl. No. 15/246,118, filed Aug. 24, 2016.
Non-Final Office Action, dated Mar. 31, 2017, U.S. Appl. No. 14/316,537, filed Jun. 26, 2014.
Notice of Allowance, dated Apr. 10, 2017, U.S. Appl. No. 14/639,976, filed Mar. 5, 2015.
Final Office Action, dated Apr. 13, 2017, U.S. Appl. No. 15/139,225, filed Apr. 26, 2016.
Final Office Action, dated May 11, 2017, U.S. Appl. No. 14/183,375, filed Feb. 18, 2014.
Non-Final Office Action, dated Jun. 7, 2017, U.S. Appl. No. 14/802,816, filed Jul. 17, 2015.
Final Office Action, dated Jun. 22, 2017, U.S. Appl. No. 14/657,942, filed Mar. 13, 2015.
Non-Final Office Action, dated Jul. 5, 2017, U.S. Appl. No. 14/848,202, filed Sep. 8, 2015.
International Search Report and Written Opinion of the International Search Authority dated Nov. 26, 2013 in Patent Cooperation Treaty Application No. PCT/US2013/047406, filed Jun. 24, 2013, 9 pages.
International Search Report and Written Opinion of the International Search Authority dated Aug. 9, 2013 in Patent Cooperation Treaty Application No. PCT/US2013/043436, filed May 30, 2013, 13 pages.
International Search Report and Written Opinion of the International Search Authority dated Jul. 1, 2014 in Patent Cooperation Treaty Application No. PCT/US2014/020880, filed Mar. 5, 2014, 14 pages.
International Search Report and Written Opinion of the International Search Authority dated Jun. 29, 2015 in Patent Cooperation Treaty Application No. PCT/US2015/012285, filed Jan. 21, 2015, 15 pages.
Hinman et al., U.S. Appl. No. 61/774,632, filed Mar. 7, 2013, 23 pages.
First Official Notification dated Jun. 15, 2015 in Chinese Design Patent Application 201530058063.8, filed Mar. 11, 2015, 1 page.
Notice of Allowance dated Sep. 8, 2015 in Chinese Design Patent Application 201530058063.8, filed Mar. 11, 2015, 3 pages.
Weisstein, Eric, “Electric Polarization”, Wolfram Reasearch [online], Retrieved from the Internet [retrieved Mar. 23, 2017] <URL:http://scienceworld.wolfram.com/physics/ElectricPolarization.html>, 2007, 1 page.
Liu, Lingjia et al., “Downlink MIMO in LTE-Advanced: SU-MIMO vs. MU-MIMO,” IEEE Communications Magazine, Feb. 2012, pp. 140-147.
“International Search Report” and “Written Opinion of the International Searching Authority,” Patent Cooperation Treaty Application No. PCT/US2017/012884, dated Apr. 6, 2017, 9 pages.
“Office Action,” Chinese Patent Application No. 201580000078.6, dated Jul. 30, 2018, 5 pages [11 pages including translation].
“Office Action,” Chinese Patent Application No. 201580000078.6, dated Oct. 31, 2018, 3 pages [6 pages including translation].
“Notice of Allowance,” Chinese Patent Application No. 201580000078.6, dated Feb. 11, 2019, 2 pages.
“International Search Report” and “Written Opinion of the International Search Authority,” dated Mar. 22, 2019 in Patent Cooperation Treaty Application No. PCT/US2019/012358, filed Jan. 4, 2019, 9 pages.
FCC Regulations, 47 CFR § 15.407, 63 FR 40836, Jul. 31, 1998, as amended at 69 FR 2687, Jan. 20, 2004; 69 FR 54036, Sep. 7, 2004; pp. 843-846.
“International Search Report” and “Written Opinion of the International Search Authority,” dated May 23, 2019 in Patent Cooperation Treaty Application No. PCT/US2019/019462, filed Feb. 25, 2019, 8 pages.
Teshirogi, Tasuku et al., “Wideband Circularly Polarized Array Antenna with Sequential Rotations and Phase Shift of Elements,” Proceedings of the International Symposium on Antennas and Propagation, 1985, pp. 117-120.
“Sector Antennas,” Radiowaves.com, [online], [retrieved Oct. 10, 2019], Retrieved from the Internet: <URL:https://www.radiowaves.com/en/products/sector-antennas>, 4 pages.
KP Performance Antennas Search Results for Antennas, Sector, Single, [online], KPPerformance.com [retrieved Oct. 10, 2019], Retrieved from the Internet: <URL:https://www.kpperformance.com/search?Category=Antennas&Rfpsan99design=Sector&Rfpsan99option=Single&view_type=grid>, 6 pages.
“Partial Supplemental European Search Report,” European Patent Application No. 17835073.2, dated Feb. 13, 2020, 17 pages.
“Wireless Access Point,” Wikipedia.org, Jan. 6, 2020 [retrieved on Feb. 3, 2020], Retrieved from the Internet: <https://en.wikipedia.org/wiki/Wireless_access_point>, 5 pages.
“Extended European Search Report”, European Patent Application No. 17835073.2, dated Jun. 30, 2020, 15 pages.
Haupt, R.T., “Antenna Arrays: A Computational Approach”, Chapter 5: Non-Planar Arrays; Wiley-IEEE Press (2010), pp. 287-338.
Related Publications (1)
Number Date Country
20170238151 A1 Aug 2017 US
Divisions (1)
Number Date Country
Parent 13906128 May 2013 US
Child 14045741 US
Continuations (2)
Number Date Country
Parent 14741423 Jun 2015 US
Child 15588092 US
Parent 14045741 Oct 2013 US
Child 14741423 US