The Internet vs. Sensor Nets

Size: px
Start display at page:

Download "The Internet vs. Sensor Nets"

Transcription

1 The Internet vs. Sensor Nets, Philip Levis 5/5/04 0

2 The Internet vs. Sensor Nets What they ve learned, Philip Levis 5/5/04 1

3 The Internet vs. Sensor Nets What they ve learned, and we ve forgotten. Philip Levis 5/5/04 2

4 The Internet vs. Sensor Nets What they ve learned, and we ve forgotten. What we ve learned, Philip Levis 5/5/04 3

5 The Internet vs. Sensor Nets What they ve learned, and we ve forgotten. What we ve learned, and they ve ignored. Philip Levis 5/5/04 4

6 The Internet vs. Sensor Nets What they ve learned, and we ve forgotten. (BIG) What we ve learned, and they ve ignored. (small) Philip Levis 5/5/04 5

7 The Internet vs. Sensor Nets What they ve learned, and we ve forgotten. (BIG) What we ve learned, and they ve ignored. (small) Philip Levis 5/5/04 6

8 Usage Patterns and Assumptions Internet Sensor Net Independent hosts End to end flows Two-tier architecture Wired (generally) Latency Throughput Bandwidth is relatively cheap Limited in-network state Single, collaborative use Collect, disseminate, and others Ad-hoc (more homogenous) Low power wireless Wake time Very low utilization Bandwidth is expensive RAM is limiting physical resource 5/5/04 7

9 Usage Patterns and Assumptions Internet Sensor Net Independent hosts End to end flows Two-tier architecture Wired (generally) Latency Throughput Bandwidth is relatively cheap Limited in-network state Single, collaborative use Collect, disseminate, and others Ad-hoc (more homogenous) Low power wireless Wake time Very low utilization Bandwidth is expensive RAM is limiting physical resource A lot of differences 5/5/04 8

10 Network Architecture Internet Sensor Net Interconnect separate networks Resilience to loss and failure Support many comm. services Accommodate variety Distributed management Cost effective Low effort attachment Resource accountability Dense real world monitoring Resilience to loss, failure and noise Support many applications Scale to large, small, long Cost effective Evolvable in resources Composable Security 5/5/04 9

11 Network Architecture Internet Sensor Net Interconnect separate networks Resilience to loss and failure Support many comm. services Accommodate variety Distributed management Cost effective Low effort attachment Resource accountability Dense real world monitoring Resilience to loss, failure and noise Support many applications Scale to large, small, long Cost effective Evolvable in resources Composable Security but many of the same principles apply. 5/5/04 10

12 Similar, but Different Very different purposes But similar architectural principles Problems are different in the details, similar at a high level Sensor network problems probably have Internet analogues Need a new solution, but probably similar to existing ones Converse: Internet paradigm doesn t work for sensor nets Wireless vs. wired Usage models: what are the key issues? 5/5/04 11

13 Outline Similar but different Phil and Scott: A Dialogue How can IP Solutions Fall Short? A Sensor Network Architecture Conclusion 5/5/04 12

14 Phil and Scott: A Dialogue Phil Scott 5/5/04 13

15 Phil and Scott: A Dialogue Phil Scott I have an algorithm. 5/5/04 14

16 Phil and Scott: A Dialogue Phil I have an algorithm. Scott What does it do? 5/5/04 15

17 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. What does it do? 5/5/04 16

18 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. What does it do? Is that important? I ll take your word for it. 5/5/04 17

19 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. What does it do? Is that important? I ll take your word for it. 5/5/04 18

20 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. What does it do? Is that important? I ll take your word for it. Such as? 5/5/04 19

21 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. It suppresses redundant messages! What does it do? Is that important? I ll take your word for it. Such as? 5/5/04 20

22 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. It suppresses redundant messages! What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. 5/5/04 21

23 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. It suppresses redundant messages! It avoids floods! What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. 5/5/04 22

24 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. It suppresses redundant messages! It avoids floods! What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. Have you ever heard of pbcast? 5/5/04 23

25 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties. It suppresses redundant messages! It avoids floods! It spreads like a virus! What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. Have you ever heard of pbcast? 5/5/04 24

26 Phil and Scott: A Dialogue Phil Scott I have an algorithm. It s for propagating code in sensor networks. It has some nice properties It suppresses redundant messages! It avoids floods! It spreads like a virus! What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. Have you ever heard of pbcast? Oh, it s an epidemic algorithm. 5/5/04 25

