Opportunistic Routing Is Missing Its Opportunities! Sachin Katti & Dina Katabi.

Slides:



Advertisements
Similar presentations
Inter-session Network Coding in wireless network Long Hai 10/02/2012.
Advertisements

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.
Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.
20.1 Chapter 20 Network Layer: Internet Protocol Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
IP Fragmentation. MTU Maximum Transmission Unit (MTU) –Largest IP packet a network will accept –Arriving IP packet may be larger IP Packet MTU.
José Vieira Information Theory 2010 Information Theory MAP-Tele José Vieira IEETA Departamento de Electrónica, Telecomunicações e Informática Universidade.
Strider : Automatic Rate Adaptation & Collision Handling Aditya Gudipati & Sachin Katti Stanford University 1.
1 A Framework for Joint Network Coding and Transmission Rate Control in Wireless Networks Tae-Suk Kim*, Serdar Vural*, Ioannis Broustis*, Dimitris Syrivelis.
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Network Coding and Xors in the Air 7th Week.
Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.
Fountain Codes Amin Shokrollahi EPFL and Digital Fountain, Inc.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Exploiting Opportunism in Wireless Networks Aruna Balasubramanian Guest Lecture, CS 653 (Some slides borrowed from the ExOr and MORE presentations at SigComm.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
1 NETWORK CODING Anthony Ephremides University of Maryland - A NEW PARADIGM FOR NETWORKING - February 29, 2008 University of Minnesota.
1 Forward Error Correction Shimrit Tzur-David School of Computer Science and Engineering Hebrew University of Jerusalem.
TCP/IP Lecture Extra. TCP/IP Developed by DARPA (Defense Advanced Research Projects) TCP is a connection-oriented transport protocol that sends data as.
Allocation of Layer Bandwidths and FECs for Video Multicast Over Wired and Wireless Networks T.-W. Angus Lee, S.-H. Gary Chan, Qian Zhang, Wen-Wu Zhu,
Forward Error Correction. FEC Basic Idea Send redundant data Receiver uses it to detect/correct errors Reduces retransmissions/NAKs Useful when RTT is.
Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland Joint work with Randy Cogill, University of Virginia.
TCP: Software for Reliable Communication. Spring 2002Computer Networks Applications Internet: a Collection of Disparate Networks Different goals: Speed,
SourceSync: A Distributed Architecture for Sender Diversity Hariharan Rahul Haitham Hassanieh Dina Katabi.
Slicing the Onion: Anonymity Using Unreliable Overlays Sachin Katti Jeffrey Cohen & Dina Katabi.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Automatic Rate Adaptation Aditya Gudipati & Sachin Katti Stanford University 1.
Wireless Network Coding Martin Xu. Outline Introduction New Solutions – COPE – ANC Conclusions.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Pushing the Limits of Wireless Networks Prof. Dina Katabi Jan 9, 2006.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
15-744: Computer Networking L-12 Wireless Broadcast.
Yufeng Shan, Su Yi, Shivkumar Kalyanaraman and John W. Woods
Recitation: Rehearsing Wireless Packet Reception in Software
Trading Coordination For Randomness Szymon Chachulski Mike Jennings, Sachin Katti, and Dina Katabi.
ZipTx: Harnessing Partial Packets in Networks Nate Kushman Kate Ching-Ju Lin, Dina Katabi.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
Error Detection and Correction – Hamming Code
Nour KADI, Khaldoun Al AGHA 21 st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications 1.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Motion-JPEG2000 Video Transmission Over Active Network Ruibiao Qiu.
Bringing Life to Dead Spots Grace Woo Pouya Kheradpour, Dawei Shen, and Dina Katabi.
ICDT'06 - Capillary routing with FEC - Emin Gabrielyan 1 Capillary-routing with Forward Error Correction (FEC) ICDT’06 - International Conference.
The Importance of Being Opportunistic Sachin Katti Dina Katabi, Wenjun Hu, Hariharan Rahul, and Muriel Medard.
Coding for Multipath TCP: Opportunities and Challenges Øyvind Ytrehus University of Bergen and Simula Res. Lab. NNUW-2, August 29, 2014.
Protocols and layering Network protocols and software Layered protocol suites The OSI 7 layer model Common network design issues and solutions.
IP Fragmentation. MTU Maximum Transmission Unit (MTU) –Largest IP packet a network will accept –Arriving IP packet may be larger IP Packet MTU.
Reliability Gain of Network Coding - INFOCOM 08
Xors in the air Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft.
Information Theory Michael J. Watts
Services of DLL Framing Link access Reliable delivery
15-744: Computer Networking
Binary Lesson 5 Classful IP Addresses
Network Layer Functions
Network Routing: Link Metrics and Non-Traditional Routing
Chapter 20 Network Layer: Internet Protocol
Network: Non Traditional Routing
Network Coding Testbed
Taking Advantage of Broadcast
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Decoding Collisions Shyamnath Gollakota Dina Katabi.
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Types of Errors Data transmission suffers unpredictable changes because of interference The interference can change the shape of the signal Single-bit.
Presentation transcript:

Opportunistic Routing Is Missing Its Opportunities! Sachin Katti & Dina Katabi

Opportunistic Routing R1R2R3 R4 R5 D S

Opportunistic Routing R1R2R3 R4 R5 D S Opportunistic Routing leverages opportunistic receptions

Opportunistic Routing R1R2R3 R4 R5 D S Opportunistic Routing leverages opportunistic receptions

R1R2R3 R4 R5 D S But Opportunistic Routing is missing the bulk of its opportunities

R1R2R3 R4 R5 D S Loss Longer jumps by partially correct packets, but dropped due to packet abstraction

R1R2R3 R4 R5 D S Leverage longer opportunistic receptions of partially correct packets! Opportunistic Routing capitalizes on Partial Packet Forwarding

R1R2R3 R4 R5 D S Leverage longer opportunistic receptions of partially correct packets!

Partial Packet Forwarding capitalizes on Opportunistic Routing R1 R2 D S

Partial Packet Forwarding capitalizes on Opportunistic Routing R1 R2 D S Spatial Diversity  Routers are unlikely to have error in the same byte positions

Partial Packet Forwarding capitalizes on Opportunistic Routing R1 R2 D S Together the partial packets have all the original bytes  No need to retransmit!

Opportunistic Routing Partial Packet Forwarding Synergy

Contributions Byte Level Network Coding Harvests synergy Provides adaptive error correction Provides the right abstraction for the PHY and network layers to maximize throughput

MIXIT R1 R2 D S

MIXIT R1 R2 D How do routers know which bytes are correct?  Physical layer knows!

How do routers knows which bytes are correct? PHY knows how confident it is for every byte it decodes High confidence Clean Byte Dirty Byte Forward “clean” bytes, throw away the “dirty” bytes Low confidence

Who should forward what? R1 R2 D Overlap in received correct bytes  Routers forward duplicates

How to prevent duplicate transmissions? R1 R2 D S Source transmits packets in batches P1 P2

R1 R2 D S Routers use byte level network coding How to prevent duplicate transmissions?

R1 R2 D … … … … Routers create random combinations of clean bytes How to prevent duplicate transmissions?

R1 R2 D Routers create random combinations of clean bytes … … … … … … … … … … How to prevent duplicate transmissions?

R1 R2 D Routers transmit coded packets to the destination … … … …

How to prevent duplicate transmissions? R1 R2 D Destination decodes by solving simple linear equations … … … … Solve 2 equations

How to prevent duplicate transmissions? R1 R2 D Destination decodes by solving simple linear equations … … … … Solve 2 equations

How to prevent duplicate transmissions? R1 R2 D Destination decodes by solving simple linear equations … … … … Solve 2 equations Byte Level Network Coding prevents spurious transmissions without any co-ordination or scheduling

How to represent the code? How to efficiently tell the destination the code of each bit?  Use run length encoding Original Packets Coded Packet

How to represent the code? How to efficiently tell the destination the code of each bit?  Use run length encoding Original Packets Coded Packet

How to represent the code? How to efficiently tell the destination the code of each bit?  Use run length encoding Original Packets Coded Packet

How to represent the code? How to efficiently tell the destination the code of each bit?  Use run length encoding Original Packets Coded Packet

How to represent the code? How to efficiently tell the destination the code of each bit?  Use run length encoding Run length encoding to represent contiguous runs of coded bits with the same code

Clean bytes can be incorrect Can be incorrect with low probability How does the destination recover from these errors? How does the destination recover from these errors? Clean Byte Dirty Byte High confidence Low confidence

How to recover from errors? Symbol Level Network Coding Adaptive Error-Correcting Code If k bytes are combined to produce n (>k) random combinations, destination can correct (n-k)/2 byte errors Routers can keep transmitting until destination decodes correctly  Rateless error-correcting code

To conclude… MIXIT: Harvests synergy between opportunistic routing and partial packet forwarding Provides the right abstraction for the PHY and network layers to maximize throughput