Routing: Collection Tree Protocol. Original slides by Omprakash Gnawal
|
|
- Gladys Rice
- 6 years ago
- Views:
Transcription
1 Routing: Collection Tree Protocol Original slides by Omprakash Gnawal
2 Collection Anycast route to the sink(s) collects data from the network to a small number of sinks network primitive for other protocols A distance vector protocol Why focus on a few sinks? distance vector vs link state 2
3 Common Architecture Control Plane Data Plane Router Link Estimator Fwd Table Application Forwarder Link Layer 3
4 Wireless Link Dynamics 5 4
5 Wireless Link Dynamics 0.9 1s 5 4
6 Control and Data Rate Mismatch Can lead to poor performance Control Plane Data Plane 1 beacon/30s 10 pkt/s Link Layer 5
7 Control and Data Rate Mismatch Can lead to poor performance Control Plane Data Plane 1 beacon/s 0 pkt/s Link Layer 5
8 CTP Noe Control Plane Router Data Plane Application Link Estimator Forwarder Link Layer 6
9 CTP Noe Control Plane Router Data Plane Application Link Estimator Forwarder Link Layer 6
10 CTP Noe s Approach Enable control and data plane interaction Two mechanisms for efficient and agile topology maintenance datapath validation adaptive beaconing Control Plane Data Plane 7
11 Outline Control plane datapath validation adaptive beacons Data plane queuing transmit time cache Evaluation Conclusion 8
12 Data path validation
13 Datapath validation Use data packets to validate the topology inconsistencies loops Receiver checks for consistency on each hop transmitter s cost is in the header Same time-scale as data packets validate only when necessary 10
14 Routing Loops Cost does not decrease C 3.2 B 4.6 D A 11
15 Routing Loops Cost does not decrease X C 3.2 B 4.6 D A 11
16 Routing Loops Cost does not decrease X C 8.1 B 4.6 D A 11
17 Routing Loops Cost does not decrease X C 8.1 B 4.6 D A 11
18 Routing Consistency Next hop should be closer to the destination Maintain this consistency criteria on a path ni ni+1 nk Inconsistency due to stale state 12
19 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane C 3.2 B D A 13
20 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency C 3.2 don t drop the packets signal the control plane 6.3 B 4.6 D A 13
21 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency C 3.2 don t drop the packets signal the control plane 4.6 < 6.3? 6.3 B 4.6 D A 13
22 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane C 3.2 B 4.6 D A
23 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency C 3.2 don t drop the packets signal the control plane 4.6 B 4.6 D A 13
24 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane C B 4.6 D A 13
25 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane C 3.2 < 4.6? B 4.6 D A 13
26 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane C 3.2 B 4.6 D A
27 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 3.2 B 4.6 D A 13
28 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B 4.6 D A 13
29 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B 4.6 D A 13
30 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane 8.1 X C 8.1 B 4.6 D A 13
31 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B D A 13
32 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B < 8.1? 8.1 D A 13
33 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B 4.6 D A 13
34 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B D A 13
35 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B D A 13
36 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B 4.6<5.8? D A 13
37 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B 4.6 D A 13
38 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X C 8.1 B D A 13
39 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane X 4.6 C 8.1 B 4.6 D A 13
40 Detecting Routing Loops Datapath validation cost in the packet receiver checks Inconsistency larger cost than on the packet On Inconsistency don t drop the packets signal the control plane 8.1 < 4.6? X 4.6 C 8.1 B 4.6 D A 13
41 Routing Consistency
42 How Fast to Send Beacons? Using a fixed rate beacon interval Can be too fast Can be too slow Agility-efficiency tradeoff Agile+Efficient possible? 15
43 Routing as Consistency Routing as a consistency problem costs along a path must be consistent Use consistency protocol in routing leverage research on consistency protocols trickle 16
44 Trickle Detecting inconsistency code propagation: version number mismatch does not work for routing: use path consistency Control propagation rate start with a small interval double the interval up to some max reset to the small interval when inconsistent 17
45 Control Traffic Timing Extend Trickle to time routing beacons Reset the interval ETX(receiver) >= ETX(sender) significant decrease in gradient [found better link] Pull bit - no valid route TX 18
46 Adaptive Beacon Timing Tutornet Infrequent beacons in the long run 19
47 Adaptive Beacon Timing ~ 8 min Tutornet Infrequent beacons in the long run 19
48 Adaptive Beacon Timing ~ 8 min Tutornet Infrequent beacons in the long run 19
49 Adaptive vs Periodic Beacons Tutornet Time (mins) Less overhead compared to 30s-periodic 20
50 Adaptive vs Periodic Beacons 1.87 beacon/s 0.65 beacon/s Tutornet Time (mins) Less overhead compared to 30s-periodic 20
51 Node Discovery A new node introduced Path established in < 1s Tutornet Time (mins) Efficient and agile at the same time 21
52 Data Plane
53 Data plane Goals: efficient, robust, and reliable forwarding Mechanisms per client queueing hybrid send queue transmit timer transmit cache 23
54 Data plane mechanisms Queueing discipline Per-client queueing [top-level] each client may have one outstanding packet achieves better fairness than a shared queue Hybrid send queue [lower-level] contains both route-through and locally-generated traffic duplicate packets are dropped [i.e., not inserted in the queue] Transmission Cache for each transmitted packet insert (src, seq, THL) determine if a packet is duplicate 24
55 Transmit Timer Self-interference between packets may be a problem DATA A B C D ACK A B C D DATA DATA A B C D Increased likelihood of collisions 25
56 Transmit Timer Rate control: delay the transmission of packets the transmission of consecutive packets is randomized between (1.5, 2.5) packet times Is this good enough? 26
57 Evaluation
58 Experiments 12 testbeds nodes 7 hardware platforms 4 radio technologies 6 link layers Variations in hardware, software, RF environment, and topology 28
59 Evaluation Goals Reliable? Packets delivered to the sink Efficient? TX required per packet delivery Robust? Performance with disruption 29
60 CTP Noe Trees Kansei Twist Mirage 30
61 Reliable, Efficient, and Robust Testbed Delivery Ratio Wymanpark Vinelab Tutornet NetEye Kansei Mirage-MicaZ Quanto Blaze Twist-Tmote Mirage-Mica2dot Twist-eyesIFXv Motelab
62 Reliable, Efficient, and Robust Testbed Delivery Ratio Wymanpark Vinelab Tutornet NetEye Kansei Mirage-MicaZ Quanto Blaze Twist-Tmote Mirage-Mica2dot Twist-eyesIFXv Motelab Retransmit 31
63 Reliable, Efficient, and Robust Testbed Delivery Ratio Wymanpark Vinelab Tutornet NetEye Kansei Mirage-MicaZ Quanto Blaze Twist-Tmote Mirage-Mica2dot False Twist-eyesIFXv ack Motelab Retransmit 31
64 Reliable, Efficient, and Robust Testbed Delivery Ratio Wymanpark Vinelab Tutornet NetEye Kansei Mirage-MicaZ Quanto Blaze Twist-Tmote Mirage-Mica2dot Twist-eyesIFXv Motelab High end-to-end delivery ratio (but not on all the testbeds!) False ack Retransmit 31
65 Reliable, Efficient, and Robust 1 Delivery Ratio Max Medium Min Time Tutornet 28 32
66 Reliable, Efficient, and Robust 1 Delivery Ratio Max Medium Min Time Tutornet High delivery ratio across time (short experiments can be misleading!) 28 32
67 Reliable, Efficient, and Robust Control Cost Data Cost Delivery cost per packet Tutornet MultiHopLQI CTP 29 33
68 Reliable, Efficient, and Robust Control Cost Data Cost Delivery cost per packet MultiHopLQI CTP Tutornet Low data and control cost 29 33
69 Reliable, Efficient, and Robust Motelab, 1pkt/5min Link Layer 30 34
70 Reliable, Efficient, and Robust Motelab, 1pkt/5min Link Layer Low duty-cycle with low-power MACs 30 34
71 Reliable, Efficient, and Robust 10 out of 56 nodes removed at t=60 mins Tutornet Time (mins) 31 35
72 Reliable, Efficient, and Robust 10 out of 56 nodes removed at t=60 mins Tutornet Time (mins) No disruption in packet delivery 31 35
73 Reliable, Efficient, and Robust Routing Beacons Tutornet 32 36
74 Reliable, Efficient, and Robust Routing Beacons ~ 5 min Tutornet 32 36
75 Reliable, Efficient, and Robust Routing Beacons ~ 5 min Tutornet Delivery Ratio >
76 Reliable, Efficient, and Robust Routing Beacons ~ 5 min Tutornet Delivery Ratio > 0.99 High delivery ratio despite serious network-wide disruption (most loss due to reboot while buffering packet) 32 36
77 CTP Noe Performance Summary Reliability Delivery ratio > 90% in all cases Efficiency Low cost and 5% duty cycle Robustness Functional despite network disruptions 37
78 Conclusion Hard networks good protocols Tutornet & Motelab Wireless routing benefits from data and control plane interaction Lessons applicable to distance vector routing Datapath validation & adaptive beaconing Data trace from all the testbeds available at 38
79 Prior Work Control Plane ETX, MT, MultiHopLQI, EAR, LOF, AODV, DSR, BGP, RIP, OSPF, Babel Data Plane Flush, RMST, CODA, Fusion, IFRC, RCRT Link Layer 4 39
Collection Tree Protocol
Collection Tree Protocol Omprakash Gnawali (Stanford University) with Rodrigo Fonseca (Brown University) Kyle Jamieson (University College London) David Moss (People Power Company) Philip Levis (Stanford
More informationCollection Tree Protocol
Collection Tree Protocol Omprakash Gnawali Stanford University & University of Southern California gnawali@cs.stanford.edu Rodrigo Fonseca Brown University & Yahoo! Research rfonseca@cs.brown.edu Kyle
More informationCollection Tree Protocol
Collection Tree Protocol Omprakash Gnawali University of Southern California gnawali@usc.edu Rodrigo Fonseca Brown University & Yahoo! Research rfonseca@cs.brown.edu Kyle Jamieson University College London
More informationCollection Tree Protocol
Collection Tree Protocol Technical Report SING-9-1 Omprakash Gnawali University of Southern California gnawali@usc.edu David Moss Rincon Labs dmm@rincon.com Rodrigo Fonseca UC Berkeley & Yahoo! Research
More informationCollection Tree Protocol. A look into datapath validation and adaptive beaconing. Speaker: Martin Lanter
Collection Tree Protocol A look into datapath validation and adaptive beaconing. Speaker: Martin Lanter Collection Protocols Why do we need collection protocols? Collecting data at a base station is a
More informationRouting for IoT and Sensor Systems
Facoltà di Ingegneria dell Informazione, Informatica e Statistica Internet of Things A.Y. 2017/18 Routing for IoT and Sensor Systems Federico Ceccarelli PhD Student 1 The Collection Tree Protocol (CTP)
More informationA CTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks
A CTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks OMPRAKASH GNAWALI, University of Houston RODRIGO FONSECA, Brown University KYLE JAMIESON, University College
More informationCTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks
CTP: An Efficient, Robust, and Reliable Collection Tree Protocol for Wireless Sensor Networks OMPRAKASH GNAWALI, University of Houston RODRIGO FONSECA, Brown University KYLE JAMIESON, University College
More informationWireless Sensor Networks
Wireless Sensor Networks Routing M. Schölzel Network in computer science Network is a graph G = (V,E) V set of all nodes E set of all edges: (v 1,v 2 ) E V 2 V = { A, B, C,... } E = { (A,B), (B,C), (C,F),...
More information15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks
15-441: Computer Networking Lecture 24: Ad-Hoc Wireless Networks Scenarios and Roadmap Point to point wireless networks (last lecture) Example: your laptop to CMU wireless Challenges: Poor and variable
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More informationMobile and Wireless Compu2ng CITS4419 Week 9 & 10: Holes in WSNs
Mobile and Wireless Compu2ng CITS4419 Week 9 & 10: Holes in WSNs Rachel Cardell-Oliver School of Computer Science & So8ware Engineering semester-2 2018 MoBvaBon Holes cause WSN to fail its role Holes can
More informationProtocolli di routing per reti di sensori Sistemi Wireless, a.a. 2013/2014
Protocolli di routing per reti di sensori Sistemi Wireless, a.a. 2013/2014 Un. of Rome La Sapienza Chiara Petrioli Department of Computer Science University of Rome Sapienza Italy Collec&on Tree Protocol
More informationECE 598HH: Special Topics in Wireless Networks and Mobile Systems
ECE 598HH: Special Topics in Wireless Networks and Mobile Systems Lecture 21: Opportunistic Routing Haitham Hassanieh *These slides are courtesy of Dina Katabi 1 Lecture Outline Single Path Routing Opportunistic
More informationCE693: Adv. Computer Networking
CE693: Adv. Computer Networking L-10 Wireless Broadcast Fall 1390 Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan at CMU. When slides are
More informationRCRT:Rate-Controlled Reliable Transport Protocol for Wireless Sensor Networks
RCRT:Rate-Controlled Reliable Transport Protocol for Wireless Sensor Networks JEONGYEUP PAEK, RAMESH GOVINDAN University of Southern California 1 Applications that require the transport of high-rate data
More informationDesign of Link and Routing Protocols for Cache-and- Forward Networks. Shweta Jain, Ayesha Saleem, Hongbo Liu, Yanyong Zhang, Dipankar Raychaudhuri
Design of Link and Routing Protocols for Cache-and- Forward Networks Shweta Jain, Ayesha Saleem, Hongbo Liu, Yanyong Zhang, Dipankar Raychaudhuri Introduction Future Internet usage is expected to involve
More informationRouting in Delay Tolerant Networks (2)
Routing in Delay Tolerant Networks (2) Primary Reference: E. P. C. Jones, L. Li and P. A. S. Ward, Practical Routing in Delay-Tolerant Networks, SIGCOMM 05, Workshop on DTN, August 22-26, 2005, Philadelphia,
More informationCHAPTER 7 SIMULATION OBSERVATIONS
CHAPTER 7 CHAPTER 7 SIMULATION OBSERVATIONS Over a randomly distributed wireless network system with the specification is modeled with the suggested algorithms for communication from a selected source
More informationLink Estimation and Tree Routing
Network Embedded Systems Sensor Networks Link Estimation and Tree Routing 1 Marcus Chang, mchang@cs.jhu.edu Slides: Andreas Terzis Outline Link quality estimation Examples of link metrics Four-Bit Wireless
More information15-441: Computer Networking. Wireless Networking
15-441: Computer Networking Wireless Networking Outline Wireless Challenges 802.11 Overview Link Layer Ad-hoc Networks 2 Assumptions made in Internet Host are (mostly) stationary Address assignment, routing
More informationCS 268: Computer Networking. Taking Advantage of Broadcast
CS 268: Computer Networking L-12 Wireless Broadcast Taking Advantage of Broadcast Opportunistic forwarding Network coding Assigned reading XORs In The Air: Practical Wireless Network Coding ExOR: Opportunistic
More informationWireless Sensornetworks Concepts, Protocols and Applications. Chapter 5b. Link Layer Control
Wireless Sensornetworks Concepts, Protocols and Applications 5b Link Layer Control 1 Goals of this cha Understand the issues involved in turning the radio communication between two neighboring nodes into
More informationLecture 20: Link Layer
Lecture 20: Link Layer COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W. Ross, All Rights
More informationMobile Communications. Ad-hoc and Mesh Networks
Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between
More informationUnicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
More informationUCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.
Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction
More informationMulti-Hop ARQ 林咨銘 2006/8/24.
Multi-Hop ARQ 林咨銘 2006/8/24 tmlin@itri.org.tw Outline Introduction Multi-Hop Scenario Multi-Hop Issues Multi-Hop ARQ Schemes Multi-hop ARQ [1] VTC 2005 Spring Relay ARQ[2] VTC 2005 Fall Summary Multi-Hop
More informationRouting. 4. Mar INF-3190: Switching and Routing
Routing 4. Mar. 004 1 INF-3190: Switching and Routing Routing: Foundations! Task! To define the route of packets through the network! From the source! To the destination system! Routing algorithm! Defines
More informationAn Implementation of Cross Layer Approach to Improve TCP Performance in MANET
An Implementation of Cross Layer Approach to Improve TCP Performance in MANET 1 Rajat Sharma Pursuing M.tech(CSE) final year from USIT(GGSIPU), Dwarka, New Delhi E-mail address: rajatfit4it@gmail.com 2
More informationData Link Control Protocols
Protocols : Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 Y12S1L07, Steve/Courses/2012/s1/its323/lectures/datalink.tex,
More informationFinal Exam: Mobile Networking (Part II of the course Réseaux et mobilité )
Final Exam: Mobile Networking (Part II of the course Réseaux et mobilité ) Prof. J.-P. Hubaux February 12, 2004 Duration: 2 hours, all documents allowed Please write your answers on these sheets, at the
More informationNetworking Link Layer
Networking Link Layer ECE 650 Systems Programming & Engineering Duke University, Spring 2018 (Link Layer Protocol material based on CS 356 slides) TCP/IP Model 2 Layer 1 & 2 Layer 1: Physical Layer Encoding
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationWireless Sensor Networks
Wireless Sensor Networks c.buratti@unibo.it +9 051 20 9147 Office Hours: Tuesday 5 pm @ Main Building, third fllor Credits: 6 Protocol Stack Time Synchronization Energy Efficiency Distributed Processing
More informationRouting, Routers, Switching Fabrics
Routing, Routers, Switching Fabrics Outline Link state routing Link weights Router Design / Switching Fabrics CS 640 1 Link State Routing Summary One of the oldest algorithm for routing Finds SP by developing
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 6 CMPE 257 Winter'11 1 Announcements Project proposals. Student presentations. 10 students so
More informationWireless Sensor Networks
Wireless Sensor Networks c.buratti@unibo.it +9 051 20 9147 Office Hours: Tuesday 5 pm @ Main Building, third fllor Credits: 6 Protocol Stack Time Synchronization Energy Efficiency Distributed Processing
More informationComputer Networks. Sándor Laki ELTE-Ericsson Communication Networks Laboratory
Computer Networks Sándor Laki ELTE-Ericsson Communication Networks Laboratory ELTE FI Department Of Information Systems lakis@elte.hu http://lakis.web.elte.hu Based on the slides of Laurent Vanbever. Further
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationWireless Internet Routing. Learning from Deployments Link Metrics
Wireless Internet Routing Learning from Deployments Link Metrics 1 Learning From Deployments Early worked focused traditional routing issues o Control plane: topology management, neighbor discovery o Data
More informationArvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More informationWireless Networking & Mobile Computing
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless
More informationMAC Protocols for WSNs Internet of Things (ex Reti Avanzate), a.a. 2015/2016
MAC Protocols for WSNs Internet of Things (ex Reti Avanzate), a.a. 2015/2016 Un. of Rome La Sapienza Chiara Petrioli Department of Computer Science University of Rome Sapienza Italy S-MAC (Sensor MAC)
More informationETSF05/ETSF10 Internet Protocols. Routing on the Internet
ETSF05/ETSF10 Internet Protocols Routing on the Internet Circuit switched routing ETSF05/ETSF10 - Internet Protocols 2 Routing in Packet Switching Networks Key design issue for (packet) switched networks
More informationLecture 7: Flow Control"
Lecture 7: Flow Control" CSE 123: Computer Networks Alex C. Snoeren No class Monday! Lecture 7 Overview" Flow control Go-back-N Sliding window 2 Stop-and-Wait Performance" Lousy performance if xmit 1 pkt
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationMobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading
Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput
More informationAd hoc and Sensor Networks Chapter 6: Link layer protocols. Holger Karl
Ad hoc and Sensor Networks Chapter 6: Link layer protocols Holger Karl Goals of this chapter Link layer tasks in general Framing group bit sequence into packets/frames Important: format, size Error control
More informationEffects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks
Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Mina Malekzadeh Golestan University Zohre Fereidooni Golestan University M.H. Shahrokh Abadi
More informationADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous Duty-Cycling in Wireless Sensor Networks
AD: An Efficient Multihop roadcast Protocol ased on Asynchronous Duty-Cycling in Wireless Sensor Networks Yanjun Sun* Omer Gurewitz Shu Du Lei Tang* David. Johnson* *Rice University en Gurion University
More informationSENSOR-MAC CASE STUDY
SENSOR-MAC CASE STUDY Periodic Listen and Sleep Operations One of the S-MAC design objectives is to reduce energy consumption by avoiding idle listening. This is achieved by establishing low-duty-cycle
More informationDelay Tolerant Networks
Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected
More informationA Spatio-temporal Access Network for Area Event Monitoring p.1
A Spatio-temporal Access Network for Area Event Monitoring Jussi Haapola Centre for Wireless Communications (CWC) A Spatio-temporal Access Network for Area Event Monitoring p.1 Motivation Large sensor
More informationTCP Congestion Control
6.033, Spring 2014 TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina Sharing the Internet How do you manage resources in a huge system like the Internet, where users with different
More informationMobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Journal of Computer Science 8 (1): 13-17, 2012 ISSN 1549-3636 2011 Science Publications Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV 1 S. Deepa and 2 G.M. Kadhar
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationDesign and Performance Evaluation of a New Spatial Reuse FireWire Protocol. Master s thesis defense by Vijay Chandramohan
Design and Performance Evaluation of a New Spatial Reuse FireWire Protocol Master s thesis defense by Vijay Chandramohan Committee Members: Dr. Christensen (Major Professor) Dr. Labrador Dr. Ranganathan
More informationXORs in the Air: Practical Wireless Network Coding
XORs in the Air: Practical Wireless Network Coding S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft MIT & University of Cambridge Can we use 3 transmissions to send traffic? 1 2 4 3 Can we
More informationRouting in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
More informationWilliam Stallings Data and Computer Communications. Chapter 10 Packet Switching
William Stallings Data and Computer Communications Chapter 10 Packet Switching Principles Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection
More informationRouting in Switched Data Networks
in Switched Data Networks ITS323: Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 ITS323Y12S1L10, Steve/Courses/2012/s1/its323/lectures/routing.tex,
More informationMobile Ad-Hoc Networks & Routing Algorithms
Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE
More informationStudy of RPL DODAG Version Attacks
Study of RPL DODAG Version Attacks Anthéa Mayzaud anthea.mayzaud@inria.fr Rémi Badonnel Isabelle Chrisment Anuj Sehgal s.anuj@jacobs-university.de Jürgen Schönwälder IFIP AIMS 2014 Brno, Czech Republik
More informationVisibility: A New Metric For Protocol Design
Visibility: A ew Metric For Protocol Design Megan Wachs, Jung Il Choi, Jung Woo Lee, Kannan Srinivasan, Zhe Chen, Mayank Jain, and Philip Levis Computer Systems Laboratory, Stanford University, Stanford,
More informationPerformance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model
American Journal of Applied Sciences 5 (6): 659-664, 2008 ISSN 1546-9239 2008 Science Publications Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationCSCI Spring Final Exam Solution
CSCI 4211 16Spring Final Exam Solution 1. When an IP packet arrives a router, how the router decides what is the next router (output link) this packet to be forwarded to? What are the routing table and
More informationFairness Example: high priority for nearby stations Optimality Efficiency overhead
Routing Requirements: Correctness Simplicity Robustness Under localized failures and overloads Stability React too slow or too fast Fairness Example: high priority for nearby stations Optimality Efficiency
More informationModule 1. Introduction. Version 2, CSE IIT, Kharagpur
Module 1 Introduction Version 2, CSE IIT, Kharagpur Introduction In this module we shall highlight some of the basic aspects of computer networks in two lessons. In lesson 1.1 we shall start with the historical
More informationBasics (cont.) Characteristics of data communication technologies OSI-Model
48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49
More informationNetworks. Distributed Systems. Philipp Kupferschmied. Universität Karlsruhe, System Architecture Group. May 6th, 2009
Networks Distributed Systems Philipp Kupferschmied Universität Karlsruhe, System Architecture Group May 6th, 2009 Philipp Kupferschmied Networks 1/ 41 1 Communication Basics Introduction Layered Communication
More informationQueuing Disciplines. Order of Packet Transmission and Dropping. Laboratory. Objective. Overview
Laboratory 2 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationCSCD 330 Network Programming
CSCD 330 Network Programming Lecture 10 Transport Layer Continued Spring 2018 Reading: Chapter 3 Some Material in these slides from J.F Kurose and K.W. Ross All material copyright 1996-2007 1 Last Time.
More informationLecture 5: Flow Control. CSE 123: Computer Networks Alex C. Snoeren
Lecture 5: Flow Control CSE 123: Computer Networks Alex C. Snoeren Pipelined Transmission Sender Receiver Sender Receiver Ignored! Keep multiple packets in flight Allows sender to make efficient use of
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationThe Effects of Asymmetry on TCP Performance
The Effects of Asymmetry on TCP Performance Hari Balakrishnan Venkata N. Padmanabhan Randy H. Katz University of California at Berkeley Daedalus/BARWAN Retreat June 1997 Outline Overview Bandwidth asymmetry
More informationWireless TCP Performance Issues
Wireless TCP Performance Issues Issues, transport layer protocols Set up and maintain end-to-end connections Reliable end-to-end delivery of data Flow control Congestion control Udp? Assume TCP for the
More informationAd Hoc Networks: Introduction
Ad Hoc Networks: Introduction Module A.int.1 Dr.M.Y.Wu@CSE Shanghai Jiaotong University Shanghai, China Dr.W.Shu@ECE University of New Mexico Albuquerque, NM, USA 1 Ad Hoc networks: introduction A.int.1-2
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationCSE 123: Computer Networks Alex C. Snoeren. HW 1 due NOW!
CSE 123: Computer Networks Alex C. Snoeren HW 1 due NOW! Automatic Repeat Request (ARQ) Acknowledgements (ACKs) and timeouts Stop-and-Wait Sliding Window Forward Error Correction 2 Link layer is lossy
More informationPIE in the Sky : Online Passive Interference Estimation for Enterprise WLANs
WiNGS Labs PIE in the Sky : Online Passive Interference Estimation for Enterprise WLANs * Nokia Research Center, Palo Alto Shravan Rayanchu, Suman Banerjee University of Wisconsin-Madison Konstantina Papagiannaki
More informationData gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks
Mobile Information Systems 9 (23) 295 34 295 DOI.3233/MIS-364 IOS Press Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks Keisuke Goto, Yuya Sasaki, Takahiro
More informationGeographic Routing in Simulation: GPSR
Geographic Routing in Simulation: GPSR Brad Karp UCL Computer Science CS M038/GZ06 23 rd January 2013 Context: Ad hoc Routing Early 90s: availability of off-the-shelf wireless network cards and laptops
More informationEtiquette protocol for Ultra Low Power Operation in Sensor Networks
Etiquette protocol for Ultra Low Power Operation in Sensor Networks Samir Goel and Tomasz Imielinski {gsamir, imielins}@cs.rutgers.edu DataMan Lab, Department of Computer Science Acknowledgement: Prof.
More informationNetwork Architecture
Unit 7 Network Architecture Acknowledgments: These slides were originally developed by Prof. Jean Walrand for EE122. The past and current EE122 instructors including Kevin Fall, Abhay Parekh, Shyam Parekh,
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationExpected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network
Expected Path Bandwidth Based Efficient Routing Mechanism in Wireless Mesh Network K Anandkumar, D.Vijendra Babu PG Student, Chennai, India Head, Chennai, India ABSTRACT : Wireless mesh networks (WMNs)
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationLayer 3: Network Layer. 9. Mar INF-3190: Switching and Routing
Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate
More informationOverview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers
Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control
More informationNetwork Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture
Network Routing Packet Routing, Routing Algorithms, Routers, Router Architecture Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction
More informationAd Hoc Networks: Issues and Routing
Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/
More informationDYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 DYNAMIC DATA ROUTING IN MANET USING POSITION BASED OPPORTUNISTIC ROUTING PROTOCOL P. Kalaivani 1, G. Sathya 2, N.
More informationWireless and WiFi. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Wireless and WiFi Daniel Zappala CS 460 Computer Networking Brigham Young University Wireless Networks 2/28 mobile phone subscribers now outnumber wired phone subscribers similar trend likely with Internet
More informationTowards a Robust Protocol Stack for Diverse Wireless Networks Arun Venkataramani
Towards a Robust Protocol Stack for Diverse Wireless Networks Arun Venkataramani (in collaboration with Ming Li, Devesh Agrawal, Deepak Ganesan, Aruna Balasubramanian, Brian Levine, Xiaozheng Tie at UMass
More informationWireless and Mobile Networks Reading: Sections 2.8 and 4.2.5
Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained
More informationITTC A Geographical Routing Protocol for Highly-Dynamic Aeronautical Networks
A Geographical Routing Protocol for Highly-Dynamic Aeronautical Networks Kevin Peters, Abdul Jabbar, Egemen K. Çetinkaya, James P.G. Sterbenz Department of Electrical Engineering & Computer Science Information
More information