HCF Channel Access And Inter-BSS Channel Sharing

Slides:



Advertisements
Similar presentations
March 2001 Sid Schrum, et al., Texas InstrumentsSlide 1 doc.: IEEE /163 Submission p-DCF Proposal Summary Sid Schrum, Jin-Meng Ho, Khaled Turki.
Advertisements

IEEE CSMA/CA DCF CSE 6590 Fall /7/20141.
Doc.: IEEE /080r1 Submission January 2001 Jie Liang, Texas InstrumentsSlide 1 Jie Liang Texas Instruments Incorporated TI Blvd. Dallas,
Doc.: IEEE /630r1a Submission S. Choi, Philips Research November 2001 Slide 1 HC Recovery and Backoff Rules Sunghyun Choi and Javier del Prado.
Doc.: IEEE /630r4a Submission S. Choi, Philips Research January 2002 Slide 1 HC Recovery and Backoff Rules Sunghyun Choi and Javier del Prado.
Achieving Quality of Service in Wireless Networks A simulation comparison of MAC layer protocols. CS444N Presentation By: Priyank Garg Rushabh Doshi.
Dynamic Bandwidth Scheduling for QoS Enhancement over IEEE WLAN Sangwook Kang, Sungkwan Kim, Mingan Wang, Sunshin An Korea University European Wireless.
Doc.: IEEE /605r3 Submission November 2001 S. Kandala, et. al. Slide 1 CFB Ending Rule under HCF Srinivas Kandala, Ken Nakashima, Yashihiro Ohtani.
MAC layer Taekyoung Kwon. Media access in wireless - start with IEEE In wired link, –Carrier Sense Multiple Access with Collision Detection –send.
Submission doc.: IEEE /569r1 November 2001 M. Benveniste -- AT&T Labs, ResearchSlide 1 An Access Mechanism for Periodic Contention-Free Sessions.
WLAN. Networks: Wireless LANs2 Distribute Coordination Function (DCF) Distributed access protocol Contention-Based Uses CSMA/ CA – Uses both physical.
doc.: IEEE /243r2 Submission May 2001 Mathilde Benveniste, AT&T Labs - ResearchSlide 1 Proposed Changes to the e D1.0 Draft Mathilde Benveniste.
Doc.: IEEE /243r1 Submission May 2001 Mathilde Benveniste, AT&T Labs - ResearchSlide 1 Proposed Changes to the e D1.0 Draft Mathilde Benveniste.
Doc.: IEEE /171 Submission July 2001 Mathilde Benveniste, AT&T Labs - ResearchSlide 1 HCF Access through Tiered Contention Mathilde Benveniste.
January 2001 Don Shaver, et.al. Texas InstrumentsSlide 1 doc.: IEEE /036 Submission Enhanced Contention Period Proposal for QoS and Throughput.
Design and Implementation of a Reservation-based MAC Protocol for Voice/Data over IEEE Ad-Hoc Wireless Networks Shiann-Tsong Sheu, Tzu-Fang Sheu.
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
Submission doc.: IEEE /599r1 November 2001 M. Benveniste -- AT&T Labs, ResearchSlide 1 ‘Cyclic Prioritized Multiple Access (CPMA): An Access Mechanism.
November 2000 Jin-Meng Ho, Texas InstrumentsSlide 1 doc.: IEEE /367 Submission p-DCF for Prioritized MAC Service Jin-Meng Ho, Sid Schrum, and.
November 2000 Jin-Meng Ho, Texas InstrumentsSlide 1 doc.: IEEE /367r1 Submission p-DCF for Prioritized MAC Service (Expanded version based on.
Doc.:IEEE /517r0 Submission August 2002 IBM Research Slide 1 Some Clarifications to IEEE e, Draft 3.2, August 2002 H.L. Truong and G. Vannuccini.
Doc.:IEEE /566r2 Submission November 2001 S. Choi, Philips & M.M. Wentink, Intersil Slide 1 Multiple Frame Exchanges during EDCF TXOP Sunghyun.
Submission doc.: IEEE /596r1 November 2001 M. Benveniste -- AT&T Labs, ResearchSlide 1 ‘Neighborhood Capture’ in Wireless LANs Mathilde Benveniste.
IEEE MAC Ikjun Yeom. Computer Network Physical Layer: network card, wire/wireless Datalink Layer: data delivery in a link Network Layer: addressing,
Doc.: IEEE /110 Submission May 2000 Sunghyun Choi, Philips ResearchSlide 1 QoS Support in : Contention-Free MAC Perspective Sunghyun Choi.
AIFS – Revisited Mathilde Benveniste
EA C451 (Internetworking Technologies)
Topics in Distributed Wireless Medium Access Control
HCF and EDCF Simulations
An Access Mechanism for Periodic Contention-Free Sessions
AP access procedure for UL MU operation
IEEE : Wireless LANs ALOHA, Slotted ALOHA
ECA Overview (Enhanced Contention Access)
IEEE Wireless LAN wireless LANs: untethered (often mobile) networking
Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Proposal for Collaborative BT and b MAC Mechanisms.
HCF medium access rules
EDCF TXOP Bursting Simulation Results
AIFS – Revisited Mathilde Benveniste
Specification overview
Hybrid Coordination Function (HCF) Frame Exchange and NAV Details
Texas Instruments Incorporated
Specification overview
Overlapping BSS Co-Existence
Overlapping BSS Co-Existence
Burst Transmission and Acknowledgment
EDCF Issues and Suggestions
Specification overview
Group Polling for DCF Based Reservation Request
Clarification on Some HCF Frame Exchange Rules
HCF medium access rules
Neighborhood Capture and OBSS
Clarification on Some HCF Frame Exchange Rules
Suggested changes to Tge D3.3
Overlapping BSS Co-Existence
DL MU MIMO Error Handling and Simulation Results
HCF medium access rules
Specification overview
Suggested changes to Tge D3.3
Introduction to the TGe Hybrid Coordination Function (HCF)
July 2007 doc.: IEEE /2090r0 Aug 2007 Discussion on CCA Sensing on 20/40 MHz Secondary Channel with PIFS and DIFS Date: Authors: Notice:
HCF medium access rules
More Simulations on Secondary CCA
NAV Operation Rules under HCF
802.11g Contention Period – Solution for Co-existence with Legacy
HCF Channel Access And Inter-BSS Channel Sharing
Burst Transmission and Acknowledgment
Reserving STA Date: Authors: January 2011 January 2011
Infocom 2004 Speaker : Bo-Chun Wang
‘Shield’: Protecting High-Priority Channel Access Attempts
NAV Operation Rules under HCF
Presentation transcript:

HCF Channel Access And Inter-BSS Channel Sharing Jin-Meng Ho, Sid Schrum, Khaled Turki, and Donald P. Shaver Texas Instruments Incorporated 12500 TI Blvd. Dallas, Texas 75243 (214) 480-1994 (Ho) jinmengho@ti.com

HC Channel Access The HC senses the channel before it attempts to initiate a CFB. If the channel has been idle for one PIFS, the HC sends a frame. If the channel is busy, the HC defers the transmission until one PIFS following the end of the busy period. PIFS HC senses HC transmits PIFS HC senses HC transmits Channel Busy

HC Access Recovery -- I If the HC expects a response following the end of a transmission from itself, and finds the channel to be busy within one SIFS but cannot correctly receive a frame, the HC shall not reclaim the channel before the end of the TXOP applicable to a WSTA. The TXOP may be an explicitly allocated TXOP or the time required for sending a QOS CF-Ack frame. The HC shall defer to the end of the busy period or the TXOP, whichever is longer, and then invocate the DCF backoff procedure using PIFS for DIFS and CWHCmin for CWmin. CWHCmin is a MIB parameter of default value 3. From another BSS HC HC SIFS SIFS PIFS PIFS Backoff Backoff TXOP TXOP Channel Busy Channel Busy WSTA WSTA WSTA TXOP > Busy Period TXOP < Busy Period Scenario 1 Scenario 2

HC Access Recovery -- II If the HC expects a response following the end of a transmission from itself, and finds the channel to be idle after one SIFS, the HC shall access the channel by the backoff procedure specified above, with the PIFS measuring from the end of that transmission. If the HC successfully receives a frame from the station that had failed to send the expected response to the HC, in the course of the backoff and within the applicable TXOP following the transmission, the HC shall ignore the backoff timer and consider the TXOP operation to have been successful. Channel Idle Channel Idle HC HC SIFS SIFS WSTA WSTA Backoff Backoff PIFS PIFS From another BSS Scenario 1 Scenario 2

WSTA Access Recovery If a WSTA does not receive an expected response within one SIFS of the end of a transmission from itself, the WSTA shall reclaim the channel one PIFS after the end of that transmission if sufficient TXOP remains for completing transmission of a frame exchange sequence. From another BSS SIFS HC HC WSTA WSTA PIFS TXOP From another BSS Scenario 1 Scenario 2

Channel Sharing An HC shall not extend, in duration, a CFB beyond aMaxCFBLimit defined in the MIB. This enables channel sharing between inter-BSS stations. This provides bandwidth for contention access. An HC shall not regain the channel within aMinCFBSpacing (a MIB parameter) interval of the preceding CFB it supported. Within a CFB, all transmissions are separated by a SIFS. SIFS PIFS CFB length  aMaxCFBLimit Separation  aMinCFBSpacing CFB length  aMaxCFBLimit CFB CFB

HC Contention Window A small contention window is adequate for resolving HC-HC collision. Such collision occurs between 2 or 3 cochannel BSSs in practice. A three-way overlapping is equivalent to a two-way overlapping in reality. A small contention window is adequate and desirable for resolving HC-STA collision. The colliding STA (in an overlapping BSS) should have a larger backoff to allow the HC to reclaim the channel. A small contention window is desirable for enabling the HC to have a higher priority access than non-HC stations after a collision. Non-HC stations should wait for a longer time based on larger (E)DCF contention windows. A small contention window is desirable for minimizing channel idle overhead. HC should always use the same contention window to backoff regardless of the presence of overlapping BSSs. This makes the inter-BSS channel sharing normative and fair. The contention window need not be doubled as overlapping BSS collision is highly asymmetric and dynamic and may be resolved by a retransmission.

Normative Text

Normative Text (Cont)