Cross-Layer Approach to Wireless Collisions Dina Katabi.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

Doc.: IEEE /0111r0 Zhanji Wu, et. Al. December 2012 Submission A Physical-layer Network Coding Relay scheme for IEEE Date: Authors:
1 Retransmission Repeat: Simple Retransmission Permutation Can Resolve Overlapping Channel Collisions Li (Erran) Li Bell Labs, Alcatel-Lucent Joint work.
Interference Avoidance and Control Ramki Gummadi (MIT) Joint work with Rabin Patra (UCB) Hari Balakrishnan (MIT) Eric Brewer (UCB)
SoftCast+ Scalable Robust Mobile Video
One-Size-Fits-All Wireless Video Szymon Jakubczak with Hariharan Rahul and Dina Katabi.
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.
Symbol Level Network Coding By Sachin Katti, Dina Katabi, Hari Balakrishnan, Muriel Medard Sigcomm 2008.
Interference Alignment and Cancellation EE360 Presentation Omid Aryan Shyamnath Gollakota, Samuel David Perli and Dina Katabi MIT CSAIL.
Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.
Special Topics in Wireless Networking: MAC design and cross-layer issues.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
CMAP: Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru Joint work with Kyle Jamieson and Hari Balakrishnan.
Physical Layer Security Made Fast and Channel-Independent Shyamnath Gollakota Dina Katabi.
MIMO As a First-Class Citizen in Kate C.-J. Lin Academia Sinica Shyamnath Gollakota and Dina Katabi MIT.
Strider : Automatic Rate Adaptation & Collision Handling Aditya Gudipati & Sachin Katti Stanford University 1.
Network Coding Testbed Using Software-Defined Radio Abstract In current generation networks, network nodes operate by replicating and forwarding the packets.
Living with Interference in Unmanaged Wireless Environments David Wetherall, Daniel Halperin and Tom Anderson Intel Research & University of Washington.
1 Estimation of Link Interference in Static Multi-hop Wireless Networks Jitendra Padhye, Sharad Agarwal, Venkat Padmanabhan, Lili Qiu, Ananth Rao, Brian.
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.
5-1 Data Link Layer r Today, we will study the data link layer… r This is the last layer in the network protocol stack we will study in this class…
DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks 1 Xinyu Zhang, Kang G. Shin University of Michigan.
SourceSync: A Distributed Architecture for Sender Diversity Hariharan Rahul Haitham Hassanieh Dina Katabi.
Combating Cross-Technology Interference Shyamnath Gollakota Fadel Adib Dina Katabi Srinivasan Seshan.
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.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Link Layer: Wireless Mesh Networks Capacity Y. Richard Yang 11/13/2012.
Understanding the Real-World Performance of Carrier Sense MIT Computer Science and Artificial Intelligence Laboratory Networks and Mobile Systems
AutoMAC : Rateless Wireless Concurrent Medium Access Aditya Gudipati, Stephanie Pereira, Sachin Katti Stanford University.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Next Generation n Dina Katabi Jointly with Kate Lin and Shyamnath Gollakota.
CSE 461 University of Washington1 Topic How do nodes share a single link? Who sends when, e.g., in WiFI? – Explore with a simple model Assume no-one is.
Wireless Network Coding Martin Xu. Outline Introduction New Solutions – COPE – ANC Conclusions.
Pushing the Limits of Wireless Networks Prof. Dina Katabi Jan 9, 2006.
Sunghwa Son Introduction Time-varying wireless channel  Large-scale attenuation Due to changing distance  Small-scale fading Due to multipath.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard.
Achieving Spectrum Efficiency Lili Qiu University of Texas at Austin 1.
Securing Wireless Medical Implants Shyamnath Gollakota Haitham Hassanieh Benjamin Ransford Dina Katabi Kevin Fu.
Practical Network Coding for Wireless Mesh Networks Wenjun Hu Joint work with Sachin Katti, Hariharan Rahul, Dina Katabi, Jon Crowcroft and Muriel Médard.
Packet Mixing: Superposition Coding and Network Coding Richard Alimi CS434 Lecture Joint work with: L. Erran Li, Ramachandran Ramjee, Harish Viswanathan,
PPR: Partial Packet Recovery for Wireless Networks Kyle Jamieson and Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laboratory.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
mZig: Enabling Multi-Packet Reception in ZigBee
MIMO: Challenges and Opportunities Lili Qiu UT Austin New Directions for Mobile System Design Mini-Workshop.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
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.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Bringing Life to Dead Spots Grace Woo Pouya Kheradpour, Dawei Shen, and Dina Katabi.
FD-MMAC: Combating Multi-channel Hidden and Exposed Terminals Using a Single Transceiver Yan Zhang, Loukas Lazos, Kai Chen, Bocan Hu, and Swetha Shivaramaiah.
The Importance of Being Opportunistic Sachin Katti Dina Katabi, Wenjun Hu, Hariharan Rahul, and Muriel Medard.
Embracing Wireless Interference : Analog Network Coding By Sachin Katti, Shyamnath Gollakota, and Dina Katabi Shyamala Villupuram Sundararaman.
Wireless Communication
Richard Alimi, L. Erran Li, Ramachandran Ramjee, Harish Viswanathan, Y
Wireless Communication
Xors in the air Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft.
and Hidden Terminals Y. Richard Yang 2/3/2009.
CS434/534: Topics in Networked (Networking) Systems Wireless Foundation: Wireless Mesh Networks Yang (Richard) Yang Computer Science Department Yale.
Colorado School of Mines
Network Coding Testbed
Interference Avoidance and Control
Hidden Terminal Decoding and Mesh Network Capacity
Network Coding Testbed
CSMA/CN: Carrier Sense Multiple Access with Collision Notification
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Collision Helps! Algebraic Collision Recovery for Wireless Erasure Networks.
Presentation transcript:

