The present invention relates generally to the field of wireless networks, and in particular, to wireless networks where multiple antennas are used to transmit multiple downlink traffic streams to multiple receiver stations simultaneously.
In a typical wireless network utilizing a coordination function for coordinating transmissions among wireless stations, such a function may be implemented in one of the wireless stations or a coordinator device such as an access point (AP). The wireless stations may communicate via directional transmissions using sector antennas and beam-forming antenna arrays. The coordinator device may use omnidirectional transmissions for broadcasts to all wireless stations in all directions (e.g., 360 degrees range). Alternatively, the coordinator may use quasi-omnidirectional transmissions for broadcasts to a wide range, but not necessarily in all directions. In many wireless local area networks (WLANs) such as those according to IEEE 802.11 standards, a coordinator station in infrastructure mode is used for providing contention-free access to a wireless communication medium to support Quality of Service (QoS) for certain applications.
In the absence of a coordinator, to provide contention-free channel time reservation, existing techniques use announcement or information exchange among wireless stations in a network to negotiate/reserve the use of the communication medium.
The present invention provides a method and system for wireless medium reservation for simultaneous transmission of multiple downlink spatial streams to multiple receiver wireless stations during a multi-user transmit opportunity over a wireless medium. Such a reservation includes reserving a transmission period for simultaneously transmitting data from a transmitting station to multiple intended receiving stations on multiple downlink spatial streams over a wireless communication medium. Reserving the transmission period includes transmitting a request-to-send (RTS) frame to the multiple receiving stations, the RTS frame including a receiver address (RA) field comprising compressed addresses for the multiple receiving stations.
These and other features, aspects and advantages of the present invention will become understood with reference to the following description, appended claims and accompanying figures.
The present invention provides a method and system for communication medium contention avoidance in multi-user (MU) multiple-input-multiple-output (MIMO) wireless networks. In one example, the communication medium comprises a wireless channel such as a radio frequency (RF) channel. In one embodiment, the present invention provides a contention avoidance mechanism comprising a multi-user request-to-send/clear-to-send (RTS/CTS) channel reservation protocol that enhances existing RTS/CTS techniques of wireless local area network (WLAN) standards.
One implementation of the invention is useful for simultaneously transmitting multiple downlink (DL) spatial streams to multiple receiver wireless stations during a multi-user transmit opportunity over a wireless channel. The invention avoids frame collisions due to third party stations, and allows multiple simultaneously transmitted downlink traffic streams. The third party stations comprise hidden terminals that pose frame collision issues.
A frame structure is used for data transmission between wireless stations such as a transmitter station and a receiver station. In one example, a frame structure in a Media Access Control (MAC) layer and a physical (PHY) layer is utilized, wherein in a transmitter station, a MAC layer receives a MAC Service Data Unit (MSDU) and attaches a MAC header thereto, in order to construct a MAC Protocol Data Unit (MPDU). The MAC header includes information such as a source address (SA) and a destination address (DA). A number of MPDUs can also be aggregated into an Aggregated MPDU (A-MPDU) to increase MAC layer throughput. The MPDU or A-MPDU is a part of a PHY Service Data Unit (PSDU) and is transferred to a PHY layer in the transmitter to attach a PHY header (i.e., PHY preamble) thereto to construct a PHY Protocol Data Unit (PPDU). The PHY header includes parameters for determining a transmission scheme including a coding/modulation scheme. The PHY layer includes transmission hardware for transmitting data bits over a wireless link. Before transmission as a frame from the transmitter station to the receiver station, a preamble is attached to the PPDU, wherein the preamble can include channel estimation and synchronization information.
In one embodiment according to the invention, communication medium contention avoidance according to the invention is utilized when a transmission opportunity (TXOP) is obtained. The TXOP may be obtained based on IEEE 802.11 channel access standards or using multi-user transmit opportunity (MU-TXOP) mechanism, for a wireless network to support multiple downlink traffic streams to multiple receiver wireless stations simultaneously.
Enhanced Distributed Channel Access (EDCA) provides quality of service (QoS) support for certain applications using announcement or information exchange. EDCA defines four Access Categories (ACs) and introduces service differentiation such that certain data traffic uses higher priority parameters to contend for the communication medium. EDCA allows contention for transmission opportunities (TXOPs), wherein a TXOP is a time interval when a QoS wireless station (STA) may initiate frame transfer on the wireless medium (e.g., wireless channel). The TXOP may be assigned to the wireless station by a coordinator, or the wireless station may obtain the TXOP by successfully contending for the wireless channel.
The wireless station STA-A comprises an access point (AP) having a PHY layer 14 and a MAC layer 12 implementing an EDCA MU-TXOP module 16 according to the invention. In this example, there are three traffic streams (or queues) of data frames (packets) for different Enhanced Distributed Channel Access (EDCA) access categories AC0, AC1, AC2 at the AP station for transmission to receiver stations STA-B, STA-C and STA-D, respectively.
The MAC layer 12 further includes a channel access module 16A comprising an enhanced RTS/CTS module providing enhanced RTS/CTS channel access mechanisms, described further below, according to embodiments of the invention. Each receiver station includes a MAC layer 12 and a PHY layer 14, wherein the MAC layer 12 further implements an enhanced RTS/CTS module 16B providing enhanced RTS/CTS channel access mechanisms in conjunction with the enhanced RTS/CTS module 16A of the AP station, described further below, according to embodiments of the invention.
Embodiments of the invention provide a modified RTS/CTS mechanism that avoids frame collisions due to third party stations, and allows multiple simultaneously transmitted downlink traffic streams, as described below.
For downlink MU-MIMO, a wireless channel is reserved between a wireless sender and multiple wireless receivers. As one of the typical methods, Network Allocation Vector (NAV) information can be delivered to multiple receivers using a CTS-to-self packet. The CTS-to-self mechanism eliminates exchange of RTS/CTS messages and relies on a wireless station to determine channel availability before transmission. However, the CTS-to-self mechanism cannot handle hidden nodes (hidden terminals) and collisions, as RTS/CTS mechanism does. A hidden node problem exists when a wireless node is visible from a wireless station such as an access point (AP), but is not visible from other wireless nodes communicating with the wireless station, causing media access control issues.
Embodiments of the present invention provide an enhancement of existing RTS/CTS mechanisms for channel reservation in a downlink MU-MIMO environment with backward compatibility. The enhanced RTS/CTS mechanism according to the invention allows channel reservation among a wireless sender and multiple wireless receivers, while coping with the hidden node problem.
Referring to
As illustrated in
According to an embodiment of the invention, the compressed RA field 41 is achieved using an Association ID (AID) 42 instead of a typical full IEEE-48 MAC address. The Association ID is a value assigned by the AP station to each wireless station that associates with the AP station. The compressed RA field includes multiple AID fields 42. The compressed RA field 41 further comprises Compatibility Bits (CB) 43.
Using AIDs in a Compressed RA Field
The compressed RA field 41 holds at most 3 AIDs for three receiver STAs according to one embodiment of the invention. Each AID is 14 bits, instead of the original 16 bits. The two MSBs of the original AID are removed since they are always set to is in the existing standard. An AID field is set to 0 if it is not used to indicate any receiver STA. The order the AIDs are presented in the compressed RA field 41 indicates order of transmission of CTS frames (e.g., CTS1, CTS2, CTS3 in
The compressed addresses based on AIDs represent temporary or virtual addresses for corresponding receiver STAs in the network. The five Compatibility Bits field 43 distinguish the temporary, virtual address, from any existing MAC addresses present in the BSS for the wireless network. As noted, the AP station assigns an AID in an association response frame that establishes a current association of a receiver STA with the AP station. As such, the AP station has knowledge of all actual MAC addresses in the BSS, and the AP station maintains an exhaustive list of five CB bits b1-b5 for all present MAC addresses in the BSS. Therefore, an unpresented 5-bit pattern can be easily found and used as CB for indicating a compressed RA field to receiver STAs. Since the total pattern number is 25=32, the five CB bits are selected from the first 3 octets of an Organizationally Unique Identifier (OUI), wherein the network interface controllers (NICs) in the BSS are rarely from 32 or more unique manufacturers. Bit b1 of Octet 0 (the U/L add bit) is always set to “0” for most commercial products, wherein setting the bit b1 to “1” differentiates the compressed RA address 41 from most of the NICs in the BSS. In this case the bit b1 is set to indicate a locally assigned address, which has no harmful effect within a BSS.
To determine the CBs, an AP station maintains a list of all 32 patterns of the 5-bit CB field 43 before any receiver STA joins the BSS. The AP station removes its own 5-bit CB pattern from the list. Whenever a receiver STA associates with the AP, the 5-bit CB pattern of the joining receiver STA is removed. Whenever a receiver STA disassociates with the AP, the 5-bit CB pattern of the departing receiver STA is added back to the list if no other STAs are sharing the same CB pattern. At any moment, there is a list of 5-bit CB patterns that can be selected from and placed in the compressed RA 41 to distinguish it from present (actual) 48-bit MAC address.
Distinguishing a receiver STA requires only 11 bits. Addressing up to 4 receiver STAs requires 4×11=44 bits. In one implementation, if supporting 4 receiver STAs is required and use of AID is desired, then four AIDs 42 may be included in one compressed RA field 41. In this case, other mechanisms are used to differentiate the virtual address from actual MAC addresses, including shuffling the order of the 4 AIDs to compose a unique MAC address for a receiver station. In another implementation of the invention, the AID can be reduced to 10 bits, wherein only 1024 (210) STAs can be uniquely identified. In this case, the remaining 7 bits (48-bit IEEE address minus one I/G Address Bit, minus 4 10-bit AIDs) can be used as compatibility bits. The number of addressable STAs is reduced by about half (50%) but the number is still large enough for a single BSS in the foreseeable future.
An alternative implementation is to use 11 bits for AIDs for only three receiver STAs and expend the Compatibility Bits to up to 14 bits to increase non-overlapping chance. However, this increases the storage requirement for the list of available patterns. A balanced approach is to use 8 bits to form a list of 8-bit entries for Compatibility Bits, to use 11 bits for AIDs, and leave the rest of the bits (6 bits) as reserved bits.
In case an actual MAC address is interpreted as a compressed address where the actual MAC address happens to match one or more of the AIDs of receiver STAs, then a receiver STA with its actual MAC address matching the content of the compressed RA field considers itself the destination of the RTS frame and hence replies with a CTS frame immediately. In one example, a receiver STA with IEEE 802.11ac capability (i.e., IEEE 802.11ac-capable) may find that its actual MAC address does not match the content of the compressed RA field, but proceeds further to check whether an RA field is a compressed RA field, according to an embodiment of the invention.
As such, an IEEE 802.11 ac-capable receiver STA checks the RA field twice, according to an embodiment of the invention. At the first check, it determines whether the RA value matches its regular MAC address. If it matches, the STA is the intended receiver. This case is a single-user transmission, wherein the RA field contains only one receiver address. If it does not match, then the STA initiates a second check since the RA field may be a compressed RA field, as described further below. In that case, the corresponding bits of the actual MAC address in the RA field match the AID of the receiver STA. The receiver STA, although not the intended (target) receiver of the RTS frame, will also reply to a CTS frame at the time determined by the position of the AID in the RA field. The CTS frame may collide with the CTS frame from the intended STA or may collide with the data transmission following the RTS/CTS exchange.
To avoid an actual MAC address being interpreted as a compressed address, the AP station analyzes the MAC address of a STA when that STA associates with the AP station. When the AP station assigns AIDs to associating STAs, assuming 14-bit AIDs are used (as illustrated in
If any of the above bits are non-zero, the corresponding AIDs do not pose issues (i.e., such AIDs will not be mistakenly treated as AIDs of a compressed RA field by a receiver STA).
If all three MSBs of an AID position are zeros, the AID is treated specially (i.e., assigned to the receiver STA as its own AID). In case the AID has been assigned to another STA previously, the AP station may need to disassociate the previous STA and re-associate it with another AID. The released AID will then be assigned to the receiver STA.
If more than a set of three-MSB positions have the “000” pattern, one AID is assigned as the AID of the receiver STA. Others AIDs are not assigned to any receiver STAs.
In the example shown in
When a RTS with an actual MAC address in the RA field is received at an intended receiver STA, the STA processes it as an actual MAC address and replies with a CTS, and does not proceed further to analyze the RA field address. Other receiver STAs implementing IEEE 802.11 ac may attempt to analyze the RA field of the received RTS as a compressed RA. First such a receiver STA checks if all the following 9 bits are zeros:
Only when all the above 9 bits are zeros, the RA field may be a compressed RA. The STA receivers will then compare their own 14-bit AIDs with three AID positions of the compressed RA field, finding their AIDs not present in the compressed RA field because the AID in the compressed RA field has been assigned to the intended receiver STA. Therefore, an actual MAC address will not be misinterpreted as a compressed RA field. If any of the 9 bits are none zeros, the RA field is not a compressed RA and there is no need for further processing at the receiver STA.
AP Operation in Using AIDs in a Compressed RA Field
An example operation scenario for an AP station using AIDs in a compressed RA field of a MU-RTs frame for enhanced RTS/CTS exchange according to an embodiment of the invention is now described. The AP station determines up to 3 targeted (intended) receiver STAs, and obtains AIDs of the receiver STAs. The AP station then obtains a 5-bit pattern as Compatibility Bits from a list it maintains. The AP station composes the compressed RA field for a MU-RTS frame 41 (
The AP station composes the MU-RTS frame 41 as typical except that the AP station replaces the typical (regular) RA field with the compressed RA field (
The AP station then transmits the MU-RTS frame 41 on the wireless channel in broadcast mode. The timers for the expected CTSs from the multiple receiver STAs are set to reflect the number of CTSs expected and the interframe spacings between multiple CTSs.
In response to the MU-RTS, the AP station receives a CTS from each receiver STA. If all expected CTSs are received at the AP, the enhanced RTS/CTS exchange according to the invention is done successfully. The AP station can start transmitting data frames. If one or more expected CTSs in response to the MU-RTS do not arrive at the AP station, the AP station may either send another MU-RTS with a revised Duration value, or during a MU-TXOP begin transmitting data frames to the receiver STAs that have replied with CTSs. After data frame transmission, the AP station releases the remainder of the MU-TXOP.
Receiving STA Operation in Using AIDs in a Compressed RA Field
An example operation scenario for a receiver STA in enhanced RTS/CTS exchange using AIDs in a compressed RA field of a MU-RTS frame, according to an embodiment of the invention is now described. For a legacy wireless receiver STA (i.e., a receiver STA which does not operate according to IEEE 802.11ac protocol), when the legacy STA receives a MU-RTS 41 from the AP station, the legacy STA checks the compressed RA field 41 of the MU-RTS 40 and finds the address in the compressed RA field 41 field does not match the MAC address of the legacy STA. As such, the legacy STA determines that it is not the intended (target) receiver for the frame. The legacy STA updates its NAV using a value indicated in the Duration field of the MU-RTS 41, wherein the legacy STA does not transmit until the NAV counts down to zero.
For a non-legacy receiver STA which operates according to the IEEE 802.11ac protocol, when the non-legacy STA receives a MU-RTS 41 from the AP station, the non-legacy STA checks the RA field therein and finds that the address in the compressed RA field does not match the MAC address of the non-legacy STA. The non-legacy STA then checks whether the RA field is a compressed RA field by parsing the RA field using the compressed RA field format in
If the non-legacy STA determines that the RA field is a compressed RA field, and if the non-legacy STA is one of the intended receivers STAs, the non-legacy determines its order in the compressed RA field. If the non-legacy STA is the first receiver, then it calculates the correct Duration value and replies with a regular CTS immediately after Point Coordination Function Interframe Space (PIFS in IEEE 802.11 standards) or Short Interframe Space (SIFS in IEEE 802.11 standards) from the end of the reception of the MU-RTS. If the non-legacy STA is not the first receiver, then it calculates the correct hold off duration value and replies with a regular CTS after Toffset=SIFS+(n−1)×(CTS+2×RIFS), where integer n is the order of the non-legacy STA in the compressed RA field of the MU-RTS (1≦n≦3). For example, if the non-legacy STA is a third receiver in order, then Toffset=SIFS+2×(CTS+2×RIFS).
However, if the non-legacy STA is not one of the intended receivers indicated in the compressed RA field, the non-legacy STA updates its NAV using the value indicated in the MU-RTS Duration field.
Using the enhanced RTS/CTS exchange according to an embodiment of the invention, the AP station may address up to 3 or 4 receiver STAs, depending on the number of bits that can be used for each AID. To address more receiver STAs (e.g., up to 4) using a compressed RA field, using a Unique Octet in the MAC address is used, according to an embodiment of the invention, as described below.
Using Unique Octet as MAC Address in Compressed RA Field
According to another embodiment of the invention for enhanced RTS/CTS exchange, the compressed RA field comprises a Unique Octet of each receiver station MAC address to represent a full IEEE-48 MAC address.
In one implementation, one of the 6 octets in a 48-bit MAC address is used to uniquely represent a receiver STA. In this case, up to 4 receiver STAs can be addressed in the RA field 41.
In one implementation, in case the compatibility bits mechanism fails, the AP station cannot find any 5-bit pattern that is different from all present 5-bit patterns in the BSS. One solution involves composing a unique compressed RA field by selecting a 5-bit pattern, and shuffling the order of different AIDs or unique octets of the targeted receiver STAs. Because such failure only occurs when the receiver STA numbers are large and all 5-bit patterns have been presented in the network, essentially by selecting a proper 5-bit pattern and order of AIDs and unique octets, a unique compressed RA can be structured to be different from any existing actual MAC address.
AP Operation in using Unique Octet as MAC Address in Compressed RA Field
An example operation scenario for an AP station using Unique Octets in a compressed RA field 41A of an MU-RTS frame for enhanced RTS/CTS exchange according to an embodiment of the invention is now described. The AP station selects up to 4 intended (target) receiver STAs, and determines Unique Octets for each of the receiver STAs and records the position of each unique octet for the compressed RA field 41A. The AP station obtains a 5-bit pattern as Compatibility Bits from a list it maintains. The AP station composes the compressed RA field 41A, wherein for each selected receiver STA, the AP station places the unique octet position value in the corresponding 2- or 3-bit position field and places the content of the unique octet in its corresponding field in the RA field 41A (
The AP station composes the MU-RTS frame 40 as typical, except the regular RA field is replaced with the compressed RA field 41A. The value of the Duration field indicates the length of the TXOP. The AP station then transmits the composed MU-RTS frame to the receiver STA in broadcast mode.
Timers for expected CTSs are set to reflect the number of CTSs expected and the inter-frame spacings between multiple CTSs. The AP stations holds off data transmission until the time expected to receive all CTSs has passed.
Upon receiving CTSs from individual receiver STAs at the AP station, if all expected CTSs are received, the enhanced RTS/CTS exchange is completed successfully and the AP station can start transmitting data frames in a MU-TXOP.
If one or more expected CTSs are not received at the AP station, the AP station may send another MU-RTS frame with revised Duration value, or may start transmitting data to the receiver STAs that have replied with CTSs. After such data transmission, the AP stations releases any remainder of the MU-TXOP.
An example operation scenario for a receiver STA in enhanced RTS/CTS exchange using Unique Octets in a compressed RA field of an MU-RTS frame, according to an embodiment of the invention is now described. A legacy receiver STA operates in a similar manner as described further above, in response to a MU-RTS including a compressed RA field 41A (
Each non-legacy receiver STA that receives an MU-RTS including a compressed RA field 41A (
If the receiving non-legacy receiver STA is one of the intended (target) receivers, the non-legacy receiver STA determine its order in the RA field 41A. If the non-legacy receiver STA is the first receiver, it calculates the correct hold off duration value and replies with a regular CTS immediately after PIFS or SIFS from the end of the reception of the MU-RTS. If the receiving non-legacy receiver STA is not the first receiver, it calculates the correct duration value and replies with a regular CTS after Toffset=SIFS+(n−1)×(CTS+2×RIFS), where integer n is the order of the receiver in the compressed RA field 41A of the MU-RTS (1≦n≦3). For example, for the third receiver, Toffset=SIFS+2×(CTS+2×RIFS).
If the receiving non-legacy receiver STA is not one of the intended receivers, the non-legacy STA updates its NAV using the value indicated in the Duration field of the MU-RTS.
Shortened Inter-Frame Spacing
As noted, another aspect of the enhanced RTS/CTS exchange mechanism according to an embodiment of the invention involves using a SIFS period to separate a response frame (i.e., CTS) from the frame (i.e., RTS) that solicited the response. In one implementation, the inter-frame spacing between MU-RTS and CTS1 must be SIFS, as shown by example channel reservation frame exchange timing diagram in
PHY layer receiving (Rx) latency,
MAC layer processing delay,
PHY layer transmitting (Tx) latency.
Between CTSs, all processes during a SIFS can be performed before the receiver STAs are ready to transmit CTSs. Therefore, the inter-frame spacing between CTSs can be reduced to 2×RIFS (e.g., 2×2 μs=4 μs,
tn=t0+SIFS for n=1
tn=t0+SIFS+(n−1)(CTS+2×RIFS) for n>1
Toffset calculations are based on a reference, t0, indicating a point in time when the last symbol of MU-RTS is received at a receiver STA. For example in
Time offsets t2 and t3 are calculated at t0 by the receiver STA2 and STA3, respectively, as soon as the compressed RA field of the MU-RTS is decoded at those receiver STAs. Therefore, STA2 need not monitor the wireless communication medium (wireless channel) before it can transmit CTS2. Indeed, if STAT is at an opposite side of the AP station relative to STA2, then STA2 may not be able to detect CTS1 on the wireless medium even if STA2 monitors the wireless medium. The same applies to STA3. Further, all receiver STAs are turned around at t0. Turn around means that the RF circuitry of the receiver switches from receiving state to transmitting state. As such, there is no turnaround again before the transmission of CTS2 and CTS3.
Referring back to the wireless network 10 in
According to embodiments of the invention, a compressed RA field is to host multiple receiver MAC addresses in a MU-RTS for an enhanced RTS/CTS exchange mechanism which provides contention avoidance in MU-MIMO wireless communication. In one implementation, the compressed RA field comprises a group of AIDs, while in another implementation the compressed RA field comprises a group of Unique Octets of receiver station MAC addresses.
The MAC addresses in the compressed RA field are temporary receiver station addresses different from any actual (real) MAC address in the BSS. The temporary receiver station addresses are achieved using Compatibility Bits and shuffling of the order of representation of the receiver station addresses in the compressed RA field.
The compressed RA field is the same size as a typical RA field, but includes compressed addresses for multiple receiver stations, according to embodiments of the invention. As such, transmission of the compressed RA field does not require additional channel bandwidth compared to a conventional RA field such as in existing IEEE 802.11 standards. This provides backward compatibility with existing wireless local area networks.
In one implementation, the compressed RA field is utilized in a MU-RTS frame for IEEE 802.11 ac capable wireless stations. Shortened inter-frame spacing (shorter than SIFS) is used between consecutive CTSs from multiple receiver STAs in response to a MU-RTS from an AP station. The use of shortened inter-frame spacing improves throughput.
Embodiments of the invention are backward compatible with legacy stations, wherein the use of a compressed RA field in MU-RTS eliminates the need for a new type of frame format. Legacy STAs treat the MU-RTS as an RTS for other receiver STAs and can correctly update their NAVs.
Embodiments of the invention provide efficiency since the compressed RA field of a MU-RTS provides use of one MAC address field to holds up to 4 receiver station addresses, dramatically reducing the MU-RTS frame size. The AP station uses existing information to differentiate different receiver STAs, wherein both AID and MAC addresses are information known to the AP station (or are readily available for the AP station to obtain).
As is known to those skilled in the art, the aforementioned example architectures described above, according to the present invention, can be implemented in many ways, such as program instructions for execution by a processor, as software modules, microcode, as computer program product on computer readable media, as logic circuits, as application specific integrated circuits, as firmware, as consumer electronic devices, etc., in wireless devices, in wireless transmitters/receivers, in wireless networks, etc. Further, embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements.
The terms “computer program medium,” “computer usable medium,” “computer readable medium”, and “computer program product,” are used to generally refer to media such as main memory, secondary memory, removable storage drive, a hard disk installed in hard disk drive, and signals. These computer program products are means for providing software to the computer system. The computer readable medium allows the computer system to read data, instructions, messages or message frames, and other computer readable information from the computer readable medium. The computer readable medium, for example, may include non-volatile memory, such as a floppy disk, ROM, flash memory, disk drive memory, a CD-ROM, and other permanent storage. It is useful, for example, for transporting information, such as data and computer instructions, between computer systems. Furthermore, the computer readable medium may comprise computer readable information in a transitory state medium such as a network link and/or a network interface, including a wired network or a wireless network, that allow a computer to read such computer readable information. Computer programs (also called computer control logic) are stored in main memory and/or secondary memory. Computer programs may also be received via a communications interface. Such computer programs, when executed, enable the computer system to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor multi-core processor to perform the features of the computer system. Accordingly, such computer programs represent controllers of the computer system.
Though the present invention has been described with reference to certain versions thereof; however, other versions are possible. Therefore, the spirit and scope of the appended claims should not be limited to the description of the preferred versions contained herein.
Number | Name | Date | Kind |
---|---|---|---|
5615212 | Ruszczyk et al. | Mar 1997 | A |
5886993 | Ruszczyk et al. | Mar 1999 | A |
6198728 | Hulyalkar et al. | Mar 2001 | B1 |
6795421 | Heinonen et al. | Sep 2004 | B1 |
6807158 | Krishnamurthy et al. | Oct 2004 | B2 |
6813277 | Edmon et al. | Nov 2004 | B2 |
6868072 | Lin et al. | Mar 2005 | B1 |
6925064 | Hester et al. | Aug 2005 | B2 |
7079812 | Miller et al. | Jul 2006 | B2 |
7088702 | Shvodian | Aug 2006 | B2 |
7127254 | Shvodian et al. | Oct 2006 | B2 |
7184767 | Gandolfo | Feb 2007 | B2 |
7197025 | Chuah | Mar 2007 | B2 |
7251235 | Wentink | Jul 2007 | B2 |
7280518 | Montano et al. | Oct 2007 | B2 |
7280801 | Dahl | Oct 2007 | B2 |
7339916 | Kwon et al. | Mar 2008 | B2 |
7356341 | Nanda | Apr 2008 | B2 |
7359398 | Sugaya | Apr 2008 | B2 |
7385943 | Niddam | Jun 2008 | B2 |
7388833 | Yuan et al. | Jun 2008 | B2 |
7400899 | Shin et al. | Jul 2008 | B2 |
7447174 | Joshi | Nov 2008 | B2 |
7447180 | Jeong et al. | Nov 2008 | B2 |
7474686 | Ho | Jan 2009 | B2 |
7480266 | Murty et al. | Jan 2009 | B2 |
7486650 | Trainin | Feb 2009 | B2 |
7539930 | Ginzburg et al. | May 2009 | B2 |
7545771 | Wentink et al. | Jun 2009 | B2 |
7561510 | Imamura et al. | Jul 2009 | B2 |
7570656 | Raphaeli et al. | Aug 2009 | B2 |
7590078 | Nanda | Sep 2009 | B2 |
7623542 | Yonge et al. | Nov 2009 | B2 |
7634275 | Odman | Dec 2009 | B2 |
7664030 | Sugaya | Feb 2010 | B2 |
7664132 | Benveniste | Feb 2010 | B2 |
7680150 | Liu et al. | Mar 2010 | B2 |
7684380 | Odman | Mar 2010 | B2 |
7697448 | Karaoguz | Apr 2010 | B2 |
7881340 | Farrag et al. | Feb 2011 | B2 |
7974261 | Lane et al. | Jul 2011 | B2 |
8089946 | Brommer | Jan 2012 | B2 |
8179867 | Seok | May 2012 | B2 |
8194626 | Moorti et al. | Jun 2012 | B2 |
8437317 | Jang et al. | May 2013 | B2 |
8532221 | Liu et al. | Sep 2013 | B2 |
20030003905 | Shvodian | Jan 2003 | A1 |
20030137970 | Odman | Jul 2003 | A1 |
20030137993 | Odman | Jul 2003 | A1 |
20030214967 | Heberling | Nov 2003 | A1 |
20040047319 | Elg | Mar 2004 | A1 |
20040214571 | Hong | Oct 2004 | A1 |
20040218683 | Batra et al. | Nov 2004 | A1 |
20040264475 | Kowalski | Dec 2004 | A1 |
20050058151 | Yeh | Mar 2005 | A1 |
20050130634 | Godfrey | Jun 2005 | A1 |
20050135318 | Walton et al. | Jun 2005 | A1 |
20050232275 | Stephens | Oct 2005 | A1 |
20050238016 | Nishibayashi et al. | Oct 2005 | A1 |
20060002428 | Trainin | Jan 2006 | A1 |
20060050742 | Grandhi et al. | Mar 2006 | A1 |
20060166683 | Sharma et al. | Jul 2006 | A1 |
20060176908 | Kwon et al. | Aug 2006 | A1 |
20060193279 | Gu et al. | Aug 2006 | A1 |
20060268800 | Sugaya et al. | Nov 2006 | A1 |
20060285516 | Li et al. | Dec 2006 | A1 |
20070060168 | Benveniste | Mar 2007 | A1 |
20070116035 | Shao et al. | May 2007 | A1 |
20070280180 | Dalmases et al. | Dec 2007 | A1 |
20080159208 | Kloker et al. | Jul 2008 | A1 |
20080212604 | Liu | Sep 2008 | A1 |
20080279204 | Pratt, Jr. et al. | Nov 2008 | A1 |
20080291873 | Benveniste | Nov 2008 | A1 |
20090052389 | Qin et al. | Feb 2009 | A1 |
20090086706 | Huang et al. | Apr 2009 | A1 |
20090092086 | Lee et al. | Apr 2009 | A1 |
20090275292 | Chang | Nov 2009 | A1 |
20090285163 | Zhang et al. | Nov 2009 | A1 |
20090323611 | Singh et al. | Dec 2009 | A1 |
20100002639 | Qin et al. | Jan 2010 | A1 |
20100046453 | Jones et al. | Feb 2010 | A1 |
20100046518 | Takagi et al. | Feb 2010 | A1 |
20100061357 | Takano | Mar 2010 | A1 |
20100220601 | Vermani et al. | Sep 2010 | A1 |
20100310003 | Lauer et al. | Dec 2010 | A1 |
20110002319 | Husen et al. | Jan 2011 | A1 |
20110064013 | Liu et al. | Mar 2011 | A1 |
20110090855 | Kim | Apr 2011 | A1 |
20110176627 | Wu et al. | Jul 2011 | A1 |
20110235513 | Ali | Sep 2011 | A1 |
20110255618 | Zhu et al. | Oct 2011 | A1 |
20120008490 | Zhu | Jan 2012 | A1 |
20120082200 | Verikoukis et al. | Apr 2012 | A1 |
20120087358 | Zhu et al. | Apr 2012 | A1 |
20120140615 | Gong | Jun 2012 | A1 |
20120218947 | Merlin et al. | Aug 2012 | A1 |
20120314694 | Hsieh | Dec 2012 | A1 |
20140010144 | Liu et al. | Jan 2014 | A1 |
Entry |
---|
U.S. Non-Final Office Action mailed Oct. 26, 2011 for U.S. Appl. No. 12/455,438. |
IEEE 802.11e/D13.0, “IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific Requirements: Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Amendment: Medium Access Control (MAC) Quality of Service (QoS) Enhancements,” LAN/MAN Committee, IEEE Computer Society, Jan. 2005, IEEE, New York, NY, pp. i-182, United States. |
IEEE Wireless LAN Edition, “A Compilation Based on IEEE Std. 802.11TM-1999 (R2003) and Its Amendments,” IEEE Press, 2003, United States pp. i-678. |
Mujtaba, S.A., “TGn Sync Proposal Technical Specification,” IEEE 802.11-04-0889r7, IEEE P802.11: Wireless LANs, Jul. 8, 2005, United States pp. 1-133. |
“Kim, S. et al., ““QoS Enhancement Scheme of EDCF in IEEE 802.11e Wireless LANs,”” Electronics Letters, vol. 40, No. 17, Aug. 19, 2004, pp. 1091-1092, United States”. |
“IEEE 802.11-2007, ““IEEE Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specific requirements: Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,”” 2007 Revision of IEEE Std 802.11-1999, IEEE Computer Society, Jun. 12, 2007, pp. i-1184, United States”. |
“IEEE 802.16e™—2005, ““IEEE Standard for Local and Metropolitan Area Networks: Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems: Amendment 2: Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands and Corrigendum 1,”” LAN/MAN Standards Committee, IEEE Computer Society and the IEEE Microwave Theory and Techniques Society, Feb. 28, 2006, pp. i-822, United States”. |
International Search Report dated Jan. 9, 2009 for International Application No. PCT/KR2008/004793 from Korean Intellectual Property Office, filed Aug. 19, 2008, pp. 1-2. |
Harada, H., “Unified and Flexible Millimeter Wave WPAN Systems Supported by Common Mode,” IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs), IEEE 802.15-07-0761-10-003c, Sep. 18, 2007, Slides 1-62, United States. |
U.S. Non-final Office Action mailed Jun. 9, 2009 for U.S. Appl. No. 11/589,519. |
U.S. Final Office Action mailed May 12, 2010 for U.S. Appl. No. 11/589,519. |
U.S. Non-Final Office Action mailed Jun. 27, 2006 for U.S. Appl. No. 11/044,600. |
U.S. Non-Final Office Action mailed Aug. 21, 2007 for U.S. Appl. No. 11/044,600. |
U.S. Final Office Action mailed Jan. 15, 2008 for U.S. Appl. No. 11/044,600. |
U.S. Non-Final Office Action mailed Aug. 7, 2008 for U.S. Appl. No. 11/044,600. |
U.S. Non-Final Office Action mailed Jan. 25, 2007 for U.S. Appl. No. 11/044,600. |
U.S. Advisory Action mailed May 15, 2008 for U.S. Appl. No. 11/044,600. |
Mirkovic, J. et al., “A MAC Protocol With Multi-User MIMO Support for Ad-Hoc WLANs”, The 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'07), IEEE, 2007, pp. 1-5, United States. |
Stacey, R. et al., “DL MU-MIMO Ack Protocol (IEEE 802.11-09/1172r0)”, IEEE, Nov. 16, 2009, pp. 1-8, United States. |
IEEE Computer Society, “IEEE Std 802®—2001 (R2007), IEEE Standard for Local and Metropolitan Area Networks: Overview and Architecture”, IEEE, Feb. 7, 2002, pp. i-36, New York, United States. |
Camp, J.D. et al., “The IEEE 802.11s Extended Service Set Mesh Networking Standard”, IEEE Communications Magazine, vol. 46, No. 8, IEEE, Aug. 2008, pp. 1-6, United States. |
U.S. Final Office Action mailed Apr. 12, 2012 for U.S. Appl. No. 12/455,438. |
U.S. Non-Final Office Action mailed Jun. 6, 2012 for U.S. Appl. No. 12/415,981. |
Morioka, Y. et al., “Multi-RTS Proposal”, IEEE 802.11-10/1124r01, Sep. 12, 2010, Slides 1-14, IEEE, USA. |
U.S. Final Office Action mailed Dec. 19, 2012 for U.S. Appl. No. 12/415,981. |
U.S. Advisory Action mailed Mar. 8, 2013 for U.S. Appl. No. 12/415,981. |
U.S. Non-Final Office Action mailed Jul. 11, 2013 for U.S. Appl. No. 12/455,438. |
U.S. Non-Final Office Action mailed Aug. 8, 2013 for U.S. Appl. No. 12/415,981. |
U.S. Final Office Action mailed Jan. 14, 2014 for U.S. Appl. No. 12/415,981. |
U.S. Non-Final Office Action for U.S. Appl. No. 13/177,386 mailed Dec. 17, 2013. |
U.S. Non-Final Office Action for U.S. Appl. No. 13/253,926 mailed Nov. 25, 2013. |
U.S. Notice of Allowance mailed Oct. 21, 2013 for U.S. Appl. No. 12/455,438. |
U.S. Restriction Requirement for U.S. Appl. No. 13/030,070 mailed Nov. 5, 2013. |
U.S. Restriction Requirement for U.S. Appl. No. 13/253,926 mailed Oct. 10, 2013. |
U.S. Notice of Allowance mailed Apr. 10, 2014 for U.S. Appl. No. 12/415,981. |
U.S. Non-Final Office Action for U.S. Appl. No. 13/030,070 mailed May 15, 2014. |
U.S. Final Office Action for U.S. Appl. No. 13/253,926 mailed Apr. 29, 2014. |
U.S. Supplemental Notice of Allowability for U.S. Appl. No. 13/253,926 mailed Oct. 15, 2014. |
U.S. Notice of Allowance for U.S. Appl. No. 13/253,926 mailed Aug. 15, 2014. |
Number | Date | Country | |
---|---|---|---|
20110317630 A1 | Dec 2011 | US |