WO2003039054A2 - Wireless lans and neighborhood capture - Google Patents

Wireless lans and neighborhood capture Download PDF

Info

Publication number
WO2003039054A2
WO2003039054A2 PCT/US2002/036425 US0236425W WO03039054A2 WO 2003039054 A2 WO2003039054 A2 WO 2003039054A2 US 0236425 W US0236425 W US 0236425W WO 03039054 A2 WO03039054 A2 WO 03039054A2
Authority
WO
Grant status
Application
Patent type
Prior art keywords
cells
stations
cell
access
global channel
Prior art date
Application number
PCT/US2002/036425
Other languages
French (fr)
Other versions
WO2003039054A3 (en )
Inventor
Mathilde Benveniste
Original Assignee
At & T Corp.
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/14Flow control or congestion control in wireless networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/24Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
    • H04L47/2416Real time traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS 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 COMMUNICATIONS NETWORKS
    • H04W56/00Synchronisation arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/12WLAN [Wireless Local Area Networks]

Abstract

Overlapped wireless LAN cells in a medium have an equal chance at establishing a session on the medium. A first member station in the first cell transmits a timing packet containing a timestamp value, which is received at a second member station in the second cell. This synchronizes member stations in the first and second ells to interrupt transmissions at a global channel release instant corresponding to the timestamp value. The member stations in the first and second cells then have the opportunity to content for accessf to the medium following the global channel release instant, using a slotted CSMA/CA access method. Each of the member station in the first and second cells has a superframe clock that is synchronized based on the timestamp value, thereby establishing a periodic global channel relase instant during each of a plurality of periodic superframes. The member stations can then periodically interrupt transmissions at the periodic global channel release instant to content for the medium. The periodic global channel release instant occurs at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical voice and video applications.

Description

WIRELESSLANSANDNEIGHBORHOOD CAPTURE

Inventor: Mathilde Benveniste

This application claims the benefit of the following co-pending applications:

[1] U.S. Provisional Application Serial No. 60/330,930, filed November 2, 2001 , entitled "HCF ACCESS MECHANISM: OBSS MITIGATION,"

[2] U.S. Provisional Application Serial No. 60/331,030, November 7, 2001, entitled

" 'NEIGHBORHOOD' CAPTURE IN CSMA/CA WLANS", [3] U.S. Provisional AppUcation Serial No. 60/331 ,211 , filed

November 13, 2001, entitled " 'SHIELD': PROTECTING HIGH PRIORITY CHANNEL ACCESS ATTEMPTS," and

[4] U.S. Provisional Application Serial No. 60/342,343, December 21, 2001, entitled "WIRELESS LANS AND 'NEIGHBORHOOD CAPTURE' ," all of which are incorporated herein by reference.

RELATED APPLICATIONS

This patent application is related to the copending regular U.S. Patent Application Serial No. 09/985,257, filed November 2, 2001, by Mathilde Benveniste, entitled "TIERED CONTENTION MULTIPLE ACCESS (TCMA): A METHOD FOR PRIORITY- BASED SHARED CHANNEL ACCESS," which is incorporated by reference. This patent application is also related to the copending regular U.S. Patent Application Serial No. 10/187,132, filed June 28, 2002, by Mathilde Benveniste, entitled "HYBRID COORDINATION FUNCTION (HCF) ACCESS THROUGH TIERED CONTENTION AND OVERLAPPED WIRELESS CELL MITIGATION," which is incorporated by reference.

This patent application is also related to the copending regular U.S. Patent AppUcation Serial No. 10/256,299, filed September 27, 2002, by Mathilde Benveniste, entitled " 'SHIELD': PROTECTING HIGH PRIORITY CHANNEL ACCESS ATTEMPTS IN OVERLAPPED WIRELESS CELLS," which is incorporated by reference. This patent application is also related to the copending regular U.S. Patent Application Serial No. 10/256,309, filed September 27, 2002, by Mathilde Benveniste, entitled "PREEMPTIVE PACKET FOR MAINTAINING CONTIGUITY IN CYCLIC PRIORITIZED MULTIPLE ACCESS (CPMA) CONTENTION-FREE SESSIONS," which is incorporated by reference.

This patent application is also related to the copending regular U.S. Patent Application Serial No.10/256,305, filed September 27, 2002, by Mathilde Benveniste, entitled "FIXED DETERMINISTIC POST-BACKOFF FOR CYCLIC PRIORITIZED MULTIPLE ACCESS (CPMA) CONTENTION-FREE SESSIONS," which is incorporated by reference.

This patent application is also related to the copending regular U.S. Patent Application Serial No. 10/256,516, filed September 27, 2002, by Mathilde Benveniste, entitled "ACCESS METHOD FOR PERIODIC CONTENTION-FREE SESSIONS, " which is incorporated by reference.

This patent application is also related to the copending regular U.S. Patent Application Serial No. 10/256,471, filed September 27, 2002, by Mathilde Benveniste, entitled "STAGGERED STARTUP FOR CYCLIC PRIORITIZED MULTIPLE ACCESS (CPMA) CONTENTION-FREE SESSIONS," which is incorporated by reference.

FIELD OF THE INVENTION

The invention generally relates to the field of communications and specifically to a system and method for reducing the effects of channel capture for extended periods of time in multiple- cell wireless local area networks (WLANs), thus, improving quality of service (QoS).

BACKGROUND OF THE INVENTION

A single-cell wireless LAN using the IEEE 802.11 Wireless LAN Standard is a Basic Service Set (BSS) network. When all of the stations in the BSS are mobile stations and there is no connection to a wired network, it is an independent BSS (IBSS). An D SS has an optional backbone network and consists of at least two wireless stations. A multiple-cell wireless LAN using the IEEE 802.11 Wireless LAN Standard is an Extended Service Set (ESS) network. An ESS satisfies the needs of large coverage networks of arbitrary size and complexity.

The IEEE 802.11 Wireless LAN Standard is published in three parts as IEEE 802.11-1999. IEEE 802.1 la-1999. and IEEE 802. llb-1999. which are available from the IEEE, Inc. web site http://grouper.ieee.org/groups/802/ll. The IEEE 802.11 Wireless LAN Standard defines at least two different physical (PHY) specifications and one common medium access control (MAC) specification. The IEEE 802.11(a) Standard is designed to operate in unlicensed portions of the radio spectrum, usually either in the 2.4 GHz Industrial, Scientific, and Medical (ISM) band or the 5 GHz Unlicensed-National Information Infrastructure (U-NII) band. It uses orthogonal frequency division multiplexing (OFDM) to deliver up to 54 Mbps data rates. The IEEE 802.11(b) Standard is designed for the 2.4 GHz ISM band and uses direct sequence spread spectrum (DSSS) to deUver up to 11 Mbps data rates.

Other wireless LAN standards include: Open Air (which was the first wireless LAN standard), HomeRF (designed specifically for the home networking market), and HiperLAN/2 (the European counterpart to the "American" 802.11a standard). Bluetooth is a personal area network (PAN) standard. It is aimed at the market of low-power, short-range, wireless connections used for remote control, cordless voice telephone communications, and close-proximity synchronization communications for wireless PDAs/hand-held PCs and mobile phones.

The IEEE 802.11 Wireless LAN Standard describes two major components, the mobile station and the fixed access point (AP). IEEE 802.11 networks can also have an independent configuration where the mobile stations communicate directly with one another, without support from a fixed access point. The medium access control (MAC) protocol regulates access to the RF physical link. The MAC provides a basic access mechanism with clear channel assessment, channel synchronization, and collision avoidance using the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) access method. The MAC provides link setup, data fragmentation, authentication, encryption, and power management.

Synchronization is the process of the stations in an IEEE 802.11 wireless LAN cell getting in step with each other, so that reliable communication is possible. The MAC provides the synchronization mechanism to allow support of physical layers that make use of frequency hopping or other time-based mechanisms where the parameters of the physical layer change with time. The process involves sending a beacon packet to announce the presence of a wireless LAN cell and inquiring to find a wireless LAN cell. Once a wireless LAN cell is found, a station joins the wireless LAN cell. This process is entirely distributed in wireless LAN cells and relies on a common timebase provided by a timer synchronization function (TSF). The TSF maintains a 64-bit timer running at 1 MHz and updated by information from other stations. When a station begins operation, it resets the timer to zero. The timer may be updated by information received in a beacon packet.

In an independent BSS (IBSS) wireless LAN cell, there is no access point (AP) to act as the central time source for the wireless LAN cell. In a wireless LAN cell, the timer synchronization mechanism is completely distributed among the mobile stations of the wireless LAN cell. Since there is no AP, the mobile station that starts the wireless LAN cell will begin by resetting its TSF timer to zero and transmitting a beacon packet, choosing a beacon period. This establishes the basic beaconing process for this wireless LAN cell. After the wireless LAN cell has been established, each station in the wireless LAN cell will attempt to send a beacon after the target beacon transmission time (TBTT) arrives. To minimize actual collisions of the transmitted beacon frames on the medium, each station in the wireless LAN cell will choose a random delay value, which it will allow to expire before it attempts its beacon transmission.

