Is IEEE 802.11 TSF Scalable?. IEEE 802.11: how large can it be? Bandwidth: Up to 54 Mbps Good for a few hundred nodes Timing Synchronization Function.

Slides:



Advertisements
Similar presentations
SELF-ORGANIZING MEDIA ACCESS MECHANISM OF A WIRELESS SENSOR NETWORK AHM QUAMRUZZAMAN.
Advertisements

Submission doc.: IEEE /1357r3 Nov Slide 1 Dynamic TIM and Page Segmentation Date: Authors: Weiping Sun, Seoul National University.
Lecture 9: Multiple Access Protocols
Wireless MACs (reprise): Overlay MAC Brad Karp UCL Computer Science CS 4C38 / Z25 24 th January, 2006.
Fundamentals of Computer Networks ECE 478/578 Lecture #9: Collision Resolution and Collision Free Protocols Instructor: Loukas Lazos Dept of Electrical.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
Ethernet. Review Media Access Control – Broadcast media shared by all stations – MAC is used to determine who gets the right to send Developed protocol.
1 An Approach to Real-Time Support in Ad Hoc Wireless Networks Mark Gleeson Distributed Systems Group Dept.
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3p: Medium Access Control Protocols.
Multiple Access Methods. When nodes or stations are connected and use a common link (cable or air), called a multipoint or broadcast link, we need a.
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Nov 2011 Neng Xue Tianxu Wang.
Is IEEE Scalable?. IEEE : how large can it be? Bandwidth: Up to 54 Mbps Good for a few hundred nodes Timing Synchronization Function Not.
Is IEEE TSF Scalable? L. Huang, T.H. Lai, On the scalability of IEEE ad hoc networks, MobiHoc 2002.
1 Version 3.0 Module 6 Ethernet Fundamentals. 2 Version 3.0 Why is Ethernet so Successful? In 1973, it could carry data at 3 Mbps Now, it can carry data.
MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.
Chapter 14 LAN Systems Ethernet (CSMA/CD) ALOHA Slotted ALOHA CSMA
EEC-484/584 Computer Networks Lecture 7 Wenbing Zhao
An Energy-efficient MAC protocol for Wireless Sensor Networks
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
Efficient MAC Protocols for Wireless Sensor Networks
Doc.: IEEE /0112r4 Submission Supporting Authentication/Association for Large Number of Stations September 2012 Slide 1 I2R Date:
Binary Exponential Backoff Binary exponential backoff refers to a collision resolution mechanism used in random access MAC protocols. This algorithm is.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
FiWi Integrated Fiber-Wireless Access Networks
1 Computer Communication & Networks Lecture 12 Datalink Layer: Multiple Access Waleed Ejaz
1 Computer Communication & Networks Lecture 13 Datalink Layer: Local Area Network Waleed Ejaz
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
Submission doc.: IEEE /1250r0 Oct Shusaku Shimada Yokogawa Co. Slide 1 TSF Timer Freq. Management and Measurement Procedure (TFM 2 P) Date:
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
Time Synchronization in based MANETs Ten H. Lai Ohio State University.
جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.
Cisco 3 - Switching Perrine. J Page 16/4/2016 Chapter 4 Switches The performance of shared-medium Ethernet is affected by several factors: data frame broadcast.
Y. Jeong, J. Ma, ICU doc.: IEEE /1027r0 Clock Synchronization Issue in the IEEE TGs September 2004 Slide 1 Clock Synchronization Issue.
Medium Access Control Sub Layer
Multiple Access.
1 An Energy-efficient MAC protocol for Wireless Sensor Networks Wei Ye, John Heidemann, Deborah Estrin IEEE infocom /1/2005 Hong-Shi Wang.
Priority Scheduling in Wireless Ad Hoc Networks Xue Yang and NitinVaidya University of Illinois at Urbana-Champaign.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Rami Melhem Sameh Gobriel & Daniel Mosse Modeling an Energy-Efficient MAC Layer Protocol.
SMAC: An Energy-efficient MAC Protocol for Wireless Networks
Introduction to IEEE
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
Introduction to Wireless Ad Hoc and Sensor Networks: From IEEE to Berkeley Motes Wireless Ten-Hwang Lai Ohio State University.
Jingbin Zhang( 張靜斌 ) †, Gang Zhou †, Chengdu Huang ‡, Sang H. Son †, John A. Stankovic † TMMAC: An Energy Efficient Multi- Channel MAC Protocol for Ad.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
CS541 Advanced Networking 1 Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang 4/20/2009.
Energy-Efficient, Application-Aware Medium Access for Sensor Networks Venkatesh Rajenfran, J. J. Garcia-Luna-Aceves, and Katia Obraczka Computer Engineering.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Oregon Graduate Institute1 Sensor and energy-efficient networking CSE 525: Advanced Networking Computer Science and Engineering Department Winter 2004.
Cascading : An Overview of the Strategy Yujie Zhu and Raghupathy Sivakumar GNAN Research Group, Georgia Tech Energy-Efficient Communication Strategy for.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Time Synchronization in based MANETs Ten H. Lai Ohio State University.
Submission doc.: IEEE /596r1 November 2001 M. Benveniste -- AT&T Labs, ResearchSlide 1 ‘Neighborhood Capture’ in Wireless LANs Mathilde Benveniste.
COMPUTER NETWORKS Data-link Layer (The Medium Access Control Sublayer) MAC Sublayer.
An Energy-efficient MAC protocol for Wireless Sensor Networks
CT301 LECTURE 8.
Wireless Ad Hoc/Sensor Networks: From IEEE 802
Services of DLL Framing Link access Reliable delivery
Ultra-Low Duty Cycle MAC with Scheduled Channel Polling
Is IEEE TSF Scalable? L. Huang, T.H. Lai,
Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.
Time Synchronization in based MANETs
MBCA and Beacon Timing element clean up
Presentation transcript:

