Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,

Slides:



Advertisements
Similar presentations
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.
Advertisements

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin LECS – UCLA Modified and Presented by Sugata Hazarika.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Haiyun Luo, Fan Ye, Jerry Cheng, Songwu Lu, Lixia Zhang
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.
H-SPREAD: A Hybrid Multipath Scheme for Secure and Reliable Data Collection in Wireless Sensor Networks Wenjing Lou, Member, IEEE, and Younggoo Kwon.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
PROXY FOR CONNECTIVITY We consider the k shortest edge disjoint paths between a pair of nodes and define a hyperlink, whose ‘connectivity’ is defined as:
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Before start… Earlier work single-path routing in sensor networks
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Intanagonwiwat, Govindan, Estrin USC, Information Sciences Institute,
Yashar Ganjali Joint work with: Abtin Keshavarzian June 4, 2003 Single-Path vs. Multi-Path Routing in Ad Hoc Networks.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Matching Data Dissemination Algorithms to Application Requirements John Heidermann, Fabio Silva, Deborah Estrin Presented by Cuong Le (CPSC538A)
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Probability Grid: A Location Estimation Scheme for Wireless Sensor Networks Presented by cychen Date : 3/7 In Secon (Sensor and Ad Hoc Communications and.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Routing Protocols II.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Charlmek Intanagonwiwat Ramesh Govindan Deborah Estrin Presentation.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Slicing the Onion: Anonymity Using Unreliable Overlays Sachin Katti Jeffrey Cohen & Dina Katabi.
Does Packet Replication Along Multipath Really Help ? Swades DE Chunming QIAO EE Department CSE Department State University of New York at Buffalo Buffalo,
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
IPCCC’111 Assessing the Comparative Effectiveness of Map Construction Protocols in Wireless Sensor Networks Abdelmajid Khelil, Hanbin Chang, Neeraj Suri.
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha.
Ubiquitous Networks WSN Routing Protocols Lynn Choi Korea University.
Routing and Data Dissemination. Outline Motivation and Challenges Basic Idea of Three Routing and Data Dissemination schemes in Sensor Networks Some Thoughts.
Energy-Efficient Protocol for Cooperative Networks IEEE/ACM Transactions on Networking, Apr Mohamed Elhawary, Zygmunt J. Haas Yong Zhou
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks Seema Bandyopadhyay and Edward J. Coyle Presented by Yu Wang.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
BARD / April BARD: Bayesian-Assisted Resource Discovery Fred Stann (USC/ISI) Joint Work With John Heidemann (USC/ISI) April 9, 2004.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Ching-Ju Lin Institute of Networking and Multimedia NTU
1 Presented by Jing Sun Computer Science and Engineering Department University of Conneticut.
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
Residual Energy Scan for Monitoring Sensor Network Yonggang Jerry Zhao,Ramesh Govindan Computer Science Department/ISI University of Southern CaliforniaLos.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
An Adaptive Zone-based Storage Architecture for Wireless Sensor Networks Thang Nam Le, Dong Xuan and *Wei Yu Department of Computer Science and Engineering,
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Centralized Transmission Power Scheduling in Wireless Sensor Networks Qin Wang Computer Depart., U. of Science & Technology Beijing Edward Y. Hua Wireless.
FERMA: An Efficient Geocasting Protocol for Wireless Sensor Networks with Multiple Target Regions Young-Mi Song, Sung-Hee Lee and Young- Bae Ko Ajou University.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Scalable and Robust Data Dissemination in Wireless Sensor Networks Wei Liu, Yanchao Zhang, Yuguang Fang, Tan Wong Department of Electrical and Computer.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
1 Hierarchical Data Dissemination Scheme for Large Scale Sensor Networks Anand Visvanathan and Jitender Deogun Department of Computer Science and Engg,
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.
Enabling QoS Multipath Routing Protocol for Wireless Sensor Networks
Protocols for Wireless Sensor Networks
Introduction to Wireless Sensor Networks
Tarun Banka Department of Computer Science Colorado State University
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Presentation transcript:

Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute, Berkeley ACIRI, Berkeley

About Periodic low-rate flooding of data in order to allow recovery from failure. Multipaths for energy efficient recovery Disjoint multipath scheme Braided multipath scheme Braided multipaths are viable alternative for energy-efficient recovery from isolated and patterned failures

Introduction Directed Diffusion Earlier work has explored the design of mechanisms for single-path routing in sensor networks To route around failed nodes, this work assumed periodic, low-rate, flooding of events that enabled local re-routing around failed nodes

Introduction Multipath routing Disjoint multipath Braided multipath Resilience Maintenance Overhead Evaluating the two mechanisms: isolated node failures and patterned failures

Direct Diffusion Directed Diffusion

Direct Diffusion Using directed diffusion to perform energy-efficient and robust dissemination of surveillance data samples from sources to sinks Low rate samples Path reinforcement Recovery from failure along reinforcement path The problem is low-rate flooding scheme

Direct Diffusion Direct Diffusion for energy-efficient data samples from source to sinks.

Multipath Routing Classic Multipath Routing usage Using multipath routing in this paper Primary path Construct and maintain a small number of alternate paths (without periodic flooding) When primary path is set up, alternate paths also sets up multipaths which data is send low-rate No network wide flooding needed

Disjoint Multipaths Small number of alternate paths that are node-disjoint with the primary path, and with each other How do we realize node disjoint multipaths using localized information alone, and not relying on global topology information? Primary and alternate path reinforcement Localized disjoint multipaths are differ from idealized multipaths

Construction of Localized Disjoint Paths

Braided Multipaths Disjoint multipaths can be energy inefficient Alternate paths in a braid are partially disjoint from the primary path, not completely node-disjoint For each node on the primary path, find the best path from source to sink that does not contain that node All paths are called idealized braided

Braided Multipaths Localized technique for constructing braids. Nodes send reinforcement to route neighbours. The alternate paths can rejoin the primary path

Braided Multipaths

Qualitative Comparison Energy/resilience tradeoffs of the two multipath schemes The energy cost of alternate disjoint paths depends on the network density The resilience of these multipaths to failure (isolated failures and patterned failures) Disjoint paths give us independence, but the failure of a single node on each alternate path results in the failure of the multipath.

Qualitative Comparison By contrast, in braided multipaths, the various alternate paths are not independent, and a combination of failures on the primary path could sever all alternate paths How much additional energy must one expend in order to increase resilience by a fixed amount? How does the energy/resilience tradeoff vary with density or with the extent and frequency of patterned failures? How closely do the localized schemes approximate their idealized counterparts?

Evaluation Methodology Maintenance overhead Resilience Failure models for which we evaluated the resilience of our multipath mechanisms

Isolated Failures Patterned Failures Failures

Details of Methodology The idealized and localized constructions of disjoint and braided multipath in ns-2 Uniformly distributing a number of sensor nodes on a finite plane of dimension 400 meters square Node transmission radius: 40 meters Density The spatial separation between source and sink (represented by the length of the shortest-hop path between the two

Details of Methodology The failure probability for isolated failures pi the arrival rate of patterned failures is lamda p Radius of patterned failures R Each run of our experiment corresponded to one choice of number of nodes N and and spatial separation between source and sink d In each run, we randomly selected a large number of source-sink pairs separated by d hops

Simulation Results Impact of failure probability on resilience: 400 nodes, 6- hop source-sink separation

Simulation Results Resilience to Isolated Failures

Simulation Results The impact of density and source-sink separation on resilience to isolated failure

Simulation Results Resilience to Patterned Failures

Simulation Results The impact of density and source-sink separation on resilience to patterned failure

Simulation Results Maintenance Overhead - Density

Simulation Results Maintenance Overhead – Path Length

Conclusions Multipath routing for energy-efficient recovery No need network-wide flooding for path discory on failure Disjoint and braided multipaths are similar, but braided multipaths have about %50 higher resilience to isolated failures It is harder to design localized energy-efficient mechanisms for constructing disjoint alternate paths, because the localized algorithms lack the information to find low latency disjoint paths Increasing the number of disjoint paths does increase the resilince but this needs higher energy cost.

Questions ?