27 Phil and Scott: A Dialogue Phil I have an algorithm. It s for propagating code in sensor networks. It has some nice properties It suppresses redundant messages! It avoids floods! It spreads like a virus! Scott What does it do? Is that important? I ll take your word for it. Such as? So, there s this thing called SRM. Have you ever heard of pbcast? Oh, it s an epidemic algorithm. Philip Levis, Neil Patel, David Culler and Scott Shenker. Trickle: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Networks. NSDI /5/04 26

28 What I Learned Internet solutions generally don t apply to sensor networks Their underlying techniques do Apply, change and adapt to the peculiarities of sensor networks 5/5/04 27

29 What I Learned Internet solutions generally don t apply to sensor networks Their underlying techniques do Apply, change and adapt to the peculiarities of sensor networks I thought I had read the literature of my community already! SIGCOMM has been around a long while. 5/5/04 28

30 Outline Similar but different Phil and Scott: A Dialogue How can IP Solutions Fall Short? A Sensor Network Architecture Conclusion 5/5/04 29

31 How Can Current IP Solutions Fall Short? Assumptions of behavior Hari: The problem with any-to-any routing is your bandwidth goes to zero as the network size increases. Robert has a paper on this in Mobicom. Phil: But GDI uses less than 0.2% of the network bandwidth. Assumptions of environment (control) Stability (can it hose my network?) vs. optimality (can it go faster?) Sensor nets are a walled garden, but you re outside. Wireless networks aren t a graph There is wireless IP, but 5/5/04 30

32 Wireless Networks Aren t a Graph A graph assumes link independence In a wireless network, transmissions can affect distant nodes This is not necessarily a binary relationship A L AB B C L CD 5/5/04 31 D

33 Wireless Networks Aren t a Graph A graph assumes link independence In a wireless network, transmissions can affect distant nodes This is not necessarily a binary relationship A L AB B C A transmits to B L CD 5/5/04 32 D

34 Wireless Networks Aren t a Graph A graph assumes link independence In a wireless network, transmissions can affect distant nodes This is not necessarily a binary relationship A L AB B C C transmits to D L CD 5/5/04 33 D

35 What Constitutes Inteference? Depends on the keying OOK, ASK, FSK, QPSK, etc. Example: CC1000 (mica2 nodes), 1 bit/baud FSK radio Experiment: One node transmits Immediately, two nodes respond, no media acccess What does the first node hear? 5/5/04 34

36 What Constitutes Inteference? Depends on the keying OOK, ASK, FSK, QPSK, etc. Example: CC1000 (mica2 nodes), 1 bit/baud FSK radio Experiment: One node transmits Immediately, two nodes respond, no media acccess What does the first node hear? One node, deterministically (the FM capture effect) Move the nodes slightly, which of the two may change ASK/OOK (mica, rene) behaves completely differently What about Telos, micaz ( , QPSK)? 5/5/04 35

37 If Not a Graph, Then What? Every transmission perturbs the graph: links are not independent Except when utilization is so low that there are no interactions Link estimates change when there is traffic Recent work on a theoretical model for reasoning about wireless networks: Mobicom 2003: Kamal Jain et al., MSR: Conflict Graphs Assumes binary interference An unanswered question 5/5/04 36

38 Outline Similar but different Phil and Scott: A Dialogue How can IP Solutions Fall Short? A Sensor Network Architecture Conclusion 5/5/04 37

39 Network Architecture Internet Sensor Net Interconnect separate networks Resilience to loss and failure Support many comm. services Accommodate variety Distributed management Cost effective Low effort attachment Resource accountability Dense real world monitoring Resilience to loss, failure and noise Support many applications Scale to large, small, long Cost effective Evolvable in resources Composable Security 5/5/04 38

40 A Current Sensor Network Flaw You can change anything and everything No structure to protocols, solutions Great for research, bad for getting things done Need interoperability E.g., diffusion: naming, routing, link estimation, all in one Sensor networks need an architectural design 5/5/04 39

41 Architectural Proposal Culler, Shenker, Stoica, et al. Sensor-Net Application In-Network Storage Security System Management Power Management Time Coordination Discovery Address-Free Protocols Data Link Custody Transfer Sensor-Net Protocol Triggers Name-Based Protocols Suppression Predicates Caching Estimation Graphs Naming Media Access Timestamping Coding Assembly ACK Narrow Waist: Local broadcast Physical Architecture Sensing Energy Storage Carrier Sense Transmit Receive 5/5/04 40

