The present disclosure is generally related to communication systems and methods and, more particularly, is related to collision avoidance systems and methods in wireless networks.
Communication networks come in a variety of forms. Notable networks include wireline and wireless. Wireline networks include local area networks (LANs), DSL networks, and cable networks, among others. Wireless networks include cellular telephone networks, classic land mobile radio networks and satellite transmission networks, among others. These wireless networks are typically characterized as wide area networks. More recently, wireless local area networks and wireless home networks have been proposed, and standards, such as Bluetooth® and IEEE 802.11, have been introduced to govern the development of wireless equipment for such localized networks.
A wireless local area network (LAN) typically uses infrared (IR) or radio frequency (RF) communication channels to communicate between portable or mobile computer terminals and access points (APs) or base stations. These APs are, in turn, connected by a wired or wireless communications channel to a network infrastructure which connects groups of access points together to form the LAN, including, optionally, one or more host computer systems.
Wireless protocols such as Bluetooth® and IEEE 802.11 support the logical interconnections of such portable roaming terminals having a variety of types of communication capabilities to host computers. The logical interconnections are based upon an infrastructure in which at least some of the terminals are capable of communicating with at least two of the APs when located within a predetermined range, each terminal being normally associated, and in communication, with a single one of the access points. Based on the overall spatial layout, response time, and loading requirements of the network, different networking schemes and communication protocols have been designed so as to most efficiently regulate the communications.
IEEE Standard 802.11 (“802.11”) is set out in “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications” and is available from the IEEE Standards Department, Piscataway, N.J. The IEEE 802.11 standard permits either IR or RF communications at 1 Mbps, 2 Mbps and higher data rates, a medium access technique similar to carrier sense multiple access/collision avoidance (CSMA/CA), a power-save mode for battery-operated mobile stations, seamless roaming in a full cellular network, high throughput operation, diverse antenna systems designed to eliminate “dead spots,” and an easy interface to existing network infrastructures. The IEEE Standard 802.11b extension supports data rates up to 11 Mbps.
The current 802.11 standard describes several methods to set a virtual carrier sense, referred to as a network allocation vector or NAV, most notably by request to send/clear to send (RTS/CTS) mechanisms. The sending of an RTS frame (herein, RTS frame also referred to as, simply, RTS) sets a NAV locally around the sender of the RTS, and the sending of a CTS frame (herein, CTS frame is also referred to as CTS) does the same locally around the sender of the CTS (e.g., the receiver of the RTS).
One problem that exists in current implementations under 802.11 involves what is referred to as a hidden node problem. For instance, in an infrastructure mode of a wireless LAN system, a first device may communicate frames to the AP and vice versa. Similarly, a second device may communicate frames to the AP, and vice versa. However, the second device may not detect transmissions from the first device (hence the phrase hidden node), for instance if the distance between the first and second device is too great. Because of the hidden node problem, various complications may arise in terms of collision avoidance and symmetry of response among devices, causing inequity in terms of opportunities for access to a shared medium of the communication system. For instance, in 802.11 compliant systems, the NAV can be reset by an access point (AP) through the transmission of what is commonly referred to as a CF-end frame. One exemplary frame format for a CF-end frame 10 is shown in
Embodiments of the present disclosure provide symmetric transmit opportunity (TXOP) truncation systems and methods in a wireless network. Briefly described, one embodiment of a method, among others, comprises receiving a frame that truncates a TXOP around a first station, and responsive to receiving the frame, sending a second frame that truncates the TXOP around a second station.
Another method embodiment, among others, comprises receiving a frame from an access point (AP) that includes an indicator of an end of a TXOP, responsive to receiving the indicator, sending a first frame that truncates the TXOP around a first station, receiving the first frame at the AP, and responsive to receiving the first frame at the AP, sending a second frame that truncates the TXOP around the AP.
Another method embodiment, among others, comprises sending at a first station a first frame, sending at the first station an extended interframe space (EIFS) set frame after the first frame, and sending at a second station a second frame having a completed transmission corresponding to time based on an interval of EIFS less DIFS, the interval commencing from an end of the short frame.
One system embodiment, among others, comprises a processor configured with logic to receive a frame that truncates a TXOP around a first station and, responsive to receiving the frame, the processor further configured with the logic to send a second frame that truncates the TXOP around a second station.
Another system embodiment, among others, comprises means for receiving a frame that truncates a TXOP around a first station, and responsive to receiving the frame, means for sending a second frame that truncates the TXOP around a second station.
Other systems, methods, features, and advantages of the present disclosure will be or become apparent to one with skill in the art upon examination of the following drawings and detailed description. It is intended that all such additional systems, methods, features, and advantages be included within this description, be within the scope of the present disclosure, and be protected by the accompanying claims.
Many aspects of the disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views.
Disclosed herein are various embodiments of symmetric transmit opportunity (TXOP) truncation (STT) systems and corresponding mechanisms or methods in a wireless network (herein, individually or collectively referred to also as an STT system or STT systems). The STT systems described herein comprise functionality to truncate a TXOP in a symmetric manner in a plurality of devices. That is, in various STT systems and methods described herein, both access points (APs) and client stations (herein, clients) are also allowed to truncate their TXOPs by transmitting a CF-end frame. This truncation is referred to as a TXOP truncation, where a NAV is first set for some maximum duration of time (e.g., the TXOP limit) and then reset when no more traffic (e.g., of frames) is left and there is some NAV time that still remains. In general, a TXOP comprises a signal exchange which may begin with the transmission of a short frame such as an RTS or CTS and ends with the last frame sent or received by the sender of the short frame (e.g., sender of the RTS or CTS). The truncation at both clients and APs resolve the various problems resulting from a reset that is not symmetrical, such as in conventional systems where the reset comes from a single device (though set by both devices through the RTS/CTS mechanisms). Various embodiments of the STT systems provide one or more mechanisms for the symmetrical truncation of TXOPs.
Thus, although described mostly in the context of a wireless local area network (WLAN) environment having a basic service set (BSS) configured in an infrastructure mode, the various embodiments of the STT systems described herein may similarly be applied to other systems and environments, such as ad hoc systems (e.g., independent BSS (IBSS) systems) or DLC systems, as well as other communication system environments. Additionally, although IEEE 802.11 is prominently used herein as an example of a standard used in the disclosed exemplary wireless networks, the various systems and methods described herein may apply to virtually any wireless network. Further, some embodiments of the STT systems may include some or all of the functionality of collision avoidance systems (CA systems) described in the co-pending application having Ser. No. 11/557,516 and incorporated herein by reference in its entirety.
The STT system 200 shown in
The control logic 300 can be implemented in hardware, software, or a combination thereof. When implemented in whole or in part by software, control logic 300 is implemented in software stored in a memory that is executed by a suitable instruction execution system. When implemented in whole or in part by hardware, the control logic 300 can be implemented with any or a combination of the following technologies, which are all well known in the art: a discrete logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc. In one embodiment, the control logic 300 may include a PHY layer processor, MAC layer processor, or a combination of both (in the same or separate units), including, but not limited to, a digital signal processor (DSP), a microprocessor unit (MCU), a general purpose processor, and an application specific integrated circuit (ASIC), among others.
The AP 202 is typically connected to a wired network (e.g., Ethernet), not shown. In general, the clients, such as client 204, connect to the AP 202 through a scanning process. The scanning process can either be performed passively by listening for a beacon transmitted by one or more APs 202, or actively by sending out probes to one or more APs 202 and choosing an AP that provides the best connection (e.g., in terms of signal strength and/or bit error ratio (BER)). After an AP is chosen, such as AP 202, an authentication process occurs between the client 204 and the AP 202, and then association between the client 204 and the AP 202 may begin.
Association involves the communication between the clients 204, 206 and the AP 202 via a shared wireless medium 208. In one implementation, the client 206 may represent a hidden node to client 204, and vice versa. Various mechanisms or methods for signal exchanges are illustrated in
Before describing the various symmetrical TXOP truncation mechanisms of embodiments of the STT system 200, an embodiment of an STT system 200 that performs an AP-initiated TXOP is described in association with
The description that follows and the associated figures (
In particular, the AP 202 (not shown, but implied as denoted by the “AP” in parenthesis) sends an RTS frame (or RTS) 402, and the client 204 (not shown, but implied as denoted by the “client” in parenthesis) responds by sending a CTS frame (or CTS) 404. The sending of the RTS 402 and CTS 404 results in the setting of a NAV around (e.g., close enough to decode frame transmissions all or at least most of the time) the respective devices. The AP 202 sends one or more data frames 406, each of which are acknowledged by the client 204 with an acknowledgement (ACK) frame 408. The final data frame 406 from the AP 202 to the client 204 is “tagged” with an end of TXOP (EOT) indication. This EOT indication comprises a signal or flag to the client 204 to respond with a CF-end frame 410 after a SIFS interval. In some implementations, the CF-end frame 410 may be preceded by a mandatory response frame, such as the ACK frame 408 (or a block acknowledgement (BA) frame, the latter not shown). A basic service set identifier (BSSID) field of the CF-end frame 410 carries a BSSID (e.g., MAC address) of the AP 202. The AP 202 recognizes its BSSID in the received CF-end frame 410 and responds to this CF-end frame 410 with a CF-end frame 412. By the AP 202 sending the CF-end frame 412, the TXOP is actively truncated by both devices 202 and 204.
Having described various exemplary mechanisms used by the STT system 200 for providing symmetrical truncation, the following description (and associated figures) generalizes some of the above-noted mechanisms for communications between stations (e.g., either AP 202 or clients 204, 206) and provides additional mechanisms. That is,
Consider the case where STA1 comprises a client station 204, and STA2 comprises an AP station (or simply, AP) 202. The mechanism shown in
Continuing the case where STA1 is a client 204 and STA2 is an AP 202, the client 204 may send a CF-end 702 with a duration value (which sets a NAV) corresponding to a defined time after the expected CF-end 704 to be sent by the AP 202. The AP 202 sends a CF-end 704 (CF-end response) with a duration of zero, which causes receivers of each CF-end to resume backoff at exactly, or substantially exactly, the same time (and hence, in one embodiment, superceding existing rules that allow an EIFS to follow a CF-end). The client 204 may also send a CF-end 702 with a physical layer convergence protocol (PLCP) duration (which is signaled inside a SIG field or L-SIG field of the frame) equal to the CF-end itself plus SIFS plus the expected CF-end response duration from the AP 202. The AP 202, in one embodiment, is allowed to ignore this physical duration and respond with a CF-end 704 a SIFS interval after the end of the actual transmission of the CF-end 702, as can be determined from the indicated rate and size of the CF-end 702 (e.g., 20 octets without an HT control field, 24 octets with an HT control field). The CF-end 704, in one embodiment, comprises a regular PLCP duration. The mechanisms described below in association with
In some embodiments, a third CF-end frame may be added to the frame sequence illustrated in
In an IBSS implementation, the BSSID may be recognized by the station that transmitted the final IBSS beacon, as illustrated in
In some embodiments, the receiver address (RA) of a CF-end frame is equal to the broadcast address, which ensures that all stations within range receive the CF-end frame and process the same. The location of the BSSID can be used to indicate the destination of the CF-end. Further, in some embodiments, the recognition of the CF-end type/subtype is enough for a receiver to truncate the NAV. In such implementations, the RA of the CF-end frame can be used to store the CF-end responder address, while the BSSID field can be used to store the BSSID.
Having described various embodiments of the STT system 200 above, it can be appreciated in the context of this disclosure that one method embodiment, referred to as STT method 200a corresponding to the mechanism shown in
It can be appreciated that portions of the method embodiment 200a are implemented at each device, and hence such portions can be described from the perspective of the individual devices of the system 200. For instance, one method embodiment corresponding to method 200a, viewed from the perspective of an AP, comprises sending (by an AP) a final data frame of a transmit opportunity (TXOP) with an end of transmit opportunity (EOT) indicator included therein, and responsive to receiving a CF-end frame with an identifier of the AP included therein to truncate the TXOP around the client, sending a CF-end frame with the same identifier to the client to truncate the TXOP around the AP.
Another method embodiment corresponding to method 200a, from the perspective of a client, comprises receiving (by a client) a final frame of a transmit opportunity (TXOP) from an AP, the final data frame having an end of transmit opportunity (EOT) indicator included therein, responding to the final frame by sending a CF-end frame, with an identifier of the AP included therein, to the AP to truncate the TXOP around the client and to prompt the AP to send a CF-end frame to truncate the TXOP around the AP.
Another embodiment, referred to as STT method 200b corresponding to the mechanisms illustrated in
It can be appreciated that portions of the method embodiment 200b are implemented at each device (e.g., stations, whether configured as an AP or client), and hence such portions can be described from the perspective of the individual devices of the system 200. For instance, one method embodiment corresponding to method 200b implemented at a first station (e.g., AP) comprises receiving a final frame of a TXOP from a second station (e.g., client) at the first station, and responsive to receiving the final frame of the TXOP, sending, at the end of the TXOP, a CF-end frame with an address of the second station included therein to truncate a TXOP around the first station and to prompt the second station to send a CF-end frame to truncate the TXOP around the second station.
Additionally, one method embodiment corresponding to method 200b implemented at a second station (e.g., client) comprises receiving (at the second station) a CF-end frame with an address of the second station included therein, the CF-end used to truncate a TXOP around a first station (e.g., AP), and responding to the first station by sending a CF-end frame with the address of the second station included therein to truncate the TXOP around the second station.
Another method embodiment, referred to as STT method 200c corresponding to the mechanism illustrated in
It can be appreciated that portions of the method embodiment 200c are implemented at each device, and hence method embodiments can be described from the perspective of the AP and client. One method embodiment corresponding to method 200c implemented at an AP comprises an AP sending a CF-end frame at a non-basic rate (and hence acting as an EOT indicator) with the address of the client included therein, and responsive to receiving a client-TXOP truncating CF-end frame having the address of the AP included therein, responding by sending a CF-end frame with the address of the AP included therein, which truncates the TXOP around the AP.
Additionally, one method embodiment corresponding to method 200c implemented at a client comprises receiving by a client a CF-end frame possibly at a non-basic rate (and hence acting as an EOT indicator) with the address of the client included therein, and responding by sending a CF-end frame having the address of the sending AP included therein, which truncates the TXOP around the client and prompts the AP to send a final CF-end frame that truncates the TXOP around the AP.
Another method embodiment, referred to as STT method 200d corresponding to the mechanisms illustrated in
It can be appreciated by one having ordinary skill in the art, in the context of this disclosure, that each device participating in the methodology illustrated in
Having described the various mechanisms shown in
It can be appreciated by one having ordinary skill in the art, in the context of this disclosure, that each device participating in the methodology illustrated in
Any process descriptions or blocks in flow charts should be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process, and alternate implementations are included within the scope of the present disclosure in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as should be understood by those reasonably skilled in the art of the present disclosure.
It should be emphasized that the above-described embodiments of the present disclosure are merely possible examples of implementations, merely set forth for a clear understanding of the principles of the disclosure. Many variations and modifications may be made to the above-described embodiment(s) of the disclosure without departing substantially from the spirit and principles of the disclosure. All such modifications and variations are intended to be included herein within the scope of this disclosure and the present disclosure and protected by the following claims.
This application is a Continuation of U.S. application Ser. No. 16/122,828, filed Sep. 5, 2018, which is a Continuation of Ser. No. 14/838,520, filed Aug. 28, 2015, now U.S. Pat. No. 10,098,160, which is a Continuation of U.S. application Ser. No. 13/941,700, filed Jul. 15, 2013 now U.S. Pat. No. 9,125,104, which is a Continuation of U.S. application Ser. No. 13/591,654, filed Aug. 22, 2012, now U.S. Pat. No. 8,488,550, which is a Continuation of U.S. application Ser. No. 13/251,772, filed Oct. 3, 2011, now U.S. Pat. No. 8,270,385, which is a Divisional of U.S. application Ser. No. 11/651,879, filed Jan. 10, 2007, now U.S. Pat. No. 8,031,661, which claims the benefit of Provisional Application U.S. Application 60/757,827, filed Jan. 10, 2006. U.S. application Ser. No. 11/651,879 is also a Continuation-In-Part of U.S. application Ser. No. 11/557,516, filed Nov. 8, 2006, now U.S. Pat. No. 8,374,123, which claims the benefit of Provisional Application U.S. Application 60/735,024, filed Nov. 8, 2005, and Provisional Application U.S. Application 60/758,595, filed Jan. 11, 2006, all of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
7054296 | Sorrells et al. | May 2006 | B1 |
7161951 | Sherman | Jan 2007 | B1 |
7164671 | Del Prado et al. | Jan 2007 | B2 |
7251232 | Meier | Jul 2007 | B1 |
7698550 | Abhishek et al. | Apr 2010 | B2 |
8374123 | Wentink | Feb 2013 | B2 |
9258842 | Wentink | Feb 2016 | B2 |
20020163933 | Benveniste | Nov 2002 | A1 |
20030112780 | Ouyang et al. | Jun 2003 | A1 |
20030123405 | del Prado | Jul 2003 | A1 |
20030161340 | Sherman | Aug 2003 | A1 |
20030174690 | Benveniste | Sep 2003 | A1 |
20040143681 | Benveniste | Jul 2004 | A1 |
20040181597 | Ekl et al. | Sep 2004 | A1 |
20040258039 | Stephens | Dec 2004 | A1 |
20050068900 | Stephens et al. | Mar 2005 | A1 |
20050068924 | Lindskog | Mar 2005 | A1 |
20050135295 | Walton et al. | Jun 2005 | A1 |
20050220145 | Nishibayashi et al. | Oct 2005 | A1 |
20050238016 | Nishibayashi et al. | Oct 2005 | A1 |
20050281225 | Mishra et al. | Dec 2005 | A1 |
20060034219 | Gu et al. | Feb 2006 | A1 |
20060045048 | Kwon | Mar 2006 | A1 |
20060092466 | Ikeda | May 2006 | A1 |
20060133401 | Ise et al. | Jun 2006 | A1 |
20060245369 | Schimmelpfeng et al. | Nov 2006 | A1 |
20070002782 | Kneckt | Jan 2007 | A1 |
20070002890 | Mangold et al. | Jan 2007 | A1 |
20070008922 | Abhishek et al. | Jan 2007 | A1 |
20070014237 | Nishibayashi et al. | Jan 2007 | A1 |
20070054632 | Lu et al. | Mar 2007 | A1 |
20070116035 | Shao et al. | May 2007 | A1 |
20070160021 | Xhafa et al. | Jul 2007 | A1 |
20070171858 | Grandhi | Jul 2007 | A1 |
20070217352 | Kwon | Sep 2007 | A1 |
20090147798 | del Prado Pavon | Jun 2009 | A1 |
20090310619 | Brommer | Dec 2009 | A1 |
20150071204 | Seok | Mar 2015 | A1 |
Number | Date | Country |
---|---|---|
1 351 414 | Oct 2003 | EP |
1 429 494 | Jun 2004 | EP |
2001-339391 | Dec 2001 | JP |
2003-008587 | Jan 2003 | JP |
2008-549533 | Jun 2009 | JP |
2009-522930 | Jun 2009 | JP |
WO-2005039105 | Apr 2005 | WO |
WO-2007056747 | May 2007 | WO |
WO-2007081683 | Jul 2007 | WO |
Entry |
---|
ANSI/IEEE Std 802.11, 1999 Edition (R2003), 528 pages. |
Fischer, Michael, “QoS Baseline Proposal,” IEEE 802.11 Standards Committee, Document IEEE 802.11-00/360R1, Nov. 7, 2000, 73 pages. |
International Preliminary Report on Patentability for PCT/US2006/060663, issued May 14, 2008. |
International Preliminary Examination Report for PCT/US06/60663, completed Jun. 18, 2009. |
International Search Report for PCT/US07/60320, dated Oct. 26, 2007. |
Number | Date | Country | |
---|---|---|---|
20200322996 A1 | Oct 2020 | US |
Number | Date | Country | |
---|---|---|---|
60758595 | Jan 2006 | US | |
60757827 | Jan 2006 | US | |
60735024 | Nov 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11651879 | Jan 2007 | US |
Child | 13251772 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16122828 | Sep 2018 | US |
Child | 16908044 | US | |
Parent | 14838520 | Aug 2015 | US |
Child | 16122828 | US | |
Parent | 13941700 | Jul 2013 | US |
Child | 14838520 | US | |
Parent | 13591654 | Aug 2012 | US |
Child | 13941700 | US | |
Parent | 13251772 | Oct 2011 | US |
Child | 13591654 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11557516 | Nov 2006 | US |
Child | 11651879 | US |