Achieving Spectrum Efficiency Lili Qiu University of Texas at Austin 1.

Slides:



Advertisements
Similar presentations
Achieving High Data Rates in a Distributed MIMO System
Advertisements

Chorus: Collision Resolution for Efficient Wireless Broadcast Xinyu Zhang, Kang G. Shin University of Michigan 1.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Interference Alignment and Cancellation EE360 Presentation Omid Aryan Shyamnath Gollakota, Samuel David Perli and Dina Katabi MIT CSAIL.
R2 R3 R4 R5 AP The throughput does not grow in the same way as wireless demands Limited wireless spectrum & unlimited user demands AP R1 R6.
Fine-grained Channel Access in Wireless LAN SIGCOMM 2010 Kun Tan, Ji Fang, Yuanyang Zhang,Shouyuan Chen, Lixin Shi, Jiansong Zhang, Yongguang Zhang.
BBN: Throughput Scaling in Dense Enterprise WLANs with Blind Beamforming and Nulling Wenjie Zhou (Co-Primary Author), Tarun Bansal (Co-Primary Author),
MIMO As a First-Class Citizen in Kate C.-J. Lin Academia Sinica Shyamnath Gollakota and Dina Katabi MIT.
– Wireless PHY and MAC Stallings Types of Infrared FHSS (frequency hopping spread spectrum) DSSS (direct sequence.
Comparison of different MIMO-OFDM signal detectors for LTE
Living with Interference in Unmanaged Wireless Environments David Wetherall, Daniel Halperin and Tom Anderson Intel Research & University of Washington.
CDMA X RTT Overview. Global 3G Evolution.
DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks 1 Xinyu Zhang, Kang G. Shin University of Michigan.
Prof.R.K.NADESH;SITE;VIT MEDIUM ACCESS CONTROL Wireless channel is a shared medium MAC coordinates transmission between users sharing the spectrum Goals:
DOMINO: Relative Scheduling in Enterprise Wireless LANs Wenjie Zhou (Co-Primary Author), Dong Li (Co-Primary Author), Kannan Srinivasan, Prasun Sinha 1.
SourceSync: A Distributed Architecture for Sender Diversity Hariharan Rahul Haitham Hassanieh Dina Katabi.
Overcoming the Antennas-Per-AP Throughput Limit in MIMO Shyamnath Gollakota Samuel David Perli and Dina Katabi.
Z IG Z AG D ECODING : C OMBATING H IDDEN T ERMINALS IN W IRELESS N ETWORKS Shyamnath Gollakota and Dina Katabi MIT CSAIL SIGCOMM 2008 Presented by Paul.
On the Coded Complex Field Network Coding Scheme for Multiuser Cooperative Communications with Regenerative Relays Caixi Key Lab of Information.
2/12/20021 IEEE Wireless Local Area Networks The future is wireless Presented by Tamer Khattab and George Wong Prepared for EECE571N - Advanced.
CS640: Introduction to Computer Networks Aditya Akella Lecture 22 - Wireless Networking.
Overview of Wireless LANs Use wireless transmission medium Issues of high prices, low data rates, occupational safety concerns, & licensing requirements.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Improvements in throughput in n The design goal of the n is “HT” for High Throughput. The throughput is high indeed: up to 600 Mbps in raw.
AutoMAC : Rateless Wireless Concurrent Medium Access Aditya Gudipati, Stephanie Pereira, Sachin Katti Stanford University.
Orthogonal Frequency Division Multiple Access (OFDMA)
Symphony: Orchestrating Collisions in Enterprise Wireless Networks Tarun Bansal (Co-Primary Author), Bo Chen (Co-Primary Author), Prasun Sinha and Kannan.
Joint PHY-MAC Designs and Smart Antennas for Wireless Ad-Hoc Networks CS Mobile and Wireless Networking (Fall 2006)
Autumn2004 © University of Surrey SatComms A - part 4 - B G Evans 4.1 Satellite Communications A Part 4 Access Schemes in Satellite Networks -Professor.
Next Generation n Dina Katabi Jointly with Kate Lin and Shyamnath Gollakota.
Medium Access Control NWEN302 Computer Network Design.
Support WiFi and LTE Co-existence
Ger man Aerospace Center Gothenburg, April, 2007 High Spectral Efficient and Flexible Next Generation Mobile Communications Simon Plass, Stephan.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
MEDIUM ACCESS CONTROL Wireless channel is a shared medium MAC coordinates transmission between users sharing the spectrum Goals: prevent collisions while.
Harnessing Frequency Diversity in Wi-Fi Networks Apurv Bhartia Yi-Chao Chen Swati Rallapalli Lili Qiu MobiCom 2011, Las Vegas, NV The University of Texas.
4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.
X. Li, W. LiuICC May 11, 2003A Joint Layer Design Smart Contention Resolution Random Access Wireless Networks With Unknown Multiple Users: A Joint.
Fast Resilient Jumbo Frames in Wireless LANs Apurv Bhartia University of Texas at Austin Joint work with Anand Padmanabha Iyer, Gaurav.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
1 A General Model of Wireless Interference Lili Qiu, Yin Zhang, Feng Wang, Mi Kyung Han University of Texas at Austin Ratul Mahajan Microsoft Research.
1 Orthogonal Frequency- Division Multiplexing (OFDM) Used in DSL, WLAN, DAB, WIMAX, 4G.
WLAN.
MIMO: Challenges and Opportunities Lili Qiu UT Austin New Directions for Mobile System Design Mini-Workshop.
CSCI 465 D ata Communications and Networks Lecture 23 Martin van Bommel CSCI 465 Data Communications & Networks 1.
CRMA: Collision Resistant Multiple Access Lili Qiu University of Texas at Austin Joint work with Tianji Li, Mi Kyung Han, Apurv Bhartia, Eric Rozner, Yin.
FD-MMAC: Combating Multi-channel Hidden and Exposed Terminals Using a Single Transceiver Yan Zhang, Loukas Lazos, Kai Chen, Bocan Hu, and Swetha Shivaramaiah.
Data and Computer Communications Tenth Edition by William Stallings Data and Computer Communications, Tenth Edition by William Stallings, (c) Pearson Education.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
MAC Protocols for Sensor Networks
Wireless Communication
244-6: Higher Generation Wireless Techniques and Networks
Wireless Communication
Medium Access Control MAC protocols: design goals, challenges,
Lecture 27 WLAN Part II Dr. Ghalib A. Shah
Multiple Access Problem: When two or more nodes transmit at the same time, their frames will collide and the link bandwidth is wasted during collision.
Co-BCast: High-Rate WiFi Broadcasting in Crowded Scenarios via Lightweight Coordination of Multiple Access Points Hang Qiu, Konstantinos Psounis, Giuseppe.
An Overview of ax Greg Kamer – Consulting Systems Engineer.
MIMO III: Channel Capacity, Interference Alignment
Colorado School of Mines
Considerations on AP Coordination
Considerations on AP Coordination
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.
CSMA/CN: Carrier Sense Multiple Access with Collision Notification
No Time to Countdown: Backing Off in Frequency Domain
DL MU MIMO Error Handling and Simulation Results
Two-Way Coding by Beam-Forming for WLAN
Strawmodel ac Specification Framework
Presentation transcript:

Achieving Spectrum Efficiency Lili Qiu University of Texas at Austin 1

Motivation Explosive increasing user traffic Spectrum crisis [NewYorkTimes12, CNET12, …] Urgent need of new technologies to dramatically increase spectrum efficiency 2

Our Work Spectrum sharing – Develop an efficient MAC for multiple nodes to efficiently share the medium Spectrum access – Develop and implement multi-point to multi- point MIMO 3

Our Work Spectrum sharing – Develop an efficient MAC for multiple nodes to share the medium Spectrum access – Develop and implement multi-point to multi- point MIMO 4

CRMA: Collision Resistant Multiple Access Joint work with Tianji Li, Mi Kyung Han, Apurv Bhartia, Eric Rozner, Yin Zhang, Brad Zarikoff ACM MobiCom

Motivation Traditional MAC protocols avoid collisions – FDMA, TDMA, FTDMA, CSMA, … Avoid collisions  large overhead – FDMA: unoccupied channel and guard band – TDMA: global coordination and centralized scheduling – CSMA: carrier sense overhead, hidden terminals, exposed terminals 1500-byte frame: 29% for a (54Mbps) and 72% for n (600Mbps) TCP ACK: 77% overhead for a and 83% overhead for n –…–… 6

Collision Avoidance  Collision Resistance Let collisions happen naturally and decode collisions 7

Our Contributions New encoding/decoding to allow multiple signals transmitted on the same channel Collision resistant medium access protocol (CRMA) based on the encoding/decoding Evaluation to show CRMA is a promising direction for spectrum sharing 8

CRMA: An Illustrating Example 9 Channel 1 Channel 2 S1R1 S2 R2 Randomly pick a channel? - 50% collisions! Coordinate to avoid using the same channel? -Large overhead especially for lots of dynamic flows

CRMA: An Illustrating Example 10 Channel 1 Channel 2 Frame 1 Frame 2 Frame 1 Frame 2 S1R1 S2 R2

CRMA: An Illustrating Example 11 Channel 1 Channel 2 Frame 1 Frame 2 Frame 1 Frame 2 S1R1 S2 R2

CRMA: Research Questions 12 Channel 1 Channel 2 Frame 1 Frame 2 Frame 1 Frame 2 AB C D

CRMA: Research Questions 13 Channel 1 Channel 2 Frame 1 Frame 2 Frame 1 Frame 2 AB C D -What is the code c? -How do the sender and receiver agree on the code?

CRMA: Research Questions 14 Channel 1 Channel 2 Frame 1 Frame 2 Frame 1 Frame 2 AB C D - What is the code c? -How do the sender and receiver agree on the code? -How to decode transmissions? -How to handle decoding failures? -How to decode misaligned collisions? -How to limit # transmissions in a collision? -How to enhance spectrum utilization?

CRMA -What is the code c? -How do the sender and receiver agree on the code? -How to decode transmissions? -How to handle decoding failures? -How to decode misaligned collisions? -How to limit # transmissions in a collision? -How to enhance spectrum utilization? 15

Code Selection We use a binary code for simplicity – C(i,f)=1 if transmitter i uses channel f, otherwise 0 16 Channel 1 Channel 2 Channel 3

Code Selection We use a binary code for simplicity – C(i,f)=1 if transmitter i uses channel f, otherwise 0 17 Channel 1 Channel 2 Channel 3

Code Selection We use a binary code – c(i,f)=1 if transmitter i uses channel f, otherwise 0 18 Channel 1 Channel 2 Channel 3

Code Selection (Cont.) 19

CRMA -What is the code c? -How do the sender and receiver agree on the code? -How to decode transmissions? -How to handle decoding failures? -How to decode misaligned collisions? -How to limit # transmissions in a collision? -How to enhance spectrum utilization? 20

Code Establishment Using control channel – The sender and receiver negotiate the code on a separate control channel In band notification – Each frame has two PN sequences to denote sender and receiver IDs – A receiver correlates the received signal with its ID to determine if the frame is destined to itself with senders’ IDs to determine who send traffic – Correlation is close to 0 except when perfectly aligned with the IDs  works under collisions! – In-band processing but no need for control channel 21

CRMA -What is the code c? -How do the sender and receiver agree on the code? -How to decode transmissions? -How to handle decoding failures? -How to decode misaligned collisions? -How to limit # transmissions in a collision? -How to enhance spectrum utilization? 22

Decoding Transmissions Detect frame arrival and departure – Correlate the received signal with the preamble and postamble – Correlation is close to 0 except when perfectly aligned with preamble or postamble 23 Accurate preamble detection (e.g., false positive and false negative ratios are 0 when SINR=-2).

Decoding Transmissions (Cont.) 24

Handling Decoding Failures Use ACKs and retransmissions to enhance reliability ACKs are sent in the same way as data frames – Receiver sends an ACK on the same set of selected channels – Sender decodes the ACK by solving a linear system (as decoding data frame) 25

Problem of Misaligned Collisions 26 Symbol 1 Symbol 2 FFT window

Handling Misaligned Collisions 27 CP i-1 CP i CP i+1 CP i-1 CP i CP i+1 Symbol i-1 Symbol i+1 offset FTT window Cyclic prefix (CP) allows collided symbols fall in the same FFT window

Handling Misaligned Collisions 28 CP i-1 CP i CP i+1 CP i-1 CP i CP i+1 Symbol i-1 Symbol i+1 offset FTT window same

Other Design Components 29

Evaluation Methodology Testbed experiments show feasibility – Implement CRMA on top of the default OFDM implementation in USRP – 5 GHz, BPSK, 200 subcarriers, each 1.95KHz Qualnet simulations evaluate efficiency – Compare CRMA w/ and wo/ virtual flows, CSMA/CA (multiple channels), WiFi (one channel), random access – 1000-byte frames, 16 QAM, 20MHz total spectrum divided into 10 channels – 700 MHz for long distance, and 5 GHz for short distance networks 30

Testbed Experiments (Cont.) SINR (dB)High SINRLow SINR 025% 198%95% 398%95% 5100%98% 799%0.09% 31 Delivery rate of 1000-byte frames High decoding rate when 1 ≤ SINR ≤ 5, and degrades as SINR approaches 0 or too high. The latter could be improved by partial packet recovery.

Testbed Experiments (Cont.) 32 CRMA accurately decodes collisions up to 140 sample offsets.

Qualnet Simulation: Varying # flows in long distance networks 33 CRMA-VF > CRMA > other schemes.

Qualnet Simulation: Varying # flows in short distance networks 34 CRMA-VF > CRMA > other schemes.

Qualnet Simulation: Varying data rate 35 CRMA significantly out-performs the other schemes and its benefit increases with data rate.

Related Work Decoding collisions – Successive interference cancellation, ZigZag, analog network coding, … – CRMA: a MAC protocol based on ability to decode collisions CDMA – Synchronous CDMA: handful orthogonal codes and requires tight synchronization – Asynchronous CDMA: suffers Multiple Access Interference (MAI) Channel assignment and channel hopping – Try to avoid collisions – CRMA: a new perspective on spectrum sharing 36

Summary of CRMA CRMA: a new direction for spectrum sharing – A new encoding and decoding scheme – A new MAC protocol based on it – Experimental evaluation to show it can achieve high efficiency without fine-grained coordination Future work – Robust to channel estimation errors – Effectively support high data rate – More graceful degradation as # transmissions exceeds # channels 37

Our Work Spectrum sharing – Develop an efficient MAC for multiple nodes to share the medium Spectrum access – Develop and implement multi-point to multi- point MIMO 38

Multi-point to Multi-point MIMO in WLANs Joint work with Sangki Yun and Apurv Bhartia 39 Under submission

Overview Motivation – MIMO promises a dramatic capacity increase n, ac, … – But usually limited by # antennas at an AP – Multi-point to multi-point MIMO achieves a higher capacity and overcomes the limitations 40

Multi-point to Multi-point MIMO 41 AP1AP2APn Client1Client2Client n n concurrent downlink or uplink streams

Multi-point to Multi-point MIMO 42 AP1AP2APn Client1Client2Client n n concurrent downlink Is it feasible?

Our Contributions Demonstrate the feasibility and effectiveness of multi-point to multi- point MIMO on USRP and SORA Design multi-point to multi-point MIMO-aware MAC Extensions to support general traffic and network conditions 43

Our Contributions Demonstrate the feasibility and effectiveness of multi-point to multi- point MIMO on USRP and SORA Design multi-point to multi-point MIMO-aware MAC Extensions to support general traffic and network conditions 44

Point-to-Point MIMO 45 AP Client

Multi-point to Multi-point MIMO: Downlink 46 AP1AP2APn Client1Client2Client n n concurrent downlink

Multi-point to Multi-point MIMO in Downlink Clients can not cooperate APs perform joint precoding (e.g., zero- force beamforming) – Such that the combined precoded signals arriving at the clients can be modulated as usual – Precoding matrix W = H -1 – Received signal HWp=HH -1 p= p Is it feasible in practice? 47

Practical Challenges Each AP has its own clock  different carrier frequency offset (CFO) Challenges – Phase synchronization – Time synchronization 48

Phase Synchronization (I) 49

Phase Synchronization (II) 50

Phase Synchronization (III) 51

Distributed MIMO in Uplink 52 Share the received signals over the Ethernet Client 1 AP 2 AP 1 Client 2 APs share their received signals and jointly decode y 1 = h 11 p 1 + h 12 p 2 y 2 = h 21 p 1 + h 22 p 2

MAC Design Rate adaptation Support ACKs Deal with losses and collisions Schedule transmissions Limit Ethernet overhead Obtain channel estimation 53

MAC Design Rate adaptation Support ACKs Dealing with losses and collisions Scheduling transmissions Limiting Ethernet overhead Obtaining channel estimation 54

Rate Adaptation (I) Challenges – Receiver receives a combination of signals from all the transmitting APs – Per link SNR based rate adaptation does not work 55

Rate Adaptation (II) Error vector magnitude (EVM) based SNR – Distance between the received symbol and the closest constellation point – Incorporate frequency diversity by computing this metric for each subcarrier to derive BER and effective SNR 56

Support ACKs ACKs enjoy the same spatial multiplex in the reverse direction Downlink – Data: APs multiplex to clients via precoding – ACK: clients multiplex to APs and APs jointly decode Uplink – Data: clients multiplex to APs and APs jointly decode – ACK: APs multiplex to clients via precoding 57

Evaluation Implement downlink on USRP – SORA transmitter has random initial phase and makes it hard to support phase sync. Implement uplink on SORA – Both USRP and SORA support uplink and use SORA for higher capacity 58

Downlink Phase Misalignment 59 Median phase misalignment is radian and reduces SNR by 0.4 dB.

Downlink Throughput 60 Downlink throughput almost linearly increases with # antennas across different APs or clients.

Uplink Throughput 61 Uplink throughput almost linearly increases with # antennas across different APs or clients.

Ran adaptation in Downlink 62 Achieves close to 96% throughput of best fixed rate.

Summary First step towards multi-point to multi- point MIMO This new transmission method opens up – New network optimization – New network management – New applications 63

Thank you! 64

Qualnet Simulation: Varying payload size 65 CRMA out-performs the other schemes and its benefit is larger for small packets.

Testbed Experiments (Cont.) 66 Phase shift correctly compensate for the offset signal.

Ethernet Client 1 Commander Client 2Client n

Frequency Synchronization 68

Multi-point to Multi-point MIMO in Downlink Clients can not cooperate APs perform joint precoding (e.g., zero- force beamforming) – Such that the combined precoded signals arriving at the clients can be modulated as usual – Precoding matrix W = H T (HH T ) -1 – Received signal HWx=HH T (HH T ) -1 x= x Is it feasible in practice? 69

Overview Motivation – MIMO promises a dramatic capacity increase n, ac, … – But usually limited by # antennas at an AP – Multi-point to multi-point MIMO achieves a higher capacity and overcomes the limitations State-of-art – Theory: significant work on distributed MIMO – Practice: not clear how well it works in reality 70