ExOR: Opportunistic Multi- hop routing for Wireless Networks by; Sanjit Biswas and Robert Morris, MIT Presented by; Mahanth K Gowda Some pictures/graphs.

Slides:



Advertisements
Similar presentations
1 A Static-Node Assisted Adaptive Routing Protocol in Vehicular Networks Yong Ding, Chen Wang, Li Xiao {dingyong, wangchen, Department.
Advertisements

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Wireless Networking Nick Feamster CS 6250 Fall 2011.
ExOR : Opportunistic Multi-hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence Laboratory.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Limited Application of ExOR Yao Zhao. Limited Application Static –No mobility Small Scale –Tens of nodes Dense network Maybe Only Rooftop Networks File.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
Exploiting Opportunism in Wireless Networks Aruna Balasubramanian Guest Lecture, CS 653 (Some slides borrowed from the ExOr and MORE presentations at SigComm.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
Network Delays, Statistical Multiplexing
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
ExOR: Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas & Robert Morris.
CS 577 / EE 537 Advanced Computer Networks Fall ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T.
Making Friends with Broadcast CMU David Andersen.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Eric Rozner - ETX.ppt1 A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S.J. Couto Daniel Aguayo John Bicket Robert Morris Presented.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
E X OR: O PPORTUNISTIC M ULTI -H OP R OUTING FOR W IRELESS N ETWORKS Yin Lin BY S ANJIT B ISWAS AND R OBERT M ORRIS.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments Dimitrios Koutsonikolas, Chih-Chun Wang and Y. Charlie Hu.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Presenter: Gregory Filpus Slides borrowed and modified from: Douglas S. J. De Couto MIT CSAIL.
Wireless Sensor Networks COE 499 Energy Aware Routing
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT Computer Science and.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto MIT CSAIL (LCS) Daniel Aguayo, John Bicket, and Robert Morris
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Roofnet Performance.
The Network Layer.
A High-Throughput Path Metric for Multi- Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT Computer Science and.
15-744: Computer Networking L-12 Wireless Broadcast.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT CSAIL Presented by Valentin.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Trading Coordination For Randomness Szymon Chachulski Mike Jennings, Sachin Katti, and Dina Katabi.
Slide #1 Performance Evaluation of Routing Protocol for Low Power and Lossy Networks (RPL) draft-tripathi-roll-rpl-simulation-04 IETF Virtual Interim WG.
Opportunistic Flooding in Low-Duty- Cycle Wireless Sensor Networks with Unreliable Links Shuo Goo, Yu Gu, Bo Jiang and Tian He University of Minnesota,
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
1 UFlood: High-Throughput Wireless Flooding Jayashree Subramanian Collaborators: Robert Morris, Ramakrishna Gummadi, and Hari Balakrishnan.
2012 1/6 NSDI’08 Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru, Kyle Jamieson, and Hari Balakrishnan MIT Computer Science and Artificial.
Mitigating Congestion in Wireless Sensor Networks Bret Hull, Kyle Jamieson, Hari Balakrishnan MIT Computer Science and Artificial Intelligence Laborartory.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Routing Metrics for Wireless Mesh Networks
SmartGossip: A Reliable Broadcast Service for Wireless Sensor Networks
Routing Metrics for Wireless Mesh Networks
Ad-hoc Transport Layer Protocol (ATCP)
15-744: Computer Networking
Network Routing: Link Metrics and Non-Traditional Routing
William Stallings Data and Computer Communications
Routing Metrics for Wireless Mesh Networks
TCP in Mobile Ad-hoc Networks
Network: Non Traditional Routing
Opportunistic Routing in Multi-hop Wireless Networks
Taking Advantage of Broadcast
A short lesson on wireless connectivity…
A High-Throughput Path Metric for Multi-Hop Wireless Routing
Congestion Control (from Chapter 05)
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Routing.
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Congestion Control (from Chapter 05)
Presentation transcript:

ExOR: Opportunistic Multi- hop routing for Wireless Networks by; Sanjit Biswas and Robert Morris, MIT Presented by; Mahanth K Gowda Some pictures/graphs adopted from authors’ slides 1

O VERVIEW Traditional Routing ExOR: key intuitions and ideas ExOR: Realization Evaluation 2

T RADITIONAL R OUTING Links are abstracted as wires. A B C D E DestinationPath EA D E CA D C 3

L INK TRANSMISSION IS A B ROADCAST Probability of reception decreases with distance However, there is always a chance that data travels longer C E 90% 60% 10% 4 A D B

E X OR E XPLOITS B ROADCAST Best traditional route over 50% hops: 3( 1 / 0.5 ) = 6 tx Throughput  1 / # transmissions ExOR exploits lucky long receptions: 4 transmissions Assumes probability falls off gradually with distance srcdstN1N2N3N4 75% 50% N5 25% 5

E X OR E XPLOITS B ROADCAST Traditional routing: 1 / = 5 tx ExOR: 1 /(1 – (1 – 0.25) 4 ) + 1 = 2.5 transmissions Assumes independent losses N1 srcdst N2 N3 N4 25% 100% 6

E X OR R EALIZATION : B ATCHING Packets are queued and sent in Batches A list of forwarders prioritized by their ETX values is included In the below topology ---> Source: A, Destination: E Priority order : E C D B A In other words, if E C D B A receive packets, they should forward in that order Other nodes listen They forward packets only if a higher priority node has failed to do so 7

A N EXAMPLE A has transmitted a batch of 10 packets 1-10 E receives packets 1, 2 C receives D receives B receives E received 1, Now C forwards 3, 4, D forwards 5, B forwards 6, 7,

B ATCHING A batch map indicates highest priority node that received each packet in the batch The map is updated and sent over along with data Gossip mechanism: updated batch map propagates from high priority nodes to low priority nodes and ultimately to source When the source receives the updated batch map, it restarts transmission if all packets haven’t got through 9

E VALUATION Comparison between traditional is done with ExOR Throughput between 65 randomly selected node pairs evaluated 1 mega-byte file exchanged Batch size is 100 Data rate 1 megabit/second 10

E X OR: 2 X OVERALL IMPROVEMENT Median throughputs: 240 Kbits/sec for ExOR, 121 Kbits/sec for Traditional Throughput (Kbits/sec) Cumulative Fraction of Node Pairs ExOR Traditional 11

25 H IGHEST THROUGHPUT PAIRS Node Pair Throughput (Kbits/sec) ExOR Traditional Routing 1 Traditional Hop 1.14x 2 Traditional Hops 1.7x 3 Traditional Hops 2.3x 12

25 L OWEST THROUGHPUT PAIRS Node Pair 4 Traditional Hops 3.3x Longer Routes Throughput (Kbits/sec) ExOR Traditional Routing 13

E X OR MOVES PACKETS FARTHER ExOR average: 422 meters/transmission Traditional Routing average: 205 meters/tx Fraction of Transmissions ExOR Traditional Routing Distance (meters) 25% of ExOR transmissions 58% of Traditional Routing transmissions 14

S UMMARY ExOR opportunistically exploits wireless broadcast long distance transmission Avoids retransmission by allowing a low priority node to forward 15

I SSUES Periodic link state flooding Queuing for batching causes delay for interactive applications Uses constant data rate for evaluation 16

T HANK Y OU Questions ? 17