In order for a mobile station to communicate with other mobile stations in a wireless LAN cell, it must first find the stations. The process of finding another station is by inquiry. The inquiring may be either passive or active. Passive inquiry involves only listening for IEEE 802.11 traffic. Active inquiry requires the inquiring station to transmit and invoke responses from IEEE 802.11 stations.

Active inquiry allows an IEEE 802.11 mobile station to find a wireless LAN cell while rninimizing the time spent inquiring. The station does this by actively transmitting queries that invoke responses from stations in a wireless LAN cell. In an active inquiry, the mobile station will move to a channel and transmit a probe request frame. If there is a wireless LAN cell on the channel that matches the service set identity (SSID) in the probe request frame, the responding station in that wireless LAN cell will respond by sending a probe response frame to the inquiring station. This probe response includes the information necessary for the inquiring station to extract a description of the wireless LAN cell. The inquiring station will also process any other received probe response and beacon frames. Once the inquiring station has processed any responses, or has decided there will be no responses, it may change to another channel and repeat the process. At the conclusion of the inquiry, the station has accumulated information about the wireless LAN cells in its vicinity.

Joining a wireless LAN cell requires that all of the mobile station's MAC and physical parameters be synchronized with the desired wireless LAN cell. To do this, the station must update its timer with the value of the timer from the wireless LAN cell description, modified by adding the time elapsed since the description was acquired. This will synchronize the timer to the wireless LAN cell. Once this process is complete, the mobile station has joined the wireless LAN cell and is ready to begin communicating with the stations in the wireless LAN cell.

Each wireless station and access point in an IEEE 802.11 wireless LAN implements the MAC layer service, which provides the capability for wireless stations to exchange MAC frames. The MAC frame is a packet that transmits management, control, or data between wireless stations and access points. After a station forms the applicable MAC frame, the frame's bits are passed to the Physical Layer for transmission. Before transmitting a frame, the MAC layer must first gain access to the network. Three interframe space (IFS) intervals defer an IEEE 802.11 station's access to the medium and provide various levels of priority. Each interval defines the duration between the end of the last symbol of the previous frame to the beginning of the first symbol of the next frame. The Short Interframe Space (SIFS) provides the highest priority level by allowing some frames to access the medium before others, such as an Acknowledgement (ACK) frame, a Clear-to-Send (CTS) frame, or a subsequent fragment burst of a previous data frame. These frames require expedited access to the network to minimize frame retransmissions.

The Priority Interframe Space (PIFS) is used for high priority access to the medium during the contention-free period. A point coordinator in the access point connected to the backbone network controls the priority-based Point Coordination Function (PCF) to dictate which stations in a cell can gain access to the medium. The point coordinator in the access point sends a contention-free poll frame to a station, granting the station permission to transmit a single frame to any destination. All other stations in the cell can only transmit during a contention-free period if the point coordinator grants them access to the medium. The end of the contention-free period is signaled by the contention-free end frame sent by the point coordinator, which occurs when time expires or when the point coordinator has no further frames to transmit and no stations to poll. The distributed coordination function (DCF)

Interframe Space (DIFS) is used for transmitting low priority data frames during the contention-based period. The DIFS spacing delays the transmission of lower priority frames to occur later than the priority-based transmission frames. An Extended Interframe Space (EIFS) goes beyond the time of a DIFS interval as a waiting period when a bad reception occurs. The EIFS interval provides enough time for the receiving station to send an acknowledgment (ACK) frame.

During the contention-based period, the distributed coordination function (DCF) uses the Carrier-Sense Multiple Access With Collision Avoidance (CSMA/CA) contention-based protocol, which is similar to IEEE 802.3 Ethernet. The CSMA CA protocol minimizes the chance of collisions between stations sharing the medium by waiting a random backoff interval if the station's sensing mechanism indicates a busy medium. The period of time immediately following traffic on the medium is when the highest probability of collisions occurs, especially where there is high utilization. Once the medium is idle, CSMA/CA protocol causes each station to delay its transmission by a random backoff time, thereby minimizing the chance it will collide with those from other stations. In the IEEE 802.11 Standard, the channel is shared by a centralized access protocol, the Point Coordination Function (PCF), which provides contention-free transfer based on a polUng scheme controlled by the access point (AP) of a basic service set (BSS). The centralized access protocol gains control of the channel and maintains control for the entire contention-free period by waiting the shorter Priority Interframe Space (PIFS) interval between transmissions than the stations using the Distributed Coordination Function (DCF) access procedure. Following the end of the contention-free period, the DCF access procedure begins, with each station contending for access using the CSMA CA method.

The 802.11 MAC Layer provides both contention and contention-free access to the shared wireless medium. The MAC Layer uses various MAC frame types to implement its functions of MAC management, control, and data transmission. Each station and access point on an 802.11 wireless LAN implements the MAC Layer service, which enables stations to exchange packets. The results of sensing the channel to determine whether the medium is busy or idle are sent to the MAC coordination function of the station. The MAC coordination also carries out a virtual carrier sense protocol based on reservation information found in the Duration Field of all frames. This information announces to all other stations the sending station's impending use of the medium. The MAC coordination monitors the Duration Field in all MAC frames and places this information in the station's Network Allocation Vector (NAV) if the value is greater than the current NAV value. The NAV operates similarly to a timer, starting with a value equal to the Duration Field of the last frame transmission sensed on the medium and counting down to zero. After the NAV reaches zero, the station can transmit if its physical sensing of the channel indicates a clear channel.

At the beginning of a contention-free period, the access point senses the medium; and if it is idle, it sends a beacon packet to all stations. The beacon packet contains the length of the contention-free interval. The MAC coordination in each member station places the length of the contention-free interval in the station's Network Allocation Vector (NAV), which prevents the station from taking control of the medium until the end of the contention-free period. During the contention-free period, the access point can send a polling message to a member station, enabling it to send a data packet to any other station in the BSS wireless cell.

QuaUty of service (QoS) is a measure of service quality provided to a customer. The primary measures of QoS are message loss, message delay, and network availability. Voice and video applications have the most rigorous delay and loss requirements. Interactive data applications such as Web browsing have less restrained delay and loss requirements, but they are sensitive to errors. Non-realtime applications such as file transfer, email, and data backup operate acceptably across a wide range of loss rates and delay. Some applications require a minimum amount of capacity to operate at all - for example, voice and video. Many network providers guarantee specific QoS and capacity levels through the use of Service-Level Agreements (SLAs). An SLA is a contract between an enteiprise user and a network provider that specifies the capacity to be provided between points in the network that must be delivered with a specified QoS. If the network provider fails to meet the terms of the SLA, then the user may be entitled a refund. The SLA is typically offered by network providers for private line, frame relay, ATM, or Internet networks employed by enterprises. The transmission of time-sensitive and data application traffic over a packet network imposes requirements on the delay or delay jitter, and the error rates realized; these parameters are referred to generically as the QoS (Quality of Service) parameters. Prioritized packet scheduling, preferential packet dropping, and bandwidth allocation are among the techniques available at the various nodes of the network, including access points, that enable packets from different applications to be treated differently, helping achieve the different quality of service objectives. The above-cited, copending U.S. patent application, entitled "Tiered Contention Multiple Access (TCMA): A Method for Priority-Based Shared Channel Access," describes the Tiered Contention Multiple Access (TCMA) distributed medium access protocol that schedules transmission of different types of traffic based on their QoS service quality specifications. For multiple-cell wireless LANs, the limited availability of channels implies that the channels must be re-used, much like in cellular communication networks. But unlike in cellular networks, the number of channels available in wireless LANs is not adequate to ensure both contiguous coverage (which is essential for roaming) and interference-free connections at the same time. As a result, cells assigned the same channel may experience co-channel interference in the area of overlapping coverage or near a cell's periphery. The problem of overlapping cell coverage is acute when wireless LANs are installed without any awareness of what other wireless LANs are operating nearby. Consequently, multiple-cell wireless LANs must rely on a medium access control (MAC) protocol to allocate channel time among stations in order to avoid co-channel interference between cells, just as it avoids contention among stations within the same cell. Special MAC protocols are provided for wireless