Is IEEE TSF Scalable?

IEEE : how large can it be? Bandwidth: Up to 54 Mbps Good for a few hundred nodes Timing Synchronization Function Not scalable How to fix it?

802.11’s Time Sync Function (I) Time divided into beacon intervals, each containing a beacon generation window. Each station: waits for a random number of slots; transmits a beacon (if no one else has done so). Beacon: several slots in length. window beacon interval

802.11’s Time Sync Function (II) Beacon contains a timestamp. On receiving a beacon, STA adopts beacon’s timing if T(beacon) > T(STA). Clocks move only forward. faster adopts 12:0112:00 slower not adopts 12:01 12:02 12:01

Problems with ’s TSF Faster clocks synchronize slower clocks. Equal opportunity for nodes to generate beacons. 1:10 1:11 1:12 1:13 1:14 1:15 1:13 1:14 1:15 1:16 1:17 1:18 1:19 1:21 1:23 1:18 1:19 1:21 1: :21 1:22 1:23 1:25 1:28 1:31 1:23 1:25 1:28 1:31

The Out-of-Sync Problem When number of stations increases Fastest station sends beacons less frequently Stations out of synchronization

Two Types of Out-of-Sync Fastest-station out-of-sync – fastest station is out of sync with all others. k-global out-of-sync – k percent of links are out of sync. Questions: How often? For how long?

Fastest-station out-of-sync (1) Clock1 and Clock2: two fastest clocks d = their difference in accuracy T = length of beacon interval (0.1 sec.) Clock drift: d*T per beacon interval. In  /(d*T) intervals, fastest-station will be out of sync with all others. T

Fastest-station out-of-sync (2) n = number of stations. w = size of beacon window. P’(n,w) = prob(fastest station wins beacon contention)

Prob(Fastest station sends a beacon)

Fastest-station out-of-sync (3) H = # beacon intervals with F.S. out-of-sync. L = # beacon intervals between async periods. E(R) = E(H)/[E(H)+E(L)] = percent of time in which the fastest station is out of sync with all others. LH

How often does fastest-node get out of sync with others?

Percentage of time fastest station out of sync with all others a 54 Mbps ∆ = 224  s d = 0.003%

How often does 25%-async occur?

Percentage of time with 25 percent of links out-of-sync a 54 Mbps ∆ = 224  s d = 0.01%

How to fix it? Desired properties: simple, efficient, and compatible with current TSF. Causes of out-of-sync Unidirectional clocks Equal beacon opportunity Single beacon per interval Beacon contention (collision) 1n1n Prob <

Improve fastest station’s chance Let the fastest station contend for beacon generation more frequently than others.

Adaptive Clock Sync Protocol Station x participates in beacon contention once every C(x) intervals. Initially, C(x) =1. Always, 1 < C(x) < Cmax. Dynamically adjust C(x): x faster C(x) +1 x slower C(x) -1

Once the protocol converges Fastest station, C(x) =1 Other stations, C(x) = Cmax (Cmax= ?)

What if the fastest node leaves the IBSS? The previously second fastest now becomes the fastest. Its C(x) will decrease to 1.

What if a new fastest node enters the IBSS? The previously fastest now no longer the fastest. Its C(x) will increase to Cmax.

Compatible with current TSF Suppose some nodes do not implement the new protocol.

Performance Performance of TSFPerformance of TSF ATSP ATSP.pdfATSP.pdf TATSP Performance of Modified TSFPerformance of Modified TSF

Performance of TSF

Performance of ATSP

Performance of Modified TSF

Modified TSF Divide stations into three groups: Group 1: C(x) = Cmax1 = 1 Group 2: C(x) = Cmax2 = a small number Group 3: C(x) = Cmax3 = a large number

Summary Showed: the IEEE Timing Sync Function (TSF) is not scalable. Proposed: a simple remedy compatible with the current TFS.

What’s Next? IBSS: single-hop MANET: multihop transmission range