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

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Robot Sensor Networks. Introduction For the current sensor network the topography and stability of the environment is uncertain and of course time is.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
TDMA Scheduling in Wireless Sensor Networks
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
Introduction to Wireless Sensor Networks
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
Slide #1IETF 82 – ROLL WG – November 2012 RPL Applicability in Industrial Networks IETF 82 draft-phinney-roll-rpl-industrial-applicability-00 Tom Phinney.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
May 14, Organization Design and Dynamic Resources Huzaifa Zafar Computer Science Department University of Massachusetts, Amherst.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Power saving technique for multi-hop ad hoc wireless networks.
Chapter 5 – Routing Protocols: IGRP. Building a Network To Be Reliable – provide error detection and ability to correct errors To Provide Connectivity.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Routing Algorithm for Large Data Sensor Networks Raghul Gunasekaran Group Meeting Spring 2006.
IETF-76, Hiroshima, Nov 2009 ROLL Working Group Meeting IETF-76, Nov 2009, Hiroshima Routing Metrics used for Path Calculation in Low Power and Lossy Networks.
CS2510 Fault Tolerance and Privacy in Wireless Sensor Networks partially based on presentation by Sameh Gobriel.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Introduction to Dynamic Routing Protocol
EAIT, February 2006 A Pragmatic Approach towards the Improvement of Performance of Ad Hoc Routing ProtocolsOptimizations To Multipath Routing Protocols.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
CSE 6590 Fall 2010 Routing Metrics for Wireless Mesh Networks 1 4 October, 2015.
Design and Application Spaces for 6LoWPAN (draft-ekim-6lowpan-scenarios-02) IETF-71 Philadelphia Tuesday, March Eunsook Kim, Nicolas Chevrollier,
Prediction Assisted Single-copy Routing in Underwater Delay Tolerant Networks Zheng Guo, Bing Wang and Jun-Hong Cui Computer Science & Engineering Department,
한국기술교육대학교 컴퓨터 공학 김홍연 Habitat Monitoring with Sensor Networks DKE.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
SR: A Cross-Layer Routing in Wireless Ad Hoc Sensor Networks Zhen Jiang Department of Computer Science West Chester University West Chester, PA 19335,
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Self-stabilizing energy-efficient multicast for MANETs.
An Enhanced Cross-Layer Protocol for Energy Efficiency in Wireless Sensor Networks Jaehyun Kim, Dept. of Electrical & Electronic Eng., Yonsei University;
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
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)
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.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
MAC Protocols for Sensor Networks
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Dominik Kaspar, Eunsook Kim, Carles Gomez, Carsten Bormann
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Presentation transcript:

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 JP Vasseur Hakjin Chong

IETF 72 – July Dublin Introduction-1 Motivation of the document –Unique characteristics of LLNs –Typical routing metrics such as hop counts or link metrics are not sufficient for LLNs –A new set of required link and node metrics suitable to LLNs needs to be specified ROLL WG item –Nov 2008 Submit Routing metrics for LLNs document to the IESG to be considered as a Proposed Standard. Classification of routing metrics –Link versus Node metrics –Qualitative versus quantitative –Dynamic or static

IETF 72 – July Dublin Introduction-2 Routing metrics for LLNs is a critical topic Need to be cautious !!! May be tempting to define a plethora of metrics … but not always implementable and usable in a deployed network Use of dynamic metrics have been studied and experimented in the past (ARPANET: first average delays, revised metrics) Dynamic metrics => Use of energy … The challenge is not to define metrics but to compute these metrics. This first revision list potential candidates

IETF 72 – July Dublin A first list of Node and Link Routing Attributes Node metric –Computational resources –Residual Energy (dynamic) –Current workload (dynamic) –Node latency –Data Aggregation attribute –Node degree Dynamicity –Node reliability Link metrics –Bandwidth –Reliability (Quality) –Propagation delay –Set of costs (missing from the ID)

Node Metrics/Attributes Most node attributes may be taken as static in LLN –Require quite resources to get exact values and update them periodically –Use of dynamic metrics is subject to routing instabilities Critical parameters like residual power –Need to be considered dynamic and monitored continuously –Need multi-threshold schemes to avoid constant routing changes Highly heterogeneous nodes in LLNs –More capable and stable nodes need to assist the most constrained ones for network lifetime extension and efficient network operations –Node metrics SHOULD be carefully maintained and utilized –Need constrained-based routing IETF-72 – July Dublin

