Top Banner
Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman
45

Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Dec 19, 2015

Download

Documents

Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Cool Topics in Networking

CS144 Review Session 8November 20, 2009

Samir Selman

Page 2: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Announcements

• Lab 5 : Due Thursday Dec 3• Final Exam: Wednesday, December 9

12:15pm - 3:15pm• For those of you submitting late, contact us

before your deadline if you need an additional extension. Tell us:– Where you are– How much more time you need

Page 3: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Today’s Cool Topics

1. Network Coding

2. Wireless Sensor Networks

Page 4: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Current Wireless

Router

C

Page 5: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Current Wireless

Traditional Routing requires 4 time slots

C

Page 6: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Current Wireless

Traditional Routing requires 4 time slots

C

Page 7: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

XOR

=

Router

Traditional Routing requires 4 time slots

Network Coding

C

Page 8: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Network Coding

Router

Traditional Routing requires 4 time slots

C

Page 9: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Network Coding

XOR

= XOR

=

Router

Traditional Routing requires 4 time slots

With Network Coding need only 3 time slots Higher throughput

C

Page 10: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

I - COPE

Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, and Jon Crowcroft, "XORs In The Air: Practical Wireless Network Coding," ACM SIGCOMM, 2006.

Page 11: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

COPE Coding Opportunities

Page 12: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

COPE Coding Opportunities

Page 13: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

II- Opportunistic Routing• Traditional routing chooses next hop before transmitting a packet.

• Poor Link Quality => Probability of chosen next hop receiving packet is low

• Solution: Opportunistic Routing allows any node that overhears the transmission and is closer to the destination to participate in forwarding the packet

• Challenge: Multiple nodes might hear a packet broadcast and unnecessarily forward the same packet.

Page 14: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

EXOR• EXOR solves this issue by tying the MAC to the Routing and imposing a strict schedule on the routers.

•The scheduler goes in rounds. Forwarders transmit in order, and only one forwarder is allowed to transmit at a given time.

•Other nodes listen to learn which packets were overheard by other nodes.

•Problem: This strict scheduling prevents forwarders from exploiting spatial reuse (even when multiple packets can be received by their respective receivers).

Page 15: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

MORE

Szymon Chachulski, Michael Jennings, Sachin Katti, and Dina Katabi, "Trading Structure for Randomness in Wireless Opportunistic Routing," ACM SIGCOMM, 2007

Page 16: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

MORE

• MORE solves the problem with Opportunistic Coding without tying Routing to the MAC.

• Instead it uses Network Coding + Randomness.

• Basically nodes randomly mix packets before forwarding them.

• This ensures the routers hearing the same transmission do not forward the same packet.

Page 17: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

MORE - Examples

Unicast Case

•Src sends P1,P2•Dest luckily overhears P1.•Router doesn’t know what dest received (P1).•In any case R can forward P1 + 2P2•Dest now has two received packets

• P1•P1 + 2P2

•Dest can solve 2 eqns with 2 unknowns to retrieve P2.•Conclusion: R only forwarded one packet instead of two =>Higher throughput

Page 18: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

MORE - Examples

Multicast Case

•Without Network Coding, src has to retransmit the union of the lost packets ( 4 pkts ).

•With Network coding can retransmit only 2 randomly coded pkts and allow all destinations to decode their respective packets.

• Src retransmits pa = p1+ p2 + p3 + p4, and pb= p1 + 2p2 + 3p3 + 4p4.

Page 19: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Analog Network Coding

Sachin Katti, Shyamnath Gollakota, and Dina Katabi, "Embracing Wireless Interference: Analog Network Coding," ACM SIGCOMM, 2007.

Page 20: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Analog Network Coding (ANC)

Instead of router mixing packets…

Exploit that the wireless channel naturally mixes signals

Analog Network Coding

Page 21: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Analog Network Coding

Router

C

Page 22: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Analog Network Coding

1) Phil and David transmit simultaneously

Interference

C

Page 23: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Analog Network Coding

1) Phil and David transmit simultaneously2) Router amplifies and broadcasts interfered signal

C

Page 24: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Analog Network Coding

1) Phil and David transmit simultaneously2) Router amplifies and broadcasts interfered signal3) Phil subtracts known signal from interfered signal

C

Page 25: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Router

Analog Network Coding

1) Dina and Robert transmit simultaneously2) Router amplifies and broadcasts interfered

signal3) 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

Page 26: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

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

Page 27: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

C C CC

Hidden Terminal Scenario

R1 R2Src Dst

Page 28: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

P1

Hidden Terminal Scenario

C C CCR1 R2Src Dst

Page 29: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

P2

Hidden Terminal Scenario

P1

1) Src and R2 transmit simultaneously

C C CCR1 R2Src Dst

Page 30: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Hidden Terminal Scenario

1) Src and R2 transmit simultaneously2) R1 subtracts P1, which he relayed earlier to

recover P2 that he wants

P1 P2

C C CCR1 R2Src Dst

Page 31: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Hidden Terminal Scenario

R2 and Src are hidden terminals Today : Simultaneous transmission

Collision ANC : Simultaneous transmission

Success!

P1 P2

C C CCR1 R2Src Dst

Page 32: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

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 CCR1 R2Src Dst

Page 33: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Wireless Sensor Networks

1. A sensor network is an Ad-hoc network composed of densely populated tiny electronic sensing devices.

2. Basic function of the network is to observe some phenomenon.3. Characteristics:

a. Low cost, Low power, Light weightb. Densely deployedc. Prone to failuresd. Two ways of deployment: randomly, pre-determined

4. Objectives:1. Monitor Activities2. Gather and fuse information3. Communicate it to special node “Base Station”.

Page 34: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Computer Revolution

0.5 oz, 2.25 x 1.25 x 0.25 inch25 lb, 19.5 x 5.5 x 16 inch

~14 mW~ 64 W

~ $35~ $6K (today)

512 KB Flash160 KB Floppies

128 KB RAM16-256 KB RAM

4 MHz4.77 MHz

MICAZ Mote (2005)Original IBM PC (1981)

Page 35: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Sensor Node Hardware Platform

Page 36: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Software Platform

Page 37: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Applications

Page 38: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Applications

Page 39: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Applications

Page 40: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Applications

Page 41: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Applications

Page 42: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN protocols

Protocol Requirements:1. Energy Efficient (Maximize node lifetime)2. Self Configuring3. Scalable4. Redundant5. Efficient (less computation, less memory

requirements, less energy consumption…)6. Robust

Page 43: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Energy Efficiency

I. Sources of Energy Consumption:1. Communications (Transmitting & Receiving)2. Computations3. Sensing

II. Sources of Energy Wastage in Communications:1. Collisions2. Overhearing3. Idle Listening4. Control Packets overhead5. Over emitting

Page 44: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

WSN Protocol Research

Page 45: Cool Topics in Networking CS144 Review Session 8 November 20, 2009 Samir Selman.

Questions?