Cross-Layer Approach to Wireless Collisions Dina Katabi

devices are increasingly prevalent distributed and bursty access Home office City mesh Two devices access medium together  Collision

Job of the MAC: Avoid Collisions! And when they happen? Be in denial!

In This Talk Collisions are not harmful – We can decode colliding packets as efficiently as if they were sent separately Collisions are beneficial – We can exploit strategic collisions to increase throughput  Analog Network Coding

The Hidden Terminals Problem Collision! Alice Bob

The Hidden Terminals Problem More Collisions! Retransmissions Can’t get any useful traffic! Alice Bob

Can we take two collisions and produce the two packets? PaPa PbPb PaPa PbPb Yes, we can!

ZigZag Exploits ’s behavior Retransmissions  Same packets collide again Senders use random jitters  Collisions start with interference-free bits ∆1 ∆2 PaPa PbPb PaPa PbPb Interference-free Bits

How Does ZigZag Work? ∆1 ∆2 Find a chunk that is interference-free in one collisions and has interference in the other 1 1 ∆1 ≠∆2 Decode and subtract from the other collision 1 1

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? 3 3 Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision

∆ ∆1 How Does ZigZag Work? Find a chunk that is interference-free in one collisions and has interference in the other ∆1 ≠∆2 Decode and subtract from the other collision Delivered 2 packets in 2 timeslots  As if packets didn’t collide Low-complexity linear decoder No need for synchronization Delivered 2 packets in 2 timeslots  As if packets didn’t collide Low-complexity linear decoder No need for synchronization

ZigZag A receiver design that decodes collisions As efficient as if the colliding packets were sent in separate time slots Experimental results shows that it reduces hidden terminal losses from 72% to 0.7%

How does the AP know it is a collision and where the second packet starts? Time AP received a collision signal ∆

Detecting Collisions and the Value of ∆ Time AP received signal Packets start with known preamble AP correlates known preamble with signal Correlation Time Correlate ∆ Preamble Correlation Detect collision and the value of ∆ Works despite interference because correlation with an independent signal is zero Preamble Correlation Detect collision and the value of ∆ Works despite interference because correlation with an independent signal is zero

How Does the AP Subtract the Signal? Channel’s attenuation or phase may change between collisions Can’t simply subtract a chunk across collisions Alice’ s signal in first collision Alice’ s signal in second collision

Subtracting a Chunk Decode chunk into bits – Removes effects of channel during first collision Re-modulate bits to get channel-free signal Apply effect of channel during second collision – Use correlation to estimate channel despite interference Now, can subtract!

What if AP Makes a Mistake?

∆1 ∆ Bad News: Errors can propagate 3 3 Can we deal with these errors? What if AP Makes a Mistake?

∆1 ∆2 What if AP Makes a Mistake? Good News: Temporal Diversity A bit is unlikely to be affected by noise in both collisions Get two independent decodings

