Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.

Slides:



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

Wireless Network Coding
Chorus: Collision Resolution for Efficient Wireless Broadcast Xinyu Zhang, Kang G. Shin University of Michigan 1.
XORs in The Air: Practical Wireless Network Coding
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.
BBN: Throughput Scaling in Dense Enterprise WLANs with Blind Beamforming and Nulling Wenjie Zhou (Co-Primary Author), Tarun Bansal (Co-Primary Author),
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.
1 DOA-ALOHA: Slotted ALOHA for Ad Hoc Networking Using Smart Antennas Harkirat Singh & Suresh Singh Portland State University, OR, USA.
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…
Outline What is an ad hoc network Smart Antenna Overview
DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks 1 Xinyu Zhang, Kang G. Shin University of Michigan.
How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
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.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
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.
AutoMAC : Rateless Wireless Concurrent Medium Access Aditya Gudipati, Stephanie Pereira, Sachin Katti Stanford University.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
Wireless Network Coding Martin Xu. Outline Introduction New Solutions – COPE – ANC Conclusions.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Omid Abari Hariharan Rahul, Dina Katabi and Mondira Pant
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard.
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.
Final Review Focus- Chapter 4: Network layer Chapter 5: Data link layer Notes: Physical layer Understand previous chapters covered in class. Final exam.
Trading Coordination For Randomness Szymon Chachulski Mike Jennings, Sachin Katti, and Dina Katabi.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
CS434/534: Mobile Computing and Wireless Networks Y. Richard Yang 08/30/2012.
MIMO: Challenges and Opportunities Lili Qiu UT Austin New Directions for Mobile System Design Mini-Workshop.
Partially Overlapped Channels Not Considered Harmful Article by Mishra, Shrivastava, Banerjee, Arbaugh Presentation by Chen Li.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Carrier Sense Multiple Access Improve ALOHA by using carrier sense –Stations listen to the carrier before transmitting –If channel is busy, the station.
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.
1 Post Lunch Session Cooperative Strategies and Optimal Scheduling for Tree Networks Alexandre de Baynast †, Omer Gurewitz ‡, Edward W. Knightly ‡ † RWTH.
Networks and Mobile Systems Research Group MIT Laboratory for Computer Science nms.lcs.mit.edu RadioActive Networks: Robust Wireless Communications John.
Bringing Life to Dead Spots Grace Woo Pouya Kheradpour, Dawei Shen, and Dina Katabi.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
The Importance of Being Opportunistic Sachin Katti Dina Katabi, Wenjun Hu, Hariharan Rahul, and Muriel Medard.
COSC 6590 Fall Multi-channel, multi-radio wireless networks.
Embracing Wireless Interference : Analog Network Coding By Sachin Katti, Shyamnath Gollakota, and Dina Katabi Shyamala Villupuram Sundararaman.
Achieving Single Channel, Full Duplex 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.
Multi-channel, multi-radio wireless networks
CS434/534: Topics in Networked (Networking) Systems Wireless Foundation: Wireless Mesh Networks Yang (Richard) Yang Computer Science Department Yale.
Network Routing: Link Metrics and Non-Traditional Routing
Network Coding Testbed
Hidden Terminal Decoding and Mesh Network Capacity
Blind Known Interference Cancellation
Network Coding Testbed
Multi-channel, multi-radio
Achieving Single Channel, Full Duplex Wireless Communication
CSMA/CN: Carrier Sense Multiple Access with Collision Notification
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Presentation transcript:

Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi

Current Wireless Router C

Current Wireless Traditional Routing requires 4 time slots C

Router Current Wireless Traditional Routing requires 4 time slots C

XOR = Router Traditional Routing requires 4 time slots Last Year  Network Coding  COPE C

Router Traditional Routing requires 4 time slots C

Last Year  Network Coding  COPE XOR = = Router Traditional Routing requires 4 time slots COPE requires 3 time slots  Higher throughput Can we do it in 2 time slots? C

Analog Network Coding (ANC) Instead of router mixing packets… Exploit that the wireless channel naturally mixes signals

Analog Network Coding Router C

Analog Network Coding 1)Dina and Jon transmit simultaneously Interference C

Router Analog Network Coding 1)Dina and Jon transmit simultaneously 2)Router amplifies and broadcasts interfered signal C

Router Analog Network Coding 1)Dina and Jon transmit simultaneously 2)Router amplifies and broadcasts interfered signal 3)Dina subtracts known signal from interfered signal C

Router Analog Network Coding 1)Dina and Robert transmit simultaneously 2)Router amplifies and broadcasts interfered signal 3)Dina subtracts known signal from interfered signal Analog Network Coding requires 2 time slots  Higher throughput Analog Network Coding requires 2 time slots  Higher throughput C

It Is More Than Going From 3 To 2! Philosophical shift in dealing with interference Strategically exploit interference instead of avoiding it Promises new ways of dealing with hidden terminals

C C CC Hidden Terminal Scenario R1 R2 Src Dst

P1 Hidden Terminal Scenario C C CC R1 R2 Src Dst

P2 Hidden Terminal Scenario P1 1)Src and R 2 transmit simultaneously C C CC R1 R2 Src Dst

