Slide #1IETF 71 – Roll WG – March 2008 Routing Requirements for Urban Sensor Networks draft-dohler-r2ln-routing-reqs-00.txt M. Dohler G. Madhusudan G.

Slides:



Advertisements
Similar presentations
anywhere and everywhere. omnipresent A sensor network is an infrastructure comprised of sensing (measuring), computing, and communication elements.
Advertisements

1 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Confidential Session Number Presentation_ID Next Generation Network Architectures Summary John.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Sec-TEEN: Secure Threshold sensitive Energy Efficient sensor Network protocol Ibrahim Alkhori, Tamer Abukhalil & Abdel-shakour A. Abuznied Department of.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Entire Routes Reflecting capability draft-zhang-idr-bgp-entire-routes-reflect-00.txt Zhang Renhai :
1 Routing Techniques in Wireless Sensor networks: A Survey.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
1 © 2015 Cisco and/or its affiliates. All rights reserved. IRTF icnrg interim meeting, 1/13/2015 Where are the opportunities for ICN in Sensor Networks?
Internet Indirection Infrastructure Ion Stoica UC Berkeley.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
Design of Efficient and Secure Multiple Wireless Mesh Network Speaker: Hsien-Pang Tsai Teacher: Kai-Wei Ke Date: 2005/06/28.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
WIRELESS SENSOR NETWORK SECURITY USING GROUP KEY MANAGEMENT SCHEME Presented By: Mohammed Saleh CS 599a Fall06.
Key management in wireless sensor networks Kevin Wang.
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures ProtocolRelevant Attacks TinyOS beaconingBogus routing information, selective forwarding,
1 Energy Efficient Communication in Wireless Sensor Networks Yingyue Xu 8/14/2015.
Virtual LANs. VLAN introduction VLANs logically segment switched networks based on the functions, project teams, or applications of the organization regardless.
Distance Vector Routing Protocols W.lilakiatsakun.
Tufts Wireless Laboratory School Of Engineering Tufts University “Network QoS Management in Cyber-Physical Systems” Nicole Ng 9/16/20151 by Feng Xia, Longhua.
Routing Metrics used for Path Calculation in Low Power and Lossy Networks draft-mjkim-roll-routing-metrics-00 IETF-72 - Dublin - July 2008 Mijeom Kim
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Req1 - Separability Old: –An RO scheme MUST have the ability to be bypassed by traffic types that desire to use bidirectional tunnels through an HA. New:
Security Patterns in Wireless Sensor Networks By Y. Serge Joseph October 8 th, 2009 Part I.
Multicast Distribution Tree Extensions for IS-IS draft-yong-isis-ext-4-distribution-tree-02 Lucy Yong Donald Eastlake Andrew Qu July
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Bandwidth Constrained Energy Efficient Transmission Protocol in Wireless Sensor Networks Jain-Shing LIU and Chun-Hung Richard LIN,Nonmembers IEICE TRANS.
0 NAT/Firewall NSLP IETF 62th – March 2005 draft-ietf-nsis-nslp-natfw-05.txt Martin Stiemerling, Hannes Tschofenig, Cedric Aoun.
한국기술교육대학교 컴퓨터 공학 김홍연 Habitat Monitoring with Sensor Networks DKE.
Virtual Private Ad Hoc Networking Jeroen Hoebeke, Gerry Holderbeke, Ingrid Moerman, Bard Dhoedt and Piet Demeester 2006 July 15, 2009.
Distributed Authentication in Wireless Mesh Networks Through Kerberos Tickets draft-moustafa-krb-wg-mesh-nw-00.txt Hassnaa Moustafa
0 NAT/Firewall NSLP Activities IETF 60th - August 2nd 2004 Cedric Aoun, Martin Stiemerling, Hannes Tschofenig.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
A Distributed Coordination Framework for Wireless Sensor and Actor Networks Tommaso Melodia, Dario Pompili, Vehbi C.Gungor, Ian F.Akyildiz (MobiHoc 2005)
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
Routing Requirements for Urban Sensor Networks draft-ietf-roll-urban-routing-reqs-01.txt D. Barthel G. Chegaray M. Dohler (Ed.) C. Jacquenet G. Madhusudan.
Applicability and Tradeoffs of ICN for Efficient IoT draft-lindgren-icnrg-efficientiot-00 presented by Olov Schelén IRTF ICNRG IETF 90, Toronto.
RPL Applicability Statement for AMI IETF #81, IETF ROLL WG Québec City, Canada July 25-29, 2011 Jorjeta Jetcheva
IETF77 Multimob California1 Proposal for Tuning IGMPv3/MLDv2 Protocol Behavior in Wireless and Mobile networks draft-wu-multimob-igmp-mld-tuning-00 Qin.
Ad Hoc Network.
Doc.: IEEE 11-04/0319r0 Submission March 2004 W. Steven Conner, Intel Corporation Slide 1 Architectural Considerations and Requirements for ESS.
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
Security Threats and Security Requirements for the Access Node Control Protocol (ANCP) IETF 68 - ANCP WG March 18-23, 2007 draft-ietf-ancp-security-threats-00.txt.
Design and Application Spaces for 6LoWPAN (draft-ekim-6lowpan-scenarios-01) IETF-70 Vancouver Wednesday, December 5th – 1500 Afternoon Session.
Routing Information Protocol
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
November 10, 2010IETF 79 – Beijing, China A method for IP multicast performance monitoring draft-cociglio-mboned-multicast-pm-01 Alessandro Capello Luca.
GEONET Brainstorming Document. Content Purpose of the document Brainstorming process / plan Proposed charter Assumptions Use cases Problem description.
Homenet Routing IETF 83, Paris Acee Lindem, Ericsson.
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
A Security Framework for ROLL draft-tsao-roll-security-framework-00.txt T. Tsao R. Alexander M. Dohler V. Daza A. Lozano.
March 22, 2010IETF 77 – Anaheim, USA1 A method for IP multicast performance monitoring draft-cociglio-mboned-multicast-pm-00 Alessandro Capello Luca Castaldelli.
Wireless Sensor Networks: A Survey I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci.
In the name of God.
ROLL Home Automation: draft-ietf-roll-home-routing-reqs
Routing Metrics for Wireless Mesh Networks
Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann
Routing Metrics for Wireless Mesh Networks
Jack Pokrzywa Director Ground Vehicle Standards, SAE International
Support for Flow bindings in MIPv6 and NEMO
doc.: IEEE <doc#>
Virtual LANs.
Routing Metrics for Wireless Mesh Networks
Abhinandan Ramaprasath, Anand Srinivasan,
IETF Liaison Report May 2004 Dorothy Stanley – Agere Systems
DetNet Information Model Consideration
Requirements and Approach
Requirements and Approach
Presentation transcript:

