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.

Slides:



Advertisements
Similar presentations
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Advertisements

Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
ExOR : Opportunistic Multi-hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence Laboratory.
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,
1 Estimation of Link Interference in Static Multi-hop Wireless Networks Jitendra Padhye, Sharad Agarwal, Venkat Padmanabhan, Lili Qiu, Ananth Rao, Brian.
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.
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.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
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.
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.
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.
Comparison of Routing Metrics for a Static Multi-Hop Wireless Network Richard Draves, Jitendra Padhye, Brian Zill Microsoft Research Presented by: Jón.
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
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
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.
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
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
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.
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.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
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.
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.
DRP: An Efficient Directional Routing Protocol for Mobile Ad Hoc Networks Hrishikesh Gossain Mesh Networks Product Group, Motorola Tarun Joshi, Dharma.
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;
Joint Multi-Channel Link Layer and Multi-Path Routing Design for Wireless Mesh Networks Wai-Hong Tam and Yu-Chee Tseng National Chiao-Tung University,
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.
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
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
A comparison of Ad-Hoc Routing Protocols
Ad Hoc Networks - Performance
Routing Metrics for Wireless Mesh 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
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*
Presentation transcript:

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 Pistol, Duke University April 6 th, 2011 Credits: Includes slides borrowed and edited from authors

Test-bed map (indoor wireless network) 2

Motivation: Min hop-count not best 3 ‘Best’ for each pair is highest measured throughput of 10 promising static routes.

Throughput differs between paths 4

Outline 5  Testbed throughput challenges  Wireless routing challenges  ETX - New high-throughput metric  Evaluation

Wireless routing challenges 6  Longer routes have less throughput  Many lossy links  Many asymmetric links

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

Challenge: many links are lossy 8 ‘Good’ ‘Bad’

Challenge: many links are asymmetric 9 Broadcast delivery ratios in both link directions. Very asymmetric link.

Delivery Ratios 1 mW vs 30 mW 10

Metric: Maximize bottleneck throughput 11 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%

Metric: Maximize end-to-end delivery ratio 12 A-B-C = 51% A-C = 50% 51%100% 50% A B C Actual throughput: A-B-C : ABBABBABB = 33% A-C : AAAAAAAA = 50% End-to-end delivery ratio:

New high-throughput metric (ETX) 13  ETX = expected transmission count  Finding the highest throughput path  Link throughput  1/ Link ETX Delivery Ratio 100% 50% 33% Throughput 100% 50% 33% Link ETX 1 2 3

Calculating link ETX 14  Actual TX  P(TX success) = P(Data success) x P(ACK success)  Link ETX = 1/ P(TX success) = 1/ [P(Data success) x P(ACK success)]  Estimating link ETX  Forward delivery ratio d fwd = P(Data success)  Reverse delivery ratio d rev = P(ACK success)  Link ETX  1 / ( d fwd x d rev )

Delivery ratios 15  Measured using dedicated link probe packets  All nodes broadcast link probes (134 bytes)  Each node remembers probes for last 10 seconds  Estimates  d fwd  # packets recv / # packets sent  d rev piggybacked on probes from neighbors

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

ETX characteristics 17  Predicts throughput for short routes  Quantifies loss  Quantifies asymmetry  Quantifies throughput reduction of longer routes  Tends to minimize spectrum use which should maximize system capacity  May reduce energy/packet

ETX limitations 18  Does not specifically account for mobility  Link probes susceptible to MAC unfairness and hidden terminals  Route ETX measurements change under load  Estimates based on single small link probe packet (136 bytes)  Under-estimates data loss ratios  Over-estimates ACK loss ratios (38 bytes)  Assumes same bit-rate across all nodes  Assumes loss ratios cannot be controlled by the system

Evaluation Setup 19  Indoor network, b, ‘ ad hoc ’ mode  1 Mbps, 1 mW, small packets (134 bytes), RTS/CTS disabled  DSDV + modifications to metrics  DSR + modifications to metrics

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

ETX slightly improves on DSR 21 DSR+ETX ‘Best’ DSR+hop-count

ETX + DSR (No TX feedback) 22 DSR+ETX DSR+hop-count ‘Best’

Summary 23  ETX is a new route metric for multi-hop wireless networks  ETX does find better routes  ETX considers  Throughput reduction of extra hops  Lossy and asymmetric links  Link-layer acknowledgements  DSR + ETX almost identical to DSR with link layer feedback  Feedback already helps avoid links with high loss ratios  No comparison between power levels for same runs

Thank you! Questions? 24 image © mrjanitor1.com

Backup slides 25

Large packets 26

Delivery ratio decreases for large packets 27

ETX vs. link handshaking 28

Hop-count penalty 29

ETX vs min hop-count at 30 mW 30