42 The Narrow Waist Data link instead of network layer Accomodates many network layer protocols Floods, dissemination, routing, diffusion, etc. Should be as minimal as possible Address-free, typed, variable len gth packet Layer addressing/naming on top Reflects resource differences In-network processing is desirable Ad-hoc nature of the network Not a two-tier architecture 5/5/04 41

43 Address-Free Protocols A broad class of sensor net protocols do not require addresses Dissemination, local aggregation, code propagation, Trickle Use local wireless broadcast as implicit naming scheme Roughly approximates nearby nodes A predicate determines whether a node forwards The false predicate: local broadcast The true predicate: full network propagation Predicate defines connected subregions 5/5/04 42

44 In-Network Storage Distinct from but related to data centric storage Not all sensor network traffic is slow and continuous Triggers, high bandwidth events Data rate can easily exceed network rate Need to locally store data before forwarding Tree-based aggregation Temporary disconnection Flow control, end-to-end delivery Sensor network transport? 5/5/04 43

45 Outline Similar but different Phil and Scott: A Dialogue How can IP Solutions Fall Short? A Sensor Network Architecture Conclusion 5/5/04 44

46 Some Obscure Similarities? Internet Sensor Net Multicast High speed packet classification High speed TCP Dissemination Single hop link estimators Media access 5/5/04 45

47 Conclusion The networking community has solved a LOT of problems Some of those solutions are very useful in sensor networks But not all of them: we don t need TCP <insert moniker here> Those that are useful can rarely be taken as is (SPIN, SRM) The research challenge is understanding the important differences and adapting, applying, and inventing as need be. 5/5/04 46

48 Questions 5/5/04 47

Towards a Sensor Network Architecture: Issues and Challenges. Muneeb Ali LUMS, Pakistan SICS, Sweden

Towards a Sensor Network Architecture: Issues and Challenges. Muneeb Ali LUMS, Pakistan SICS, Sweden Towards a Sensor Network Architecture: Issues and Challenges Muneeb Ali LUMS, Pakistan SICS, Sweden Talk at Knuth SICS, Sweden, November 2005 Outline Introduction Internet vs Sensor Networks Towards a

More information

More wireless: Sensor networks and TCP on mobile hosts

More wireless: Sensor networks and TCP on mobile hosts More wireless: Sensor networks and TCP on mobile hosts CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) Outline Routing in sensor networks

More information

Outline. Mate: A Tiny Virtual Machine for Sensor Networks Philip Levis and David Culler. Motivation. Applications. Mate.

Outline. Mate: A Tiny Virtual Machine for Sensor Networks Philip Levis and David Culler. Motivation. Applications. Mate. Outline Mate: A Tiny Virtual Machine for Sensor Networks Philip Levis and David Culler Presented by Mark Tamola CSE 521 Fall 2004 Motivation Mate Code Propagation Conclusions & Critiques 1 2 Motivation

More information

Some portions courtesy Srini Seshan or David Wetherall

Some portions courtesy Srini Seshan or David Wetherall CSE 123 Computer Networks Fall 2009 Lecture 6: Data-Link III: Hubs, Bridges and Switches Some portions courtesy Srini Seshan or David Wetherall Misc Homework solutions have been posted I ll post a sample

More information

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures

Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures By Chris Karlof and David Wagner Lukas Wirne Anton Widera 23.11.2017 Table of content 1. Background 2. Sensor Networks vs. Ad-hoc

More information

15-441: Computer Networking. Wireless Networking

15-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 information

Week 2 / Paper 1. The Design Philosophy of the DARPA Internet Protocols

Week 2 / Paper 1. The Design Philosophy of the DARPA Internet Protocols Week 2 / Paper 1 The Design Philosophy of the DARPA Internet Protocols David D. Clark ACM CCR, Vol. 18, No. 4, August 1988 Main point Many papers describe how the Internet Protocols work But why do they

More information

ADB: An Efficient Multihop Broadcast Protocol Based on Asynchronous Duty-Cycling in Wireless Sensor Networks

ADB: 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 information

CS551 Ad-hoc Routing

CS551 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 information

15-441: Computer Networking. Lecture 24: Ad-Hoc Wireless Networks

15-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 information

CS 268: Internet Architecture & E2E Arguments. Today s Agenda. Scott Shenker and Ion Stoica (Fall, 2010) Design goals.

CS 268: Internet Architecture & E2E Arguments. Today s Agenda. Scott Shenker and Ion Stoica (Fall, 2010) Design goals. CS 268: Internet Architecture & E2E Arguments Scott Shenker and Ion Stoica (Fall, 2010) 1 Today s Agenda Design goals Layering (review) End-to-end arguments (review) 2 1 Internet Design Goals Goals 0 Connect