LANs because transmission is flawed by higher bit error rates, different losses are experienced on a wireless channel depending on the path on which the signal travels, and a radio node cannot listen while transmitting. Additive noise, path loss and multipath result in more retransmissions and necessitate acknowledgements, as successful transmission cannot be taken for granted. The different losses experienced along different paths cause different nodes to receive transmissions at different strengths, giving rise to the phenomenon of hidden terminals, as is known in the art. These are terminals that cannot hear or be heard by a source but are capable of causing interference to the destination of a transmission. The message exchange mechanism known in the art as Request-to-Send/Clear-to- Send (RTS/CTS) alleviates the hidden terminal problem. RTS/CTS also provides a reservation mechanism that can save bandwidth in wireless LANs. The inability to detect a collision as quickly as it can be detected on cable with carrier-sense multiple access with collision detection (CSMA/CD) causes more channel time to be wasted in a collision while waiting for the entire frame to transmit before the collision is detected. Hence, carrier sensing is combined with the RTS/CTS mechanism to give carrier-sense multiple access with collision avoidance (CSMA/CA).

All channel reservations, generated either with an RTS/CTS exchange or for a contention-free period (CFP), are made with the aid of the Network Allocation Vector (NAV), which is a timer maintained by all stations. The NAV is set at the value of the duration field broadcast when the reservation is announced, either by the RTS or CTS frames, or with the PCF beacon transmitted by the AP to initiate the CFP. All stations in a cell defer access until the NAV expires. The NAV thus provides a virtual carrier-sense mechanism.

Receiving signals at different strengths, depending on their origin, gives rise to capture effects. A known capture effect, the "near-far capture," results from stronger signals being received successfully while other stations transmit at the same time. Near-far capture leads to inequities, as throughput is greater for nearby stations while distant stations are starved. In infrastructure wireless LANs, where all communications occur through the AP, the inequity can be remedied by applying power control at the station (i.e., on the upUnk). By equalizing the signal strength received at the AP, all transmissions have equal probabilities of success.

A special IEEE 802.11 study group is working on enhancements to the MAC protocols that achieve acceptable QoS for Wireless LANs. Proposals for a QoS enhanced DCF (EDCF) mechanism and a QoS enhanced PCF (EPCF) mechanism are under review.

The proposed EDCF mechanism employs the Tiered Contention Multiple Access (TCMA) protocol. The basic access rules of TCMA are similar to CSMA with the following differences: transmission deferral and backoff countdown depend on the priority classification of the data. A station still waits for an idle time interval before attempting transmission following a busy period, but the length of this interval is no longer equal to DIFS. The length of an idle time interval is equal to the Arbitration-Time Inter-Frame Space (AIFS), which varies with the priority of the data. A shorter AIFS is associated with higher priority data. As a consequence, higher priority data gets to the channel faster. In addition, countdown of the backoff timer does not commence when a busy period completes unless the channel has been idle for a period equal to AIFS. This causes backoff countdown of lower priority frames to slow down and even freeze if there are higher-priority frames ready to transmit, a common occurrence in congestion.

The proposed EPCF maintains multiple traffic queues at the stations for different traffic categories. Higher-priority frames are scheduled for transmission first. Delays are reduced through improved polling-list management. Only active stations are kept on the polling list. A station with data to transmit must reserve a spot on that list, where it stays as long as it is active and for a limited number of inactive polling cycles. In the proposed draft standard, the reservation occurs inside the CFP, using a multi-channel ALOHA channel access mechanism to forward reservation requests. A priority mask is available to restrict contention by priority in case of congestion. Several of the features in EPCF are part of the MediaPlex protocol. The hybrid coordination function (HCF) has been proposed to provide a generalization of PCF. It allows for contention- free transfers to occur as needed; not necessarily at pre-determined regular repeat times as provided by the PCF. The AP can thus send (and possibly receive) data to stations in its BSS on a contention-free basis. This contention-free session, referred to as a contention-free burst (CFB), helps an AP transmit its traffic, which is typically heavier in infrastructure cells (since stations must communicate exclusively through the AP). As in the case of the PCF, the HCF permits access to the channel by the AP after waiting for an idle period of length equal to PIFS.

Attention has also been given by the study group to the problem of co-channel overlapping BSSs (OBSSs). Channel re-use in multiple-cell Wireless LANs poses a problem for the PCF and HCF, as contention-free sessions (CFSs) are generated without coordination among co-channel APs to help prevent time overlap. Some mechanism is needed in situations where cells are within interference range of each other. The existing standard does not provide adequate coordination for contention-free sessions in such situations. The DCF mechanism does not require special measures, as stations operating under the DCF mechanism deal with interference from stations in other cells in exactly the same manner as they deal with interference from stations in their own cell.

All stations within the cell operate on one duplex TDD channel, with only one station in each cell transmitting data at any given time. In order to preserve power, stations go into a sleeping mode, which prevents frequent changes of the operating channel. Channel assignments should thus be fixed or static. Static assignments permit slow adaptation to traffic pattern changes over the course of a day. Ideally, these fixed or static assignments must be made optimal through the use of fixed or adaptive non-regular channel assignment methods, which are based on measurement-derived re-use criteria known in the art. With such an approach, statistical interference relationships between cells are established from measurements of the signal strength between stations and APs in different cells.

Optimization methods use these relationships to assign the available channels to cells. Ad hoc channel assignment methods, like Dynamic Frequency Selection of HiperLAN2, can be used but with less promising results, as the re-use distances between co-channel cells are not selected optimally.

The limited number of channels available in the unlicensed band (three channels for IEEE 802. lib) will lead to a high degree of overlap in the coverage areas of co-channel cells. This overlap is exacerbated by the ad hoc placement of wireless LANs that results in overlapping BSAs. The channel time (or bandwidth) must thus be allocated among multiple co-channel cells in order to avoid interference. To be efficient, the channel should not remain idle if there is data waiting for transmission. Thus, while channel selection must be fixed or static, bandwidth allocation should be dynamic (possibly changing on a per-transmission basis).

A distributed dynamic bandwidth allocation mechanism is simply a distributed contention-based MAC protocol, which must enable sharing of the channel among APs and DCF stations in co-channel cells, as HCF and DCF co-exist. With APs accessing the channel to initiate contention-free sessions (CFPs or CFBs) before DCF stations, a prioritized distributed MAC protocol is needed. Such a protocol would also handle different priority DCF data. The priority-based distributed MAC protocol for

EDCF, TCMA, can be used to allocate the channel time among co- channel cells in a multiple-cell wireless LAN. The APs would be treated as a class with priority above the highest DCF priority class and would be assigned, therefore, a shorter AEFS than the highest-priority EDCF data. Other variations of CSMA are also appropriate.

In general, a carrier-sense-based MAC protocol would help avoid interference between cells as it causes conflicting transmissions - either DCF transmissions or CFSs - to occur at statistically (or deterministically, depending on the protocol) different times in co-channel cells.

The objective of dynamic bandwidth allocation is to promote fair access to the channel for all co-channel cells. That is, the success rate of a cell in accessing its assigned channel, either by its AP generating CFSs or by (E)DCF transmissions, should be independent of its location, assuming comparable traffic loads. Without fair access, transmissions can be delayed excessively in the disadvantaged cell, thus failing to meet QoS requirements. This goal is not realized with a traditional CSMA-type of protocol, however, when channel re-use is allowed because of a neighborhood capture effect. Neighborhood capture arises when Ethernet-type protocols are employed in multiple-cell wireless LANs that re-use radio frequency (RF) channels. Given the small number of channels available, co-channel cells cannot all transmit simultaneously without causing interference on one another. A carrier-sense contention-based MAC protocol can allocate channel bandwidth among co-channel cells dynamically and in a distributed manner; but if used in the conventional way, it may lead to channel capture. Mutually non-interfering co- channel neighbors could deprive other co-channel neighbors of access. In general, there will be instability, with the channel retained by a group of cells for long time intervals. This would have negative impact on quality of service (QoS).

Neighborhood capture arises in a multiple-cell wireless LAN with fewer channels available than the number of cells. Unlike in cellular communications networks, where sufficient channels are available to ensure interference-free transmission on an assigned channel, channel selection in WLAN networks must be accompanied by dynamic bandwidth allocation in order to avoid interference between co-channel cells. Carrier-sense multiple access (CSMA)-type media access control (MAC) protocols provide dynamic bandwidth allocation in a distributed manner, obviating the need for a central controller. With such protocols, time-overlapped transmissions by stations in non- interfering co-channel cells cooperate to capture the channel for long time periods. The resulting neighborhood capture is deleterious to QoS because of the ensuing access delays in other co-channel cells.

The present invention addresses neighborhood capture and establishes a method to prevent its occurrence. SUMMARY OF THE INVENTION

The neighborhood capture problem described above is mitigated by requiring that the channel be released by all stations at prespecified times, ideally regularly spaced. All co-channel cells are thus given an equal opportunity to contend for the channel. Slotted CSMA does not eliminate all inequities; it simply eliminates unfairness due to the synergy of the cells in a re-use group in capturing the channel, at the expense of co-channel cells outside that group. Traffic loads must be equally distributed across both cells and re-use groups for all stations to have the same success rate in seizing the channel. Additionally a variety of schronization schemes can be employed to correct time offsets.