Hidden Terminal Scenario 1)Src and R 2 transmit simultaneously 2)R 1 subtracts P 1, which he relayed earlier to recover P 2 that he wants P1 P2 C C CC R1 R2 Src Dst

Hidden Terminal Scenario R2 and Src are hidden terminals Today : Simultaneous transmission  Collision ANC : Simultaneous transmission  Success! P1 P2 C C CC R1 R2 Src Dst

Hidden Terminal Scenario Other Benefits of ANC: First step toward addressing hidden terminals ANC extends network coding to new scenarios Other Benefits of ANC: First step toward addressing hidden terminals ANC extends network coding to new scenarios C C CC R1 R2 Src Dst

How do we make it work?

Practical Challenges Interfered signal is not exactly the sum Channel distorts signals Two signals are never synchronized It is not s D (t) + s J (t) but f 1 (s D (t)) + f2(s J (t-T)) Prior work assumes full synchronization and ignores channel distortion Not Practical! C

Key Idea: Exploit Asynchrony!

Time Signal No Interference Dina uses interference-free parts to estimate channel and timing Dina compensates for her interfering signal Jon runs the same algorithm backwards! Exploit asynchrony to make it practical

Cross layer realization of our idea

Router senses idle medium and broadcasts a trigger to Dina and Jon Dina and Jon jitter their start times randomly and transmit Router amplifies and forwards interfered signal Dina and Jon receive and decode Protocol How do they decode?

Primer on Modulation Nodes transmit vectors on channel Focus on MSK (Minimum Shift Keying) modulation D2 lags D 1 by 90 degrees  Bit “0” D2 D1 D2 D1 D2 leads D 1 by 90 degrees  Bit “ 1 ”

Primer on Channel Effects Attenuation D2 and D1 are attenuated by the same amount Channel D2 D1 D2 D1

Primer on Channel Effects Attenuation Rotation Channel D2 D1 D2 D1

Primer on Channel Effects Attenuation Rotation Angle between vectors is preserved Channel D2 D1 D2 D1 To decode, receiver computes angle between received vectors Angle (D2, D 1) = 90 degrees  Bit “ 1 ” was transmitted

So, How Does Dina Decode? Time Signal No Interference Dina’s Signal Jon’s Signal

Time Signal Small uninterfered part at the start Decodes uninterfered part via standard MSK demodulation Once interference starts, Dina changes decoding algorithm Interference So, How Does Dina Decode? No Interference

What did Dina send? D1 D2

What did Dina send? What did Jon send? D1 D2 J1 J2

What is Interference  Vector addition J1 J2 X1 X2 D1 D2

D1 What does Dina know? J1 J2 X1 X2 D1 D2

D1 What does Dina know? Amplitude of her Vectors  α Amplitude of Jon’s Vectors  β No Interference X1 X2 α β

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? D1’ J1’ J1 D1 X1 X2

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Two solutions for each interfered vector! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Four possible angles! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Four possible angles! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Four possible angles! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Four possible angles! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Four possible angles! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Pick the correct angle  90 degrees D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Pick the correct angle  +90 degrees D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 Dina finds solutions for X 1 and X2 What does Dina know? Dictates solution for Jon’s vectors! D1’ J1’ J1 D1 X1 X2 J2 D2 D2’ J2’

D1 D2 What does Dina know? Dina finds angle between J 1 and J2 and decodes J1 D1 X1 X2 J2 D2

Decoding Algorithm – Decoding interference Time Signal Interference Decode rest of the interfered part using this algorithm Decode final uninterfered part from Jon via standard MSK demodulation

Performance

ANC Implementation Software – GNURadio codebase Hardware – USRP frontend GHz frequency range SNR of dB Canonical topologies in mesh networks

Dina and Jon Router ANC throughput gain over current 4/2 = 2 ANC throughput gain over COPE 3/2 = 1.5 C

Throughput gain for Dina-Jon scenario Throughput gain CDF Median Gain over Routing – 70% Gain over Routing

Throughput gain for Dina-Jon scenario Throughput gain CDF Gain over Routing Gain over COPE Median Gain over Routing – 70% Median Gain over COPE – 30% Median Gain over Routing – 70% Median Gain over COPE – 30%

X topology Router Capture! Interference C

X topology Router Capture! Interference C

X topology Router ANC throughput gain over current 4/2 = 2 ANC throughput gain over COPE 3/2 = 1.5 ANC decodes interference using overheard signals C

Throughput gain – X topology Throughput gain CDF Gain over Routing Median Gain over Routing – 65%

Throughput gain – X topology Throughput gain CDF Gain over Routing Gain over COPE Median Gain over Routing – 65% Median Gain over COPE – 28% Median Gain over Routing – 65% Median Gain over COPE – 28%

Chain topology ANC throughput gain over current 3/2 = 1.5 C C CC R1 R2 Src Dst

Throughput gain – Chain topology Throughput gain CDF Median Gain over Routing – 37%

Conclusion Shifts in the design of wireless networks to recognize wireless for what it is Embrace Broadcast Embrace Interference Implementation that yields large throughput gains