More information

Media Access Control in Ad Hoc Networks

Media Access Control in Ad Hoc Networks Media Access Control in Ad Hoc Networks The Wireless Medium is a scarce precious resource. Furthermore, the access medium is broadcast in nature. It is necessary to share this resource efficiently and

More information

The Firecracker Protocol

The Firecracker Protocol The Firecracker Protocol Philip Levis and David Culler {pal,culler}@eecs.berkeley.edu EECS Department University of California, Berkeley Berkeley, CA 94720 ABSTRACT We propose the Firecracker protocol

More information

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading

Mobile 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 information

Link Estimation and Tree Routing

Link 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 information

MAC LAYER. Murat Demirbas SUNY Buffalo

MAC LAYER. Murat Demirbas SUNY Buffalo MAC LAYER Murat Demirbas SUNY Buffalo MAC categories Fixed assignment TDMA (Time Division), CDMA (Code division), FDMA (Frequency division) Unsuitable for dynamic, bursty traffic in wireless networks Random

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

CSE 123A Computer Networks

CSE 123A Computer Networks CSE 123A Computer Networks Winter 2005 Lecture 6: Data-Link III: Hubs, Bridges and Switches Some portions courtesy Srini Seshan or David Wetherall Last Time How do multiple hosts share a single channel?

More information

Wireless MACs: MACAW/802.11

Wireless MACs: MACAW/802.11 Wireless MACs: MACAW/802.11 Mark Handley UCL Computer Science CS 3035/GZ01 Fundamentals: Spectrum and Capacity A particular radio transmits over some range of frequencies; its bandwidth, in the physical

More information

Sensor Network Protocol Design and Implementation. Philip Levis UC Berkeley

Sensor Network Protocol Design and Implementation. Philip Levis UC Berkeley Sensor Network Protocol Design and Implementation Philip Levis UC Berkeley Sensor Network Constraints Distibuted, wireless networks with limited resources Energy, energy, energy. Communication is expensive.

More information

CS 43: Computer Networks The Network Layer. Kevin Webb Swarthmore College November 2, 2017

CS 43: Computer Networks The Network Layer. Kevin Webb Swarthmore College November 2, 2017 CS 43: Computer Networks The Network Layer Kevin Webb Swarthmore College November 2, 2017 TCP/IP Protocol Stack host host HTTP Application Layer HTTP TCP Transport Layer TCP router router IP IP Network

More information

A 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 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 information

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols

ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric

More information

Sensor Networks. Part 3: TinyOS. CATT Short Course, March 11, 2005 Mark Coates Mike Rabbat. Operating Systems 101

Sensor Networks. Part 3: TinyOS. CATT Short Course, March 11, 2005 Mark Coates Mike Rabbat. Operating Systems 101 Sensor Networks Part 3: TinyOS CATT Short Course, March 11, 2005 Mark Coates Mike Rabbat 1 Operating Systems 101 operating system (äp ǝr āt ing sis tǝm) n. 1 software that controls the operation of a computer

More information

DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK

DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK DISCOVERING OPTIMUM FORWARDER LIST IN MULTICAST WIRELESS SENSOR NETWORK G.Ratna kumar, Dr.M.Sailaja, Department(E.C.E), JNTU Kakinada,AP, India ratna_kumar43@yahoo.com, sailaja.hece@gmail.com ABSTRACT:

More information

An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks

An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks Euro-par 27 Hugo Miranda Simone Leggio 2 Luís Rodrigues Kimmo Raatikainen 2 University of Lisbon and LaSIGE - Portugal

More information

Multicast EECS 122: Lecture 16

Multicast EECS 122: Lecture 16 Multicast EECS 1: Lecture 16 Department of Electrical Engineering and Computer Sciences University of California Berkeley Broadcasting to Groups Many applications are not one-one Broadcast Group collaboration

More information

Making Friends with Broadcast. Administrivia

Making Friends with Broadcast. Administrivia Making Friends with Broadcast CMU 15-744 David Andersen Administrivia Midterm Mean 66.5, Median 70, Stddev 13.7 Histo: 35-39 37 38 40-44 45-49 50-54 54 54 54 55-59 56 57 60-64 61 64 64 65-69 69 70-74 71

More information

Outline. Lecture 16: Wireless Networking. Physical Layer (Layer 1) Ethernet: Wireless is Different. Attenuation Over Space

