Multihop Wireless Networks: What’s Wrong With Min Hopcount?

Slides:



Advertisements
Similar presentations
University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
Advertisements

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
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,
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Radio Propagation Spring 07 CS 527 – Lecture 3. Overview Motivation Block diagram of a radio Signal Propagation  Large scale path loss  Small scale.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL Presented by: Ao-Jan Su.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
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,
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
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.
ITIS 6010/8010: Wireless Network Security Weichao Wang.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
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
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.
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.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
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.
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.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
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.
SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.
1 Gossip-Based Ad Hoc Routing Zygmunt J. Haas, Joseph Halpern, LiLi Cornell University Presented By Charuka Silva.
Robust MANET Design John P. Mullen, Ph.D. Timothy I. Matis, Ph.D. Smriti Rangan Karl Adams Center for Stochastic Modeling New Mexico State University May.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
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.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Grid: Scalable Ad-Hoc Wireless Networking Robert Morris LCS
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.
Survey of Ad Hoc Network Routing Protocols Team Adhocracy Presentation 4 – May 10, 2007 Jason Winnebeck Benjamin Willis Travis Thomas.
William Stallings Data and Computer Communications
Routing Metrics for Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks
ECE 544 Protocol Design Project 2016
Wireless Mesh Networks
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
A High-Throughput Path Metric for Multi-Hop Wireless Routing
The Impact of Multihop Wireless Channel on TCP Performance
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
CapProbe Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
Tony Sun, Guang Yang, Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
Study of performance of regular TCP in MANETs (using simulator).
Multi-channel, multi-radio
Routing.
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Congestion Control (from Chapter 05)
Presentation transcript:

Multihop Wireless Networks: What’s Wrong With Min Hopcount? Douglas S. J. De Couto Daniel Aguayo, Benjamin A. Chambers, and Robert Morris http://pdos.lcs.mit.edu/grid 1. NOT shortest path is bad, but we need to be more discerning

Wired Nets: Why Min Hopcount? Prefer route with fewest links (“hops”) Many more sophisticated alternatives End-to-end latency, lowest congestion, etc. Min hopcount works in practice Can engineer a decent network Alternatives complex, less tested

Min Hopcount Assumption All important route state in hopcount Link quality is bimodal Links are either “good”, or “bad” All “good” links are equivalent Sufficient condition for success What about wireless?

Indoor Wireless Network 18 nodes 6 on 6th, 12 on 5th 802.11b radios (fixed tx power), PCs, DSDV 5th floor 6th floor

Min Hopcount Underperforms Packets/sec Worse Better Why DSDV, doesn’t it suck? No, not on static nets. Max 802.11 small packet throughput is ~400—750 pps, depending on bit rate DSDV worse on 152/185 pairs 18 * 17 = 296 total possible pairs; no data for some of the pairs (either missing DSDV or SR) Best half of SR routes are mostly 1-hop with a few scattered 2-hop. The middle third and bottom are mostly 2-hop, with a few 3-hop among the bottom half. 124 bytes * 500 pkts/sec ~= kilobits/sec (kbps) Why best sometimes not better: experiments at different times, didn’t try all possible routes Node Pair DSDV 124-byte packets for 30 seconds “Best” static route “Best” is maximum pkts/sec over multiple static source routes

Not All Min Hopcount Paths Are Equal 3-hop paths between a single node pair 14 paths, all shortest paths between same 2 nodes: 3 hops Different experiment from other slides, same packet size: 124 bytes Different throughput for different paths! Pair: 10 to 18

Not All Links Are Equal 171 non-zero links Links are not bimodal Broadcast delivery rate Link 171 non-zero out of 342 links measured. But why not 18*17=306 links? Oops! In data collection… 171 non-zero links Links are not bimodal Min hopcount assumptions are false

Intermediate Quality Wireless Links Always Exist In a random ad hoc network, there will be nodes at all distances from each other Since link quality depends on signal strength, and signal strength is a function of distance, there will nodes with all different link qualities from any given node. Min hopcount -> Max distance per hop -> min hopcount more likely to pick marginal links! There are nodes at every distance Link quality depends on signal strength (distance) Min hopcount maximizes link distance Marginal links are more likely!

Should We Give Up Hopcount? Intuition from wired networks is wrong Links share spectrum Capacity penalty for more hops What should we optimize? Per-route throughput, network capacity, power? Capacity = 1/2 Capacity = 1

Low Quality 802.11 Links 802.11 has link-level retransmissions Lossy links become narrow links 0% effective loss rate Good pings But, low packet-per-second throughput Retransmissions waste capacity Other nodes could have transmitted Will retransmit until ACK, up until a fixed number of maximum retransmits, e.g. 16

A Reasonable (Wrong) Idea Maximize bottleneck throughput: A-D-C 50% 100% 51% D A B C A-B-C: ABBABBABB = 1/3 A-D-C: AADDAADD = 1/4 Actual throughput:

A Better Idea Insight: spectrum use is important! Idea: minimize transmissions per packet Num tx 1 2 2

Transmissions Per Packet B 100%1 tx 50% 2 tx A C 51% 2 tx 51% 2 tx D Transmissions per packet (A-B-C) = 3 Transmissions per packet (A-D-C) = 4

Research Agenda Explore performance of other protocols, e.g. DSR, AODV Explain route performance by underlying link performance Confirm usefulness of transmissions per packet as metric Handle link variation over time

Summary Minimum hopcount protocols are unlikely to achieve best performance Quality varies between links Transmissions per packet nicely quantifies link and path quality for routing