ExOR : Opportunistic Multi-hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence Laboratory.

Slides:



Advertisements
Similar presentations
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
Advertisements

Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Limited Application of ExOR Yao Zhao. Limited Application Static –No mobility Small Scale –Tens of nodes Dense network Maybe Only Rooftop Networks File.
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.
Issues in ad-hoc networks Miguel Sanchez Nov-2000.
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Making Friends with Broadcast CMU David Andersen.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
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.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
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
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:
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
MIT Roofnet Robert Morris Daniel Aguayo, John Bicket, Sanjit Biswas, Douglas De Couto MIT Computer Science and Artificial Intelligence Laboratory
Mobile Routing protocols MANET
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.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
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.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
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.
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.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
STORE AND FORWARD & CUT THROUGH FORWARD Switches can use different forwarding techniques— two of these are store-and-forward switching and cut-through.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
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.
SMAC: An Energy-efficient MAC Protocol for Wireless Networks
Networks and Distributed Systems Sarah Diesburg Operating Systems COP 4610.
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.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
2012 1/6 NSDI’08 Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru, Kyle Jamieson, and Hari Balakrishnan MIT Computer Science and Artificial.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Distance Vector Routing
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
Wireless Mesh Networks
THE NETWORK LAYER.
15-744: Computer Networking
Network Routing: Link Metrics and Non-Traditional Routing
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Network: Non Traditional Routing
Opportunistic Routing in Multi-hop Wireless Networks
A High-Throughput Path Metric for Multi-Hop Wireless Routing
PRESENTATION COMPUTER NETWORKS
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
Routing.
ExOR: Opportunistic Multi-hop routing for Wireless Networks
Opportunistic Routing in Multi-hop Wireless Networks*
Presentation transcript:

ExOR : Opportunistic Multi-hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence Laboratory Presented by : Arpan Roy 1

Acknowledgements The results data have been taken from the original slides of Sanjit Biswas and Robert Morris. 2

Index Background Basic Idea Proposed Protocol Results Discussions 3

Routing in wireless networks In the initial stages, wireless routing treaded the same path that wired routing took. Extensive research led to proactive protocols like DSDV and later to reactive ones like DSR in this regard. Reality Injection - The ETX metric was brought into the picture to take into account the effects of lossy, assymetric links in wireless networks. Ultimate aim - Reliability through diversity Finally ETX and some of the advantages of cooperative diversity were put together and ExOR evolved – a combined routing and MAC protocol for wireless networks, that was found to increase the throughput. 4

Index Background Basic Idea Proposed Protocol Results Discussions 5

Overview For every source-target pair, the source broadcasts the packet. Some subset of the wireless nodes between the source and the destination is supposed to receive this packet. These nodes run a protocol to discover and agree as to which nodes are in that sub-set. The node in that sub-set that is closest to the destination again broadcasts that packet. Again the nodes that receive this packet agree on the closest receiver and forward that packet. This chain continues until the packet reaches its destination. 6

What is opportunistic about ExOR ? Can make the best out of a bad situation & also reap benefits from some new found reception luck. Traditional routing can’t do this. ABCDE ExOR Traditional 7

Only Assumption Reception of packets from the same broadcast at different nodes in the subset are independent of each other. 8

Index Background Basic Idea Proposed Protocol Results Discussions 9

Issues Four primary issues  choice of a cooperative agreement protocol that is robust and yet provide negligible communication overhead. (Solution – Batches)  metric that is used to reflect the right choice of the forwarder (Solution – ETX)  in a large dense network how to reduce the overhead in selecting a subset (Solution – Thresholding)  reduce collisions (Solution – Scheduling) 10

ETX in ExOR ETX is a good metric because it takes into consideration lossy, assymmetric links and interference between successive links. If a node has multiple paths to the destination, the links associated with minimum ETX values is chosen for forwarding. By ETX, we prioritize an estimate of the cost to the destination. 11

