ExOR:Opportunistic Multi-Hop Routing For Wireless Networks

Slides:



Advertisements
Similar presentations
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
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.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Receiver Based Forwarding for Wireless Sensor Networks Rodrigo Fonseca OASIS Retreat January 2005 Joint work with Ana Sanz Merino, Ion Stoica.
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.
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.
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.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
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 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
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:
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments Dimitrios Koutsonikolas, Chih-Chun Wang and Y. Charlie Hu.
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
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.
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.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Multirate Anypath Routing in Wireless Mesh Networks Rafael Laufer †, Henri Dubois-Ferrière ‡, Leonard Kleinrock † Acknowledgments to Martin Vetterli 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.
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.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
ExOR: Opportunistic Multi- hop routing for Wireless Networks by; Sanjit Biswas and Robert Morris, MIT Presented by; Mahanth K Gowda Some pictures/graphs.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
1 UFlood: High-Throughput Wireless Flooding Jayashree Subramanian Collaborators: Robert Morris, Ramakrishna Gummadi, and Hari Balakrishnan.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
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.
1 Ad-hoc Transport Layer Protocol (ATCP) EECS 4215.
COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Routing Metrics for Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks
Ch 13 WAN Technologies and Routing
Wireless Mesh Networks
Ad-hoc Transport Layer Protocol (ATCP)
THE NETWORK LAYER.
Intra-Domain Routing Jacob Strauss September 14, 2006.
15-744: Computer Networking
Network Routing: Link Metrics and Non-Traditional Routing
Routing Metrics for Wireless Mesh Networks
Multi-Rate ETX: A Radio-Aware Routing metric for s Mesh Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Network: Non Traditional Routing
Opportunistic Routing in Multi-hop Wireless Networks
Taking Advantage of Broadcast
Multihop Wireless Networks: What’s Wrong With Min Hopcount?
A High-Throughput Path Metric for Multi-Hop Wireless Routing
Chapter 22. Network Layer: Routing
Wide Area Networks (WANs), Routing, and Shortest Paths
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Wide Area Networks (WANs), Routing, and Shortest Paths
Presentation transcript:

ExOR:Opportunistic Multi-Hop Routing For Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL http://pdos.csail.mit.edu/roofnet

What is Ex Opportunistic Routing ? A Link/Network Layer diversity routing technique that uses standard radio hardware Achieves substantial increase in throughput for large unicast transfers in mesh network. Thoughts : Does opportunistic mean Greedy ? Do we need Dijkstra’s algorithm? How is it different?

Traditional Routing Packets get forwarded on fixed path B Packet D S C Packets get forwarded on fixed path Retried on failures Looks like a circuit switched network

Cooperative Diversity / Probabilistic Broadcast Packets are broadcasted Selects each hop, after the transmission for that hop. Unlike Coop Diversity only a single node forwards each packet

Why ExOR promises high throughput? N1 N2 N3 N4 N5 N6 N7 N8 D Traditional Path Gradual falloff of probability with distance (80%, 40%, 20%..) Lucky longer path can reduce transmission count Shorter path ensures some forward progress

Why ExOR promises high throughput? 25% 100% 25% S 100% S D 25% 100% S 100% 25% S Reception at different node is independent, no interference Traditional Routing: 1/ 0.25 + 1 = 5tx ExOR: 1/ (1-(1-0.25) ) + 1 = 2.5tx 4

Design Challenges – Order in Anarchy The nodes must agree on which subset of them received each packet – Protocol ? A metric to measure the probable cost of moving packet from any node to destination Choosing most useful participants Avoid simultaneous transmission to minimize collisions.

Agreement using Gossip and Batch F F F N1 N2 N5 S F Batch N4 D N3 1st round N6 2nd round F 3rd round A complete schedule, undelivered packet are retried in subsequent one A subset within a transmission batch is called Fragment (F) After each batch destination sends packet just containing batch map Okay, where is the agreement ?

Gossip – Protocol – Very similar to P2P Only one kind of packet/message. Batch Map (Summary) - Map of each packet against the received highest priority node. Forwarder List – A list of nodes ordered in priority i.e. proximity towards the destination. Knowledge is shared by means of Gossip. Each data packet contains summary. Summary is updated, retrofitted and transmitted by each node.

Cost Metric and Selection of Participants ETX (Expected Transmission Count) metric based on Forward Delivery Probability Periodically link state flooding Path is weighted shortest path (Dijkstra) The source runs ExOR simulation and selects only the nodes which transmit at least 10% of total transmissions in a batch. Need to know about entire Mesh before hand? Is that okay?

Forwarding Timer and Transmission Tracker Batch N4 D N3 1st round N6 2nd round F 3rd round Header contains information to predict source transmission rate Transmission schedule allows high priority node to send first Uses EMWA to set Forwarding Timer

Batch? What’s going on with TCP Window?

25 Highest Throughput Pairs ACK might get dropped even for single hop.

25 Lowest Throughput Pairs Asymmetric long links affect ACK handling

Transmission Range ExOR requires less packet transmissions to travel far.

Going Forward Leverage 802.11 bit rate for throughput improvement. Cooperation between simultaneous flows. Transport level protocol development ? Security ? More organic improvements based on cooperative diversity theory ?