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

Slides:



Advertisements
Similar presentations
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Advertisements

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.
Wireless MACs (reprise): Overlay MAC Brad Karp UCL Computer Science CS 4C38 / Z25 24 th January, 2006.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
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.
Gentian Jakllari, Stephan Eidenbenz, Nick Hengartner, Srikanth V. Krishnamurthy & Michalis Faloutsos Paper in Infocom 2008 Link Positions Matter: A Non-Commutative.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
Wireless Ad Hoc Network Routing Protocols CSE Maya Rodrig.
CS541 Advanced Networking 1 Mobile Ad Hoc Networks (MANETs) Neil Tang 02/02/2009.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Travis Grant – Mingzhe Li, Choong-Soo Lee, Emmanuel.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
ExOR: Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas & Robert Morris.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Comparison of Routing Metrics for Static Multi-Hop Wireless Networks Richard Draves, Jitendra Padhye and Brian Zill Microsoft Research Presented by Hoang.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
Computer Networks: Wireless Networks Ivan Marsic Rutgers University Chapter 6 – Wireless Networks.
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.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Ad Hoc Wireless Routing COS 461: Computer Networks
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments Dimitrios Koutsonikolas, Chih-Chun Wang and Y. Charlie Hu.
Roofnet: An b Mesh Network Brad Karp UCL Computer Science CS 4C38 / Z25 23 rd January, 2006.
Routing Functions in Mesh Networks
MIT Roofnet Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Computer Science and Artificial Intelligence Laboratory
Link Quality Source Routing (LQSR) Girish Nandagudi.
Ad Hoc Routing Metrics E -- Wireless Networks 02/27/2006 Kaushik Sheth Jatin Shah.
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.
Link Estimation, CTP and MultiHopLQI. Motivation Data Collection needs to estimate the link quality –To select a good link.
Wireless Sensor Networks COE 499 Energy Aware Routing
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
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.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
Dilshad Haleem CST593 summer 2007 Routing In Wireless Mesh Networks CST593 Final Project by Dilshad Haleem Division of Computing Studies, ASU Polytechnic.
Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Roofnet Performance.
Proposed ad hoc Routing Approaches Conventional wired-type schemes (global routing, proactive): –Distance Vector; Link State Proactive ad hoc routing:
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.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
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.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.
Qos support and adaptive video. QoS support in ad hoc networks MAC layer techniques: – e - alternation of contention based and contention free periods;
Hongkun Li, Yu Cheng, Chi Zhou Illinois Institute of Technology, Chicago, IL, USA IEEE GLOBECOM 2008.
1 UFlood: High-Throughput Wireless Flooding Jayashree Subramanian Collaborators: Robert Morris, Ramakrishna Gummadi, and Hari Balakrishnan.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Routing in Heterogeneous Wireless Ad Hoc Networks Sivaram Cheekiralla, Daniel W. Engels ICCCN 2007.
Grid: Scalable Ad-Hoc Wireless Networking Douglas De Couto
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Wireless Ad Hoc Network Routing Protocols
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Multi-Rate ETX: A Radio-Aware Routing metric for s Mesh Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks
Multihop Wireless Networks: What’s Wrong With Min Hopcount?
A High-Throughput Path Metric for Multi-Hop Wireless Routing
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A High-Throughput Path Metric for Multi-Hop Wireless Routing
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Computer Networks: Wireless Networks
Presentation transcript:

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

5 th floor 6 th floor 29 PCs with b radios (fixed transmit power) in ‘ad hoc’ mode Indoor wireless network 4 th floor 3 rd floor2 nd floor

Testbed UDP throughput better Better

What throughput is possible? ‘Best’ for each pair is highest measured throughput of 10 promising static routes. Routing protocol ‘Best’

Talk outline Testbed throughput problems Wireless routing challenges A new high-throughput metric (ETX) Evaluation

Links in route share radio spectrum Extra hops reduce throughput Challenge: more hops, less throughput Throughput = 1/2 Throughput = 1 Throughput = 1/3

Challenge: many links are lossy Smooth link distribution complicates link classification. One-hop broadcast delivery ratios ‘Good’ ‘Bad’