Slide #1IETF 71 – Roll WG – March 2008 Routing Requirements for Urban Sensor Networks draft-dohler-r2ln-routing-reqs-00.txt M. Dohler G. Madhusudan G. Chegaray T. Watteyne C. Jacquenet

Slide #2IETF 71 – Roll WG – March 2008 Outline Motivation and context Traffic characteristics Operational considerations Routing requirements Next steps

Slide #3IETF 71 – Roll WG – March 2008 Motivation Sensor networking becomes urban cornerstone technology –To improve living conditions –To assess compliance with environmental regulation Sensor usage includes –Smart metering –Waste disposal –Weather and pollution sensing

Slide #4IETF 71 – Roll WG – March 2008 Networking Context Wireless networking Tens of thousands of nodes –Sensors, actuators and access points Multi-functional devices –Actuators can serve as: Gateways (to access the Internet) Data sinks (to collect data from sensors) Data sources (to instruct other actuators in clustering environments)

Slide #5IETF 71 – Roll WG – March 2008 Traffic Characteristics Directional flows –Sensed data are sent by sensors to APs –APs send queries to sensors –Control data are sent by APs to actuators Regular and spontaneous –Periodic sensing and reporting –On-request sensing –Dynamic notifications (alerts) Sensed data are time and space correlated

