SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:

Slides:



Advertisements
Similar presentations
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
Advertisements

Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
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,
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
6/3/ Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness CS495 – Spring 2005 Northwestern University.
Receiver Based Forwarding for Wireless Sensor Networks Rodrigo Fonseca OASIS Retreat January 2005 Joint work with Ana Sanz Merino, Ion Stoica.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
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
Opportunistic Packet Scheduling and Media Access Control for Wireless LANs and Multi-hop Ad Hoc Networks Jianfeng Wang, Hongqiang Zhai and Yuguang Fang.
1 ATP: A Reliable Transport Protocol for Ad-hoc Networks Sundaresan, Anantharam, Hseih, Sivakumar.
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)
1 A Comparison of Mechanisms for Improving TCP Performance over Wireless Links Course : CS898T Instructor : Dr.Chang - Swapna Sunkara.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
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.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
CIS 725 Wireless networks. Low bandwidth High error rates.
Ming-Yu Jiang and Wanjiun Liao,IEEE ICC 2002 Family ACK Tree (FAT): A New Reliable Multicast Protocol for Mobile Ad Hoc Networks. Speaker : Wilson Lai.
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.
Mobile Routing protocols MANET
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Presented by Fei Huang Virginia Tech April 4, 2007.
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.
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.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
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.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
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.
Fast Resilient Jumbo Frames in Wireless LANs Apurv Bhartia University of Texas at Austin Joint work with Anand Padmanabha Iyer, Gaurav.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Fundamentals of Computer Networks ECE 478/578
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Routing Metrics for Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks
Ad-hoc Networks.
Ad-hoc Transport Layer Protocol (ATCP)
Presence Information in Large Mesh Networks
ECE 544 Protocol Design Project 2016
Routing Metrics for Wireless Mesh Networks
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Network: Non Traditional Routing
A High-Throughput Path Metric for Multi-Hop Wireless Routing
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Ajay Vyasapeetam Brijesh Shetty Karol Gryczynski
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published: IEEE Transactions on Mobile Computing

Outline The benefits of Opportunistic Routing The proposed algorithm Simulation results Testbed evaluation

The benefits of Opportunistic Routing Traditional routing protocol: on average, a packet needs to be transmitted 5 times in order to reach the next hop. SOAR: 1-(1-0.2) 5 = /0.672=1.487

The benefits of Opportunistic Routing ABCD

Network environment The goal of opportunistic routing is to maximize the progress each transmission makes without causing duplicate (re)transmissions or incurring significant coordination overhead. each node maintains a routing table of the following format: (destination, default path, forwardList)

Overview Every node periodically measures and disseminates link quality. A sender selects the default path and a list of (next- hop) forwarding nodes that are eligible for forwarding the data. The sender broadcasts a data packet including the above information. Upon hearing the transmission –the nodes not on the forwarding list simply discard the packet –Nodes on the forwarding list store the packet and set forwarding timers based on their proximity to the destination

Default path selection Each node measures the loss rate of its links to and from its neighbors by broadcasting one probe packet every second and counting the number of probes received in the last 10 seconds.

Default path selection The forwarding node’s ETX to the destination is lower than i’s ETX to the destination. The forwarding node’s ETX to i is within a threshold.

Forwarding nodes selection In order to leverage path diversity, SOAR relaxes the actual route that data traverses to be along or near the default path.

Forwarding nodes selection Each forwarding node is close to at least one node on the default path. The ETX of a link between any pair of forwarding nodes is within a threshold.

ABCD 50% 5%

Priority-based forwarding A sender transmits a packet, which specifies a list of forwarding nodes sorted in a non-decreasing order of ETX towards the destination. Each node hearing the packet first checks if it is included in the forwarding list. –If not, it discards the packet. –Otherwise, it sets its forwarding timer as follows. The i-th forwarding node on the list sets its forwarding timer to (i − 1) ∗ δ, where i starts from 1.

Local recovery SOAR uses per-hop network-layer ACKs and retransmissions to provide best effort reliability. To reduce the overhead of ACKs, SOAR uses a combination of piggyback ACKs and ACK compression as follows.

When to transmit data? In SOAR, each node estimates its retransmission timeout (RTO) in a similar way as done in TCP.

Simulation results

Simulation results-linear

Simulation results-5x5

Simulation results-random

Testbed

Conclusion We develop SOAR, a novel opportunistic routing protocol. First, judiciously selecting forwarding nodes and avoiding diverging paths are important especially for supporting multiple simultaneous flows. Second, rate control is important to the performance of a routing protocol.