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.

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.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
CS541 Advanced Networking 1 Dynamic Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks Neil Tang 3/10/2009.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
TCP over ad hoc networks Ad Hoc Networks will have to be interfaced with the Internet. As such backward compatibility is a big issue. One might expect.
Gentian Jakllari, Stephan Eidenbenz, Nick Hengartner, Srikanth V. Krishnamurthy & Michalis Faloutsos Paper in Infocom 2008 Link Positions Matter: A Non-Commutative.
Wireless Ad Hoc Network Routing Protocols CSE Maya Rodrig.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
ExOR: Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas & Robert Morris.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Comparison of Routing Metrics for Static Multi-Hop Wireless Networks Richard Draves, Jitendra Padhye and Brian Zill Microsoft Research Presented by Hoang.
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.
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Ad Hoc Routing CMU David Andersen. Ad Hoc Routing Goal: Communication between wireless nodes –No external setup (self-configuring) –Often need.
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
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.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
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
Mobile Routing protocols MANET
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.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
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.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Link Estimation, CTP and MultiHopLQI. Motivation Data Collection needs to estimate the link quality –To select a good link.
Ad Hoc Routing: The AODV and DSR Protocols Jonathan Sevy Geometric and Intelligent Computing Lab Drexel University
Wireless Sensor Networks COE 499 Energy Aware Routing
1 Power-Aware Routing in Mobile Ad Hoc Networks S. Singh, M. Woo and C. S. Raghavendra Presented by: Shuoqi Li Oct. 24, 2002.
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
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.
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.
Multirate Anypath Routing in Wireless Mesh Networks Rafael Laufer †, Henri Dubois-Ferrière ‡, Leonard Kleinrock † Acknowledgments to Martin Vetterli and.
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.
Link-level Measurements from an b Mesh Network Daniel Aguayo John Bicket Sanjit Biswas Glenn Judd † Robert Morris M.I.T. Computer Science and Artificial.
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;
Ordering in Time: A New Routing Approach for Wireless Networks Stephen Dabideen and J.J. Garcia-Luna-Aceves Department of Computer Engineering 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.
2012 1/6 NSDI’08 Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru, Kyle Jamieson, and Hari Balakrishnan MIT Computer Science and Artificial.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
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.
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Ad-hoc Transport Layer Protocol (ATCP)
Wireless Mesh Networks
Multi-Rate ETX: A Radio-Aware Routing metric for s Mesh Networks
Multihop Wireless Networks: What’s Wrong With Min Hopcount?
A High-Throughput Path Metric for Multi-Hop Wireless Routing
A High-Throughput Path Metric for Multi-Hop Wireless Routing
ExOR:Opportunistic Multi-Hop Routing For 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 Computer Science and Artificial Intelligence Laborotory Presented by Souvik Sen

Minimum Hop Count Links in route share radio spectrum Extra hops reduce throughput Throughput = 1 Throughput = 1/2 Throughput = 1/3

Min hop-count metric does not always choose highest-throughput path available!!!  Assumes links either work or don’t work  Maximize the loss ratio of each hop  Arbitrarily chooses among same length paths  Retransmission reduces throughput increases interference  Thresholds to discard lossy links may disconnect network Question – Is there a “better” metric ? Problems

Hop-count penalty Better

Challenge: many links are asymmetric Many links are good in one direction, but lossy in the other. Links with intermediate Loss Ratio Very asymmetric link.

Effect of asymmetry 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%

Throughput differs between paths Paths from 23 to 36

ETX metric: Design goals Find high-throughput paths Account for lossy links Account for asymmetric links Account for inter-link interference Independent of network load (don’t incorporate congestion)‏

A New Metric? SINR threshold?  Nodes Unreachable Multiply link ratios? 11 1 = 1.95 ~ 2 Throughput End to End Delay? -Depends on interface queue lengths

ETX: Minimize the Expected Transmission Count 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 acknowledgements (ACKs) and retransmissions: P(TX success) = 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 )‏ ETX (path) = ∑ ETX(link)‏

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

Test Specifics: 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

DSDV overhead ‘Best’ DSDV+ETX DSDV+hop-count ETX and DSDV

Big packets

Comparison with min-hop (higher power)‏ DSDV hop-count DSDV ETX

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

DSR with ETX(With Tx Feedback)‏ DSR+ETX ‘Best’ DSR+ hop-count

ETX Performance “Broadcast” has lower priority Probe size ≠ Data/Ack size  Under-estimates data loss ratios, over-estimates ACK loss ratios For >= 4 hops, may choose a slower path with fewer hops ETX assumes all links run at one bit-rate, at the same Power Link-layer feedback already does a good job for DSR‏

Conclusion / Thoughts Proposed new metric to accommodate lossy/asymmetric links Detailed experiments on real testbed Favours shorter paths! Inter-hop interference accounting problematic  Probe Packets may suffer from interference due to a hidden terminal Is Traffic Independent:  Congestion / Link loss separation ?