One aspect of the invention is a method to enable overlapping first and second wireless LAN cells in a medium to have an equal chance at establishing a session on the medium. Each cell includes a respective plurahty of member stations. A first member station in the first cell transmits a timing packet containing a timestamp value, which is received at a second member station in the second cell. The timing packet can be the beacon frame packet or the probe response frame packet of the IEEE 802.11 standard, in which the packet carries a superframe timestamp field. This synchronizes member stations in the first and second cells to interrupt transmissions at a global channel release instant corresponding to the timestamp value. The member stations in the first and second cells then have the opportunity to contend for access to the medium following the global channel release instant. Each of the member stations in the first and second cells has a superframe clock that is synchronized based on the timestamp value. This enables establishing a periodic global channel release instant at the member stations during each of a plurality of periodic superframes based on the clock. The member stations can then periodically interrupt transmissions at the periodic global channel release instant to contend for the medium. The periodic global channel release instant occurs at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical voice and video applications. The contention for access to the medium is by a slotted CSMA/CA access method that takes place following the periodic global channel release instant.

The resulting invention provides a dynamic bandwidth allocation scheme to promote fair access to the channel for all co-channel cells. It enables the success rate of a cell in accessing its assigned channel to be independent of its location, assuming comparable traffic loads. The invention provides a dynamic bandwidth allocation scheme that meets QoS requirements.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention is best described with reference to the detailed description and the following figures.

Fig. 1 shows a three-cell co-channel group. Fig. 1 A shows the three-cell co-channel group of Fig.

1, in which station 3 transmits a beacon packet with a superframe timestamp that synchronizes the SF clock in each station, thereby enabling global channel release (GCR) by all stations.

Fig. IB shows the three-cell co-channel group of Fig. 1A, at a later target beacon transmission time (TBTT) in which

Wireless station 5 transmits its beacon frame packet 100', relaying a superframe timestamp value that is updated with the passage of time since its receipt from station 3.

Fig. 2 depicts capture by re-use group A-C. Fig. 3 illustrates a four-cell co-channel group.

Fig. 4 shows the capture effect mitigated. Fig. 5 depicts the global channel release of the present invention with one busy period (BP) per frame.

Fig. 6 illustrates the global channel release of the present invention with multiple busy periods (BPs) per superframe.

Fig. 7 depicts a three-cell co-channel group as depicted in Fig. 1 with the addition of the wired distribution network, showing the beacon packet with the superframe timestamp that synchronizes the SF clock in each station, thereby enabling global channel release (GCR) by all stations. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The neighborhood capture effect can be understood by considering a multiple-cell WLAN where three cells have been assigned the same channel. The cells assigned to the same channel are referred to as a co-channel group. As illustrated in Fig. 1, the three cells A, B, and C comprise nine stations. Cells are depicted as dotted circles. The stations are labeled numerically and the cells are labeled with alphabetic characters. Stations 1, 2, and 3 make up cell A with station 3 serving as the AP for cell A. Stations 4, 5, and 6 make up cell B with station 4 as cell B's AP. Stations 7, 8, and 9 make up cell C with station 9 as the AP for cell C. Cells A and C are not within interference range of each other, so they are called a re-use group. Stations in the pair of cells A-B or B-C are, however, within possible interference range of one another. In the A-B cell pair, station 2 of cell A and station 5 of cell B are both in the possible interference range of one another. Correspondingly, in the B-C cell pair, station 6 of cell B and station 7 of cell C are both in the possible interference range of one another. All stations use a CSMA-type of protocol to access the channel, which involves some form of carrier-sensing (either actual or virtual). A station will refrain from transmitting while the channel is busy, and transmission will be deferred until the backoff timer expires. Backoff countdown occurs while the channel is sensed idle and an idle time interval equal to the AEFS for the priority of the pending transmission has elapsed following a busy period.

Because different cells hear different transmissions, depending on their location relative to other co-channel cells, their backoff countdown rates are different. As a consequence, cell B will have difficulty accessing the channel. In Fig. 2, the periods during which the channel is busy as a result of transmissions generated in each cell are shown separately. Busy periods are separated by the Short Inter-Frame Spaces (SIFS) and idle time slots needed for AIFS and backoff delay. (AIFS equals a SIFS plus a variable number of time slots.) A station in cell A may transmit at the same time as stations in cell C. Stations in cell A must refrain from transmitting only when stations in cell B are transmitting. Stations in cell B are preempted from accessing the channel by transmissions in either of its interfering neighbors, cells A or C.

Because transmissions have variable lengths, it is very likely under loaded traffic conditions for a station in cell A to start a transmission before a transmission in cell C expires, and vice versa. As a result, cells A and C will capture the channel, not allowing a chance for stations in cell B to transmit. In general, one would expect that periphery cells, or cells at the top or bottom floors of a multiple- story building equipped with a multiple-cell WLAN, to be likely to capture the channel, at the expense of cells in the same co-channel group located in the interior. In this instance, a cell is disadvantaged not only because its competition for the channel - namely, the re-use group comprising cells A and C - has a greater combined offered load, but also because selected station members of a re-use group may transmit simultaneously, thus prolonging their retention of the channel. As can be seen from Fig. 2, the only traffic from cell B to be transmitted was high-priority. All other traffic from cell B was blocked by traffic from cells A and C even though the traffic from cells A and C was medium- and even low-priority.

Even when all cells have the same degree of competition from neighbors in the same co-channel group, there is still a problem. Consider the situation in Fig. 3 illustrating four cells, each cell having two competing co-channel neighbors. Once again the cells are labeled with alphabetic characters, the stations are labeled numerically and the cells are depicted by dotted circles. Two re-use groups exist in this co-channel group of cells: one comprising cells A and C, and another comprising cells B and D. As before, under loaded traffic conditions, a station in cell A may start a transmission before completion of a transmission in cell C, thus failing to release the channel for access by cells B and D. The same is true for stations in cells B and D. If a station in either cell seizes the channel, it will not be released until there is no pending traffic in the other cell. Assuming the offered loads in the two groups of non-interfering cells are the same, they have equal probability of capturing the channel; hence, there is no a priori unfairness in this instance. Once the channel is accessed by one re-use group, however, it will be captured and the other group deprived access. In general, instability in channel access would result, with long channel retention periods by each re-use group.

The neighborhood capture effect will be worse if traffic loads are balanced across cells, as the synergy of cells in the same re-use group is maximum in that case. Equal traffic loading across cells is desirable for fair access in a multiple-cell WLAN, as the probability of accessing the channel successfully within a cell decreases with increasing load. In order to avoid unfairness, it is desirable to size cells (through AP power adjustment) so that the traffic loads in all cells are equal. Load balancing magnifies the negative impact of neighborhood capture, however, as the channel will be released only if there is no pending traffic in another cell of the same re-use group. A re-use group thus achieves the maximum retention probability if its combined load is equally split among its members. Neighborhood capture has a negative impact on QoS delivery. Transmissions in cells outside the re-use group capturing the channel will be delayed excessively as transmissions will find the channel busy for long time intervals. In consequence, CFPs could not be initiated as scheduled and periodic and time-critical data will be delayed. The prioritization apparatus put in place for EDCF will also be rendered ineffective.

Neighborhood capture can be reduced or eliminated by requiring all stations to release the channel at prespecified times. All competing co-channel cells would thus have an equal chance to seize the channel. Global channel release (GCR) should occur at regularly spaced time intervals that are sufficiently close to meet delay and jitter restrictions for time-critical applications such as voice or video. This implies slotting of the channel into superframes and synchronization of all stations. The resulting protocol would be a Slotted CSMA/CA. Fig. 4 shows how neighborhood capture is mitigated in the three-cell co-channel scenario of Fig. 1 as a result of the global channel release requirement of the present invention.

As shown in Fig. 1A, the wireless station 3 transmits a timing packet, such as the beacon frame packet 100 or probe response frame packet of the IEEE 802.11 standard, carrying a superframe timestamp field. Each station receiving the timing packet 100 updates its SF clock if the received timestamp is later than the current value of the clock. The initial setting of the clock when a station powers on is 0. All stations in an IBSS cell prepare to transmit a beacon frame packet at a target beacon transmission time (TBTT). Each station prepares its beacon packet to contain the superframe timestamp value. Each station selects a random delay when it is to transmit its superframe timestamp value. In this manner, the superframe timestamp value is propagated to overlapped stations, such as wireless station 5 in Figure 1A. At a later target beacon transmission time (TBTT) of Fig. IB, wireless station 5 will relay a superframe timestamp value that is updated with the passage of time since its receipt, when it transmits its beacon frame packet 100'. In this manner, wireless stations, such as station 9, which may be out of range of wireless station 3, will receive an updated superframe timestamp value. Other timing packets that can propagate the updated superframe timestamp value include the probe response frame packet and the contention-free time response (CFTR) packet described in the copending patent application entitled "HYBRID COORDINATION FUNCTION (HCF) ACCESS THROUGH TIERED CONTENTION AND OVERLAPPED WIRELESS CELL MITIGATION," which is incorporated by reference.