Outline. Lecture 16: Wireless Networking. Physical Layer (Layer 1) Ethernet: Wireless is Different. Attenuation Over Space Outline Lecture 16: Wireless Networking Wireless physical layer challenges - Signal, noise, modulation - A little bit of EE goes a long way Wireless link layers - Hidden terminals, exposed terminals -

More information

Lecture 6: Bridging & Switching. Last time. Today. CSE 123: Computer Networks Chris Kanich. How do multiple hosts share a single channel?

Lecture 6: Bridging & Switching. Last time. Today. CSE 123: Computer Networks Chris Kanich. How do multiple hosts share a single channel? Lecture 6: ridging & Switching SE 3: omputer Networks hris Kanich Project countdown: 5 days Last time How do multiple hosts share a single channel? Medium ccess ontrol (M) protocols hannel partitioning

More information

Granting Silence to Avoid Wireless Collisions

Granting Silence to Avoid Wireless Collisions Granting Silence to Avoid Wireless Collisions Jung Il Choi, Mayank Jain, Maria A. Kazandjieva, and Philip Levis October 6, 2010 ICNP 2010 Wireless Mesh and CSMA One UDP flow along a static 4-hop route

More information

STEVEN R. BAGLEY PACKETS

STEVEN R. BAGLEY PACKETS STEVEN R. BAGLEY PACKETS INTRODUCTION Talked about how data is split into packets Allows it to be multiplexed onto the network with data from other machines But exactly how is it split into packets and

More information

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL

CHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.

More information

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may

More information

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers

Overview. 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 information

Mobile and Sensor Systems. Lecture 3: Infrastructure, Ad-hoc and Delay Tolerant Mobile Networks Dr Cecilia Mascolo

Mobile and Sensor Systems. Lecture 3: Infrastructure, Ad-hoc and Delay Tolerant Mobile Networks Dr Cecilia Mascolo Mobile and Sensor Systems Lecture 3: Infrastructure, Ad-hoc and Delay Tolerant Mobile Networks Dr Cecilia Mascolo In this lecture In this lecture we will describe the difference in infrastructure and ad

More information

CE693: Adv. Computer Networking

CE693: 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 information

Wireless Mesh Networks

Wireless Mesh Networks Wireless Mesh Networks COS 463: Wireless Networks Lecture 6 Kyle Jamieson [Parts adapted from I. F. Akyildiz, B. Karp] Wireless Mesh Networks Describes wireless networks in which each node can communicate

More information

CS118 Discussion, Week 6. Taqi

CS118 Discussion, Week 6. Taqi CS118 Discussion, Week 6 Taqi 1 Outline Network Layer IP NAT DHCP Project 2 spec 2 Network layer: overview Basic functions for network layer Routing Forwarding Connection v.s. connection-less delivery

More information

CS519: Computer Networks. Lecture 1 (part 2): Jan 28, 2004 Intro to Computer Networking

CS519: Computer Networks. Lecture 1 (part 2): Jan 28, 2004 Intro to Computer Networking : Computer Networks Lecture 1 (part 2): Jan 28, 2004 Intro to Computer Networking Remember this picture? How did the switch know to forward some packets to B and some to D? From the address in the packet

More information

Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks

Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Energy-Efficient Communication Protocol for Wireless Micro-sensor Networks Paper by: Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan Outline Brief Introduction on Wireless Sensor

More information

Outline. MAC (Medium Access Control) General MAC Requirements. Typical MAC protocols. Typical MAC protocols

Outline. MAC (Medium Access Control) General MAC Requirements. Typical MAC protocols. Typical MAC protocols Outline Medium ccess ontrol With oordinated daptive Sleeping for Wireless Sensor Networks Presented by: rik rooks Introduction to M S-M Overview S-M Evaluation ritique omparison to MW Washington University

More information

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Reminder: Datalink Functions Computer Networking. Datalink Architectures Reminder: Datalink Functions 15-441 15 441 15-641 Computer Networking Lecture 5 Media Access Control Peter Steenkiste Fall 2015 www.cs.cmu.edu/~prs/15-441-f15 Framing: encapsulating a network layer datagram

More information

Ad Hoc Networks: Issues and Routing

Ad 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 information

Information Brokerage

Information Brokerage Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,

More information

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer

More information

Data-Centric Query in Sensor Networks

Data-Centric Query in Sensor Networks Data-Centric Query in Sensor Networks Jie Gao Computer Science Department Stony Brook University 10/27/05 Jie Gao, CSE590-fall05 1 Papers Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed

More information

Chapter 1 - Introduction