Slide #6IETF 71 – Roll WG – March 2008 Operational Considerations Deployment in batches out-of-box –Pre-programmed capabilities –Customized by service providers –Heterogeneous technologies to cope with Addition and removal of nodes while network is in operation –Graceful notification and/or abrupt disappearance

Slide #7IETF 71 – Roll WG – March 2008 Basic Routing Requirements Support of unicast and multicast –Including "groupcast" (forwarding to a list of identified addressees in a given subnet) Scalability –Routing protocol(s) must accommodate 10,000+ nodes Constraint-based, context-aware routing –Energy, memory, CPU usage to be considered as routing metrics –Knowledge of flow directionality should be an asset Self-organizing capabilities –Self configuration and management Possibly triggered by external events

Slide #8IETF 71 – Roll WG – March 2008 More Requirements Latency –Shorter than reporting period for regular sensing –Application-compatible queried sensing Security –Authentication is required for sensing Need to preserve data integrity –Robustness against (D)DOS attacks

Slide #9IETF 71 – Roll WG – March 2008 Next Steps Update draft with elaboration on: –Node mobility –Traffic patterns Comments and suggestions are warmly encouraged Adopt draft as WG document?

Slide #10IETF 71 – Roll WG – March 2008 Backup

Slide #11IETF 71 – Roll WG – March 2008 MUST's The routing protocol MUST be scalable to be able to accommodate a very large and increasing number of nodes without deteriorating to-be-specified performance parameters below to-be-specified thresholds. The routing protocol MUST support parameter constrained routing, where examples of such parameters have been given in the previous paragraph. The routing protocol MUST provide a set of features including 0-configuration at network ramp-up, (network-internal) self-organization and configuration due to topological changes, ability to support (network-external) patches and configuration updates. For the latter, the protocol SHOULD support multicast and broadcast addressing. The protocol SHOULD also support the formation and identification of groups of field devices in the network. The routing protocol MUST support multicast, where the routing protocol MUST provide the ability to route a packet towards a single field device (unicast) or a set of devices, which explicitly (multicast) or implicitly (groupcast) belong to the same group/cast. The choice of the security solutions will have an impact onto routing protocols. To this end, routing protocols proposed in the context of Urban sensor networks MUST support integrity measures and SHOULD support confidentiality (security) measures.

Slide #12IETF 71 – Roll WG – March 2008 SHOULD's The routing protocol MUST provide a set of features including 0-configuration at network ramp-up, (network-internal) self-organization and configuration due to topological changes, ability to support (network-external) patches and configuration updates. For the latter, the protocol SHOULD support multicast and broadcast addressing. The protocol SHOULD also support the formation and identification of groups of field devices in the network. The routing protocol SHOULD support and utilize this fact to facilitate scalability and parameter constrained routing. The routing protocols proposed in U-L2N SHOULD support a variety of different devices without compromising the operability and energy efficiency of the network. Local network dynamics SHOULD NOT impact the entire network to be re-organized or re-reconfigured; however, the network SHOULD be locally optimized to cater for the encountered changes. Convergence and route establishment times SHOULD be significantly lower than the inverse of the smallest reporting cycle. The routing protocol is RECOMMENDED to support minimum latency for alert reporting and time-critical data queries. For regular data reporting, it SHOULD support latencies not exceeding a fraction of the inverse of the respective reporting cycle. The choice of the security solutions will have an impact onto routing protocols. To this end, routing protocols proposed in the context of U-L2Ns MUST support integrity measures and SHOULD support confidentiality (security) measures.

Slide #13IETF 71 – Roll WG – March 2008 Other Requirements SHOULD NOTs: –Local network dynamics SHOULD NOT impact the entire network to be re-organized or re-reconfigured; however, the network SHOULD be locally optimized to cater for the encountered changes. Convergence and route establishment times SHOULD be significantly lower than the inverse of the smallest reporting cycle. RECOMMENDEDs: –The routing protocol is RECOMMENDED to support minimum latency for alert reporting and time-critical data queries. For regular data reporting, it SHOULD support latencies not exceeding a fraction of the inverse of the respective reporting cycle.