The MAC protocol allocates channel time among the following: control and data frames and contention-free sessions (both CFPs and CFBs). CFSs may include all frame exchange sequences generated without contention following a successful channel contention-based access attempt, where contention is avoided through the use of SIFS spacing. A CFS may involve one or more stations and may be initiated by any station. For simplicity, the generic term busy period (BP) is used to designate any of the above.

Different MAC protocols may be used to access the channel for the different BP types. All of the MAC protocols, however, are distributed and based on carrier-sensing. BPs are all assigned an AEFS; EDCF stations are assigned AEFS values according to their priority classification; CFPs and CFBs are assigned the shortest possible AIFS value.

Capture is mitigated by requiring that the channel be free of all activity at pre-specified times - termination of the busy period (TBPend). The channel time is slotted at equal time intervals, thus creating superframes (SF) of duration SFDuration. BPs may complete before the next frame boundary. As a result, the BPs that follow must be foreshortened in order to ensure termination of the BP at the designated slotted time. This length adjustment will account also for idle time spent for AIFS and backoff delay. Fig. 5 illustrates how equal-size BPs of length BPLength are foreshortened in order to meet the global channel release requirement. Stations that attempt access unsuccessfully using a short reservation packet (RTS/CTS) may be able to use the channel within the same superframe. After first engaging in backoff, stations may transmit concurrently with successful transmissions, provided that they do not interfere. Their BPs may have to be foreshortened in order to release the channel at the next TBPend, however. GCR does not eliminate all inequities. By forcing stations to end their BPs at the same time, equal access is offered to all stations in all cells, as there is no synergy of member cells of the same re-use group in retaining the channel. If traffic loads are equally distributed across cells and re-use groups, all stations have a fair/equal chance at the channel. But if the combined offered load is greater in one re-use group, as is possible for instance with group A-C which has more stations, the success rate of cell B would be less. GCR improves the success rate of cell B, however, relative to what the success rate would have been otherwise. To achieve greater fairness, traffic loads in all re-use groups must be comparable - hence the need to balance loads not only across cells, but also across re-use groups.

It is not necessary for GCR to occur after each data frame or CFS; it may happen less often. Fig. 6 illustrates BPs of maximum-length BPLength shorter than the superframe duration. In general, there may be multiple BPs per superframe.

In order to avoid their BPs straddling the superframe boundary, all stations in the multiple-cell WLAN must be synchronized. Synchronization may be achieved in several ways. For instance, within a cell, stations may synchronize with the AP, as is done in the current IEEE 802.11 standard. Neighboring cells may be synchronized via frames sent by stations in the overlapping coverage area of two cells. However, time offsets may arise between different cells as distant cells [cells that cannot hear each other] power on and synchronize locally, independently of one another. This would happen early in the morning when few stations are on. As more stations power on and synchronize with their neighbors in the course of the day, asynchrony may arise. Clock adjustment is necessary in order to eliminate time offsets.

Time offsets between cells may be corrected in a way similar to node synchronization in an independent BSS. As shown in Fig. 7, the stations transmit a special frame, such as the beacon packet 100 or probe response frame of IEEE 802.11, carrying a superframe timestamp field. Each station updates its SF clock if the received timestamp is later. The initial setting of the clock when a station powers on is 0.

Other mechanisms are also possible for synchronization. For instance, synchronization between cells may be pursued through the wired distribution system in infrastructure WLANs.

Fig. 7 depicts a three-cell co-channel group similar to that depicted in Fig. 1 with the addition of the wired distribution network 110, which is in communication with each cell via the cell's AP. Synchronization between cells can be maintained by transmitting the superframe timestamp over the wired distribution system 110. Additionally, stations in each cell can communicate with each other and with stations in other cells via the AP, which is in communication with the wired distribution network 110. For example, if station 1 in cell A has data/communication traffic for station 7 in cell C, then when station 1 is polled by AP 3 of cell A, station 1 indicates that it has data for station 7 of cell C and the priority of the data. The AP 3 can then poll station 1 to send the data to the AP 3. If AP 3 is within wireless communication range of AP 9 in cell C, it can attempt to gain channel access to the wireless medium to communicate that data to AP 9. If channel access is granted, then AP 3 of cell A forwards station l's data frames over the wireless medium to AP 9. Alternately, AP 3 can access the wired distribution network to forward the frames to station 9 of cell C for final distribution to station 7 of cell C. The AP can use the IEEE 802.3 protocol to access the wired distribution network 110.

The phenomenon of neighborhood capture, which arises in a multiple-cell wireless LAN with fewer channels available than the number of cells, has been described herein. Unlike in cellular communications networks where sufficient channels are available to ensure interference-free transmission on an assigned channel, channel selection in WLAN networks must be accompanied by dynamic bandwidth allocation in order to avoid interference between co-channel cells. CSMA-type MAC protocols provide dynamic bandwidth allocation in a distributed manner, obviating the need for a central controller. With such protocols, time-overlapped transmissions by stations in non-interfering co-channel cells cooperate to capture the channel for long time periods. The result is deleterious to QoS because of the ensuing access delays in other co-channel cells.

The problem of neighborhood channel capture can be mitigated by requiring that the channel be released by all stations at prespecified times, ideally regularly spaced. All co-channel cells are thus given an equal opportunity to contend for the channel. Slotted CSMA does not eliminate all inequities ,but rather simply eliminates unfairness due to the synergy of the cells in a re-use group in capturing the channel at the expense of co-channel cells outside that group. Traffic loads must be equally distributed (balanced) across both cells and re-use groups for all stations to have the same success rate in seizing the channel.

It should be clear from the foregoing that the objectives of the invention have been met. While particular embodiments of the present invention have been described and illustrated, it should be noted that the invention is not limited thereto since modifications may be made by persons skilled in the art. The present application contemplates any and all modifications within the spirit and scope of the underlying invention disclosed and claimed herein.

Claims