Chapter 1 - Introduction Chapter 1-lntroduction Chapter 1 - Introduction The aim of this chapter is to provide a background to topics which are relevant to the subject of this thesis. The motivation for writing a thesis regarding

More information

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang Intelligent Transportation Systems Medium Access Control Prof. Dr. Thomas Strang Recap: Wireless Interconnections Networking types + Scalability + Range Delay Individuality Broadcast o Scalability o Range

More information

Sensor Network Protocols

Sensor Network Protocols EE360: Lecture 15 Outline Sensor Network Protocols Announcements 2nd paper summary due March 7 Reschedule Wed lecture: 11-12:15? 12-1:15? 5-6:15? Project poster session March 15 5:30pm? Next HW posted

More information

CSE 123: Computer Networks Alex C. Snoeren. HW 2 due Thursday 10/21!

CSE 123: Computer Networks Alex C. Snoeren. HW 2 due Thursday 10/21! CSE 123: Computer Networks Alex C. Snoeren HW 2 due Thursday 10/21! Finishing up media access Contention-free methods (rings) Moving beyond one wire Link technologies have limits on physical distance Also

More information

CS 268: Computer Networking. Taking Advantage of Broadcast

CS 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 information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

More information

DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 1. Introduction

DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 1. Introduction DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 1 Introduction Definition of a Distributed System (1) A distributed system is: A collection of

More information

Outline. CS5984 Mobile Computing. Dr. Ayman Abdel-Hamid, CS5984. Wireless Sensor Networks 1/2. Wireless Sensor Networks 2/2

Outline. CS5984 Mobile Computing. Dr. Ayman Abdel-Hamid, CS5984. Wireless Sensor Networks 1/2. Wireless Sensor Networks 2/2 CS5984 Mobile Computing Outline : a Survey Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech An Introduction to 1 2 1/2 Advances in micro-electro-mechanical systems technology, wireless communications,

More information

Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network

Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network Fault Tolerant, Energy Saving Method for Reliable Information Propagation in Sensor Network P.S Patheja, Akhilesh Waoo & Parul Shrivastava Dept.of Computer Science and Engineering, B.I.S.T, Anand Nagar,

More information

IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE )

IPv6 Stack. 6LoWPAN makes this possible. IPv6 over Low-Power wireless Area Networks (IEEE ) Reference: 6LoWPAN: The Wireless Embedded Internet, Shelby & Bormann What is 6LoWPAN? 6LoWPAN makes this possible - Low-power RF + IPv6 = The Wireless Embedded Internet IPv6 over Low-Power wireless Area

More information

Ad hoc and Sensor Networks Chapter 13a: Protocols for dependable data transport

Ad hoc and Sensor Networks Chapter 13a: Protocols for dependable data transport Ad hoc and Sensor Networks Chapter 13a: Protocols for dependable data transport Holger Karl Computer Networks Group Universität Paderborn Overview Dependability requirements Delivering single packets Delivering

More information

Simulations of the quadrilateral-based localization

Simulations of the quadrilateral-based localization Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution

More information

Collection 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 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 information

References. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but

References. Introduction. Publish/Subscribe paradigm. In a wireless sensor network, a node is often interested in some information, but References Content-based Networking H. Karl and A. Willing. Protocols and Architectures t for Wireless Sensor Networks. John Wiley & Sons, 2005. (Chapter 12) P. Th. Eugster, P. A. Felber, R. Guerraoui,

More information

Lecture 16: Wireless Networks