Open Issues Consideration of routing efficiency and stability –Routing should be lightweight for resource saving in constrained networks –Need to care about the dynamic nature of some metrics and their implication on routing stability Traffic flow requirement –Applicable metrics are dependent on application and traffic flow requirements –Different applications or Service Level Agreement (SLA) might demand different routing metric combination –May need Multi-topology routing based on the traffic flow requirements using different set of metrics Metric weights exploitation –Metric weights should be decided according to applications and data flows –Applicable metrics or optimized weights may need to be changed on demand Metrics related to security IETF-72 – July Dublin

Next Steps Too soon to ask for WG adoption Please review and comment Proposed approach: Any metric missing Be very cautious of not mandating metrics if not required (think protocol !). Define the MUST, SHOULD, MAY, … IETF-72 – July Dublin

Back-up slides

Residual Energy (Node metric) Why –Power is highly precious resource in battery powered LLNs –To maintain energy balance among nodes for maximum network lifetime Treated as a relative value –Considering statistical node lifetime and role of the node in the network –Constrained-based routing is needed Generally, taken as a dynamic metric –Most battery operated devices have ability to estimate the remaining energy –Initial energy status can be considered as a static metric when monitoring energy status demands quite resources IETF-72 – July Dublin

Current workload (Node Metric) Why –Data processing along the data path is required –Queuing delays must be minimized for highly sensitive traffic Difficult to be measured and compared –Also difficult to express in a quantitative form –Putting the workload as a "heavy" or "light" one bit metric can be good IETF-72 – July Dublin

Node latency (Node Metric) The time span from the arrival time to the departure time of a given packet at a node –Primarily made up of packet processing time and packet transmission time High correlation with other metrics –Heavy workload increases node latency –Abundant computational resources reduce node latency IETF-72 – July Dublin

Data Aggregation attribute Data aggregation and fusion –Aggregation aims to reduce the amount of data –Fusion involves more complicated processing to improve accuracy of data Data aggregation/fusion can be performed –Due to data correlation –Especially in urban applications where sensor nodes collect environmental information High directional data flow is expected in a regular basis Challenges –Capturing time and location dependent correlation among sensed data from nodes on the possible routes –In-network processing may have high complexity IETF-72 – July Dublin

Node degree (Node Metric) Node degree –Number of neighbors that can send a message to the node directly –Neighbors are nodes located within the transmission range of the node A high node degree, generally –Is helpful for quick route recovery when the next hop node on the route cannot be accessible Node degree has to be carefully utilized in routing decision –A node with a high degree has a high possibility to have heavy workload in a busy network IETF-72 – July Dublin

Dynamicity (Node Metric) Measured by many different factors such as –Mobility –Transmission range –Duty cycle –The rate at which node joins and leaves the network Directly affects the network topology and connectivity –May trigger route reestablishment process –Less dynamic nodes should be preferred for path selection –Classifying nodes into static and dynamic can be helpful May be a static or dynamic metric –When dynamic, the network administrator will have to use consistent metric values IETF-72 – July Dublin

Node reliability (Node Metric) Deeply related to node dynamicity –Node reliability deteriorates as node dynamicity increases –Node reliability is a wider concept than node dynamicity Node dynamicity metric can be covered by node reliability metric A crucial metric –Nodes in LLNs may stay in a sleep mode most of the time A sleeping node should not be an intermediate node Status of a node must be monitored or can be anticipated –Residual energy of a node should be predictable To avoid the node’s battery out during routing process Hard to be estimated or monitored –A specific function needs to be defined IETF-72 – July Dublin

Link Attributes Link attributes in static LLNs –Can be considered as static ones Challenging to update them in a real-time manner Quite time- and energy-consuming work –Static LLNs have also variables like appearance of obstacles and signal interference Link attributes in dynamic LLNs –May need to take these attributes as dynamic metrics Values of dynamic metrics –Cannot be obtained easily –To use historical data and average them within a specified time window. IETF-72 – July Dublin

Bandwidth (Link Metric) Can be taken as a link capacity metric –In case of wireless link, the link capacity is shared among nodes in a single wireless link Can be evaluated as nodes’ communicational capability IETF-72 – July Dublin

Reliability – Quality (Link Metric) Can be measured by –Bit Error Rate (BER) –Mean Time Between Failures (MTBF) –Link churn (the rate at which links change between good and bad) Closely related to node reliability especially in wireless LLNs –Two nodes which form a link affect directly to the link reliability Also influenced by other factors like –Unexpected obstacles –Temporary interference An essential routing metric –Change of link quality directly affects network connectivity –Increasing link and node reliability together enhances route robustness IETF-72 – July Dublin

Propagation delay (Link Metric) Is the time taken for the packet to traverse the link from the source node to the target node –Path (route) latency is made up of nodes’ latency and links’ propagation delay on the path Can be obtained by making average from historical data IETF-72 – July Dublin