CLAIMSWhat Is Claimed Is:
1. A method to enable overlapping first and second wireless LAN cells in a medium to have an equal chance at establishing a session on the medium, each cell including a respective plurality of member stations, comprising: transmitting by a first member station in the first cell, a timing packet containing a timestamp value; receiving the timing packet at a second member station in the second cell; interrupting transmissions by member stations in the first and second cells at a global channel release instant corresponding to said timestamp value; and permitting member stations in the first and second cells to contend for access to said medium following said global channel release instant.
2. The method of claim 1, which further comprises: synchronizing a superframe clock in member stations in the first and second cells based on said timestamp value; establishing a periodic global channel release instant at member stations in the first and second cells during each of a plurality of periodic superframes based on said clock; and periodically interrupting transmissions at member stations in the first and second cells at said periodic global channel release instant.
3. The method of claim 2, which further comprises: periodically permitting member stations in the first and second cells to contend for access to said medium following said periodic global channel release instant.
4. The method of claim 3, which further comprises: said periodic global channel release instant occurring at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical voice applications.
5. The method of claim 3, which further comprises: said periodic global channel release instant occurring at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical video applications.
6. The method of claim 3, which further comprises: said member stations in the first and second cells contending for access to said medium using a slotted CSMA/CA access method following said periodic global channel release instant.
7. The method of claim 6, which further comprises: conducting a distributed coordination function (DCF) session by one of said member stations in the first and second cells that has successfully accessed the medium following said periodic global channel release instant.
8. The method of claim 6, which further comprises: conducting a Tiered Contention Multiple Access (TCMA) session by one of said member stations in the first and second cells that has successfully accessed the medium following said periodic global channel release instant.
9. The method of claim 6, which further comprises: conducting a point coordination function (PCF) session by one of said member stations in the first and second cells that has successfully accessed the medium following said periodic global channel release instant.
10. The method of claim 6, which further comprises: requiring that the medium be free of all activity at the termination of a busy period; detecting completion of a busy period before a next periodic global channel release instant; and foreshortening a subsequent busy period in order to ensure termination of the subsequent busy period at a next periodic global channel release instant.
11. A method of distributed dynamic bandwidth allocation for mitigating the effects of neighborhood capture in an infrastructure
WLAN, comprising the steps of: time-slotting of a communications channel into superframes of superframe duration (SFDuration) by a MAC protocol, wherein said superframes comprise control and data frames and busy periods (BPs), wherein said BPS comprise contention-free periods
(CFPs) and contention-free bursts (CFBs); assigning each BP an Arbitration-Time Inter-Frame
Space (AEFS); further assigning each enhanced distributed coordination function (EDCF) station AEFS values according to said station's priority classification; further assigning CFPs and CFBs the shortest possible AEFS values; further assigning available channels to cells; polling stations within a cell by an access point (AP) to determine if said stations within said cell have communications traffic to transmit; attempting to gain access to said communications channel by means of a contention-based scheme using a short reservation packet by said AP if said AP determined that said stations within said cell had communications traffic to transmit; performing frame exchanges if channel access is gained; gaining access to said communications channel by one of waiting for a backoff period and re-attempting to gain access to said communication channel in the event that a transmission by another cell is less than a full time slot if channel access was not gained and waiting to attempt to gain access until a next time slot; performing a global channel release (GCR) of all channels at pre-specified intervals; and continuing to perform the above steps.
12. The method according to claim 11, wherein said contention-based scheme is based on carrier-sensing.
13. The method according to claim 11, wherein said BPs are foreshortened if necessary to meet GCR requirements.
14. The method according to claim 11, wherein said GCR may occur less frequently than after each BP if BPs are shorter than said SFDuration.
15. The method according to claim 11, wherein said distributed dynamic bandwidth allocation scheme gives all co-channels an equal opportunity to contend for said communication channel.
16. The method according to claim 11, wherein said GCR is performed at regularly spaced intervals.
17. The method according to claim 11, wherein communication traffic loads are balanced across cells and re-use groups.
18. The method according to claim 11, wherein cells in a multiple cell WLAN are synchronized to avoid BPs straddling a boundary of said superframe.
19. The method according to claim 18, wherein stations within a cell are synchronized with said cell's access point (AP).
20. The method according to claim 18, wherein neighboring cells synchronize with frames sent by stations in an overlapping coverage area of said neighboring cells.
21. The method according to claim 18, wherein time offsets are corrected by stations transmitting a special frame carrying a timestamp field.
22. The method according to claim 21, wherein each station updates its clock upon receipt of said special frame having said timestamp field.
23. The method according to claim 19, wherein synchronization between cells is accomplished via a wired distribution system in communication with said APs.
24. A multiple-cell wireless local area network including overlapping first and second wireless LAN cells in a medium, each cell including a respective plurality of member stations, comprising: a first member station in the first cell, transmitting a timing packet containing a timestamp value; a second member station in the second cell receiving the timing packet; said member stations in the first and second cells interrupting transmissions at a global channel release instant corresponding to said timestamp value; and said member stations in the first and second cells contending for access to said medium following said global channel release instant.
25. The network of claim 24, which further comprises: said member stations in the first and second cells synchronizing a superframe clock based on said timestamp value; said member stations in the first and second cells establishing a periodic global channel release instant during each of a plurality of periodic superframes based on said clock; and said member stations in the first and second cells periodically interrupting transmissions at said periodic global channel release instant.
26. The network of claim 25, which further comprises: said member stations in the first and second cells periodically contending for access to said medium following said periodic global channel release instant.
27. The network of claim 26, which further comprises: said periodic global channel release instant occurring at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical voice applications.
28. The network of claim 26, which further comprises: said periodic global channel release instant occurring at intervals that are sufficiently close to meet delay and jitter restrictions for time-critical video applications.
29. The network of claim 26, which further comprises: said member stations in the first and second cells contending for access to said medium using a slotted CSMA/CA access method following said periodic global channel release instant.
30. The network of claim 29, which further comprises: said member stations in the first and second cells detecting completion of a busy period before a next periodic global channel release instant; and said member stations in the first and second cells foreshortening a subsequent busy period in order to ensure termination of the subsequent busy period at a next periodic global channel release instant.
31. The network of claim 29, which further comprises: one of said member stations in the first and second cells conducting a distributed coordination function (DCF) session, said one of said member stations having successfully accessed the medium following said periodic global channel release instant.
32. The network of claim 29, which further comprises: one of said member stations in the first and second cells conducting a Tiered Contention Multiple Access (TCMA) session, said one of said member stations having successfully accessed the medium following said periodic global channel release instant.
33. The network of claim 29, which further comprises: one of said member stations in the first and second cells conducting a point coordination function (PCF) session, said one of said member stations having successfully accessed the medium following said periodic global channel release instant.
34. A multiple-cell wireless local area network (WLAN) using distributed dynamic bandwidth allocation for mitigating the effects of neighborhood capture, comprising: a wired distribution network; and a plurality of cells, each cell having a plurality of stations, wherein one of said stations in each cell is an access point (AP), and further wherein communications between said plurality of stations is via said AP and where said plurality of stations are within one of a same cell and a different cell, and further wherein communications between one of said stations and said wired distribution network is via said AP, and further wherein stations in some different cells overlap; wherein said wired distribution network allocates time- slots of a communications channel into superframes of superframe duration (SFDuration) using a MAC protocol, wherein said superframes comprise control frames and data frames and busy periods (BPs), wherein said BPs comprise contention-free periods (CFPs) and contention-free bursts (CFBs); further wherein said wired distribution network assigns each BP an Arbitration-Time Inter-Frame Space (AEFS); further wherein said wired distribution network assigns each enhanced distributed coordination function (EDCF) station AIFS values according to said station's priority classification; further wherein said wired distribution network assigns CFPs and CFBs the shortest possible AIFS values; further wherein stations within each cell are polled by their respective AP to determine if said stations within said cell have communications traffic to transmit; further wherein each said AP attempts to gain access to said communications channel by means of a contention-based scheme using a short reservation packet if each said AP determines that said stations within said cell have communications traffic to transmit; further wherein each said AP that gained access to said communications channel performs frame exchanges with said wired distribution network; further wherein said AP that had communications traffic to transmit and that did not gain access to said communications channel re-attempts to gain access to said communications channel by one of waiting for a backoff period and attempting to gain access to said communication channel in the event that a transmission by another cell is less than a full time slot and waiting to attempt to gain access until a next time slot; further wherein each said AP and said wired distribution network perform a global channel release (GCR) of all channels at pre- specified intervals.
35. The WLAN according to claim 34, wherein said contention-based scheme is based on carrier-sensing.
36. The WLAN according to claim 34, wherein said BPs are foreshortened if necessary to meet GCR requirements.
37. The WLAN according to claim 34, wherein said GCR may occur less frequently than after each BP if BPs are shorter than said SFDuration.
38. The WLAN according to claim 34, wherein said distributed dynamic bandwidth allocation scheme gives all co-channels an equal opportunity to contend for said communication channel.
39. The WLAN according to claim 34, wherein said GCR is performed at regularly spaced intervals.
40. The WLAN according to claim 34, wherein communication traffic loads are balanced across cells and re-use groups.
41. The WLAN according to claim 34, wherein cells in said multiple-cell WLAN are synchronized to avoid BPs straddling a boundary of said superframe.
42. The method according to claim 41, wherein stations within a cell are synchronized with said cell's access point (AP).
43. The WLAN according to claim 41, wherein neighboring cells synchronize with frames sent by stations in an overlapping coverage area of said neighboring cells.
44. The WLAN according to claim 41, wherein time offsets are corrected by stations transmitting a special frame carrying a timestamp field.
45. The WLAN according to claim 44, wherein each station updates its clock upon receipt of said special frame having said timestamp field.
46. The WLAN according to claim 45, wherein synchronization between cells is accomplished via a wired distribution system in communication with said APs.
PCT/US2002/036425 2000-11-03 2002-10-28 Wireless lans and neighborhood capture WO2003039054A3 (en)

Priority Applications (24)

Application Number Priority Date Filing Date Title
US33093001 true 2001-11-02 2001-11-02
US09985257 US7095754B2 (en) 2000-11-03 2001-11-02 Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US60/330,930 2001-11-02
US09/985,257 2001-11-02
US33103001 true 2001-11-07 2001-11-07
US60/331,030 2001-11-07
US33121101 true 2001-11-13 2001-11-13
US60/331,211 2001-11-13
US34234301 true 2001-12-21 2001-12-21
US60/342,343 2001-12-21
US10/187,132 2002-06-28
US10187132 US7277413B2 (en) 2001-07-05 2002-06-28 Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US10/256,299 2002-09-27
US10/256,471 2002-09-27
US10/256,309 2002-09-27
US10256516 US7180905B2 (en) 2001-11-02 2002-09-27 Access method for periodic contention-free sessions
US10256309 US7245605B2 (en) 2001-11-02 2002-09-27 Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (CPMA) contention-free sessions
US10/256,516 2002-09-27
US10256299 US7248600B2 (en) 2001-11-02 2002-09-27 ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US10256471 US7277415B2 (en) 2001-11-02 2002-09-27 Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
US10256384 US7280517B2 (en) 2001-11-02 2002-09-27 Wireless LANs and neighborhood capture
US10/256,305 2002-09-27
US10256305 US7245604B2 (en) 2001-11-02 2002-09-27 Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
US10/256,384 2002-09-27