Challenge: many links are asymmetric Many links are good in one direction, but lossy in the other. Broadcast delivery ratios in both link directions. Very asymmetric link.

Bottleneck throughput: A straw-man route metric Maximize bottleneck throughput 50%Delivery ratio = 100% 51% D A B C Actual throughput: A-B-C : ABBABBABB = 33% A-D-C : AADDAADD = 25% A-B-C = 50% A-D-C = 51%

A-B-C = 51% A-C = 50% Another straw-man metric Maximize end-to-end delivery ratio 51%100% 50% A B C Actual throughput: A-B-C : ABBABBABB = 33% A-C : AAAAAAAA = 50% End-to-end delivery ratio:

Minimize total transmissions per packet (ETX, ‘Expected Transmission Count’) New metric: ETX Link throughput  1/ Link ETX Delivery Ratio 100% 50% 33% Throughput 100% 50% 33% Link ETX 1 2 3

Calculating link ETX Assuming link-layer acknowledgments (ACKs) and retransmissions: P(TX success) = P(Data success)  P(ACK success) Link ETX = 1 / P(TX success) = 1 / [ P(Data success)  P(ACK success) ] Estimating link ETX: P(Data success)  measured fwd delivery ratio r fwd P(ACK success)  measured rev delivery ratio r rev Link ETX  1 / (r fwd  r rev )

Measuring delivery ratios Each node broadcasts small link probes (134 bytes), once per second Nodes remember probes received over past 10 seconds Reverse delivery ratios estimated as r rev  pkts received / pkts sent Forward delivery ratios obtained from neighbors (piggybacked on probes)

Route ETX Route ETX = Sum of link ETXs 5 Throughput 100% 50% 33% 20%

ETX Properties ETX predicts throughput for short routes (1, 2, and 3 hops) ETX quantifies loss ETX quantifies asymmetry ETX quantifies throughput reduction of longer routes

ETX caveats ETX link probes are susceptible to MAC unfairness and hidden terminals –Route ETX measurements change under load ETX estimates are based on measurements of a single link probe size (134 bytes) –Under-estimates data loss ratios, over-estimates ACK loss ratios ETX assumes all links run at one bit-rate

Evaluation Setup Indoor network, b, ‘ad hoc’ mode 1 Mbps, 1 mW, small packets (134 bytes), RTS/CTS disabled DSDV + modifications to respect metrics –Packets are routed using route table snapshot to avoid route instability under load. DSR + modifications to respect metrics

ETX improves DSDV throughput better DSDV overhead ‘Best’ DSDV+ETX DSDV+hop-count

DSR with ETX DSR+ETX ‘Best’ DSR+hop-count

DSR with ETX (no TX feedback) DSR+ETX ‘Best’ DSR+hop-count

Some related work Threshold-based techniques –DARPA PRNet, 1970s–80s [Jubin87]: Minimum hop-count, ignore ‘bad’ links (delivery ratio  5/8 in either direction) –Link handshaking [Lundgren02, Chin02]: Nodes exchange neighbor sets to filter out asymmetric links. –SNR-based approaches [Hu02]: Mark low-SNR links as ‘bad’, and avoid them Mote sensors [Yarvis02] –Product of link delivery ratios

What’s next: MIT Roofnet

Summary ETX is a new route metric for multi-hop wireless networks ETX accounts for –Throughput reduction of extra hops –Lossy and asymmetric links –Link-layer acknowledgements ETX finds better routes!

DSDV & DSR implementations: Roofnet info at poster session

Extra slides follow

Big packets

Per-pair DSDV throughputs

ETX vs. link handshaking

Hop-count penalty

Throughput differs between paths Paths from 23 to 36

Evaluation details All experiments: –134-byte (including overhead) UDP packets sent for 30 seconds DSDV: – 90 second warm-up (including ETX) –Route table snapshot taken at end of 90s used to route UDP data for next 30s DSR: –Initiate route request by sending 1 pkt/s for five seconds; followed by UDP data for 30s –ETX warms up for 15s before route request

Effect of asymmetry on DSDV 100% 8% But, throughput of B-A = 0.08 B-C-A = 0.5 B successfully receives all of A’s route ads, and installs a one-hop route to A. A C B 100%