US20030123405A1 - Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF - Google Patents

Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF Download PDF

Info

Publication number
US20030123405A1
US20030123405A1 US10/029,825 US2982501A US2003123405A1 US 20030123405 A1 US20030123405 A1 US 20030123405A1 US 2982501 A US2982501 A US 2982501A US 2003123405 A1 US2003123405 A1 US 2003123405A1
Authority
US
United States
Prior art keywords
counter
frame
mobile station
bss
received frame
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US10/029,825
Other versions
US7164671B2 (en
Inventor
Javier del Prado
Sunghyun Choi
Amjad Soomro
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Uniloc 2017 LLC
Original Assignee
Koninklijke Philips NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Assigned to KONINKLIJKE PHILIPS ELECTRONICS N.V. reassignment KONINKLIJKE PHILIPS ELECTRONICS N.V. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: SOOMRO, AMJAD, CHOI, SUNGHYUN, PRADO, JAVIER DEL
Priority to US10/029,825 priority Critical patent/US7164671B2/en
Application filed by Koninklijke Philips NV filed Critical Koninklijke Philips NV
Priority claimed from EP02727905A external-priority patent/EP1396111B1/en
Publication of US20030123405A1 publication Critical patent/US20030123405A1/en
Application granted granted Critical
Publication of US7164671B2 publication Critical patent/US7164671B2/en
Assigned to IPG ELECTRONICS 503 LIMITED reassignment IPG ELECTRONICS 503 LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KONINKLIJKE PHILIPS ELECTRONICS N.V.
Assigned to PENDRAGON WIRELESS LLC reassignment PENDRAGON WIRELESS LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: IPG ELECTRONICS 503 LIMITED
Assigned to UNILOC LUXEMBOURG S.A. reassignment UNILOC LUXEMBOURG S.A. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PENDRAGON WIRELESS LLC
Assigned to UNILOC 2017 LLC reassignment UNILOC 2017 LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: UNILOC LUXEMBOURG S.A.
Application status is Active legal-status Critical
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access, e.g. scheduled or random access
    • H04W74/08Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0808Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA
    • H04W74/0816Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using carrier sensing, e.g. as in CSMA carrier sensing with collision avoidance

Abstract

The present invention is related to a medium access control (MAC) protocol for avoiding collisions among ESTAs when two or more overlapping basic service sets (OBSSs) co-exist and operate in the same channel. To achieve this, each mobile station operating under HCF maintains a first counter known as Network Allocation Vector (NAV) and a second counter known as Overlapping Network Allocation Vector (ONAV), which is updated within a mobile station by frames coming from OBSSs, during the Contention Free Period (CFP) or during a Contention Free Burst (CFB) granted by a polling frame. The mobile station uses the NAV to update only to the medium occupancy in its own BSS to ensure that the mobile station will not interfere with the transmissions in its own QBSS, while the ONAV is used to avoid collisions with the mobile stations from the OBSS.

Description

    BACKGROUND OF THE INVENTION
  • 1. Field of the Invention [0001]
  • The present invention relates to a wireless medium access control (MAC) protocol, and more particularly to a novel MAC protocol that may be used to avoid collisions among stations (STAs) from different overlapping basic service sets (OBSSs). [0002]
  • 2. Description of Related Art [0003]
  • Basically, there are two variants of wireless local area networks (WLAN): infrastructure-based and ad hoc-type. In the former network, communication typically takes place only between wireless nodes, called stations (STA[0004] i), and the access point (AP), not directly between the wireless nodes as in the latter network. Thus, the wireless nodes can exchange data via the AP. The stations and the AP, which are within the same radio coverage, are known as a basic service set (BSS). When two adjacent basic service sets (BSSs) are located close to each other and operate at the same channel, which are referred to as overlapping BSSs, it is difficult to support the required quality-of-service (QoS) due to the possible collisions among stations from different overlapping BSSs.
  • The IEEE 802.11 standard specifies the medium access control (MAC) and the physical (PHY) characteristics for wireless local area networks. The MAC layer is a set of protocols which is responsible for maintaining order in the use of a shared medium. The IEEE 802.11 standard is defined in International Standard ISO/IEC 8802-111, “Information Technology—Telecommunications and information exchange area networks,” 1999 Edition, which is hereby incorporated by reference in its entirety. [0005]
  • The IEEE 802.11 provides a carrier sense multiple access with collision avoidance (CSMA/CA) protocol as well as polling mechanism for use as a random access protocol technique. Within such a network, if a transmitting unit wishes to transmit a packet, it may transmit a short request-to-send (RTS) packet containing information on the duration of the following packet. If the receiving unit receives the RTS, it responds with a short clear-to-send (CTS) packet. Then, the transmitting node sends its packet, and, when received successfully by the receiving node, the receiving node sends an acknowledgment (ACK) packet. However, a problem arises when there is a hidden transmitting station from the overlapping BSSs. [0006]
  • Currently, to address the above problem, the IEEE 802.11 specifies a Network Allocation Vector (NAV) as part of the virtual carrier sensing mechanism so that an STA, which is hidden from the transmitter of a frame, would not contend for the channel while the transmitter unit is occupying the channel. All STAs receiving a frame set their NAV for a given time period, using the duration/ID value contained in the frame, and utilize it jointly with their physical carrier sensing mechanism to determine if the medium is idle and, thus reducing the probability of collision. [0007]
  • Although the NAV seems to be a plausible solution, it has some drawbacks in that if two ore more overlapping BSSs are collocated and operated in the same channel, some collisions may occur. For example, FIG. 1 shows an example of WLAN composed of an access point (AP) and a number of stations (STAs) where the problem of collisions may occur among STAs from different BSSs. As shown in FIG. 1, two OBSSs are represented by the coverage area of the corresponding AP (AP[0008] 1 and AP2). STA1,1 and STA1,2 belong to the BSS of AP1. If AP1 sends a beacon indicating the beginning of the Contention Free Period (CFP), STA1,1 and STA1,2 will set the NAV to the duration of the CFP. But STA2,1, which is out of the range of AP1, will not. That means that eventually STA2,1, which belongs to BSS2, can transmit frames, e.g., RTS/CTS, that can cause a collision with frames sent or received by stations, i.e., STA1,1 and STA1,2, belonging to BSS1 within its coverage area. In addition, a problem arises when STA1,1 or STA1,2, receives an RTS or a CF-END (+ACK) frame from an Overlapping BSS (from AP2). In that case, according to the current standard rules, STA1,1 and STA1,2 may incorrectly reset the NAV if no frame is received after the RTS, and will incorrectly reset the NAV upon reception of the CF-END (+ACK) frame although the frame was not transmitted from its AP.
  • Accordingly, there exits a need to provide an improved mechanism to avoid potential collisions from the stations in the overlapping BSS. [0009]
  • SUMMARY OF THE INVENTION
  • The present invention provides a wireless MAC protocol to efficiently utilize bandwidth in a wireless LAN by avoiding collisions with stations (STAs) from different overlapping BSSs. [0010]
  • According to one aspect of the invention, a method of avoiding collisions between a plurality of stations located in two or more basic service sets (BSSs) and operating in the same channel is provided. The method includes the steps of: the mobile station receiving a frame, the frame including information indicative of which of basic service units (BSSs) are transmitting the frame to the mobile station; the mobile station updating a first counter when the received frame is determined to be from the same BSS; the mobile station updating a second counter when the received frame is determined to be from an overlapping BSS; and, the mobile station contending for the medium when the first counter and the second counter are idle, wherein the first counter is updated according to a duration specified in the received frame to ensure that the mobile station from its corresponding BSS will not interfere with the transmissions of other mobile stations within its BSS.Meanwhile, the second counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmissions in the overlapping BSS. If the received frame is a request-to-send (RTS) frame, a clear-to-send (CTS) frame is transmitted by the mobile station within its corresponding BSS when the second counter is idle. If the received frame is a CF poll frame from the AP, a data frame by the mobile station is transmitted within its corresponding BSS when the second counter is idle. If the received frame is a frame of any type that requires acknowledgement, an ACK frame is always transmitted by the mobile station, regardless of the value of the counters. [0011]
  • According to another aspect of the invention, a method of operating a wireless local area network (WLAN) of the type having at least one basic service set (BSS) comprised of one access point (AP) and a plurality of mobile stations (STAs) is provided. The method includes the steps of: transmitting a polling frame by the access points to the mobile station, the polling frame including information indicative of the destination address of the frame and which of basic service units are transmitting the polling frame to the mobile station; storing the information indicative of which basic service sets are transmitting the frame to the mobile station and storing the destination address of the polling frame as a transmitting source; updating a first counter of the mobile station according to the duration field specified in the polled frame; receiving a frame by the mobile station, the frame including information indicative of the duration of the next transmission; if the duration of the received frame is longer than the duration of the updated first counter, updating a second counter of the mobile station according to the duration indicated in the received frame; and, the mobile station contending for the medium if the first counter and the second counter indicate an idle state. The mobile station is allowed to contend for the medium if the first counter and the second counter indicate an idle state. The first counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with rest of transmissions in its own BSS. The second counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmission between the stations in the overlapping BSS. [0012]
  • According to another aspect of the invention, a local area network is provided and includes: a plurality of mobile stations, each mobile station having a first counter and a second counter; one access point in communication with the plurality of mobile stations; and, means for updating the first counter and the second counter when any mobile station units receive a frame to ensure that the mobile station will not interfere with the overlapping basic service set (OBSS), wherein the mobile station is allowed to contend for the medium if the first counter and the second counter indicate an idle state. The mobile stations further includes means for utilizing request-to-send-(RTS)/clear-to-send(CTS) exchange to avoid potential interference with the transmission between the mobile station and its corresponding AP following the RTS/CTS exchange. [0013]
  • A further aspect of the invention provides a machine-readable medium having stored thereon data representing sequences of instructions for avoiding collisions from stations (STAs) comprising two or more basic service sets (BSSs) collocated and operating in the same channel, and the sequences of instructions which, when executed by a processor, cause the processor to: receive a frame, the frame including information indicative of which of basic service units are transmitting the frame to the mobile station; update a first counter when the received frame is determined to be from the same BSS; update a second counter when the received frame is determined to be from an overlapping BSS; and, the mobile station contending for the medium when the first counter and the second counter are idle. The first counter is updated according to a duration specified in the received frame to ensure that the mobile station will not interfere with the rest of transmissions in its own BSS. The second counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmissions in overlapping BSS. [0014]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • A more complete understanding of the method and apparatus of the present invention is available by reference to the following detailed description when taken in conjunction with the accompanying drawings wherein: [0015]
  • FIG. 1 is a schematic diagram depicting a wireless network whereto the embodiment of the present invention may be applied; [0016]
  • FIG. 2 shows the structure of a superframe depicting the coexistence of CFP and CP; [0017]
  • FIG. 3 is a timing diagram of a RTS/CTS exchange during CFP. [0018]
  • FIG. 4 is a flow chart illustrating the operation steps of determining whether a received frame is from the overlapping BSS according to an embodiment of the present invention; [0019]
  • FIG. 5 is a flow chart illustrating the operation steps of determining whether a received frame is from the overlapping BSS according to an embodiment of the present invention; and, [0020]
  • FIG. 6 is a schematic diagram depicting different instances where a station is allowed to transmit according to an embodiment of the present invention. [0021]
  • DETAILED DESCRIPTION OF THE INVENTION
  • In the following description, for purposes of explanation rather than limitation, specific details are set forth such as the particular architecture, interfaces, techniques, etc., in order to provide a thorough understanding of the present invention. For purposes of simplicity and clarity, detailed descriptions of well-known devices, circuits, and methods are omitted so as not to obscure the description of the present invention with unnecessary detail. [0022]
  • To help understand the invention, the following definitions are used: [0023]
  • A “Distributed Coordination function (DCF)” is a class of coordination functions where the same coordination function logic is active in every station in the BSS whenever the network is in operation. [0024]
  • A “Point coordination function (PCF)” is a class of possible coordination functions where the coordination function logic is active in only one station in a BSS at any given time that the network is in operation. [0025]
  • A “Contention Free Period (CFP)” is a time period during which frame exchanges occur without intra-BSS contention. [0026]
  • A “Contention Period (CP)” is a time period during the operation of a BSS when a DCF, and the right to transmit is determined locally using a carrier sense multiple access algorithm with collision avoidance (CSMA/CA). [0027]
  • A Contention Free Period Repetition Interval (CFPRI) is the duration of a super-frame comprised of the CFP and the CP. [0028]
  • A “Hybrid Coordination Function (HCF)” is a coordination function that combines aspects of the DCF and the PCF to provide the selective handling of the medium access control (MAC) service data units (MSDUs) required for the QoS facility, and allows stations to use a uniform set of frame exchange sequences during both the CFP and the CP. [0029]
  • A “Transmission Opportunity (TXOP)” is an interval of time when a particular station has the right to initiate transmissions onto the wireless medium. A TXOP is defined by a starting time and a maximum duration. [0030]
  • A “Point Coordination Function (PCF) Interframe Space (PIFS)” is a priority level for accessing the wireless medium or a waiting time prior to any frame transmission. [0031]
  • In order to facilitate an understanding of this invention, a conventional method of the IEEE 802.11 MAC protocol will be described herein. [0032]
  • Referring to FIG. 2, the IEEE 802.11 MAC sub-layer defines two functions for accessing the wireless medium: distributed coordination function (DCF) and point coordination function (PCF). The DCF is used to transmit asynchronous data based on Carrier Sense Medium Access with a Collision Avoidance (CSMA/CA) mechanism as described earlier, while the PCF uses a polling mechanism for an isochronous service. Under the PCF access scheme, 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. A CFP starts with a beacon frame and finishes with a CF-End frame both sent by the AP. The beacon frame includes the information about the duration of the CFP that is used 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. As such, the CFPRI is composed of a number of beacon periods. [0033]
  • As described earlier, the Network Allocation Vector (NAV) is defined in IEEE 802.11 as part of the virtual carrier sensing mechanism so that an STA, which is hidden from the transmitter of a frame, would not contend for the channel while the transmitter is occupying the channel. During the CFP, there is no competition for the medium as the NAV of each station sets to non-zero (non-idle). During this time, the station that is polled by the AP can only transmit by overriding the NAV. If the polled STA has any, it will transmit a frame. If the AP receives no response from the polled STA after waiting for a point inter-frame space (PIFS) interval, the AP may poll the next STA. The HCF of the proposed IEEE 802.11e QoS standard and the PCF in IEEE 802.11-1999 standard relies on the NAV for the operation of the CFP and CP, such that all the STAs other than the one polled by the HCF/HC implemented in the AP are kept silent even though they may not be able to hear from the polled STA. [0034]
  • FIG. 3 shows the exchange of the RTS/CTS frames during a CFP as described in the preceding paragraph. As shown in FIG. 3, AP[0035] 1 transmits an RTS to the STA1,1 to which the STA1,1 responses with a CTS. Thereafter, all the STAs, except the intended STA1,1 which received the RTS set their NAV to a busy state for the duration as specified in the received RTS. That is, the STA1,2 will set up the NAV with the Duration/ID value in the received RTS frame, and will not interfere with the transmission between STA1,1 and AP1 following the RTS/CTS exchange. At this time, if the STA1,2 does not receive any CTS or data frame after receiving the RTS signal for a predetermined time period, the STA1,2 will reset its NAV to zero (idle). However, a problem arises at this time if the STA1,2 receives an RTS with no subsequent CTS or Data from the STA2,1 that is located in the neighboring or overlapping BSS or if the STA1,2 receives CF-end poll from AP2, the STA1,2 will reset its NAV to zero (idle). As the STA1,2 will react to the frames arrived from an overlapping BSS by resetting its NAV incorrectly, it will cause an interference with the signal exchanges surrounding the AP1. 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 overcome the prior art problem described above, the present invention employs the NAV in conjunction with the inventive new counter, the Overlapping Network Allocation Vector (ONAV), in order to avoid collisions with stations (STAs) from the overlapping basic service sets (BSSs), which is updated within an STA by frames coming from OBSSs, during the Contention Free Period (CFP) or during a Contention Free Burst (CFB) granted by a QoS (+)CF-Poll. That is, each station maintains and updates two sets of counters, the NAV and the ONAV, to make a decision to transmit a frame within its own BSS accordingly. The STAs will be able to update their NAV only according to the medium occupancy in their own BSS, while using the value of the ONAV to avoid collisions with the OBSS and protecting their BSS by sharing the medium with overlapping STAs. [0036]
  • In the embodiment, the ONAV is updated with the same rule of the original/existing conventional methods for updating an NAV as set forth in IEEE 802.11 MAC with one exception. The exception is that the ONAV is updated with the values of the Duration ID/field carried by frames coming from OBSSs only, not the frames from their own BSS. Note that the ONAV is updated only during the CFP and CFB under the HCF operation. In addition, the ONAV requires that if an STA has a non-zero ONAV, the STA will not respond to the QoS (+)CF-poll from its AP. [0037]
  • Now, the provision of avoiding collisions with the OBSS using the ONAV and updating the NAV by the stations according to the medium occupancy in their own BSS is described in detail. [0038]
  • First, the provisions of determining whether the frames are from a neighboring BSS is necessary when maintaining and updating the NAV and the ONAV. As the frames, including the RTS/CTS/ACK, received by a particular station do not contain the BSS ID information, the process of determining such information in accordance with the present invention is explained in reference to FIGS. 4 and 5. [0039]
  • Referring to FIG. 4, the updating process initiated when the HC QoS (+)CF-polls every station in step [0040] 100. After receiving the QoS (+)CF-Poll in the CP, every STA updates its NAV with the duration of the TXOP granted by the QoS (+)CF-Poll plus DIFS, and saves the value of the Destination Address (DA) and the BSSID carried in the QoS (+)CF-Poll in step 102. The value of DA is saved as a transmission source (TXsrc). In the CFP, the STAs may not update their NAV, but will save the value of the DA (as TXsrc) and the BSSID carried in the QoS (+)CF-Poll.
  • After receiving the QoS (+)CF-Poll, the STAs are able to differentiate if any frame is coming from their own BSS or not based on the TXsrc information. If an STA receives a frame with a Duration/ID field in step [0041] 104, which will increase the NAV value, it is determined that this frame is coming from an OBSS in step 106. As a result, the ONAV is updated in step 108, not the NAV, with the Duration/ID field from the received frame. At the same time, the overlapping BSSID, if available, is saved.
  • If an STA receives a frame with a Duration/ID field in step [0042] 104, which will not increase the NAV value, it is possible that the frame arrived from the same BSS. To determine if the frame was coming from the same BSS, the operation steps described in FIG. 5 are performed, as described below.
  • In step [0043] 110, an STA classifies the reception of a frame into two: an RTS frame and CTS/ACK. The skilled artisan will note that the RTS and CTS/ACK frames do not contain the BSSID field. In step 108, if the received frame is the RTS, the STA can determine that the frame is coming from the same BSS when the source address (SA) of the RTS frame is the same as the TXsrc that was saved recently in step 102. That is, if the SA address of the RTS frame is equal to TXsrc, the frame is considered coming from the same BSS in step 110. Otherwise, it was coming from the OBSS and the STA will update the ONAV with the Duration/ID field from the received frame in step 116.
  • Meanwhile, if the CTS/ACK frame is received by the station in step [0044] 110, the STA can determine that the frame is coming from the same BSS when the Destination address (DA) of the CTS/ACK frame is the same as the TXsrc that was saved recently in step 102. That is, if the DA of the RTS frame is equal to TXsrc, the frame is considered coming from the same BSS in step 120. Otherwise, it was coming from the OBSS and the STA shall update the ONAV in step 116. Here, the DA is used instead of the SA as the CTS/ACK does not contain the SA information.
  • Finally, once determined that the frame is coming from the OBSS, the ONAV is updated in step [0045] 118, not the NAV, with the Duration/ID field from the received frame, but only when the new ONAV value is greater than the current ONAV.
  • After determining whether frames received by the STA are from the OBSS and updating the ONAV thereafter, each STA is allowed to transmit within its own BSS when both the NAV and the ONAV indicate that the medium is zero or idle (i.e., NAV=ONAV=0) to avoid collisions due to OBSS. However, there are special instances that an STA may or may not transmit upon reception of QoS (+)CF-Poll, RTS frames and/or frames of a type that requires acknowledgement. FIG. 6 shows three such cases in which an STA is allowed to transmit, in response to a control signal, only upon satisfying certain conditions as set below. [0046]
  • For the non-CFB Contention Period (CP: regions indicated by number [0047] 1), a QSTA can response to the RTS with CTS only when the NAV and ONAV of the STA are set equal to zero. If an STA receives a QoS (+)CF-Poll and its NAV and ONAV are equal to zero, the STA is allowed to respond to the QoS (+)CF-Poll if the QoS (+)CF-poll is intended to the STA. Then, the STA sets the NAV according to the duration field indicated in the QoS (+)CF-poll. However, if an STA receives a QoS (+)CF-Poll and its NAV or ONAV is non-zero, the STA cannot reply to the QoS (+)CF-Poll even if it was for itself. Here, the STA saves the maximum value out of (NAV, ONAV) in the ONAV counter but sets the NAV using the Duration/ID field specified in the QoS (+)CF-Poll frame.
  • For the Contention Free Burst (CFB: regions indicated by number [0048] 2), STAs will respond to a QoS (+)CF-Poll and respond to RTS from the TxOP holder with CTS only when the ONAV is zero. It should be noted that NAV is already activated in this region.
  • For the Contention Free Period (CFP: region indicated by number [0049] 3), at TBTT when a CFP is scheduled to start, if an STA has non-zero NAV, then the STA assumes that its NAV was set in the contention period by an OBSS. Thus, the STA will save the maximum value of (NAV, ONAV) in the ONAV counter, but sets the NAV using the dot11CFPMaxDuration/ID field specified in the beacon frame. Here, STAs will respond to a QoS (+)CF-Poll and to an RTS from the TxOP holder with CTS only when the ONAV is zero.
  • In all three above cases, STAs will always generate an ACK frame, upon successful reception of the frame of a type that requires acknowledgement, without regard to the busy/idle state of the medium. [0050]
  • Having thus described a preferred embodiment for reducing the considerable number of collisions due to an overlapping BSS, it should be apparent to those skilled in the art that certain advantages have been achieved. The concept of ONAV is intended to protect its BSS from the OBSSs as well as to be fair to the OBSSs by not transmitting when the OBSSs need to be protected. [0051]
  • While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes and modifications may be made, and equivalents may be substituted for elements thereof without departing from the true scope of the present invention. In addition, many modifications may be made to adapt to a particular situation and the teaching of the present invention without departing from the central scope. Therefore, it is intended that the present invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out the present invention, but that the present invention include all embodiments falling within the scope of the appended claims. [0052]

Claims (30)

What is claimed:
1. A method for avoiding collisions between a plurality of stations located in two or more basic service sets (BSSs) and operating in the same channel, the method comprising the steps of:
the mobile station receiving a frame, the frame including information indicative of which of basic service units (BSSs) are transmitting the frame to the mobile station;
the mobile station updating a first counter when the received frame is determined to be from the same BSS;
the mobile station updating a second counter when the received frame is determined to be from an overlapping BSS; and,
the mobile station transmitting within its corresponding BSS when the first counter and the second counter are zeros.
2. The method of claim 1, wherein the first counter is updated according to a duration specified in the received frame to ensure that the mobile station will not interfere with the transmissions in its own BSS.
3. The method of claim 2, wherein the received frame is determined to be from the overlapping BSS if the duration specified in the received frame is greater than a previous duration of the first counter upon reception of a QoS (+)CF-Poll frame.
4. The method of claim 1, wherein the second counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmissions in the OBSS.
5. The method of claim 1, further comprising the step of transmitting an acknowledgement by the mobile station in response to the received frame irrespective of the value of the counters.
6. The method of claim 1, wherein, if the received frame is a request-to-send (RTS) frame during a contention period, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the first counter and the second counter are zeros.
7. The method of claim 1, wherein, if the received frame is a request-to-send (RTS) frame during a contention-free period, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the second counter is zero.
8. The method of claim 1, wherein, if the received frame is a request-to-send (RTS) frame during a contention-free burst, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the second counter is zero.
9. A method of operating a wireless local area network (WLAN) of the type having at least one basic service set (BSS) comprised of at least one access point (AP) and a plurality of mobile stations (STAs), the method comprising the steps of:
(a) transmitting a polling frame by the at least one of the access points to the mobile station, the polling frame including information indicative of the destination address of the frame and which of basic service units are transmitting the polling frame to the mobile station;
(b) storing the information indicative of which basic service sets are transmitting the frame to the mobile station and storing the destination address of the polling frame as a transmitting source;
(c) updating a first counter of the mobile station according to the duration field specified in the polled frame;
(d) receiving a frame by the mobile station, the frame including information indicative of the duration of the first counter;
(e) if the duration of the received frame is longer than the duration of the updated first counter, updating a second counter of the mobile station according to the duration indicated in the received frame; and,
(f) transmitting by the mobile station within its corresponding BSS if the first counter and the second counter are zeros.
10. The method of claim 9, wherein, if the duration of the received frame is not longer than the duration of the updated first counter, determining that the received frame is from an overlapping basic service set.
11. The method of claim 9, further comprising the steps of:
determining whether a source address of the received frame is equal to the transmitting source obtained in step (b) if the duration of the received frame is not longer than the duration of the updated first counter; and,
if not, updating the second counter of the mobile station according to the duration indicated in the received frame.
12. The method of claim 11, further comprising the step of transmitting by the mobile station within its corresponding BSS if the first counter and the second counter are zeros.
13. The method of claim 11, further comprising the steps of:
determining whether a destination address of the received frame is equal to the transmitting source obtained in step (b) if the duration of the received frame is not longer than the duration of the updated first counter; and,
if not, updating the second counter of the mobile station according to the duration indicated in the received frame.
14. The method of claim 13, further comprising the step of transmitting within its corresponding BSS by the mobile station if the first counter and the second counter are zeros.
15. The method of claim 9, wherein the first counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmissions in the BSS.
16. The method of claim 9, wherein the second counter is updated according to a duration specified in the received frame to ensure that the mobile station will not interfere with the transmissions in the OBSS.
17. The method of claim 9, further comprising the step of transmitting an acknowledgement by the mobile station within its BSS irrespective of the value of the counters.
18. The method of claim 9, wherein, if the received frame is a request-to-send (RTS) frame during a contention period, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the first counter and the second counter are zeros.
19. The method of claim 9, wherein, if the received frame is a request-to-send (RTS) frame during a contention-free period, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the second counter is zero.
20. The method of claim 9, wherein, if the received frame is a request-to-send (RTS) frame during a contention-free burst, transmitting a clear-to-send (CTS) frame by the mobile station within its corresponding BSS when the second counter is zero.
21. The method of claim 9, wherein, if the received frame is a QoS (+)CF poll frame from the AP, transmitting data by the mobile station within its corresponding BSS when the second counter is zero.
22. A local area network comprising:
a plurality of mobile stations, each mobile station having a first counter and a second counter;
at least one access point in communication with the plurality of mobile stations; and,
means for updating the first counter and the second counter when any mobile station units receive a frame to ensure that the mobile station will not interfere with the transmissions in its own BSS or in the overlapping basic service set (OBSS), wherein the mobile station is allowed to transmit within its corresponding basic service set (BSS) if the first counter and the second counter are zeros.
23. The network of claim 22, wherein the plurality of mobile stations further comprising means for transmitting an acknowledgement in response to the received frame irrespective of the value of the counters.
24. The network of claim 22, wherein the first counter is updated when the received frame is determined to be from the same BSS.
25. The network of claim 22, wherein the second counter is updated when the received frame is determined to be from the OBSS.
26. The network of claim 22, wherein the plurality of mobile stations further comprise means for utilizing request-to-send-(RTS)/clear-to-send(CTS) exchange to avoid potential interference with the transmissions in the BSS following the RTS/CTS exchange.
27. A machine-readable medium having stored thereon data representing sequences of instructions for avoiding collisions from stations (STAs) comprising two or more basic service sets (BSSs) collocated and operating in the same channel, and the sequences of instructions which, when executed by a processor, cause the processor to:
receive a frame, the frame including information indicative of which of basic service units are transmitting the frame to the mobile station;
update a first counter when the received frame is determined to be from the same BSS;
update a second counter when the received frame is determined to be from an overlapping BSS; and,
transmit by the mobile station within its corresponding BSS when the first counter and the second counter are zeros.
28. The machine-readable medium of claim 27, wherein the first counter is updated according to a duration specified in the received frame to ensure that the mobile station will not interfere with the transmissions in its own BSS.
29. The machine-readable medium of claim 27, wherein the second counter is updated according to a duration specified in the received frame to ensure that the station will not interfere with the transmissions in the OBSS.
30. The method of claim 27, wherein the process is further operative to transmit an acknowledgement by the mobile station in response to the received frame irrespective of the value of the counters.
US10/029,825 2001-12-27 2001-12-27 Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF Active 2025-05-06 US7164671B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/029,825 US7164671B2 (en) 2001-12-27 2001-12-27 Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
US10/029,825 US7164671B2 (en) 2001-12-27 2001-12-27 Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF
EP02727905A EP1396111B1 (en) 2001-05-15 2002-05-15 Overlapping network allocation vector (onav) for avoiding collision in the ieee 802.00 wlan operating under hcf
CN02801647A CN1462524A (en) 2001-05-15 2002-05-15 Overlapping network allocation vector (ONAV) for avoiding collision in IEEE 802.00 WLAN operating under HCF
DE60210957T DE60210957T2 (en) 2001-05-15 2002-05-15 Overlapping Network Allocation Vector (ONAV) to avoid collisions in IEEE 802.00 WLAN operating under HCF
JP2002590582A JP4221225B2 (en) 2001-05-15 2002-05-15 How to avoid collisions between a plurality of terminals
AT02727905T AT324723T (en) 2001-05-15 2002-05-15 Overlapping network allocation vector (ONAV) for avoiding collisions in IEEE 802.00 WLAN the HCF is operated under
KR10-2003-7000623A KR20030018051A (en) 2001-05-15 2002-05-15 Overlapping network allocation vector(onav) for avoiding collision in the ieee 802.00 wlan operating under hcf
PCT/IB2002/001678 WO2002093831A2 (en) 2001-05-15 2002-05-15 Overlapping network allocation vector (onav) for avoiding collision in the ieee 802.00 wlan operating under hcf

Publications (2)

Publication Number Publication Date
US20030123405A1 true US20030123405A1 (en) 2003-07-03
US7164671B2 US7164671B2 (en) 2007-01-16

Family

ID=21851088

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/029,825 Active 2025-05-06 US7164671B2 (en) 2001-12-27 2001-12-27 Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF

Country Status (1)

Country Link
US (1) US7164671B2 (en)

Cited By (57)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020181425A1 (en) * 2001-03-02 2002-12-05 Sherman Matthew J. Interference suppression methods for 802.11
US20030012166A1 (en) * 2001-07-05 2003-01-16 At&T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US20030128716A1 (en) * 2002-01-07 2003-07-10 Harris John M. Method and apparatus for transmitting and receiving data
US20030156553A1 (en) * 2001-11-02 2003-08-21 At&T Corp. 'Shield': protecting high priority channel access attempts in overlapped wireless cells
US20030174665A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Access method for periodic contention-free sessions
US20030174690A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Wireless LANs and neighborhood capture
US20040003334A1 (en) * 2002-06-30 2004-01-01 Boyanapalli Vipin S. Efficient method and apparatus for low latency forward error correction
US20040043767A1 (en) * 2002-08-28 2004-03-04 Nec Infrontia Corporation Fast roaming system
US20040071154A1 (en) * 2002-10-08 2004-04-15 Wentink Maarten Menzo Achieving high priority and bandwidth efficiency in a shared communications medium
US20040114928A1 (en) * 2001-03-15 2004-06-17 Adzhalov Vladimir Isfandeyarovich Access method for data packet networks
US20040258039A1 (en) * 2003-06-23 2004-12-23 Stephens Adrian P. Adaptive use of a transmit opportunity
US20050122935A1 (en) * 2003-11-06 2005-06-09 Christophe Mangin Methods and devices for managing a shared transmission medium
US20050147115A1 (en) * 2003-12-24 2005-07-07 Qinghua Li SDMA training operations
US20050195821A1 (en) * 2004-03-03 2005-09-08 Samsung Electronics Co., Ltd. Method and apparatus for dynamically controlling traffic in wireless station
US20050195776A1 (en) * 2004-03-04 2005-09-08 Sharp Laboratories Of America, Inc. System and method for beacon timing control in a mixed IEEE 802.11 network
US20050207377A1 (en) * 2004-02-11 2005-09-22 Samsung Electronics Co., Ltd. Wireless communication method
US20050226191A1 (en) * 2004-04-12 2005-10-13 Golestani S J Allocation of channels to wireless LANS
KR100570825B1 (en) 2004-09-30 2006-04-12 삼성전자주식회사 Apparatus and method for detecting the interference with neighboring bss in wireless lan system
US20060153156A1 (en) * 2004-12-23 2006-07-13 Conexant Systems, Inc. Systems and methods for the connection and remote configuration of wireless clients
US20060182032A1 (en) * 2005-02-14 2006-08-17 Intel Corporation Method and apparatus for providing a control frame duration correlated to data frame duration
US20060259617A1 (en) * 2005-05-12 2006-11-16 Samsung Electronics Co., Ltd. Method and system for transmitting data between nodes in a mesh network
US20070041334A1 (en) * 2005-08-19 2007-02-22 Hak-Hoon Song Transmitting frames in wireless local area network (WLAN)
US20070058581A1 (en) * 2001-07-05 2007-03-15 Mathilde Benveniste Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US20070115853A1 (en) * 2005-11-08 2007-05-24 Conexant Systems Collision Avoidance Systems and Methods
US20070115882A1 (en) * 2005-11-08 2007-05-24 Conexant Systems, Inc Symmetric transmit opportunity (TXOP) truncation
US7245605B2 (en) 2001-11-02 2007-07-17 At&T Corp. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US7245604B2 (en) 2001-11-02 2007-07-17 At&T Corp. Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US7277415B2 (en) 2001-11-02 2007-10-02 At&T Corp. Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
KR100765776B1 (en) 2005-12-13 2007-10-12 삼성전자주식회사 Method and apparatus for avoiding collision in medium access of WLAN
WO2007082229A3 (en) * 2006-01-10 2008-01-17 Conexant Systems Inc Symmetric transmit opportunity (txop) truncation
US20080112351A1 (en) * 2006-11-15 2008-05-15 Qualcomm Incorporated Transmissions to multiple stations in wireless communication systems
US20080161031A1 (en) * 2006-12-28 2008-07-03 Palm, Inc. Coordination of transmissions in wireless communications devices
US20080273525A1 (en) * 2003-02-03 2008-11-06 Sony Corporation Communication method and communication device as well as computer program
US20090213776A1 (en) * 2008-02-26 2009-08-27 Stmicroelectronics, Inc. Broadcast/multicast collision free frame transmission
US20090279487A1 (en) * 2005-05-12 2009-11-12 Koninklijke Philips Electronics N.V. Distributed medium access protocol for wireless mesh networks
US20100208579A1 (en) * 2003-06-23 2010-08-19 Intel Corporation Adaptive use of a transmit opportunity
US7949358B2 (en) 2004-12-23 2011-05-24 Xocyst Transfer Ag L.L.C. Systems and methods for device discovery
US8072980B1 (en) * 2008-05-15 2011-12-06 Marvell International Ltd. Prediction of future frames in a wireless network
CN102457942A (en) * 2010-10-29 2012-05-16 中兴通讯股份有限公司 Method and system for scanning channel in wireless network
US20120257574A1 (en) * 2009-12-17 2012-10-11 Lg Electronics Inc. Method of reducing interference between stations in wireless lan system, and apparatus supporting the same
US20120327870A1 (en) * 2011-06-24 2012-12-27 Interdigital Patent Holdings, Inc. Method and apparatus for supporting wideband and multiple bandwidth transmission protocols
US20130343341A1 (en) * 2010-02-09 2013-12-26 Lg Electronics Inc. Method and apparatus of requesting channel access in wireless local area network
US8625546B2 (en) 2009-05-14 2014-01-07 Koninklijke Philips N.V. Distributed medium access protocol for wireless mesh networks
US20150036619A1 (en) * 2013-08-01 2015-02-05 Hitachi, Ltd. Wireless transmission system
US20150071278A1 (en) * 2010-02-16 2015-03-12 Intel Corporation CLUSTERING MANAGEMENT IN mmWAVE WIRELESS SYSTEMS
EP2871901A1 (en) * 2013-11-07 2015-05-13 Nokia Corporation Methods and apparatus for wireless networking
US20150373582A1 (en) * 2014-06-24 2015-12-24 Qualcomm Incorporated Dynamic bandwidth management for load-based equipment in unlicensed spectrum
US9270606B2 (en) 2000-11-03 2016-02-23 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US20170064739A1 (en) * 2015-08-26 2017-03-02 Newracom, Inc. Network allocation vector types and transmission opportunity types for spatial reuse
WO2017058919A1 (en) * 2015-09-28 2017-04-06 Newracom, Inc. Apparatus and methods for txop duration field in phy header
US9642070B2 (en) 2014-05-21 2017-05-02 Electronics And Telecommunications Research Institute Method for avoiding interference in wireless local area network system and apparatus for performing the same
WO2017183917A1 (en) * 2016-04-22 2017-10-26 엘지전자 주식회사 Heterogeneous network allocation vector (nav)-based communication in wireless lan system
KR101824196B1 (en) * 2012-12-26 2018-01-31 한국전자통신연구원 Apparatus and method for avoiding interference between access points
EP3313140A4 (en) * 2015-07-17 2018-06-13 Huawei Technologies Co., Ltd. Method for setting nav in wireless communication system, and related device
EP3402292A4 (en) * 2016-01-06 2018-12-19 Sony Corporation Information processing apparatus, communication system, information processing method, and program
US10278022B2 (en) 2015-05-06 2019-04-30 Qualcomm Incorporated Communication deferral policies to increase reuse
EP3484231A1 (en) * 2007-03-05 2019-05-15 Sony Corporation Setting of network allocation vectors in a wireless communication system

Families Citing this family (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3530141B2 (en) * 2001-03-06 2004-05-24 松下電器産業株式会社 Signal collision avoidance method for a wireless lan system and a wireless lan system
US7957356B2 (en) 2002-05-13 2011-06-07 Misomino Chi Acquisitions L.L.C. Scalable media access control for multi-hop high bandwidth communications
US8780770B2 (en) * 2002-05-13 2014-07-15 Misonimo Chi Acquisition L.L.C. Systems and methods for voice and video communication over a wireless network
GB2391137B (en) * 2002-07-19 2004-09-01 Synad Technologies Ltd Method of controlling access to a communications medium
CN1512721A (en) * 2002-12-26 2004-07-14 皇家飞利浦电子股份有限公司 Radio local net work system and method with increased central coordination control
US20040141496A1 (en) * 2003-01-16 2004-07-22 Wentink Maarten Menzo Optimization of transmissions on a shared communications channel
US8274961B2 (en) * 2003-10-24 2012-09-25 Sony Corporation Apparatus and associated methodology of adjusting a RTS/CTS transmission protocol
US7944882B2 (en) * 2003-12-17 2011-05-17 Intel Corporation Channel access apparatus, systems, and methods
JP4005974B2 (en) 2004-01-09 2007-11-14 株式会社東芝 Communication apparatus, communication method and a communication system,
AU2005210998B2 (en) * 2004-02-06 2009-04-23 Koninklijke Philips Electronics, N.V. A system and method for an ultra wide-band medium access control distributed reservation protocol
WO2006040390A1 (en) * 2004-10-15 2006-04-20 Nokia Corporation Reduction of power consumption in wireless communication terminals
DE602005031745C5 (en) * 2005-03-04 2017-11-30 Nokia Technologies Oy Route preparation in a wireless communication environment
US7693175B1 (en) * 2005-04-21 2010-04-06 Avaya Inc. Prioritized access in a multi-channel MAC protocol
KR20080016943A (en) * 2005-06-08 2008-02-22 아바야 테크놀러지 코퍼레이션 Avoding exposed node problems in wireless local area networks
JP2010532947A (en) * 2007-07-06 2010-10-14 エルジー エレクトロニクス インコーポレイティド Radio measurement procedure in a wireless communication system
US20140185567A1 (en) * 2007-08-31 2014-07-03 Nokia Corporation Link Establishment In A Wireless Communication Environment
CN105900516B (en) 2014-02-11 2019-05-24 华为技术有限公司 Data transmission method for uplink and device
US9485179B2 (en) * 2014-11-13 2016-11-01 Cavium, Inc. Apparatus and method for scalable and flexible table search in a network switch
US10271352B2 (en) * 2016-07-19 2019-04-23 Realtek Semiconductor Corp. Wireless communication system and associated wireless communication method and wireless device having efficient polling mechanism in overlapping network environments

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030174664A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US7050420B2 (en) * 2001-03-21 2006-05-23 Broadcom Corporation System for maintaining synchronization between multiple asynchronous communication links

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1998035453A1 (en) 1997-02-06 1998-08-13 Norand Corporation A low-power wireless beaconing network supporting proximal formation, separation and reformation

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7050420B2 (en) * 2001-03-21 2006-05-23 Broadcom Corporation System for maintaining synchronization between multiple asynchronous communication links
US20030174664A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions

Cited By (141)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9668276B2 (en) 2000-11-03 2017-05-30 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US9270606B2 (en) 2000-11-03 2016-02-23 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US20020181425A1 (en) * 2001-03-02 2002-12-05 Sherman Matthew J. Interference suppression methods for 802.11
US7046650B2 (en) * 2001-03-02 2006-05-16 At&Tcorp. Interference suppression methods for 802.11
US20040114928A1 (en) * 2001-03-15 2004-06-17 Adzhalov Vladimir Isfandeyarovich Access method for data packet networks
US20080019329A1 (en) * 2001-07-05 2008-01-24 Mathilde Benveniste Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US20080291873A1 (en) * 2001-07-05 2008-11-27 Mathilde Benveniste Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US9420611B2 (en) 2001-07-05 2016-08-16 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tired contention and overlapped wireless cell mitigation
US9398594B2 (en) 2001-07-05 2016-07-19 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US7379432B2 (en) 2001-07-05 2008-05-27 At&T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8068449B2 (en) 2001-07-05 2011-11-29 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US9699793B2 (en) 2001-07-05 2017-07-04 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US7277413B2 (en) * 2001-07-05 2007-10-02 At & T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US20070058581A1 (en) * 2001-07-05 2007-03-15 Mathilde Benveniste Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
US9179477B2 (en) 2001-07-05 2015-11-03 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8687642B2 (en) 2001-07-05 2014-04-01 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8649321B2 (en) 2001-07-05 2014-02-11 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US20030012166A1 (en) * 2001-07-05 2003-01-16 At&T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US8130770B2 (en) 2001-07-05 2012-03-06 At&T Intellectual Property Ii, L.P. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US20030174690A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Wireless LANs and neighborhood capture
US8532079B2 (en) 2001-11-02 2013-09-10 At&T Intellectual Property Ii, L.P. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US8111682B2 (en) 2001-11-02 2012-02-07 At&T Intellectual Property Ii, L.P. “Shield”: protecting high priority channel access attempts in overlapped wireless cells
US8068470B2 (en) 2001-11-02 2011-11-29 At&T Intellectual Property Ii, L.P. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US7180905B2 (en) 2001-11-02 2007-02-20 At & T Corp. Access method for periodic contention-free sessions
US8699510B2 (en) 2001-11-02 2014-04-15 At&T Intellectual Property Ii, L.P. ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US8913597B2 (en) 2001-11-02 2014-12-16 AT&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
US8064415B2 (en) 2001-11-02 2011-11-22 At&T Intellectual Property Ii, L.P. Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US7995544B2 (en) 2001-11-02 2011-08-09 At&T Intellectual Property Ii, L.P. Wireless LANs and neighborhood capture
US7983231B2 (en) 2001-11-02 2011-07-19 At&T Intellectual Property Ii, L.P. Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
US7245605B2 (en) 2001-11-02 2007-07-17 At&T Corp. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US7245604B2 (en) 2001-11-02 2007-07-17 At&T Corp. Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US7248600B2 (en) 2001-11-02 2007-07-24 At&T Corp. ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US7983232B2 (en) 2001-11-02 2011-07-19 At&T Intellectual Property Ii, L.P. Wireless LANs and neighborhood capture
US20070211749A1 (en) * 2001-11-02 2007-09-13 Mathilde Benveniste Access method for periodic contention-free sessions
US7773625B2 (en) 2001-11-02 2010-08-10 At&T Intellectual Property Ii, L.P. Access method for periodic contention-free sessions
US9191971B2 (en) 2001-11-02 2015-11-17 At&T Intellectual Property Ii, L.P. ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US9319906B2 (en) 2001-11-02 2016-04-19 At&T Intellectual Property Ii, L.P. Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US7280517B2 (en) 2001-11-02 2007-10-09 At&T Corp. Wireless LANs and neighborhood capture
US20030174665A1 (en) * 2001-11-02 2003-09-18 At&T Corp. Access method for periodic contention-free sessions
US20030156553A1 (en) * 2001-11-02 2003-08-21 At&T Corp. 'Shield': protecting high priority channel access attempts in overlapped wireless cells
US20070263581A1 (en) * 2001-11-02 2007-11-15 Mathilde Benveniste "shield": protecting high priority channel access attempts in overlapped wireless cells
US20080019343A1 (en) * 2001-11-02 2008-01-24 Mathilde Benveniste Wireless lans and neighborhood capture
US20080013508A1 (en) * 2001-11-02 2008-01-17 Mathilde Benveniste Fixed deterministic post-backoff for cyclic prioritized multiple access (cpma) contention-free sessions
US20080013515A1 (en) * 2001-11-02 2008-01-17 Mathilde Benveniste Staggered startup for cyclic prioritized multiple access (cpma) contention-free sessions
US20080013522A1 (en) * 2001-11-02 2008-01-17 Mathilde Benveniste Wireless lans and neighborhood capture
US7277415B2 (en) 2001-11-02 2007-10-02 At&T Corp. Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
US20030128716A1 (en) * 2002-01-07 2003-07-10 Harris John M. Method and apparatus for transmitting and receiving data
US7280480B2 (en) * 2002-01-07 2007-10-09 Motorola, Inc. Method and apparatus for transmitting and receiving data
US20040003334A1 (en) * 2002-06-30 2004-01-01 Boyanapalli Vipin S. Efficient method and apparatus for low latency forward error correction
US20040043767A1 (en) * 2002-08-28 2004-03-04 Nec Infrontia Corporation Fast roaming system
US8000298B2 (en) * 2002-08-28 2011-08-16 Nec Infrontia Corporation Fast roaming system
US20040071154A1 (en) * 2002-10-08 2004-04-15 Wentink Maarten Menzo Achieving high priority and bandwidth efficiency in a shared communications medium
US8619806B2 (en) 2003-02-03 2013-12-31 Sony Corporation Communication method and communication device as well as computer program
US20080273525A1 (en) * 2003-02-03 2008-11-06 Sony Corporation Communication method and communication device as well as computer program
US8249093B2 (en) * 2003-02-03 2012-08-21 Sony Corporation Communication method and communication device as well as computer program
US20100157967A1 (en) * 2003-02-03 2010-06-24 Sony Corporation Communication method and communication device as well as computer program
US7715426B2 (en) * 2003-02-03 2010-05-11 Sony Corporation Communication method and communication device as well as computer program
US20100208579A1 (en) * 2003-06-23 2010-08-19 Intel Corporation Adaptive use of a transmit opportunity
US7512070B2 (en) * 2003-06-23 2009-03-31 Intel Corporation Adaptive use of a transmit opportunity
US20040258039A1 (en) * 2003-06-23 2004-12-23 Stephens Adrian P. Adaptive use of a transmit opportunity
US8630168B2 (en) 2003-06-23 2014-01-14 Intel Corporation Adaptive use of a transmit opportunity
US20050122935A1 (en) * 2003-11-06 2005-06-09 Christophe Mangin Methods and devices for managing a shared transmission medium
US20050147115A1 (en) * 2003-12-24 2005-07-07 Qinghua Li SDMA training operations
US20050207377A1 (en) * 2004-02-11 2005-09-22 Samsung Electronics Co., Ltd. Wireless communication method
US20050195821A1 (en) * 2004-03-03 2005-09-08 Samsung Electronics Co., Ltd. Method and apparatus for dynamically controlling traffic in wireless station
US7295542B2 (en) * 2004-03-04 2007-11-13 Sharp Laboratories Of America, Inc. System and method for beacon timing control in a mixed IEEE 802.11 network
US20050195776A1 (en) * 2004-03-04 2005-09-08 Sharp Laboratories Of America, Inc. System and method for beacon timing control in a mixed IEEE 802.11 network
US20050226191A1 (en) * 2004-04-12 2005-10-13 Golestani S J Allocation of channels to wireless LANS
US7194271B2 (en) * 2004-04-12 2007-03-20 Lucent Technologies Inc. Allocation of channels to wireless LANs
US20060079183A1 (en) * 2004-09-30 2006-04-13 Hak-Hoon Song Detecting interference between neighboring basic service sets (BSSs) in wireless local area network (WLAN) system
KR100570825B1 (en) 2004-09-30 2006-04-12 삼성전자주식회사 Apparatus and method for detecting the interference with neighboring bss in wireless lan system
EP1829398A2 (en) * 2004-12-23 2007-09-05 Conexant Systems, Inc. Systems and methods for the connection and remote configuration of wireless clients
US7949358B2 (en) 2004-12-23 2011-05-24 Xocyst Transfer Ag L.L.C. Systems and methods for device discovery
US7929504B2 (en) 2004-12-23 2011-04-19 Xocyst Transfer Ag L.L.C. Systems and methods for the connection and remote configuration of wireless clients
EP3301958A1 (en) * 2004-12-23 2018-04-04 Intellectual Ventures I LLC Systems and methods for the connection and remote configuration of wireless clients
US20060153156A1 (en) * 2004-12-23 2006-07-13 Conexant Systems, Inc. Systems and methods for the connection and remote configuration of wireless clients
EP1829398A4 (en) * 2004-12-23 2012-10-31 Xocyst Transfer Ag L L C Systems and methods for the connection and remote configuration of wireless clients
US20060182032A1 (en) * 2005-02-14 2006-08-17 Intel Corporation Method and apparatus for providing a control frame duration correlated to data frame duration
US7388878B2 (en) * 2005-02-14 2008-06-17 Liuyang Lily Yang Method and apparatus for providing a control frame duration correlated to data frame duration
US20090279487A1 (en) * 2005-05-12 2009-11-12 Koninklijke Philips Electronics N.V. Distributed medium access protocol for wireless mesh networks
US8116295B2 (en) * 2005-05-12 2012-02-14 Koninklijke Philips Electronics N.V. Distributed medium access protocol for wireless mesh networks
US20060259617A1 (en) * 2005-05-12 2006-11-16 Samsung Electronics Co., Ltd. Method and system for transmitting data between nodes in a mesh network
KR101317996B1 (en) 2005-05-12 2013-10-14 삼성전자주식회사 Method and apparatus for transmiting data between nodes in a mesh network
US8045514B2 (en) * 2005-08-19 2011-10-25 Samsung Electronics Co., Ltd. Transmitting frames in wireless local area network (WLAN)
US20070041334A1 (en) * 2005-08-19 2007-02-22 Hak-Hoon Song Transmitting frames in wireless local area network (WLAN)
US8270385B2 (en) 2005-11-08 2012-09-18 Intellectual Ventures I Llc Symmetric transmit opportunitty (TXOP) truncation
US9125104B2 (en) 2005-11-08 2015-09-01 Intellectual Ventures I Llc Symmetric transmit opportunity (TXOP) truncation
US8488550B2 (en) * 2005-11-08 2013-07-16 Intellectual Ventures I Llc Symmetric transmit opportunity (TXOP) truncation
US20070115853A1 (en) * 2005-11-08 2007-05-24 Conexant Systems Collision Avoidance Systems and Methods
US8374123B2 (en) 2005-11-08 2013-02-12 Intellectual Ventures I Llc Collision avoidance systems and methods
US8031661B2 (en) 2005-11-08 2011-10-04 Intellectual Ventures I Llc Symmetric transmit opportunity (TXOP) truncation
US20070115882A1 (en) * 2005-11-08 2007-05-24 Conexant Systems, Inc Symmetric transmit opportunity (TXOP) truncation
US10098160B2 (en) * 2005-11-08 2018-10-09 Intellectual Ventures I Llc Symmetric transmit opportunity (TXOP) truncation
US20150373745A1 (en) * 2005-11-08 2015-12-24 Intellectual Ventures I Llc Symmetric transmit opportunity (txop) truncation
US10201015B2 (en) 2005-11-08 2019-02-05 Intellectual Ventures I Llc Collision avoidance systems and methods
US9258842B2 (en) 2005-11-08 2016-02-09 Intellectual Ventures I Llc Collision avoidance systems and methods
US9544917B2 (en) 2005-11-08 2017-01-10 Intellectual Ventures I Llc Collision avoidance systems and methods
US8824266B2 (en) 2005-12-13 2014-09-02 Samsung Electronics Co., Ltd. Method and apparatus preventing plurality of stations in WLAN from colliding with each other when attempting to access medium
US8582545B2 (en) 2005-12-13 2013-11-12 Samsung Electronics Co., Ltd. Method and apparatus preventing plurality of stations in WLAN from colliding with each other when attempting to access medium
KR100765776B1 (en) 2005-12-13 2007-10-12 삼성전자주식회사 Method and apparatus for avoiding collision in medium access of WLAN
KR101212423B1 (en) 2006-01-10 2012-12-13 인텔렉츄얼 벤처스 원 엘엘씨 Symmetrical transmission opportunity (txop) cutting
WO2007082229A3 (en) * 2006-01-10 2008-01-17 Conexant Systems Inc Symmetric transmit opportunity (txop) truncation
US20080112351A1 (en) * 2006-11-15 2008-05-15 Qualcomm Incorporated Transmissions to multiple stations in wireless communication systems
US8305948B2 (en) * 2006-11-15 2012-11-06 Qualcomm Incorporated Transmissions to multiple stations in wireless communication systems
US7920883B2 (en) * 2006-12-28 2011-04-05 Hewlett-Packard Development Company, L.P. Coordination of transmissions in wireless communications devices
US20080161031A1 (en) * 2006-12-28 2008-07-03 Palm, Inc. Coordination of transmissions in wireless communications devices
EP3484231A1 (en) * 2007-03-05 2019-05-15 Sony Corporation Setting of network allocation vectors in a wireless communication system
US20090213776A1 (en) * 2008-02-26 2009-08-27 Stmicroelectronics, Inc. Broadcast/multicast collision free frame transmission
US8391259B2 (en) 2008-02-26 2013-03-05 Stmicroelectronics, Inc. Broadcast/multicast collision free frame transmission
US8467391B1 (en) 2008-05-15 2013-06-18 Marvell International Ltd. Prediction of future frames in a wireless network
US8072980B1 (en) * 2008-05-15 2011-12-06 Marvell International Ltd. Prediction of future frames in a wireless network
US9326216B1 (en) 2008-05-15 2016-04-26 Marvell International Ltd. Method and apparatus for predicting a physical layer parameter of a wireless packet in a wireless network
US8625546B2 (en) 2009-05-14 2014-01-07 Koninklijke Philips N.V. Distributed medium access protocol for wireless mesh networks
US20120257574A1 (en) * 2009-12-17 2012-10-11 Lg Electronics Inc. Method of reducing interference between stations in wireless lan system, and apparatus supporting the same
US9258824B2 (en) 2009-12-17 2016-02-09 Lg Electronics Inc. Method of reducing interference between stations in wireless LAN system, and apparatus supporting the same
US8995342B2 (en) * 2009-12-17 2015-03-31 Lg Electronics Inc. Method of reducing interference between stations in wireless LAN system, and apparatus supporting the same
US20130343341A1 (en) * 2010-02-09 2013-12-26 Lg Electronics Inc. Method and apparatus of requesting channel access in wireless local area network
US9949141B2 (en) * 2010-02-16 2018-04-17 Intel Corporation Clustering management in mmWave wireless systems
US20150071278A1 (en) * 2010-02-16 2015-03-12 Intel Corporation CLUSTERING MANAGEMENT IN mmWAVE WIRELESS SYSTEMS
CN102457942A (en) * 2010-10-29 2012-05-16 中兴通讯股份有限公司 Method and system for scanning channel in wireless network
US9844075B2 (en) 2011-06-24 2017-12-12 Interdigital Patent Holdings, Inc. Method and apparatus for supporting wideband and multiple bandwidth transmission protocols
US20120327870A1 (en) * 2011-06-24 2012-12-27 Interdigital Patent Holdings, Inc. Method and apparatus for supporting wideband and multiple bandwidth transmission protocols
US10334626B2 (en) 2011-06-24 2019-06-25 Interdigital Patent Holdings, Inc. Method and apparatus for supporting wideband and multiple bandwidth transmission protocols
US9369918B2 (en) * 2011-06-24 2016-06-14 Interdigital Patent Holdings, Inc. Method and apparatus for supporting wideband and multiple bandwidth transmission protocols
KR101824196B1 (en) * 2012-12-26 2018-01-31 한국전자통신연구원 Apparatus and method for avoiding interference between access points
US20150036619A1 (en) * 2013-08-01 2015-02-05 Hitachi, Ltd. Wireless transmission system
US9967895B2 (en) * 2013-08-01 2018-05-08 Hitachi, Ltd. Wireless transmission system
EP2871901A1 (en) * 2013-11-07 2015-05-13 Nokia Corporation Methods and apparatus for wireless networking
CN104640225A (en) * 2013-11-07 2015-05-20 诺基亚公司 Methods and apparatus for wireless networking
US9642070B2 (en) 2014-05-21 2017-05-02 Electronics And Telecommunications Research Institute Method for avoiding interference in wireless local area network system and apparatus for performing the same
US20150373582A1 (en) * 2014-06-24 2015-12-24 Qualcomm Incorporated Dynamic bandwidth management for load-based equipment in unlicensed spectrum
US10080159B2 (en) * 2014-06-24 2018-09-18 Qualcomm Incorporated Dynamic bandwidth management for load-based equipment in unlicensed spectrum
US10278022B2 (en) 2015-05-06 2019-04-30 Qualcomm Incorporated Communication deferral policies to increase reuse
EP3313140A4 (en) * 2015-07-17 2018-06-13 Huawei Technologies Co., Ltd. Method for setting nav in wireless communication system, and related device
US20170064739A1 (en) * 2015-08-26 2017-03-02 Newracom, Inc. Network allocation vector types and transmission opportunity types for spatial reuse
US10285203B2 (en) * 2015-08-26 2019-05-07 Newracom, Inc. Network allocation vector types and transmission opportunity types for spatial reuse
US10257857B2 (en) 2015-09-28 2019-04-09 Newracom, Inc. Apparatus and methods for TXOP duration field in PHY header
WO2017058919A1 (en) * 2015-09-28 2017-04-06 Newracom, Inc. Apparatus and methods for txop duration field in phy header
EP3357295A4 (en) * 2015-09-28 2019-06-19 Newracom, Inc. Apparatus and methods for txop duration field in phy header
EP3402292A4 (en) * 2016-01-06 2018-12-19 Sony Corporation Information processing apparatus, communication system, information processing method, and program
WO2017183917A1 (en) * 2016-04-22 2017-10-26 엘지전자 주식회사 Heterogeneous network allocation vector (nav)-based communication in wireless lan system

Also Published As

Publication number Publication date
US7164671B2 (en) 2007-01-16

Similar Documents

Publication Publication Date Title
US7221681B2 (en) Apparatus and method for providing IEEE 802.11e hybrid coordinator recovery and backoff rules
US8305885B2 (en) Control of quality of service in overlapping basic service sets in wireless local area networks
US9398594B2 (en) Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
EP0615365B1 (en) A method of accessing a communication medium
JP4022200B2 (en) Ieee802.11e Standard optimally service to methods and systems station on the wireless lan using controlled contention / resource reservation protocol
US7305004B2 (en) Interference suppression methods for 802.11
US7457973B2 (en) System and method for prioritizing data transmission and transmitting scheduled wake-up times to network stations based on downlink transmission duration
KR100564761B1 (en) The hybrid inter token Carrier Sensing Multiple Access/Collision Avoidance protocol
US7245605B2 (en) Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
CN100347969C (en) Wireless communication apparatus, wireless communication method, and computer program
US7046690B2 (en) Interference suppression methods for 802.11
US7523205B1 (en) Interference suppression methods for 802.11
US8780831B2 (en) System and method for estimating bandwidth requirements of and allocating bandwidth to communication devices operating in a network
EP1969771B1 (en) Method and apparatus for transmitting control frame to hidden node in wireless lan
KR101466951B1 (en) Apparatus for collision mitigation of multicast transmissions in wireless networks
CN103781152B (en) Wireless communication system, a wireless communication device and wireless communication method
US8699510B2 (en) ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
EP1695491B1 (en) Polling in wireless networks through dynamic modification of polling intervals and virtual polling
US7245604B2 (en) Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
Leung et al. Outdoor IEEE 802.11 cellular networks: MAC protocol design and performance
EP2084862B1 (en) A serial clear to send to self messaging procedure
CA2876773C (en) Resolving hidden node problem in synchronized dcf based channel access in wlan
US6990116B1 (en) Method and system for improving throughput over wireless local area networks with mode switching
CN1293731C (en) Method and system for wireless local area network (LAN) communication using virtual time division multiple access (TDMA)
US7180905B2 (en) Access method for periodic contention-free sessions

Legal Events

Date Code Title Description
AS Assignment

Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V., NETHERLANDS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PRADO, JAVIER DEL;CHOI, SUNGHYUN;SOOMRO, AMJAD;REEL/FRAME:012422/0681;SIGNING DATES FROM 20011214 TO 20011217

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: IPG ELECTRONICS 503 LIMITED

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KONINKLIJKE PHILIPS ELECTRONICS N.V.;REEL/FRAME:022203/0791

Effective date: 20090130

Owner name: IPG ELECTRONICS 503 LIMITED, GUERNSEY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KONINKLIJKE PHILIPS ELECTRONICS N.V.;REEL/FRAME:022203/0791

Effective date: 20090130

FPAY Fee payment

Year of fee payment: 4

AS Assignment

Owner name: PENDRAGON WIRELESS LLC, WASHINGTON

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IPG ELECTRONICS 503 LIMITED;REEL/FRAME:028594/0224

Effective date: 20120410

FPAY Fee payment

Year of fee payment: 8

AS Assignment

Owner name: UNILOC LUXEMBOURG S.A., LUXEMBOURG

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PENDRAGON WIRELESS LLC;REEL/FRAME:045338/0601

Effective date: 20180131

AS Assignment

Owner name: UNILOC 2017 LLC, DELAWARE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:UNILOC LUXEMBOURG S.A.;REEL/FRAME:046532/0088

Effective date: 20180503

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FEPP Fee payment procedure

Free format text: 11.5 YR SURCHARGE- LATE PMT W/IN 6 MO, LARGE ENTITY (ORIGINAL EVENT CODE: M1556); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12