Publications (2)

Publication Number Publication Date
WO2003039054A2 true true WO2003039054A2 (en) 2003-05-08
WO2003039054A3 true WO2003039054A3 (en) 2004-02-26

Family

ID=27583788

Family Applications (6)

Application Number Title Priority Date Filing Date
PCT/US2002/036425 WO2003039054A3 (en) 2000-11-03 2002-10-28 Wireless lans and neighborhood capture
PCT/US2002/034585 WO2003043357A1 (en) 2000-11-03 2002-10-29 Access method for periodic contention-free sessions
PCT/US2002/034433 WO2003041427A1 (en) 2000-11-03 2002-10-29 'shield': protecting high priority channel access attempts in overlapped wireless cells
PCT/US2002/034430 WO2003041428A1 (en) 2000-11-03 2002-10-29 Staggered startup for cyclic prioritized multiple acess (cpma) contention-free sessions
PCT/US2002/034434 WO2003041343A3 (en) 2000-11-03 2002-10-29 Fixed deterministic post-backoff for cyclic prioritized multiple access (cpma) contention-free sessions
PCT/US2002/034406 WO2003041346A1 (en) 2000-11-03 2002-10-29 Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (cpma) contention-free sessions

Family Applications After (5)

Application Number Title Priority Date Filing Date
PCT/US2002/034585 WO2003043357A1 (en) 2000-11-03 2002-10-29 Access method for periodic contention-free sessions
PCT/US2002/034433 WO2003041427A1 (en) 2000-11-03 2002-10-29 'shield': protecting high priority channel access attempts in overlapped wireless cells
PCT/US2002/034430 WO2003041428A1 (en) 2000-11-03 2002-10-29 Staggered startup for cyclic prioritized multiple acess (cpma) contention-free sessions
PCT/US2002/034434 WO2003041343A3 (en) 2000-11-03 2002-10-29 Fixed deterministic post-backoff for cyclic prioritized multiple access (cpma) contention-free sessions
PCT/US2002/034406 WO2003041346A1 (en) 2000-11-03 2002-10-29 Preemptive packet for maintaining contiguity in cyclic prioritized multiple access (cpma) contention-free sessions

Country Status (1)

