A Cross-Layer Perspective of Routing. Taming the Underlying Challenges of Reliable Routing in Sensor Networks. Underlying Connectivity in Reality
|
|
- Eustacia Copeland
- 5 years ago
- Views:
Transcription
1 Taming the Underlying Challenges of Reliable Routing in Sensor Networks Alec Woo, Terence Tong, and David Culler UC Berkeley and Intel Research Berkeley A Cross-Layer Perspective of Routing How to get from A to B? Underlying question: what are the ways to get from A to B? not given vary over time Each layer is a distributed, local process. Combine Select Good Routes Neighbor management keep the good ones Discover & characterize connectivity Study and understand global properties End-to-end success rate Routing topology over time Stability November 5 th, 2003 SenSys Underlying Connectivity in Reality 3 regions and transitional region is large Effective Clear Deployment: Communication range = effective region Nodes: Discover connectivity = link estimation Hear many nodes in transitional region How to define a neighbor? Transitional many November 5 th, 2003 SenSys Roadmap Underlying process Link Quality Estimation Neighborhood Management Cross-layer routing study Tree-based Routing November 5 th, 2003 SenSys Accurate A Good Link Estimator Passive Estimation Link sequence number snooping Estimate inbound reception quality Agile yet stable Small memory footprint Simple November 5 th, 2003 SenSys Key issue Cannot infer losses until next packet reception Solution With a minimum data rate, infer losses based on time Asymmetric links Require outbound transmission quality estimation Exchange reception quality over local broadcast November 5 th, 2003 SenSys
2 Link Estimator Study Study 7 estimators by tuning to yield the same error bound Results WMEWMA(T, α) Estimator Stable, simple, constant memory footprint Compute success rate over non-overlapping window (T) Average over an EWMA(α) Key: 10% error requires at least 100 packets to settle Limits rate of adaptation November 5 th, 2003 SenSys Neighbors in Transitional Hear Many potential neighbors Few good nodes (blue) Potential neighbors > available table-size Get in Neighbor Cannot tell which neighbor is good Get out General solution: down-sample to suppress gray nodes maintain frequent nodes November 5 th, 2003 SenSys Management Techniques Cache Replacement Policy FIFO, LRU (LRH), Clock Database Frequency estimation of data streams FREQUENCY (Manku et al.) November 5 th, 2003 SenSys Details Insert (when) Down-sample rate adapt to # of neighbors Rate = Size / Neighbors Reinforce if in table Cache hit (FIFO, LRH, Clock) Node s Counter++ (Frequency) Evict (which) Counter--, zero entries are replaceable (Freq) If all Counter > 0, drop insertion Cache policies evict for each insertion November 5 th, 2003 SenSys Key Results Fixed-size table as cell density increases 1st 2nd 3rd # Good neighbors > size Freq always maintains 50% or more good neighbors in table Roadmap Underlying process Link Quality Estimation Neighborhood Management Cross-layer routing study Tree-based Routing 40 Number of Potential Neighbors November 5 th, 2003 SenSys November 5 th, 2003 SenSys
3 Distributed Tree Building Distributed distance-vector protocols Operate over link estimator and neighbor management Send periodic route messages Carry cost to tree root Piggyback link estimations Hop-Count? Neighbor? Link Quality? Hop-Count Hear neighbor s cost and store in table Select minimum cost neighbor for routing Route damping What should be the cost metric? November 5 th, 2003 SenSys Shortest hop with no estimation (SP) Shortest hop with threshold SP(%) Hard threshold November 5 th, 2003 SenSys Non-threshold based Cost Metrics Path Reliability Product of link quality along the entire path Minimum Transmission (MT) Cost is based on link quality Link estimator provides 1 p forward p hop reverse Cost = E[total number of trans.] November 5 th, 2003 SenSys Evaluation Roadmap Key observations: Hop distribution, end-to-end success, stability Graph analysis Large 80x80 grid SP, SP(%), MT Rule out SP because of poor reliability Packet-level simulation 10x10 grid, (max 2 retrans./hop) Broadcast and DSDV (periodic route selection) Neighbor table management (Freq -> MTTM) Empirical (Mica Motes) Small 5x10 grid and 30-node random placement SP(%), MT with large enough table max 2 retrans./hop, deliberate congestion High Level Low Level November 5 th, 2003 SenSys Graph Analysis Key Results Hop-Distribution and Reliability to BS Simulation Key Results End-to-end Hop-Count Success Stability Distribution vs. Distance November 5 th, 2003 SenSys November 5 th, 2003 SenSys
4 Empirical Study Restudy connectivity vs. distance Put nodes at end of effective region (~ worst case) 8 feet Study SP(70%), SP(40%), MT Key observations: SP(70%) fails SP(40%) fails Hard threshold fails under congestion Link quality drops under traffic November 5 th, 2003 SenSys Different Empirical Key Results from simulations! End-to-end Hop-Count Success Distribution vs. Distance Effective is 8 feet November 5 th, 2003 SenSys Average Hop-Count Contour Plot 30-node network Congestion and Stability Topology Stability # Route Changes Per 5 Route Messages Link Estimation % Time (s) November 5 th, 2003 SenSys November 5 th, 2003 SenSys Conclusion Connectivity: 3 regions (need to measure) Deployment: node spacing Routing as 3 on-line processes Discover/maintain varying connectivity (WMEWMA) Settling time limits adaptation rate Maintain a set of good neighbors regardless of cell density (Frequency) Hard thresholds are problematic MT (No predefine threshold) Interactions among these processes Hop distribution, end-to-end success, stability Backup Slides November 5 th, 2003 SenSys
5 Routing Architecture Routing Cost: Actual vs. Est. Send originated data message Application Timer Originating Queue Send route update message Cycle detected choose other parent Parent Selection Run parent selection and send route message periodically Forward Queue Cycle Detection Forwarding Data message message Filter discard non data packet discard duplicate packet Estimator All message sniff and estimate Neighbor Route message save information Management All Messages November 5 th, 2003 SenSys November 5 th, 2003 SenSys Channel Utilization Contour MT Topology Movie November 5 th, 2003 SenSys November 5 th, 2003 SenSys
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 informationTaming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks Alec Woo, Terence Tong, David Culler {awoo, terence, culler}@cs.berkeley.edu Computer Science Division Intel Research: Berkeley
More informationObjective. Introduction A More Practical Model. Introduction A More Practical Model. Introduction The Issue
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks By Byron E. Thornton Objective We now begin to build a Wireless Sensor Network model that better captures the operational
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 informationTOSSIM simulation of wireless sensor network serving as hardware platform for Hopfield neural net configured for max independent set
Available online at www.sciencedirect.com Procedia Computer Science 6 (2011) 408 412 Complex Adaptive Systems, Volume 1 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri University of Science
More informationA HOLISTIC APPROACH TO MULTIHOP ROUTING IN SENSOR NETWORKS ALEC LIK CHUEN WOO
A HOLISTIC APPROACH TO MULTIHOP ROUTING IN SENSOR NETWORKS by ALEC LIK CHUEN WOO B.S. in University of California, Berkeley 1998 M.S. in University of California, Berkeley 2001 A dissertation submitted
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 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 informationInternetworking. Problem: There is more than one network (heterogeneity & scale)
Internetworking Problem: There is more than one network (heterogeneity & scale) Hongwei Zhang http://www.cs.wayne.edu/~hzhang Internetworking: Internet Protocol (IP) Routing and scalability Group Communication
More informationDraft 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 informationChapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.
Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.
More informationPresented by: Murad Kaplan
Presented by: Murad Kaplan Introduction. Design of SCP-MAC. Lower Bound of Energy Performance with Periodic Traffic. Protocol Implementation. Experimental Evaluation. Related Work. 2 Energy is a critical
More informationChapter 12. Routing and Routing Protocols 12-1
Chapter 12 Routing and Routing Protocols 12-1 Routing in Circuit Switched Network Many connections will need paths through more than one switch Need to find a route Efficiency Resilience Public telephone
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 informationInformation Brokerage
Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,
More informationPerformance Evaluation of Link Quality Estimation Metrics for Static Multihop Wireless Sensor Networks
Performance Evaluation of Link Quality Estimation Metrics for Static Multihop Wireless Sensor Networks Tao Liu, Ankur Kamthe, Lun Jiang and Alberto Cerpa Computer Science and Engineering, University of
More informationThe 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 informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationThe 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 informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
More informationAsymmetry-Aware Link Quality Services in Wireless Sensor Networks
Asymmetry-Aware Link Quality Services in Wireless Sensor Networks Technical Report: MIST-TR-25-6 Junzhao Du, Weisong Shi, and Kewei Sha Department of Computer Science Wayne State University {junzhao, weisong,
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 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 informationRouting in Sensor Networks
Routing in Sensor Networks Routing in Sensor Networks Large scale sensor networks will be deployed, and require richer inter-node communication In-network storage (DCS, GHT, DIM, DIFS) In-network processing
More informationDynamic Source Routing (DSR) [Johnson96]
ynamic Source Routing (SR) [ohnson96] S 6811 : ecture 5 d oc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation oop freedom
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 13: Traffic Engineering
Lecture 13: Traffic Engineering CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Mike Freedman, Nick Feamster Lecture 13 Overview Evolution of routing in the ARPAnet Today s TE: Adjusting
More informationChapter 9. Enhanced Interior Gateway Routing Protocol (EIGRP) Part I
Chapter 9 Enhanced Interior Gateway Routing Protocol (EIGRP) Part I CCNA2-1 Chapter 9-2 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College
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 informationCS5984 Mobile Computing
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part II 1 Outline Routing Protocols for Ad hoc Networks DSDV: Highly Dynamic Destination-Sequenced Distance- Vector
More informationDynamic Source Routing (DSR) [Johnson96] CSE 6811 : Lecture 5
ynamic Source Routing (SR) [Johnson96] S 6811 : Lecture 5 d Hoc Wireless Routing ifferent from routing in the wired world esirable properties of a wireless routing protocol istributed operation Loop freedom
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 informationNamed Data Networking for 5G Wireless
Named Data Networking for 5G Wireless Edmund Yeh Electrical and Computer Engineering Northeastern University New York University January 27, 2017 Overview NDN: a major information-centric networking architecture
More informationSecure 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 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 informationInterference avoidance in wireless multi-hop networks 1
Interference avoidance in wireless multi-hop networks 1 Youwei Zhang EE228A Project Report, Spring 2006 1 Motivation Wireless networks share the same unlicensed parts of the radio spectrum with devices
More informationTag a Tiny Aggregation Service for Ad-Hoc Sensor Networks. Samuel Madden, Michael Franklin, Joseph Hellerstein,Wei Hong UC Berkeley Usinex OSDI 02
Tag a Tiny Aggregation Service for Ad-Hoc Sensor Networks Samuel Madden, Michael Franklin, Joseph Hellerstein,Wei Hong UC Berkeley Usinex OSDI 02 Outline Introduction The Tiny AGgregation Approach Aggregate
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationNetwork Initialization in Low-Power Wireless Networks: A Comprehensive Study
The Computer Journal Advance Access published July 21, 2013 The British Computer Society 2013. All rights reserved. For Permissions, please email: journals.permissions@oup.com doi:10.1093/comjnl/bxt074
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationDuraNet: Energy-Efficient Durable Slot-Free Power Scheduling
DuraNet: Energy-Efficient Durable Slot-Free Power Scheduling Terence Tong, David Molnar, and Alec Woo Report No. UCB/CSD-4-1323 May 2004 Computer Science Division (EECS) University of California Berkeley,
More informationFinal exam study Guide
Final exam study Guide K-1A * In relationship to the OSI layer model and encapsulation/decapsulation process, what happen to a packet that travels through multiple hops of routers? - What happen to the
More informationFig. 2: Architecture of sensor node
Volume 4, Issue 11, November 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com To Reduce
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 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 Omprakash Gnawali Stanford University & University of Southern California gnawali@cs.stanford.edu Rodrigo Fonseca Brown University & Yahoo! Research rfonseca@cs.brown.edu Kyle
More informationRouting 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 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 informationROUTING 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 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 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 informationRunning Reports CHAPTER
CHAPTER 14 WCS reporting is necessary to monitor the system and network health as well as troubleshoot problems. A number of reports can be generated to run on an immediate and scheduled basis. Each report
More informationModule 7 Implementing Multicast
Module 7 Implementing Multicast Lesson 1 Explaining Multicast Why Multicast? Used when sending same data to multiple receivers Better bandwidth utilization Less host/router processing Used when addresses
More informationLecture 4 Wide Area Networks - Routing
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Routing Mei Yang Based on Lecture slides by William Stallings 1 ROUTING IN PACKET SWITCHED NETWORK key design issue for (packet) switched
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationComputer Networks. 19 December This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points.
Computer Networks 19 December 2014 This exam consists of 6 questions with subquestions. Every subquestion counts for 10 points. Mark every page with name and student number. Use of books, additional course
More informationScaling IGPs in ISP Networks. Philip Smith SANOG 8, Karachi 3rd August 2006
Scaling IGPs in ISP Networks Philip Smith SANOG 8, Karachi 3rd August 2006 Agenda Definition of Scaling IGP Design Tuning OSPF What Does Scaling a Network Mean? Scaling is very important for an SP network
More informationReinforcement Learning for Network Routing
Reinforcement Learning for Network Routing by Hema Jyothi Yalamanchi Major advisors: Dr. Thinh Nguyen Dr. Alan Fern Committee: Dr. Bella Bose A PROJECT submitted to Oregon State University in partial fulfillment
More information4/22 A Wireless Sensor Network for Structural Health Monitoring. Gregory Peaker
4/22 A Wireless Sensor Network for Structural Health Monitoring Gregory Peaker Overview Why perform health monitoring of structures? What is Wisden/Mica? Hardware Software Platform Reliable Data Transport
More informationA COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS
A COMPARISON STUDY OF DSDV AND SEAD WIRELESS AD HOC NETWORK ROUTING PROTOCOLS M.S.R.S Prasad 1, S.S. Panda 2, MNM Prasad 3, S.T.V.S.Kumar 4 1 Assistant Professor (SG), Dept. of CSE., Regency Institute
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 informationTCP. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli)
TCP CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) 1 Sources Fall and Stevens, TCP/IP Illustrated Vol. 1, 2nd edition Congestion Avoidance
More informationOutline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting
Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer
More informationTAG: A TINY AGGREGATION SERVICE FOR AD-HOC SENSOR NETWORKS
TAG: A TINY AGGREGATION SERVICE FOR AD-HOC SENSOR NETWORKS SAMUEL MADDEN, MICHAEL J. FRANKLIN, JOSEPH HELLERSTEIN, AND WEI HONG Proceedings of the Fifth Symposium on Operating Systems Design and implementation
More informationAn Adaptive Algorithm for Fault Tolerant Re-Routing in Wireless Sensor Networks
An Adaptive Algorithm for Fault Tolerant Re-Routing in Wireless Sensor Networks Abstract A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best
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 informationMaté. Presentation Outline. Presentation Outline. Introduction - Why? Introduction Mate VM. Introduction - Requirements
Maté Maté: : A Tiny Virtual Machine for Sensor Networks Introduction Implementation Evaluation Discussion and Critique Authors: Philip Levis and David Culler Presenter: Fernando Zamith Introduction - Why?
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationGLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks. Stanford University. HP Labs
GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang Jie Gao Leonidas J. Guibas Vin de Silva Li Zhang Stanford University HP Labs Point-to-Point Routing in Sensornets 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 informationLINKORD: Link Ordering-Based Data Gathering Protocol for Wireless Sensor Networks
Computing, March 2015, Vol. 97, Issue 3, pp 205-236 LINKORD: Link Ordering-Based Data Gathering Protocol for Wireless Sensor Networks Marjan Radi 1,, Behnam Dezfouli 1, K. A. Bakar 1, S. A. Razak 1, Malrey
More informationDeployment of Sensor Networks: Problems and Passive Inspection. Matthias Ringwald, Kay Römer (ETH Zurich)
Deployment of Sensor Networks: Problems and Passive Inspection Matthias Ringwald, Kay Römer (ETH Zurich) Sensor Networks Ad hoc network of sensor nodes Perceive real world (sensors) Process data (microcontroller)
More informationWSN NETWORK ARCHITECTURES AND PROTOCOL STACK
WSN NETWORK ARCHITECTURES AND PROTOCOL STACK Sensing is a technique used to gather information about a physical object or process, including the occurrence of events (i.e., changes in state such as a drop
More information5.2 Routing Algorithms
CEN445 Network Protocols and Algorithms Chapter 5 Network Layer 5. Routing Algorithms Dr. Mostafa Hassan Dahshan Department of Computer Engineering College of Computer and Information Sciences King Saud
More informationMulticast Communications. Tarik Čičić, 4. March. 2016
Multicast Communications Tarik Čičić, 4. March. 06 Overview One-to-many communication, why and how Algorithmic approach: Steiner trees Practical algorithms Multicast tree types Basic concepts in multicast
More informationPerformance Evaluation of Various Routing Protocols in MANET
208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationWireless Sensor Networks: From Science to Reality. Kay Römer ETH Zurich
Wireless Sensor Networks: From Science to Reality Kay Römer ETH Zurich Sensor Networks Ad hoc network of sensor nodes Perceive (sensors) Process (microcontroller) Communicate (radio) Autonomous power supply
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationPerformance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model
Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Geetha.S, Dr.G.Geetharamani Asst.Prof, Department of MCA, BIT Campus Tiruchirappalli, Anna University,
More informationPath Optimization in Stream-Based Overlay Networks
Path Optimization in Stream-Based Overlay Networks Peter Pietzuch, prp@eecs.harvard.edu Jeff Shneidman, Jonathan Ledlie, Mema Roussopoulos, Margo Seltzer, Matt Welsh Systems Research Group Harvard University
More informationRouting over Low Power and Lossy Networks
outing over Low Power and Lossy Networks Analysis and possible enhancements of the IETF PL routing protocol Enzo Mingozzi Associate Professor @ University of Pisa e.mingozzi@iet.unipi.it outing over LLNs
More informationComputer Networks. Routing Algorithms
Computer Networks Routing Algorithms Topics Routing Algorithms Shortest Path (Dijkstra Algorithm) Distance Vector Routing Count to infinity problem Solutions for count to infinity problem Link State Routing
More informationRunning Reports. Choosing a Report CHAPTER
13 CHAPTER WCS reporting is necessary to monitor the system and network health as well as troubleshoot problems. A number of reports can be generated to run on an immediate and scheduled basis. Each report
More informationEnergy and Latency Control in Low Duty Cycle MAC Protocols
Energy and Latency Control in Low Duty Cycle MAC Protocols Yuan Li Wei Ye John Heidemann {liyuan, weiye, johnh}@isi.edu Information Sciences Institute, University of Southern California Abstract Recently
More informationThe Spanning Tree Protocol
The Spanning Tree Protocol Guangyu Dong, Jorg Liebeherr, MNG Group Wednesday, March 30, 2005 This is a draft and not a final version. 2005-8. All rights reserved. All material is copyrighted by the authors.
More informationAd hoc and Sensor Networks Chapter 10: Topology control
Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity
More informationEEC-682/782 Computer Networks I
EEC-682/782 Computer Networks I Lecture 15 Wenbing Zhao w.zhao1@csuohio.edu http://academic.csuohio.edu/zhao_w/teaching/eec682.htm (Lecture nodes are based on materials supplied by Dr. Louise Moser at
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 informationEnergy Aware and Link Quality Based Routing in Wireless Sensor Networks under TinyOS-2.x
Energy Aware and Link Quality Based Routing in Wireless Sensor Networks under TinyOS-2.x Dhaval Patel, 1 Bijal Chawla, 2 Chandresh Parekh 3 12 PG Student, Department of Wireless Mobile Computing, Gujarat
More information62HConfiguring port role restriction 131H37. 63HConfiguring TC-BPDU transmission restriction 132H38. 64HEnabling TC-BPDU guard 133H38
Contents Configuring spanning tree protocols 3 STP 3 STP protocol packets 3 Basic concepts in STP 4 Calculation process of the STP algorithm 5 RSTP 9 MSTP 10 MSTP features 10 MSTP basic concepts 10 How
More informationThe fundamentals of Ethernet!
Building Ethernet Connectivity Services for Provider Networks" " Eduard Bonada i Cruells" Tesi Doctoral UPF / 2012 Dirigida per Dra. Dolors Sala i Batlle Departament de Tecnologies de la Informació i les
More informationCSCI Computer Networks
CSCI-1680 - Computer Networks Link Layer III: LAN & Switching Chen Avin Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Peterson & Davie, Rodrigo Fonseca Today: Link Layer (cont.)
More informationMLD. MLDv1 (defined in RFC 2710), which is derived from IGMPv2. MLDv2 (defined in RFC 3810), which is derived from IGMPv3.
Introduction to Multicast listener discovery protocol () is used by an IPv6 router to discover the presence of multicast listeners on directly-attached subnets. Multicast listeners are nodes wishing to
More informationOutline. 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 informationAdvanced Networking: Routing & Switching 2 Chapter 7
EIGRP Advanced Networking: Routing & Switching 2 Chapter 7 Copyleft 2014 Hacklab Cosenza (http://hlcs.it) Released under Creative Commons License 3.0 By-Sa Cisco name, logo and materials are Copyright
More informationOn the Analysis of Caches with Pending Interest Tables
On the Analysis of Caches with Pending Interest Tables Mostafa Dehghan 1, Bo Jiang 1 Ali Dabirmoghaddam 2, Don Towsley 1 1 University of Massachusetts Amherst 2 University of California Santa Cruz ICN,
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 information