Errors propagate differently in the two decodings For each bit, AP picks the decoding that has a higher PHY confidence [JB07, WKSK07] Which decoded value should the AP pick? ∆1 ∆ AP Decodes Backwards as well as Forwards

ZigZag Generalizes

∆1 ∆ Flipped order

Different packet sizes ZigZag Generalizes ∆1 ∆

ZigZag Generalizes Flipped order Different packet sizes Multiple colliding packets

ZigZag Generalizes Flipped order Different packet sizes Multiple colliding packets Capture effect P a1 PbPb P a2 PbPb 3 packets in 2 timeslots  better than no collisions

Performance

Implementation USRP Hardware GNURadio software Carrier Freq: GHz BPSK modulation

USRPs Testbed 10% HT, 10% partial HT, 80% perfectly sense each other Each run randomly picks an AP and two clients Co-located a nodes that measure HTs. The USRPs use the same collision patterns as a

Throughput Comparison Throughput CDF of concurrent flow pairs

Throughput Comparison Throughput CDF of concurrent flow pairs Hidden Terminals Partial Hidden Terminals Perfectly Sense

Throughput Comparison ZigZag Throughput CDF of concurrent flow pairs Hidden Terminals get high throughput

Throughput Comparison ZigZag Throughput CDF of concurrent flow pairs ZigZag Exploits Capture Effect ZigZag improved average Throughput by 25%

Throughput Comparison ZigZag Throughput CDF of concurrent flow pairs Improved hidden terminals loss rate from 72% to 0.7% Hidden Terminals

Is ZigZag as efficient as if the colliding packets were sent in separate slots? For every SNR, Check that ZigZag can match the BER of collision-free receptions

Is ZigZag as efficient as if packets were collision-free Receptions? SNR in dB Bit Error Rate (BER)

Collision-Free Receptions Is ZigZag as efficient as if packets were collision-free Receptions? SNR in dB Bit Error Rate (BER)

Collision-Free Receptions Is ZigZag as efficient as if packets were collision-free Receptions? ZigZag-Decoded Collisions SNR in dB Bit Error Rate (BER) ZigZag is as efficient as if the colliding packets were sent separately

But can collisions be beneficial? ZigZag makes collisions harmless

Current Wireless Alice Bob

Current Wireless Current approach requires 4 time slots Can we do better? Alice Bob

Naive Application of ZigZag Collision! Alice Bob

Decode Collisions Naïvely applying ZigZag requires 4 time slots Decoding collisions at AP doesn’t reduce timeslots But the AP doesn’t need to decode! Alice Bob Naive Application of ZigZag

What if the AP doesn’t decode? Collision! 1)Alice and Bob transmit simultaneously Alice Bob

What if the AP doesn’t decode? Collision! 1)Alice and Bob transmit simultaneously 2)AP amplifies and broadcasts the collision Alice Bob

1)Alice and Bob transmit simultaneously 2)AP amplifies and broadcasts the collision 3)Alice subtracts her packet from the collision 1fhj What if the AP doesn’t decode? 1fhj 11 Bob’s pkt 11 Alice’s pkt 2 time slots instead of 4  Throughput Gain of 2x 2 time slots instead of 4  Throughput Gain of 2x Alice Bob

Extends Network Coding to Signals Traditional network coding: nodes forward linear combinations of received packets New approach: channel naturally creates linear combinations of signals Analog Network Coding (ANC)!

Theoretical Limits Theorem [Katti et al. ISIT’07]: Informal version: “For a symmetric two-way relay channel the rate achieved by analog network coding at high SNR is double the rate achieved by pure forwarding”

Implemented in software radio Evaluated in a similar testbed Metric Gain = Throughput in ANC /Current Throughput Performance

Throughput Gain for the Alice-Bob Scenario Throughput gain CDF Median Throughput Gain is 1.7x

Related Work Network Coding and Physical-layer Network Coding – Our ANC decoder linear modulation-independent and works without synchronization Joint Decoding & 2-way relay – Requires senders synchronization  hard in practice Interference Cancellation – Requires exponential difference in power or code-rate

Conclusion Cross-layer design changes how we perceive collisions Collisions need not be harmful – ZigZag decodes collisions as efficiently as if the colliding packets were sent in separate time slots Collisions can be beneficial – Analog network coding induces strategic collisions to increase throughput Softcast: cross-layer wireless video without CSI