Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20020071448 A1
Publication typeApplication
Application numberUS 09/896,716
Publication dateJun 13, 2002
Filing dateJun 30, 2001
Priority dateJul 7, 2000
Also published asUS7054329, US20060029073
Publication number09896716, 896716, US 2002/0071448 A1, US 2002/071448 A1, US 20020071448 A1, US 20020071448A1, US 2002071448 A1, US 2002071448A1, US-A1-20020071448, US-A1-2002071448, US2002/0071448A1, US2002/071448A1, US20020071448 A1, US20020071448A1, US2002071448 A1, US2002071448A1
InventorsGerard Cervello, Sunghyun Choi
Original AssigneeGerard Cervello, Sunghyun Choi
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Collision avoidance in IEEE 802.11 contention free period (CFP) with overlapping basic service sets (BSSs)
US 20020071448 A1
Abstract
A medium access control (MAC) protocol is provided for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs). The MAC protocol includes hardware/software for utilizing ready-to-send(RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs and hardware/software for providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the RTS/CTS during CFPs.
Images(7)
Previous page
Next page
Claims(11)
What is claimed is:
1. A medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs), comprising:
means for utilizing ready-to-send-(RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs; and
means for providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the means for utilizing.
2. The MAC protocol defined by claim 1, further comprising means for updating the duration/ID of both the RTS and CTS frames during the CFP and maintaining that the overlapping STA(s) will not interfere with transmission between and STA and its corresponding AP following the RTS/CTS exchanges.
3. The MAC protocol defined by claim 2, wherein the means for updating the duration/ID of the RTS frame by adding the time length of the CTS to the (duration of the CF data minus the poll frame) and the duration of the CF-ACK, and for updating the duration/ID of the CTS frame by adding the duration/ID specified in the received RTS frame with the duration of the data and the time length if the CF-ACK and subtracting the duration time of the CTS from same.
4. The MAC protocol defined by claim 2, including means for determining if the RTS/CTS exchange is successful, and, if unsuccessful, deferring polling of the STA by its corresponding AP to a future time, where the AP then polls another STA.
5. The MAC protocol defined by claim 1, further comprising means for implementing ONAV rules.
6. The MAC protocol defined by claim 1, further comprising means for determining when to implement the RTS/CTS during CFP.
7. A method for implementing a medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs), the method comprising the steps:
utilizing ready-to-send-(RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs; and
providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the Step of utilizing.
8. A wireless local area network (WLAN) which implements the MAC protocol defined in claim 1.
9. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform method steps for which define a medium access control (MAC) protocol for implementing a medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs), the method comprising the steps:
utilizing ready-to-send-(RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs; and
providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the Step of utilizing.
10. A medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs), comprising:
means for utilizing ready-to-send-(RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs.
11. A medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs), comprising:
means for providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness said collision avoidance.
Description
    BACKGROUND OF THE INVENTION
  • [0001]
    1. Field of the Invention
  • [0002]
    The present invention relates to a wireless medium access control (MAC) protocol, and more particularly relates to a hybrid wireless MAC protocol which uses a Ready To Send(RTS)/Clear To Send(CTS) exchange during a contention free period (CFP) in order to avoid contention from Stations (STAs) in overlapping basic service sets (BSSs).
  • [0003]
    2. Description of Related Art
  • [0004]
    The wireless communication market has lately enjoyed tremendous growth and is now capable of reaching every place on earth. Hundreds of millions of people exchange information every day using pagers, cellular telephones and other wireless communication products. Wireless communication has broken the harnesses of wireline networks, allowing users to access and share information on a global scale nearly everywhere they venture.
  • [0005]
    Standard LAN protocols (wireline), such as ETHERNET™, operate on wireline networks using various MAC protocols, e.g., carrier sense multiple access with collision detection (CSMA/CD), at fairly high speeds with inexpensive connection hardware which provides an ability to bring digital networking to practically any computer. Until recently, however, LANs were limited to physical, hard-wired (wireline) infrastructure. Even with phone dial-ups, network nodes were limited to access through wireline connections. Wireline communications, however, have set the stage for wireless communications.
  • [0006]
    Since the recent development of wireless LANs, many network users, such as mobile users in business, the medical professions, industry, universities, etc., have benefited from the enhanced communication ability of wireless LANs, i.e., increased mobility. Uses for wireless network access are practically unlimited. In addition to increased mobility, wireless LANs offer increased flexibility. Compared to wireline counterparts, however, wireless networks are known to have much less bandwidth, and hence it is highly desirable to utilize the wireless link bandwidth efficiently.
  • [0007]
    To that end, commonly owned pending application Ser. No. 09/732,585, filed Dec. 8, 2000, and entitled: A Wireless MAC Protocol Based On A Hybrid Combination Of Slot Allocation, Token Passing and Polling For Isochronous Traffic, discloses a mechanism for increasing the efficiency of bandwidth use. The '585 application, incorporated herein by reference, utilizes a hybrid MAC protocol with a combination of bandwidth allocation, a variation on conventional token passing and polling to regulate isochronous traffic efficiently within a wireless network with “hidden” terminals.
  • [0008]
    The IEEE standard for wireless LAN protocol is identified as “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),” 1999, which will be referred to hereinafter as IEEE 802.11. IEEE 802.11 specifies parameters of both the physical (PHY) and medium access control (MAC) layers of the network. The PHY network may handle transmission of data between nodes by either direct sequence spread spectrum (DSSS)/complementary code keying (CCK) supporting 1-11 Mbps, frequency-hopping spread spectrum (FHSS) supporting 1 or 2 Mbps, infrared (IR) pulse position modulation supporting 1 or 2 Mbps, or orthogonal frequency division multiplexing (OFDM) modulation supporting 6-54 Mbps.
  • [0009]
    The MAC layer is a set of protocols which is responsible for maintaining order in the use of a shared medium. IEEE 802.11 specifies a carrier sense multiple access with collision avoidance (CSMA/CA) protocol for use as a random access protocol technique. A CSMA protocol operates as follows. A station (STA) senses the medium, which, if busy, defers transmission of its data packet to a later time. A problem will arise in the case where two (2) STAs sense the medium as being free, for example, contemporaneously, and each transmit a data packet at the same time resulting in a collision. Note that in wireless environment, transmitting and receiving at the same time is almost impossible even with a full duplex radio due to the high signal attenuation. That is, if one senses the medium while it transmits a packet, it will only sense its own packet even if the packet is colliding with another packet in the medium.
  • [0010]
    Moreover, in such a wireless LAN system, not all STAs can “hear” each other. The 802.11 standard includes collision avoidance (CA) mechanism in order to minimize collisions, which could arise from two STAs, transmitting at the same time.
  • [0011]
    The conventional mechanism attempts to overcome the problem by implementing the following rules. 1. If a station wishing to transmit a data packet senses that the medium is busy, it defers its transmission. If the station “listens” for a random length of time and finds the medium free, the STA will then transmit. As the reader can guess, this is certainly not a complete solution to the above-stated problem. 2. Alternatively, the receiving station implements a cycle redundancy check (CRC) of the received packet and sends an acknowledgment packet (ACK) to the transmitting station, indicating to the transmitting STA that no collision has occurred. If the transmitting station does not receive the ACK, it retransmits its data packet until it actually receives the ACK, or discards the data. As with rule 1., this is not a complete solution.
  • [0012]
    Moreover, radio transmissions based on IEEE 802.11 may also be ineffective because transmitting nodes within the wireless LAN cannot hear any other node in the system (network) which may be transmitting. That is, the transmitting node's own signal is presumably stronger than any other signal arriving at the node. The problem can be analogized to the problem of hearing impairment, that is, some nodes are hearing impaired for any of various reasons.
  • [0013]
    Hidden nodes or stations (STAs) prevent efficient use of bandwidth as a result of their hearing impairment to certain transmissions. For example, FIG. 1 shows a conventional wireless local area network (WLAN) composed of an access point (AP) and a number of stations (STAs). WLAN operation therein is based on the premise that the AP can communicate with all STAs directly over the wireless link while STAs can communicate each other depending on the relative locations due to their limited transmission ranges.
  • [0014]
    In order to reduce the probability of two STAs transmitting data which will collide because the STAs are not aware of the other's presence (can not “hear” each other) defines a virtual carrier sense (VCS) mechanism. The STA to transmit sends a short control packet referred to as a request to send(RTS) packet. The RTS includes identification of the STA source, its destination, and the duration of its data packet transmission time and time for receipt of the ACK packet. The destination STA responds with a clear to send(CTS) if the medium is free, also including time duration information. All STAs receiving either the RTS or CTS packets set their virtual carrier sense indicators, referred to as network allocation vectors (NAV), for the given time period, and utilize same with their physical carrier sensing mechanism when sensing the medium (see FIG. 2). This reduces the probability of collision.
  • [0015]
    In prior art FIG. 1, STA 1 is seen as clearly able to communicate by its access point AP1 with STA 2 by its access point AP2, either directly or in one hop, but not with STA 3 and its access point AP3. In FIG. 1, a circle around each STA (and access point A) represents the corresponding transmission range, where STAs 1 and 3 are called hidden terminals to each other since they cannot know even the existence of each other without the help of the access point A in between. Note that the communication between STAs 1 and 3 should be performed via the access point A.
  • [0016]
    The IEEE 802.11 MAC sub-layer defines two functions for accessing the wireless medium: distributed coordination function (DCF) and point coordination function (PCF), as seen in FIG. 2. The DCF is used to transmit asynchronous data based on Carrier Sense Medium Access with Collision Avoidance (CSMA/CA) mechanism, while the PCF uses a polling mechanism for a “nearly isochronous” service.
  • [0017]
    The PCF is implemented on top of the DCF, and controlled by a Point Coordinator (PC) which resides inside the access point (AP). An example of the PCF access is shown in FIG. 3 FIG. 3. The transmission time is divided into super-frames, where each super-frame is composed of a Contention Free Period (CFP) and a Contention Period (CP). During the CFP, the PCF is used for accessing the medium, while the DCF is used during the CP. The duration of a super-frame is referred to as Contention Free Period Repetition Interval (CFPRI). A CFP starts by a beacon frame sent by the AP or PC. A CFP starts with a beacon frame and finishes with a CF-End frame, both transmitted by the AP (See FIG. 3). The beacon includes the information about the real duration of the CFP to update the network allocation vector (NAV) of the STAs as well as the network synchronization information. A Target Beacon Transmission Time (TBTT) indicates the time when the AP attempts to transmit a beacon, so TBTTs repeat every beacon period. A CFPRI is composed of a number of beacon periods. In some situations, the transmission of the beacon frame can be delayed if a DCF frame from the previous repetition interval carries over into the current interval. This situation is known as stretching, and can be seen in FIG. 2 as ‘Delay (due to a busy medium)’. During the CFP, there is no competition for the medium. The AP polls each STA asking for pending frames to be transmitted. In case the STA has any, it will transmit a frame. If the AP receives no response from a polled STA after waiting for a point inter-frame space (PIFS) interval (FIG. 3), it will poll the next STA.
  • [0018]
    [0018]FIG. 4 highlights a situation of overlapping among two BSSs in order to use it for the presentation of our invention. For example, a circle around each STA (and AP) which represents the transmission range of the STA. STAx,1 belongs to the BSS of APx, which is called BSSx. The APs can always reach all the STAs belonging to its BSS, and therefore, all the STAs can always reach its own AP. Unless stated otherwise, the effects of the overlapping STAs will be considered with respect to STA1,1 belonging to BSS1. In the overlapping BSS situation of FIG. 4, API can hear STA1,1 and STA1,2 (BSS1); (2) STA1,1 can hear AP1, STA1,2, and STA2,1; and (3) STA2,1 can hear AP1, STA1,1, and STA2,1. Then, in BSS2, (1) AP2 can hear STA2,1; and (2) STA2,1 can hear AP2, STA1,1, and STA1,2. This can happen, for example, in a block of offices, where the BSSs located in two neighboring offices, apartments, etc., interfere to each other.
  • [0019]
    Here, the main concern is the performance of the CFP under PCF in BSS2 in the existence of the overlapping BSS2. For example, the transmission from STA1,1 to AP1 during a CFP can collide with the transmission from STA2,1 to AP2. This kind of collision during the CFP can result in severe degradation of the effectiveness of the PCF in terms of the throughput, and it makes really difficult to support QoS using this polling-based PCF.
  • OBJECTS AND SUMMARY OF THE INVENTION
  • [0020]
    It is therefore an object of the present invention to provide a wireless MAC protocol, and a wireless LAN system using the MAC protocol which overcomes the shortcomings of the prior art.
  • [0021]
    It is also an object of the invention to provide a hybrid wireless MAC protocol for isochronous traffic support which uses a novel Ready To Send(RTS)/Clear To Send(CTS) exchange during a contention free period (CFP) in order to avoid contention from Stations (STAs) in overlapping BSSs.
  • [0022]
    It is yet another object of the present invention to define a new counter called Overlapping Network Allocation Vector (ONAV) to render the RTS/CTS during CFP truly effective even in the existence of the STAs in CFP in the case of overlapping BSSs.
  • [0023]
    It is still yet another aspect of the invention to provide a hybrid wireless MAC protocol for isochronous traffic support which uses a novel Ready To Send(RTS)/Clear T o Send(CTS) exchange during a contention free period (CFP) in order to avoid contention from Stations (STAs) in overlapping BSSs, combined with a new counter called Overlapping Network Allocation Vector (ONAV) to render the RTS/CTS during CFP truly effective even in the existence of the STAs in CFP in the case of overlapping BSSs. To that end, the present invention sets forth a medium access control (MAC) protocol for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs). The MAC protocol includes hardware or software for utilizing request-to-send (RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs and hardware or software for providing overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the hardware or software for utilizing.
  • [0024]
    A second embodiment of the invention embodies a wireless local area network (WLAN) which utilizes the inventive MAC protocol described above.
  • [0025]
    A third embodiment of the present invention provides a method for avoiding collisions from stations (STAs) comprising two or more IEEE 802.11 basic service sets (BSSs) collocated and operating in the same channel during contention free periods (CFPs). The MAC protocol includes hardware or software for utilizing request-to-send (RTS)/clear-to-send(CTS) exchange during CFPs to avoid potential collision from STAs in overlapping BSSs. The method may further include steps for providing an overlapping network allocation vectors (ONAV) in addition to a network allocation vector (NAV), the ONAV included to facilitate the effectiveness of the collision avoidance.
  • [0026]
    A fourth embodiment of this invention includes a computer programmable device readable by machine, tangibly embodying a program of instructions executable by machine to perform the method steps of the invention set forth herein.
  • BRIEF DESCRIPTION OF THE DRAWING FIGURES
  • [0027]
    [0027]FIG. 1 is a schematic diagram depicting a conventional wireless network comprising stations which may be “hidden” from each other;
  • [0028]
    [0028]FIG. 2 is a schematic diagram depicting the coexistence of CFP and CP in a super-frame, and an example of stretching and foreshortened CFP;
  • [0029]
    [0029]FIG. 3 is a schematic diagram of the PCF working in the CFP in accordance with the present invention;
  • [0030]
    [0030]FIG. 4 is a schematic diagram depicting a situation of overlapping BSSs;
  • [0031]
    [0031]FIG. 5 is a timing diagram of a RTS/CTS exchange during CFP; and
  • [0032]
    [0032]FIG. 6 is a schematic flow diagram depicting an embodiment of a number of steps for implementing a DMR algorithm of this invention.
  • DETAILED DESCRIPTION OF THE INVENTION
  • [0033]
    As mentioned herein, one embodiment of the invention comprises means for utilizing an innovative Medium Access Control (MAC) protocol for isochronous traffic support which uses a novel Request To Send(RTS)/Clear To Send(CTS) exchange during a contention free period (CFP) in order to avoid contention from Stations (STAs) in overlapping BSSs, and method for implementing same.
  • [0034]
    Said first embodiment may further comprise a new counter called Overlapping Network Allocation Vector (ONAV) to render the RTS/CTS during CFP truly effective even in the existence of the STAs in CFP in the case of overlapping BSSs.
  • [0035]
    A third embodiment of the invention provides a hybrid wireless MAC protocol for isochronous traffic support which uses a novel Ready To Send(RTS)/Clear To Send(CTS) exchange during a contention free period (CFP) in order to avoid contention from Stations (STAs) in overlapping BSSs, combined with a new counter called Overlapping Network Allocation Vector (ONAV) to render the RTS/CTS during CFP truly effective even in the existence of the STAs in CFP in the case of overlapping BSSs.
  • [0036]
    More particularly, the inventions disclosed herein utilize a work frame which could included and used in a conventional WLAN such as that shown in FIG. 1. Within the invention, the network frame starts with a beacon transmission from the access point (AP) to all the stations (STA) in the receiving range of the AP (as shown in FIGS. 2 and 3). The beacon includes the information about the time slot allocation for each STA, synchronization information and information about the AP itself, which is necessary for new STAs to associate with the AP.
  • [0037]
    [0037]FIG. 5 shows the exchange of the RTS/CTS frames during a CFP. Those skilled in the art will realize that we have ignored the short inter-frame space (SIFS) time between two exchanging frames, e.g., between RTS and CTS, for the simplicity of the explanation. The frame formats of RTS/CTS frames transmitted during the CFP are the same as the original frame formats defined in IEEE 802.11 specification. The only difference is the way to specify/update the Duration/ID field (time) as is set forth in the frame header. For the RTS/CTS during the CFP, the Duration/ID fields are calculated as follows. First, the Duration/ID of the RTS is:
  • Duration/ID in RTS frame (i.e., Dur1 in FIG. 5)=[duration of CTS]+[duration of (Data+) CF-Poll frame]+[duration of CF-ACK]
  • [0038]
    The skilled artisan will understand that the AP1 cannot know how long STA1,1 will transmit per being polled, i.e., the duration of Data+CF-ACK frame, shown in FIG. 5 is not known to the AP in advance. Now, per receiving the RTS, the STA responds with CTS with the Duration/ID field calculated as follows:
  • Duration/ID in CTS frame (i.e., Dur2 in FIG. 5)=[Duration/ID specified in the received RTS frame]−[duration of CTS]+[duration of Data+CF-ACK]
  • [0039]
    Also shown in FIG. 5, STA2,1 sets up the NAV with the Duration/ID value in the received CTS frame, and will not interfere with the transmission between STA2,1 to AP1 following the RTS/CTS exchange.
  • [0040]
    If the RTS/CTS exchange is not successful, for example, assuming STA1,1 did not receive the RTS frame correctly, which could occur due to the bad channel condition or an erroneous transmission of STA2,1, then AP1 will defer the polling to STA1,1 to a future time, and will poll another STA, for example, STA1,2 in the situation under consideration. More particularly, if the underlying wireless channel involves bursty errors often, exchanging the RTS/CTS before the polling can minimize the potential failure of the actual data transmission, which can result in the severe throughput degradation. The present inventions address and correct for such situations as a by-product.
  • [0041]
    The skilled artisan will note that the proposed RTS/CTS may be quite effective when is STA2,1 in the CP under DCF. That is, by having a non-zero NAV due to the reception of the CTS from STA1,1, in the above example, STA2,1 will never initiate a frame transmission. However, if STA2,1 in the CFP under PCF, this RTS/CTS exchange will not be effective. This is a result of the fact that STA2,1 will set up its NAV at the beginning of the CFP of BSS2, and the reception of the CTS will not update the NAV at all. Moreover, according to the 802.11 PCF mechanism, STA2,1 will transmit a frame if it has any data for transmission upon being polled by AP2 irrespective of the value of its NAV. Such transmission by STA2,1 may result in a collision with another transmission during the CFP of STA2,1's neighboring BSS. In order to obviate this undesirable situation, the present inventions define and utilize a useful new counter called overlapping network allocation vector (ONAV). Termed differently, the present inventions will maintain ONAV as well as the original NAV for each STA in a system.
  • [0042]
    There are two rules regarding the ONAV which are implemented by any of the inventions set forth herein. The first ONAV rule requires that the ONAV is updated with the same rule of the original/existing conventional methods for updating a NAV as set forth in IEEE 802.11 MAC with one exception. The exception is that the ONAV is updated by the frames from neighboring BSSs only, not the frames from its own BSS. The second ONAV rule requires that if a STA has a non-zero ONAV, the STA will not respond to the CF-poll from its AP. Accordingly, if a STA being polled does not respond, the AP will assume that (1) the CF-poll was not received correctly, or (2) the STA has non-zero ONAV. The AP will then automatically defer the polling to the future.
  • [0043]
    The present inventions which include the ONAV as well as the NAV, and the means for implementing ONAV rules 1 and 2, is that the undesirable potential collision discussed above can be eliminated. Moreover, the RTS/CTS exchanges consume the precious wireless bandwidth redundantly if they are used where (1) there is no contention from overlapping BSSs, and (2) the bursty errors are very rare. On the other hand, if the RTS/CTS exchange is not used where it could be useful, the transmitted frames result in a waste of bandwidth due to the unsuccessful transmissions. Therefore, the present invention also defines several decision-making rules (DMR), as is the case with the RTS/CTS in the DCF. The DMR can be implemented by a system control software of the MAC implementation.
  • [0044]
    The first DMR rule regarding the decision on whether to use RTS/CTS during CFP before a particular (data+)CF-poll frame (that is, whether to use ONAV rules 1 and 2) requires that each STA report to its AP if there are STAs, which belong to other BSSs, within its coverage area. By receiving a frame with a BSSID different from its own, a STA can detect the existence of such STAs easily. For each data transmission to/from such a STA, the AP may initiate the RTS/CTS exchange during CFP.
  • [0045]
    The second DMR rule regarding the decision on whether to use RTS/CTS during CFP before a particular (data+)CF-poll frame requires that the transmission of the (data+)CF-poll frame which is larger than a predetermined threshold size results in the AP requesting the RTS/CTS exchange during CFP. The second DMR rule is applied to the RTS/CTS decision in the DCF via the parameter RtsThreshold.
  • [0046]
    The third DMR rule regarding the decision on whether to use RTS/CTS during CFP before a particular (data+)CF-poll frame is based on observing a number of transmission failures to/from a STA which is greater than a predetermined threshold value. In consequence, the present invention requires that the AP may request the RTS/CTS exchange during CFP for the data transmissions involving this STA, effective for time-varying channel with bursty errors.
  • [0047]
    [0047]FIG. 6 shows the diagram for the above-described DMR algorithm.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US5717688 *May 12, 1995Feb 10, 1998Netwave Technologies LimitedWireless local area network with roaming indicating multiple communication ranges
US5875186 *Jan 23, 1997Feb 23, 1999Netwave Technologies LimitedDynamic wireless local area network with interactive communications within the network
US6693888 *Jun 6, 2001Feb 17, 2004Networks Associates Technology, Inc.Method and apparatus for filtering that specifies the types of frames to be captured and to be displayed for an IEEE802.11 wireless LAN
US6724730 *Mar 4, 2003Apr 20, 2004Azimuth Networks, Inc.Test system for simulating a wireless environment and method of using same
US6747968 *Jan 14, 2000Jun 8, 2004Nokia Ip Inc.Methods and systems for weighted PCF polling lists for WLAN QoS support
US6791996 *Sep 20, 2000Sep 14, 2004Matsushita Electric Industrial Co., Ltd.Wireless network system and communication method employing both contention mode and contention-free mode
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7046651Jan 6, 2004May 16, 2006Nokia CorporationSystem topologies for optimum capacity transmission over wireless local area networks
US7136361 *Jun 28, 2002Nov 14, 2006At&T Corp.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US7251232 *Sep 12, 2001Jul 31, 2007Cisco Technology, Inc.Point-controlled contention arbitration in multiple access wireless LANs
US7283554 *Feb 12, 2002Oct 16, 2007Texas Instruments IncorporatedNetwork manager for a hybrid network environment
US7305004Jan 15, 2002Dec 4, 2007At&T Corp.Interference suppression methods for 802.11
US7321762Jan 27, 2004Jan 22, 2008Conexant Systems, Inc.Mechanism for reserving multiple channels of a single medium access control and physical layer
US7336642Aug 7, 2003Feb 26, 2008Skypilot Networks, Inc.Communication protocol for a wireless mesh architecture
US7356335 *Jun 15, 2004Apr 8, 2008Oki Electric Industry Co., Ltd.Wireless communication apparatus
US7376143 *Sep 30, 2003May 20, 2008Intel CorporationSystems and methods for contention control in wireless networks
US7382757 *Sep 23, 2003Jun 3, 2008Motorola, Inc.Method for supporting a plurality of subscribers operating on different frequency bands using a single access point
US7408909Apr 28, 2004Aug 5, 2008Intel CorporationMethod and apparatus to enable multiple receivers
US7505761 *Mar 13, 2006Mar 17, 2009Canon Kabushiki KaishaWireless terminal device, wireless communication method, and computer program
US7522576Nov 22, 2005Apr 21, 2009Ntt Docomo Inc.Distributed wireless access method based on network allocation vector table and apparatus of the same
US7523205 *Oct 28, 2006Apr 21, 2009At&T Corp - BrendzelInterference suppression methods for 802.11
US7644437May 12, 2006Jan 5, 2010Microsoft CorporationMethod and apparatus for local area networks
US7697476Jun 30, 2006Apr 13, 2010Lenovo Singapore Pte. LtdEffective management of overlapping wireless channels
US7703132Aug 20, 2007Apr 20, 2010Microsoft CorporationBridged cryptographic VLAN
US7715426 *Apr 29, 2008May 11, 2010Sony CorporationCommunication method and communication device as well as computer program
US7773625Feb 19, 2007Aug 10, 2010At&T Intellectual Property Ii, L.P.Access method for periodic contention-free sessions
US7787487May 19, 2008Aug 31, 2010Intel CorporationSystems and methods for contention control in wireless networks
US7817614Jan 26, 2005Oct 19, 2010Samsung Electronics Co., Ltd.Method and apparatus for setting, transmitting and receiving data for virtual carrier sensing in wireless network communication
US7818796Feb 10, 2006Oct 19, 2010Microsoft CorporationBridged cryptographic VLAN
US7852791Aug 30, 2007Dec 14, 2010Kabushiki Kaisha ToshibaWireless communication apparatus and method
US7869412 *May 16, 2007Jan 11, 2011Cisco Technology, Inc.Point-controlled contention arbitration
US7877080Aug 20, 2007Jan 25, 2011Microsoft CorporationPublic access point
US7886354Aug 20, 2007Feb 8, 2011Microsoft CorporationMethod and apparatus for local area networks
US7920536 *Oct 18, 2007Apr 5, 2011Marvell International Ltd.More robust data transfer through detection of hidden nodes
US7983231 *Sep 28, 2007Jul 19, 2011At&T Intellectual Property Ii, L.P.Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
US7983232Sep 28, 2007Jul 19, 2011At&T Intellectual Property Ii, L.P.Wireless LANs and neighborhood capture
US7986937 *Jan 9, 2004Jul 26, 2011Microsoft CorporationPublic access point
US7995544Sep 28, 2007Aug 9, 2011At&T Intellectual Property Ii, L.P.Wireless LANs and neighborhood capture
US8054798 *May 20, 2004Nov 8, 2011Ntt Docomo, Inc.Proxy active scan for wireless networks
US8054812Jan 3, 2007Nov 8, 2011Samsung Electronics Co., Ltd.Apparatus and method for transmitting data frame in WLAN terminal
US8064415Jul 13, 2007Nov 22, 2011At&T Intellectual Property Ii, L.P.Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US8068449 *Nov 29, 2011At&T Intellectual Property Ii, L.P.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8068470Nov 29, 2011At&T Intellectual Property Ii, L.P.Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US8111682Jul 23, 2007Feb 7, 2012At&T Intellectual Property Ii, L.P.“Shield”: protecting high priority channel access attempts in overlapped wireless cells
US8130770Oct 1, 2007Mar 6, 2012At&T Intellectual Property Ii, L.P.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8149737 *Aug 9, 2005Apr 3, 2012Motorola Solutions, Inc.Method and system for data transmission in a wireless network
US8170052Oct 25, 2005May 1, 2012Koninklijke Philips Electronics N.V.Method of operating a network node of a network, a network node, a network system, a computer-readable medium, and a program element
US8249093 *Mar 4, 2010Aug 21, 2012Sony CorporationCommunication method and communication device as well as computer program
US8254354Aug 4, 2008Aug 28, 2012Intel CorporationMethod and apparatus to enable multiple receivers
US8259655 *Nov 4, 2005Sep 4, 2012Samsung Electronics Co., Ltd.Medium access method for contention and non-contention
US8284739 *Feb 28, 2003Oct 9, 2012Vixs Systems, Inc.Method and apparatus for affiliating a wireless device with a wireless local area network
US8320345 *Feb 5, 2008Nov 27, 2012Panasonic CorporationRadio communication method and radio communication device
US8347377Jan 1, 2013Microsoft CorporationBridged cryptographic VLAN
US8457087Dec 15, 2009Jun 4, 2013Intel CorporationMethod and apparatus to enable multiple receivers
US8462686Jun 30, 2008Jun 11, 2013Thomson LicensingApparatus for collision mitigation of multicast transmissions in wireless networks
US8472365Jun 26, 2008Jun 25, 2013Thomson LicensingMethod and system for acknowledgement and retransmission of multicast data in wireless local area networks
US8503339Nov 19, 2010Aug 6, 2013Kabushiki Kaisha ToshibaWireless communication apparatus and method
US8514763Jun 26, 2008Aug 20, 2013Thomson LicensingApparatus for requesting acknowledgement and transmitting acknowledgement of multicast data in wireless local area networks
US8532079Nov 15, 2011Sep 10, 2013At&T Intellectual Property Ii, L.P.Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US8553548Jun 23, 2008Oct 8, 2013Thomson LicensingCollision mitigation for multicast transmission in wireless local area networks
US8559437 *May 12, 2010Oct 15, 2013Qualcomm IncorporatedPacket concatenation in wireless networks
US8619806May 18, 2012Dec 31, 2013Sony CorporationCommunication method and communication device as well as computer program
US8644271Feb 25, 2008Feb 4, 2014Trilliant Networks, Inc.Communication protocol for a wireless mesh architecture
US8649321Nov 15, 2011Feb 11, 2014At&T Intellectual Property Ii, L.P.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8687642Nov 21, 2011Apr 1, 2014At&T Intellectual Property Ii, L.P.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8699510Dec 6, 2011Apr 15, 2014At&T Intellectual Property Ii, L.P.‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US8705383Jun 18, 2008Apr 22, 2014Thomson LicensingContention based medium reservation for multicast transmission in wireless local area networks
US8737281Jun 27, 2008May 27, 2014Thomson LicensingApparatus for multicast transmissions in wireless local area networks
US8891642 *Aug 24, 2012Nov 18, 2014Broadcom CorporationMixed mode preamble for MIMO wireless communications
US8913597Nov 15, 2011Dec 16, 2014AT&T Intellectual Property II, L.P. via a transfer from AT&T Corp.Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US9166766Sep 22, 2014Oct 20, 2015At&T Intellectual Property I, L.P.System and method for full duplex cancellation
US9167601Aug 11, 2014Oct 20, 2015At&T Intellectual Property I, L.P.System and method for medium access control enabling both full-duplex and half-duplex communications
US9179477Feb 10, 2014Nov 3, 2015At&T Intellectual Property Ii, L.P.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US9191971Apr 14, 2014Nov 17, 2015At&T Intellectual Property Ii, L.P.‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US9215709 *Sep 30, 2013Dec 15, 2015Sony CorporationWireless communication system and wireless communication control method, wireless communication device and wireless communication method, and computer program
US9225773Apr 3, 2014Dec 29, 2015Chestnut Hill Sound, Inc.Entertainment system with sourceless selection of networked and non-networked media content
US20020181426 *Mar 4, 2002Dec 5, 2002Sherman Matthew J.Interference suppression methods for 802.11
US20030012167 *Jun 28, 2002Jan 16, 2003At&T Corp.Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US20040114928 *Apr 16, 2001Jun 17, 2004Adzhalov Vladimir IsfandeyarovichAccess method for data packet networks
US20040125777 *Feb 28, 2003Jul 1, 2004James DoyleMethod and apparatus for affiliating a wireless device with a wireless local area network
US20040141617 *Jan 9, 2004Jul 22, 2004Volpano Dennis MichaelPublic access point
US20040196871 *Jan 6, 2004Oct 7, 2004Nokia CorporationSystem topologies for optimum capacity transmission over wireless local area networks
US20040242252 *Jan 27, 2004Dec 2, 2004Maarten HoebenMechanism for reserving multiple channels of a single medium access control and physical layer
US20040257996 *May 5, 2004Dec 23, 2004Samsung Electronics Co., Ltd.Wireless network communication method using access point
US20050041616 *Aug 21, 2003Feb 24, 2005Boris GinzburgMethod and apparatus to adapt threshold of data frame protect mechanism
US20050063349 *Sep 23, 2003Mar 24, 2005Logalbo Robert D.Method for supporting a plurality of subscribers operating on different frequency bands using a single access point
US20050070270 *Jun 15, 2004Mar 31, 2005Oki Electric Industry Co., Ltd.Wireless communication apparatus
US20050070317 *Sep 30, 2003Mar 31, 2005Intel CorporationSystems and methods for contention control in wireless networks
US20050147075 *Mar 7, 2005Jul 7, 2005John TerrySystem topologies for optimum capacity transmission over wireless local area networks
US20050147115 *Dec 24, 2003Jul 7, 2005Qinghua LiSDMA training operations
US20050163150 *Jan 26, 2005Jul 28, 2005Samsung Electronics Co., Ltd.Method and apparaus for setting, transmitting and receiving data for virtual carrier sensing in wireless network communication
US20050169221 *Jun 24, 2004Aug 4, 2005Sharp Laboratories Of America, Inc.Decentralized bandwidth reservation mechanism for wireless networks
US20060045059 *Aug 26, 2005Mar 2, 2006Samsung Electronics Co., Ltd.Method for wireless transmission of data in infrastructure mode wireless network environment
US20060078001 *Sep 28, 2005Apr 13, 2006Interdigital Technology CorporationWireless local area network medium access control extensions for station power efficiency and resource management
US20060092888 *May 20, 2004May 4, 2006Moo Ryong JeongProxy active scan for wireless networks
US20060114878 *Nov 4, 2005Jun 1, 2006Mi-Ra ChoeMedium access method for contention and non-contention
US20060126497 *Nov 4, 2005Jun 15, 2006Sung-Guk NaRe-transmitting packet of polling-based wireless local area network (WLAN)
US20060153117 *Jan 9, 2004Jul 13, 2006Guillaume BichotMethod and apparatus for bandwidth provisioning in a wlan
US20060206944 *May 12, 2006Sep 14, 2006Cranite Systems, Inc.Method and apparatus for local area networks
US20060225089 *Mar 13, 2006Oct 5, 2006Canon Kabushiki KaishaWireless terminal device, wireless communication method, and computer program
US20070036089 *Aug 9, 2005Feb 15, 2007Metke Anthony RMethod and system for data transmission in a wireless network
US20070183443 *Jan 3, 2007Aug 9, 2007Sang-Yeon WonApparatus and method for transmitting data frame in WLAN terminal
US20070211749 *Feb 19, 2007Sep 13, 2007Mathilde BenvenisteAccess method for periodic contention-free sessions
US20070217385 *May 16, 2007Sep 20, 2007Meier Robert CPoint-controlled contention arbitration
US20070263581 *Jul 23, 2007Nov 15, 2007Mathilde Benveniste"shield": protecting high priority channel access attempts in overlapped wireless cells
US20080002615 *Aug 30, 2007Jan 3, 2008Tetsu NakajimaWireless communication apparatus and method
US20080002643 *Jun 30, 2006Jan 3, 2008Lenovo (Singapore) Pte. Ltd.Effective management of overlapping wireless channels
US20080013508 *Jul 13, 2007Jan 17, 2008Mathilde BenvenisteFixed deterministic post-backoff for cyclic prioritized multiple access (cpma) contention-free sessions
US20080013509 *Jul 13, 2007Jan 17, 2008Mathilde BenvenistePreemptive packet for maintaining contiguity in cyclic prioritized multiple access (cpma) contention-free sessions
US20080013515 *Sep 28, 2007Jan 17, 2008Mathilde BenvenisteStaggered startup for cyclic prioritized multiple access (cpma) contention-free sessions
US20080013522 *Sep 28, 2007Jan 17, 2008Mathilde BenvenisteWireless lans and neighborhood capture
US20080019329 *Oct 1, 2007Jan 24, 2008Mathilde BenvenisteHybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US20080022390 *Feb 10, 2006Jan 24, 2008Cranite Systems, Inc.Bridged cryptographic VLAN
US20080198821 *Aug 20, 2007Aug 21, 2008Cranite Systems, Inc.Public Access Point
US20080198863 *Aug 20, 2007Aug 21, 2008Cranite Systems, Inc.Bridged Cryptographic VLAN
US20080212604 *May 19, 2008Sep 4, 2008Intel CorporationSystems and methods for contention control in wireless networks
US20080273525 *Apr 29, 2008Nov 6, 2008Sony CorporationCommunication method and communication device as well as computer program
US20080273549 *Oct 25, 2005Nov 6, 2008Koninklijke Philips Electronics, N.V.Method of Operating a Network Node of a Network, a Network Node, a Network System, a Computer-Readable Medium, and a Program Element
US20080273698 *Apr 25, 2006Nov 6, 2008Koninklijke Philips Electronics, N.V.Device for and a Method of Processing a Data Stream Having a Sequence of Packets and Timing Information Related to the Packets
US20080291873 *May 20, 2008Nov 27, 2008Mathilde BenvenisteHybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US20080310346 *Feb 25, 2008Dec 18, 2008Skypilot Networks, Inc.Communication protocol for a wireless mesh architecture
US20080316987 *Aug 4, 2008Dec 25, 2008Trainin Solomon BMethod and apparatus to enable multiple receivers
US20100097999 *Dec 15, 2009Apr 22, 2010Trainin Solomon BMethod and apparatus to enable multiple receivers
US20100157967 *Mar 4, 2010Jun 24, 2010Sony CorporationCommunication method and communication device as well as computer program
US20100220661 *May 12, 2010Sep 2, 2010Qualcomm IncorporatedPacket concatenation in wireless networks
US20100298573 *Jan 19, 2009Nov 25, 2010Kazuhiko MizunoFluorescent agent having ethynyl group
US20100316043 *Feb 5, 2008Dec 16, 2010Panasonic CorporationRadio communication method and radio communication device
US20110033047 *Feb 10, 2011Microsoft CorporationBridged cryptographic vlan
US20110064013 *Jun 23, 2008Mar 17, 2011Hang LiuCollision mitigation for multicast transmission in wireless local area networks
US20110064065 *Mar 17, 2011Tetsu NakajimaWireless communication apparatus and method
US20110069628 *Jun 18, 2008Mar 24, 2011Thomson LicensingContention based medium reservation for multicast transmission in wireless local area networks
US20110080977 *Jun 27, 2008Apr 7, 2011Thomson LicensingApparatus for multicast transmissions in wireless local area networks
US20110096710 *Jun 26, 2008Apr 28, 2011Hang LiuApparatus for requesting acknowledgement and transmitting acknowledgement of multicast data in wireless local area networks
US20110096711 *Jun 30, 2008Apr 28, 2011Thomson LicensingApparatus for collision mitigation of multicast transmissions in wireless networks
US20110116435 *Jun 26, 2008May 19, 2011Hang LiuMethod and System for acknowledgement and retransmission of multicast data in wireless local area networks
US20120320885 *Aug 24, 2012Dec 20, 2012Broadcom CorporationMixed mode preamble for mimo wireless communications
US20140016528 *Sep 30, 2013Jan 16, 2014Sony CorporationWireless communication system and wireless communication control method, wireless communication device and wireless communication method, and computer program
US20140078940 *Sep 14, 2012Mar 20, 2014At&T Intellectual Property I, L.P.System and method for full-duplex media access control using request-to-send signaling
DE10350905A1 *Oct 31, 2003Jun 16, 2005Siemens AgRF communication system communication method, requires reserved signaling information for RF sources to be sent via direct signaling information exchange between user-side RF stations
DE10350905B4 *Oct 31, 2003Dec 1, 2005Siemens AgVerfahren zum Zugriff auf Funkressourcen und anschließende Datenübertragung
EP1509006A1 *Aug 20, 2004Feb 23, 2005Intel CorporationMethod and apparatus to adapt a threshold for activating a data frame protection mechanism
EP1526685A1 *Oct 24, 2003Apr 27, 2005International University Bremen GmbhInter-Cell Interference mitigation technique using reservation indicators
EP1646184A1 *Jul 14, 2004Apr 12, 2006Nippon Telegraph and Telephone CorporationRadio packet communication method and radio packet communication device
EP2584738A1 *Jul 14, 2004Apr 24, 2013Nippon Telegraph And Telephone CorporationWireless packet communication method and wireless packet communication apparatus
EP2584739A1 *Jul 14, 2004Apr 24, 2013Nippon Telegraph And Telephone CorporationWireless packet communication method and wireless packet communication apparatus
WO2004064330A1 *Jan 9, 2004Jul 29, 2004Guillaume BichotMethod and apparatus for bandwidth provisioning in a wlan
WO2004088886A2 *Mar 23, 2004Oct 14, 2004Conexant Systems IncMechanism for reserving multiple channels in a wireless lan
WO2005006660A1Jul 14, 2004Jan 20, 2005Nippon Telegraph & TelephoneRadio packet communication method and radio packet communication device
WO2005025140A1 *Aug 4, 2004Mar 17, 2005Intel CorpMethod and apparatus to adapt threshold for activating a data frame protection mechanism
WO2006041673A2 *Sep 27, 2005Apr 20, 2006Interdigital Tech CorpWireless local area network medium access control extensions for station power efficiency and resource management
WO2006121432A1May 9, 2005Nov 16, 2006Intel CorpMethod and apparatus to enable multiple receivers
WO2006134704A1 *Mar 27, 2006Dec 21, 2006Toshiba KkResponder (e.g. 802.11n) transmitting acknowledgements in an extra physical frame at a first transmission rate
WO2012005697A1 *Jul 8, 2011Jan 12, 2012Agency For Science, Technology And ResearchCommunication devices and methods for sending a message
WO2014017735A1 *May 13, 2013Jan 30, 2014Postech Academy-Industry FoundationMethod for transmitting data by using reverse order implied information obtained by competition by means of distributed coordination function in wireless lan, and wireless communication device for transmitting data by using same
WO2014017745A1 *Jun 26, 2013Jan 30, 2014Postech Academy-Industry FoundationMethod for transmitting data by using reverse order implied information obtained by competition by means of distributed coordination function in wireless lan, and wireless communication device for transmitting data by using same
Classifications
U.S. Classification370/445, 370/449
International ClassificationH04L12/28, H04L12/56
Cooperative ClassificationH04W80/02, H04W74/0816, H04W88/10, H04W84/12
European ClassificationH04W74/08B2
Legal Events
DateCodeEventDescription
Dec 27, 2001ASAssignment
Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NETHERLANDS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CERVELLO, GERARD;CHOI, SUNGHYUN;REEL/FRAME:012388/0541;SIGNING DATES FROM 20011024 TO 20011110
Jan 4, 2010REMIMaintenance fee reminder mailed
May 30, 2010LAPSLapse for failure to pay maintenance fees
Jul 20, 2010FPExpired due to failure to pay maintenance fee
Effective date: 20100530