Country Link
WO (6) WO2003039054A3 (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1515484A1 (en) * 2003-09-09 2005-03-16 Broadcom Corporation Method and system for optimal load balancing in a hybrid wired/wireless network
WO2005117350A1 (en) * 2004-05-27 2005-12-08 Detewe Systems Gmbh Smooth handover in a wireless local area network
US7027462B2 (en) 2001-01-02 2006-04-11 At&T Corp. Random medium access methods with backoff adaptation to traffic
WO2006041708A2 (en) * 2004-10-06 2006-04-20 Motorola, Inc. Sync bursts for frequency offset compensation
EP1661414A1 (en) * 2003-08-28 2006-05-31 Motorola, Inc., A Corporation of the State of Delaware; Passive probing for handover in a local area network
US7095754B2 (en) 2000-11-03 2006-08-22 At&T Corp. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US7136361B2 (en) 2001-07-05 2006-11-14 At&T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
US7180905B2 (en) 2001-11-02 2007-02-20 At & T Corp. Access method for periodic 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
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
WO2007082247A1 (en) * 2006-01-11 2007-07-19 Qualcomm Incorporated Communications method and apparatus for transmitting priority information via beacon signals
US7248600B2 (en) 2001-11-02 2007-07-24 At&T Corp. ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
US7277415B2 (en) 2001-11-02 2007-10-02 At&T Corp. Staggered startup for cyclic prioritized multiple access (CPMA) contention-free sessions
US7280517B2 (en) 2001-11-02 2007-10-09 At&T Corp. Wireless LANs and neighborhood capture
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
US8595501B2 (en) 2008-05-09 2013-11-26 Qualcomm Incorporated Network helper for authentication between a token and verifiers
US8811369B2 (en) 2006-01-11 2014-08-19 Qualcomm Incorporated Methods and apparatus for supporting multiple communications modes of operation
CN1969480B (en) 2004-06-16 2014-09-17 皇家飞利浦电子股份有限公司 Wireless communication system, communication method using thereof and wireless communication device
WO2015063367A1 (en) * 2013-10-28 2015-05-07 Nokia Technologies Oy Improving communication efficiency
EP3091773A4 (en) * 2014-01-26 2017-03-01 Huawei Technologies Co., Ltd. Competition method, apparatus and system for channel of unlicensed frequency band

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8483105B2 (en) 2003-10-15 2013-07-09 Qualcomm Incorporated High speed media access control
US8472473B2 (en) 2003-10-15 2013-06-25 Qualcomm Incorporated Wireless LAN protocol stack
US8233462B2 (en) 2003-10-15 2012-07-31 Qualcomm Incorporated High speed media access control and direct link protocol
US8462817B2 (en) 2003-10-15 2013-06-11 Qualcomm Incorporated Method, apparatus, and system for multiplexing protocol data units
US9226308B2 (en) 2003-10-15 2015-12-29 Qualcomm Incorporated Method, apparatus, and system for medium access control
US7352772B2 (en) 2003-12-19 2008-04-01 Lenovo Singapore Pte. Ltd. Minimization of performance impact in overlying 802.11b and 802.11g networks
WO2005062542A1 (en) * 2003-12-22 2005-07-07 Telefonaktiebolaget Lm Ericsson (Publ) A method in a communication system
US8903440B2 (en) 2004-01-29 2014-12-02 Qualcomm Incorporated Distributed hierarchical scheduling in an ad hoc network
US7564814B2 (en) 2004-05-07 2009-07-21 Qualcomm, Incorporated Transmission mode and rate selection for a wireless communication system
US8401018B2 (en) 2004-06-02 2013-03-19 Qualcomm Incorporated Method and apparatus for scheduling in a wireless network
US8600336B2 (en) 2005-09-12 2013-12-03 Qualcomm Incorporated Scheduling with reverse direction grant in wireless communication systems

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5142533A (en) * 1991-03-28 1992-08-25 Motorola, Inc. Method for controlling the scheduling of multiple access to communication resources
US5355375A (en) * 1993-03-18 1994-10-11 Network Systems Corporation Hub controller for providing deterministic access to CSMA local area network
US5416780A (en) * 1991-06-28 1995-05-16 Network Access Corporation Telecommunications system and protocol for avoiding message collisions on a multiplexed communications link

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4682165A (en) * 1985-11-04 1987-07-21 Motorola, Inc. Apparatus for inhibiting repetitive message detections in a zone batched communication system
JPH0677963A (en) * 1992-07-07 1994-03-18 Hitachi Ltd Communication system and terminal equipment
GB9304636D0 (en) * 1993-03-06 1993-04-21 Ncr Int Inc A method of accessing a communication system
JPH08163130A (en) * 1994-12-02 1996-06-21 Nec Corp Access control system for radio lan
JP3349853B2 (en) * 1994-12-27 2002-11-25 富士通株式会社 Wireless lan system
US6343071B1 (en) * 1995-01-11 2002-01-29 Simtek Corporation Wireless desktop area network system
JP3349861B2 (en) * 1995-03-17 2002-11-25 富士通株式会社 Wireless lan system
US5768267A (en) * 1995-10-18 1998-06-16 Telefonaktiebolaget Lm Ericsson Method for system registration and cell reselection
CA2166343C (en) * 1995-12-29 1999-08-10 Lee F. Hartley Carrier sense collision avoidance with auto abort
US6047175A (en) * 1996-06-28 2000-04-04 Aironet Wireless Communications, Inc. Wireless communication method and device with auxiliary receiver for selecting different channels
FR2753863B1 (en) * 1996-09-20 1999-04-02 An issuance of digital satellite information from several ground stations
US6011784A (en) * 1996-12-18 2000-01-04 Motorola, Inc. Communication system and method using asynchronous and isochronous spectrum for voice and data
US5987033A (en) * 1997-09-08 1999-11-16 Lucent Technologies, Inc. Wireless lan with enhanced capture provision
US6067291A (en) * 1997-09-23 2000-05-23 Lucent Technologies Inc. Wireless local area network with enhanced carrier sense provision
WO1999019991A1 (en) * 1997-10-14 1999-04-22 Alation Digital radio-frequency transceiver
US6272117B1 (en) * 1998-02-20 2001-08-07 Gwcom, Inc. Digital sensing multi access protocol
JP4015750B2 (en) * 1998-05-14 2007-11-28 株式会社東芝 Active array antenna system
EP1348271A4 (en) * 2000-10-06 2006-05-10 Cognio Inc Systems and methods for interference mitigation among multiple wlan protocols
US7305004B2 (en) * 2001-01-16 2007-12-04 At&T Corp. Interference suppression methods for 802.11

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5142533A (en) * 1991-03-28 1992-08-25 Motorola, Inc. Method for controlling the scheduling of multiple access to communication resources
US5416780A (en) * 1991-06-28 1995-05-16 Network Access Corporation Telecommunications system and protocol for avoiding message collisions on a multiplexed communications link
US5355375A (en) * 1993-03-18 1994-10-11 Network Systems Corporation Hub controller for providing deterministic access to CSMA local area network

Cited By (54)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7095754B2 (en) 2000-11-03 2006-08-22 At&T Corp. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US7864674B2 (en) 2000-11-03 2011-01-04 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US7983271B2 (en) 2000-11-03 2011-07-19 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US8532134B2 (en) 2000-11-03 2013-09-10 At&T Intellectual Property Ii, L.P. Tiered contention multiple access (TCMA): a method for priority-based shared channel access
US7664132B2 (en) 2001-01-02 2010-02-16 At&T Corp. Random medium access methods with backoff adaptation to traffic
US7027462B2 (en) 2001-01-02 2006-04-11 At&T Corp. Random medium access methods with backoff adaptation to traffic
US7274708B2 (en) 2001-01-02 2007-09-25 At&T Corp. Random medium access methods with backoff adaptation to traffic
US7136361B2 (en) 2001-07-05 2006-11-14 At&T Corp. Hybrid coordination function (HCF) access through tiered 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
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
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
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
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
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
US7379432B2 (en) 2001-07-05 2008-05-27 At&T Corp. Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
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
US7280517B2 (en) 2001-11-02 2007-10-09 At&T Corp. 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
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
US7248600B2 (en) 2001-11-02 2007-07-24 At&T Corp. ‘Shield’: protecting high priority channel access attempts in overlapped wireless cells
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
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
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
US7983232B2 (en) 2001-11-02 2011-07-19 At&T Intellectual Property Ii, L.P. Wireless LANs and neighborhood capture
US7245604B2 (en) 2001-11-02 2007-07-17 At&T Corp. Fixed deterministic post-backoff for cyclic prioritized multiple access (CPMA) contention-free sessions
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
US7180905B2 (en) 2001-11-02 2007-02-20 At & T Corp. Access method for periodic 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
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
US7995544B2 (en) 2001-11-02 2011-08-09 At&T Intellectual Property Ii, L.P. Wireless LANs and neighborhood capture
US7936725B2 (en) 2003-08-28 2011-05-03 Motorola Solutions, Inc. Passive probing for handover in a local area network
EP1661414A4 (en) * 2003-08-28 2009-05-06 Motorola Inc Passive probing for handover in a local area network
EP1661414A1 (en) * 2003-08-28 2006-05-31 Motorola, Inc., A Corporation of the State of Delaware; Passive probing for handover in a local area network
EP1515484A1 (en) * 2003-09-09 2005-03-16 Broadcom Corporation Method and system for optimal load balancing in a hybrid wired/wireless network
WO2005117350A1 (en) * 2004-05-27 2005-12-08 Detewe Systems Gmbh Smooth handover in a wireless local area network
CN1969480B (en) 2004-06-16 2014-09-17 皇家飞利浦电子股份有限公司 Wireless communication system, communication method using thereof and wireless communication device
WO2006041708A2 (en) * 2004-10-06 2006-04-20 Motorola, Inc. Sync bursts for frequency offset compensation
US7961828B2 (en) 2004-10-06 2011-06-14 Motorola Mobility, Inc. Sync bursts frequency offset compensation
WO2006041708A3 (en) * 2004-10-06 2006-08-17 Motorola Inc Sync bursts for frequency offset compensation
US8902860B2 (en) 2006-01-11 2014-12-02 Qualcomm Incorporated Wireless communication methods and apparatus using beacon signals
US8879520B2 (en) 2006-01-11 2014-11-04 Qualcomm Incorporated Wireless communication methods and apparatus supporting wireless terminal mode control signaling
US8811369B2 (en) 2006-01-11 2014-08-19 Qualcomm Incorporated Methods and apparatus for supporting multiple communications modes of operation
US8804677B2 (en) 2006-01-11 2014-08-12 Qualcomm Incorporated Methods and apparatus for establishing communications between devices with differing capabilities
US8902865B2 (en) 2006-01-11 2014-12-02 Qualcomm Incorporated Wireless communication methods and apparatus supporting multiple modes
WO2007082245A1 (en) * 2006-01-11 2007-07-19 Qualcomm Incorporated Communications method and apparatus for transmitting priority information via beacon signals
WO2007082247A1 (en) * 2006-01-11 2007-07-19 Qualcomm Incorporated Communications method and apparatus for transmitting priority information via beacon signals
US9277481B2 (en) 2006-01-11 2016-03-01 Qualcomm Incorporated Wireless communication methods and apparatus supporting different types of wireless communciation approaches
US9369943B2 (en) 2006-01-11 2016-06-14 Qualcomm Incorporated Cognitive communications
US8595501B2 (en) 2008-05-09 2013-11-26 Qualcomm Incorporated Network helper for authentication between a token and verifiers
WO2015063367A1 (en) * 2013-10-28 2015-05-07 Nokia Technologies Oy Improving communication efficiency
US9173233B2 (en) 2013-10-28 2015-10-27 Nokia Technologies Oy Communication efficiency
EP3091773A4 (en) * 2014-01-26 2017-03-01 Huawei Technologies Co., Ltd. Competition method, apparatus and system for channel of unlicensed frequency band
US10028150B2 (en) 2014-01-26 2018-07-17 Huawei Technologies Co., Ltd. Method and system for contending for channel of unlicensed frequency band, and apparatus

Also Published As

Publication number Publication date Type
WO2003039054A3 (en) 2004-02-26 application
WO2003041343A3 (en) 2003-07-10 application
WO2003041346A1 (en) 2003-05-15 application
WO2003041428A1 (en) 2003-05-15 application
WO2003041427A1 (en) 2003-05-15 application
WO2003043357A1 (en) 2003-05-22 application
WO2003041343A2 (en) 2003-05-15 application

Similar Documents

Publication Publication Date Title
US7054329B2 (en) Collision avoidance in IEEE 802.11 contention free period (CFP) with overlapping basic service sets (BSSs)
US7075890B2 (en) System and method to provide fairness and service differentation in ad-hoc networks
US6795418B2 (en) Wireless MAC protocol based on a hybrid combination of slot allocation, token passing, and polling for isochronous traffic
Garces et al. Collision avoidance and resolution multiple access for multichannel wireless networks
US20030128684A1 (en) Coexistence of modulation schemes in a WLAN
US7164671B2 (en) Overlapping network allocation vector (ONAV) for avoiding collision in the IEEE 802.11 WLAN operating under HCF
US20030128659A1 (en) Coexistence of OFDM and DSSS/CCK stations in a WLAN
US20030063655A1 (en) System and method for establishing bluetooth communications
US20030169763A1 (en) Coexistence of stations capable of different modulation schemes in a wireless local area network
US20090103501A1 (en) Decentralized Media Access Control for Ad-Hoc Mobile Wireless Network
US20060068820A1 (en) Wireless communication system, wireless communication apparatus and wireless communication method, and computer program
US20040240426A1 (en) Method for enhancing fairness and performance in a multihop ad hoc network and corresponding system
US20080002636A1 (en) Multi-user MAC protocol for a local area network
US7274708B2 (en) Random medium access methods with backoff adaptation to traffic
US20040258040A1 (en) System and method to maximize channel utilization in a multi-channel wireless communiction network
EP1998499A1 (en) Polling for peer-to-peer traffic
US20070019591A1 (en) Fair rate allocation on an ieee 802.11e communication medium
US20070165589A1 (en) Radio communication system, radio communication apparatus, radio communication method, and computer program
US20110205998A1 (en) Scheduling of Isochronous Traffic in Time and Frequency To Reduce Contention
US20050227615A1 (en) Wireless communication system, wireless communication apparatus, wireless communication method and computer program
US20060159041A1 (en) Method to achieve fast active scan in 802.11 wlan
US20040047319A1 (en) Contention-based medium access control for ad hoc wireless piconets
US20060280152A1 (en) Multi-channel MAC method for WLAN devices with a single radio interface and system for implementing the same
US7843819B1 (en) Protocol for wireless multi-channel access control
US7643509B2 (en) Hybrid implicit token carrier sensing multiple access/collision avoidance protocol

Legal Events

Date Code Title Description
AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG UZ VN YU ZA ZM ZW

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
WWW Wipo information: withdrawn in national office

Country of ref document: JP

NENP Non-entry into the national phase in:

Ref country code: JP