Lecture 16: Wireless Networks &6( *UDGXDWH1HWZRUNLQJ :LQWHU Lecture 16: Wireless Networks Geoffrey M. Voelker :LUHOHVV1HWZRUNLQJ Many topics in wireless networking Transport optimizations, ad hoc routing, MAC algorithms, QoS, mobility,

More information

Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization

Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization Wireless Sensor Networks: Clustering, Routing, Localization, Time Synchronization Maurizio Bocca, M.Sc. Control Engineering Research Group Automation and Systems Technology Department maurizio.bocca@tkk.fi

More information

Overview of Sensor Network Routing Protocols. WeeSan Lee 11/1/04

Overview of Sensor Network Routing Protocols. WeeSan Lee 11/1/04 Overview of Sensor Network Routing Protocols WeeSan Lee weesan@cs.ucr.edu 11/1/04 Outline Background Data-centric Protocols Flooding & Gossiping SPIN Directed Diffusion Rumor Routing Hierarchical Protocols

More information

The Emergence of Networking Abstractions and Techniques in TinyOS

The Emergence of Networking Abstractions and Techniques in TinyOS The Emergence of Networking Abstractions and Techniques in TinyOS CS295-1 Paper Presentation Mert Akdere 10.12.2005 Outline Problem Statement & Motivation Background Information TinyOS HW Platforms Sample

More information

Multicast Communications. Slide Set were original prepared by Dr. Tatsuya Susa

Multicast Communications. Slide Set were original prepared by Dr. Tatsuya Susa Multicast Communications Slide Set were original prepared by Dr. Tatsuya Susa Outline 1. Advantages of multicast 2. Multicast addressing 3. Multicast Routing Protocols 4. Multicast in the Internet 5. IGMP

More information

PIE in the Sky : Online Passive Interference Estimation for Enterprise WLANs

PIE 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 information

Dynamic Source Routing in ad hoc wireless networks

Dynamic Source Routing in ad hoc wireless networks Dynamic Source Routing in ad hoc wireless networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University In Mobile Computing, vol. 353, chapter 5, T. Imielinski and H.

More information

TCP so far Computer Networking Outline. How Was TCP Able to Evolve

TCP so far Computer Networking Outline. How Was TCP Able to Evolve TCP so far 15-441 15-441 Computer Networking 15-641 Lecture 14: TCP Performance & Future Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 Reliable byte stream protocol Connection establishments

More information

From Routing to Traffic Engineering

From Routing to Traffic Engineering 1 From Routing to Traffic Engineering Robert Soulé Advanced Networking Fall 2016 2 In the beginning B Goal: pair-wise connectivity (get packets from A to B) Approach: configure static rules in routers

More information

Event Driven Routing Protocols For Wireless Sensor Networks

Event Driven Routing Protocols For Wireless Sensor Networks Event Driven Routing Protocols For Wireless Sensor Networks Sherif Moussa 1, Ghada Abdel Halim 2, Salah Abdel-Mageid 2 1 Faculty of Engineering, Canadian University Dubai, Dubai, UAE. 2 Faculty of Engineering,

More information

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis Computer Network Fundamentals Spring 2008 Week 3 MAC Layer Andreas Terzis Outline MAC Protocols MAC Protocol Examples Channel Partitioning TDMA/FDMA Token Ring Random Access Protocols Aloha and Slotted

More information

Part 1: Introduction. Goal: Review of how the Internet works Overview

Part 1: Introduction. Goal: Review of how the Internet works Overview Part 1: Introduction Goal: Review of how the Internet works Overview Get context Get overview, feel of the Internet Application layer protocols and addressing Network layer / Routing Link layer / Example

More information

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

A 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 information

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols High Level View EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 Goal: share a communication medium among multiple hosts connected to it Problem: arbitrate between connected hosts Solution goals:

More information

Outline 9.2. TCP for 2.5G/3G wireless

Outline 9.2. TCP for 2.5G/3G wireless Transport layer 9.1 Outline Motivation, TCP-mechanisms Classical approaches (Indirect TCP, Snooping TCP, Mobile TCP) PEPs in general Additional optimizations (Fast retransmit/recovery, Transmission freezing,

More information

ABSTRACTING CONNECTIVITY FOR IOT WITH A BACKHAUL OPERATOR

ABSTRACTING CONNECTIVITY FOR IOT WITH A BACKHAUL OPERATOR ABSTRACTING CONNECTIVITY FOR IOT WITH A BACKHAUL OPERATOR NIGEL CHADWICK VIDEO TRANSCRIPT Welcome! What s your name and what do you do? Hi, it s Nigel Chadwick. I m one of the founders of Stream Technologies.

More information

Lecture 10: Protocol Design

Lecture 10: Protocol Design Lecture 10: Protocol Design Prof. Shervin Shirmohammadi SITE, University of Ottawa Fall 2005 CEG 4183 10-1 Introduction TCP and UDP are generic protocols: They fulfill the needs of a wide range of applications

More information

CSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes

CSE 461 Routing. Routing. Focus: Distance-vector and link-state Shortest path routing Key properties of schemes CSE 46 Routing Routing Focus: How to find and set up paths through a network Distance-vector and link-state Shortest path routing Key properties of schemes Application Transport Network Link Physical Forwarding

More information

Medium Access Protocols

Medium Access Protocols Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning

More information

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey

Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey Comparison of TDMA based Routing Protocols for Wireless Sensor Networks-A Survey S. Rajesh, Dr. A.N. Jayanthi, J.Mala, K.Senthamarai Sri Ramakrishna Institute of Technology, Coimbatore ABSTRACT One of

More information

Next Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points

Next Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points Next Steps Have: digital point-to-point We ve worked on link signaling, reliability, sharing Want: many interconnected points 6.02 Spring 2011 Lecture #18 multi-hop networks: design criteria network topologies

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast 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 information

Copyright Link Technologies, Inc.

Copyright Link Technologies, Inc. 3/15/2011 Mikrotik Certified Trainer / Engineer MikroTik Certified Dude Consultant Consulting Since 1997 Enterprise Class Networks WAN Connectivity Certifications Cisco, Microsoft, MikroTik BGP/OSPF Experience

More information

SWAP and TCP performance

SWAP and TCP performance SWAP and TCP performance Jean Tourrilhes, HPLB 23 March 98 1 Introduction The SWAP protocol that we have proposed [4] the HRFWG is designed to carry TCP/IP traffic. Of course, we would never had proposed

More information

Draft Notes 1 : Scaling in Ad hoc Routing Protocols

Draft Notes 1 : Scaling in Ad hoc Routing Protocols Draft Notes 1 : Scaling in Ad hoc Routing Protocols Timothy X Brown University of Colorado April 2, 2008 2 Introduction What is the best network wireless network routing protocol? This question is a function

More information

EE 122: Ethernet and

EE 122: Ethernet and EE 122: Ethernet and 802.11 Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose) High Level View Goal: share a communication medium among multiple hosts

More information

Principles behind data link layer services

Principles behind data link layer services Data link layer Goals: Principles behind data link layer services Error detection, correction Sharing a broadcast channel: Multiple access Link layer addressing Reliable data transfer, flow control: Done!

More information

The Open System Interconnect model

The Open System Interconnect model The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually

More information

CS 3640: Introduction to Networks and Their Applications

CS 3640: Introduction to Networks and Their Applications CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 7: The Link Layer II Medium Access Control Protocols Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You

More information

CSC 401 Data and Computer Communications Networks

CSC 401 Data and Computer Communications Networks CSC 401 Data and Computer Communications Networks Computer Networks and The Inter Sec 1.3 Prof. Lina Battestilli Fall 2017 Outline Computer Networks and the Inter (Ch 1) 1.1 What is the Inter? 1.2 work

More information

CHAPTER 5 CONCLUSION AND SCOPE FOR FUTURE EXTENSIONS

CHAPTER 5 CONCLUSION AND SCOPE FOR FUTURE EXTENSIONS 130 CHAPTER 5 CONCLUSION AND SCOPE FOR FUTURE EXTENSIONS 5.1 INTRODUCTION The feasibility of direct and wireless multi-hop V2V communication based on WLAN technologies, and the importance of position based

More information

Network Routing. Packet Routing, Routing Algorithms, Routers, Router Architecture

Network 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 information

Future Implications of IPv6 Accessorizing IPv6

Future Implications of IPv6 Accessorizing IPv6 Future Implications of IPv6 Accessorizing IPv6 Preston Marshall Defense Advanced Research Projects Agency (DARPA) Advanced Technology Office pmarshall@darpa.mil The Future IPV6 Wireless Problem From Access

More information

Network Architecture

Network 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 information

Summary of MAC protocols

Summary of MAC protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division, Code Division, Frequency Division Random partitioning (dynamic) ALOHA, S-ALOHA,

More information

ECE 435 Network Engineering Lecture 21

ECE 435 Network Engineering Lecture 21 ECE 435 Network Engineering Lecture 21 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 27 November 2018 Announcements HW#9 was posted Project Status One e-mail per group One-line

More information

Communications Software. CSE 123b. CSE 123b. Spring Lecture 2: Internet architecture and. Internetworking. Stefan Savage

Communications Software. CSE 123b. CSE 123b. Spring Lecture 2: Internet architecture and. Internetworking. Stefan Savage CSE 123b CSE 123b Communications Software Spring 2003 Lecture 2: Internet architecture and Internetworking Stefan Savage Some history 1968: DARPANET (precursor to Internet) Bob Taylor, Larry Roberts create

More information

What is the difference between unicast and multicast? (P# 114)

What is the difference between unicast and multicast? (P# 114) 1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111

More information

On the Scalability of Hierarchical Ad Hoc Wireless Networks

On the Scalability of Hierarchical Ad Hoc Wireless Networks On the Scalability of Hierarchical Ad Hoc Wireless Networks Suli Zhao and Dipankar Raychaudhuri Fall 2006 IAB 11/15/2006 Outline Motivation Ad hoc wireless network architecture Three-tier hierarchical

More information