Batches ExOR protocol operates on batches of packets in order to reduce the communication cost of agreement. Every packet in a batch contains its senders’ snapshot of the network scenario. Every receiving node maintains its own snapshot of the network scenario. With the reception of each packet this keeps getting updated. 12

Node State Every node maintains a state for each batch of packets. Packet Buffer – It stores successfully received packets in the current batch. Local Forwarder List – It contains a copy of the prioritized list of nodes copied from one of the packets in the packet buffer. (*) Forwarding Timer – It indicates the time at which the node predicts that it should start forwarding packets from its packet buffer. Governed by its priority. Transmission tracker – It keeps track of the current rate of data sending and the number of packets left to transmit. Batch map – It indicates for each packet in a batch the highest priority node to have received a copy of that packet. 13

The ExOR packet header 14

Batches Transmission – Source and subsequently every intermediate node gathers a batch of packets headed to the same destination. Then each packet is broadcast. Reception - Receiving node check to see if it is on forwarder list. If so, it checks the batch map. If no higher priority node has received the packet yet, it adds the packet to its corresponding packet buffer. It may also update the receiving node’s local batch map if any of the packets indicates reception by a higher-priority node. 15

Batch ACK Batch map field indicates the highest priority node that is known to have received a copy of that packet. The source knows that the batch has been successfully received when 90% of the batch map entries are filled with IDs of higher priority nodes. No ACK needed. After 90% of the packets have been sent, rest 10% of the packets is sent using traditional routing using link level ACKs. 16

Thresholding The problem in the case of dense networks is that the expected number of the batch’s packets that any node is responsible for forwarding might come down to zero. So the source runs an ExOR simulation based on the link loss probabilities and selects only the nodes that transmit at least 10% of the total transmission in a batch. 17

Scheduling Since ExOR tends to opportunistically select the occasional longer link, virtual carrier sensing might not work that well. To avoid collision, ExOR performs scheduling that allows higher priority nodes to send first. This in turn allows for the batch maps of lower priority nodes to get updated. The forwarding timer is involved in accomplishing this. 18

Index Background Basic Idea Proposed Protocol Results Discussions 19

Throughput : 2x overall improvement Median throughputs: 240 Kbits/sec for ExOR, 121 Kbits/sec for Traditional Throughput (Kbits/sec) Cumulative Fraction of Node Pairs ExOR Traditional 20

Distance per transmission ExOR is able to move packets farther. ExOR average: 422 meters/transmission Traditional Routing average: 205 meters/tx 21 Fraction of Transmissions ExOR Traditional Routing % of Traditional Routing transmissions 25% of ExOR transmissions Distance

Index Background Basic Idea Proposed Protocol Results Discussions 22

Summary ExOR capitalizes on the nature of the wireless medium. ExOR was implemented on RoofNet testbed. ExOR increases throughput by a factor of two or four times over that of traditional wireless routing. 23

ExOR Caveats  The forwarder list is chosen with the help of the knowledge of inter-node loss rates over the whole network. This needs a periodic round of link state flooding of per-node measurements.  Candidate selection is tricky (How often is ETX updated)  May require changes to the MAC protocol.  How exactly does ExOR compare to cooperative diversity schemes ?  Selection of the best data rate 24

Recent Developments Sanjit Biswas is currently the CEO of his own start-up, Meraki Networks. Biswas's protocol, combined with commonly available hardware components, allows Meraki to produce Wi-Fi routers that cost as little as $50. (The routers Biswas originally used at MIT, initially cost $1,500.) Here's how a Meraki network actually works: a user plugs a router into a broadband Internet connection; that person's neighbors stick routers to their windows, and a mesh network of up to hundreds of people forms automatically. Users can give away or sell Internet access to their neighbors. There are already Meraki-based networks in 95 countries, from Slovakia to Venezuela, serving more than 15,000 users. 25

Questions 26