1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Routing Protocols II.

Slides:



Advertisements
Similar presentations
ROUTING IN INTERMITTENTLY CONNECTED MOBILE AD HOC NETWORKS AND DELAY TOLERANT NETWORKS: OVERVIEW AND CHALLENGES ZHENSHENG ZHANG.
Advertisements

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Presented By- Sayandeep Mitra TH SEMESTER Sensor Networks(CS 704D) Assignment.
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Network
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
Rumor Routing Algorithm For sensor Networks David Braginsky, Computer Science Department, UCLA Presented By: Yaohua Zhu CS691 Spring 2003.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Background In designing communication protocols for use in wireless sensor networks, one must consider the limitations of wireless systems in general:
By Libo Song and David F. Kotz Computer Science,Dartmouth College.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.
Sensor Networks Issues Solutions Some slides are from Estrin’s early talks.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
1-1 Routing. 1-2 Data-Centric Routing r Paradigm shift from accessing data from individual nodes to accessing “relevant” data. m Data within certain region,
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
1-1 Topology Control. 1-2 What’s topology control?
Multiple constraints QoS Routing Given: - a (real time) connection request with specified QoS requirements (e.g., Bdw, Delay, Jitter, packet loss, path.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control II.
Dissemination protocols for large sensor networks Fan Ye, Haiyun Luo, Songwu Lu and Lixia Zhang Department of Computer Science UCLA Chien Kang Wu.
Before start… Earlier work single-path routing in sensor networks
 Idit Keidar, Technion Intel Academic Seminars, February Octopus A Fault-Tolerant and Efficient Ad-hoc Routing Protocol Idit Keidar, Technion Joint.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Topology Control.
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Load Balancing Routing Scheme in Mars Sensor Network CS 215 Winter 2001 Term Project Prof : Mario Gerla Tutor: Xiaoyan Hong Student : Hanbiao Wang & Qingying.
Energy Aware Directed Diffusion for Wireless Sensor Networks Jisul Choe, 2Keecheon Kim Konkuk University, Seoul, Korea
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,
Efficient and Robust Query Processing in Dynamic Environments Using Random Walk Techniques Chen Avin Carlos Brito.
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
A Survey on Routing Protocols for Wireless Sensor Networks Kemal Akkaya, Mohamed Younis 19 th July, 2005 Seo, DongMahn.
Gathering Data in Wireless Sensor Networks Madhu K. Jayaprakash.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Wireless Sensor Networks COE 499 Energy Aware Routing
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
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.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
GARUDA: Achieving Effective Reliability for Downstream Communication in Wireless Sensor Networks Seung-Jong Park et al IEEE Transactions on mobile computing.
1 HAWAII- Handoff-Aware Wireless Access Internet Infrastructure Reporter : Jing-Shiuan Hua Date : 2005/4/26.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
SENSOR NETWORKS BY Umesh Shah Mayuresh Patil G P Reddy GUIDES Prof U.B.Desai Prof S.N.Merchant.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks Reporter: Yanlin Peng Wenrui Zhao, Mostafa Ammar, College of Computing,
Research into the hybridization of the PRoPHET and ERP network routing algorithms George Mason University INFS 612 (Spring 2013) Project Group 4: Richard.
A Survey on Sensor Networks Hussein Alzoubi Rami Alnamneh
NTU IM Page 1 of 35 Modelling Data-Centric Routing in Wireless Sensor Networks IEEE INFOCOM Author: Bhaskar Krishnamachari Deborah Estrin Stephen.
Routing in Sensor Networks. –Routing means carrying data packets from a source node to a destination node (usually called sinks in sensor networks terminology)
Location Directory Services Vivek Sharma 9/26/2001 CS851: Large Scale Deeply Embedded Networks.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
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)
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Sensor Networks Katia Obraczka Winter 2005 MAC II
Delay-Tolerant Networks (DTNs)
Introduction to Wireless Sensor Networks
Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks
Presentation transcript:

1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Routing Protocols II

1-2 Announcements r Reading assignment 1 is up.

1-3 Notes on Directed Diffusion r Multiple paths can be used to forward data back to the sink. r Is it the same as multicast?

1-4 Data MULEs

1-5 Target deployments. r Sparse networks. r Multi-tiered deployments. m Sensors. m Wired access points. m Mules.

1-6 Approach r Mobile agents. r MULEs: mobile ubiquitous LAN extensions. m Mobility. m Communication (short range). UWB radios? [low power and ability to handle bursts]. m Buffering.

1-7 Pros and cons

1-8 Pros and cons r Pros: m Energy efficiency ? Listen for the mule. m Intermittent connectivity. r Cons: m Increased latency.

1-9 Alternatives Approaches Latency Power Reliability Infrastructure cost Base stations Low High High High Ad-hoc Medium M/L Medium M/H MULE High Low Medium Low

tier architecture r Wired APs. r Mules. r Sensors.

1-11 Considerations r APs have no limitations. r Mules: m Storage, mobility, ability to communicate with sensors and APs. m Unpredictable movement patterns. m Can talk to other mules. Benefits? r Robustness. r Reliability.

1-12 More considerations… r No routing overhead. r Mules can transport data for multiple applications. r High latency. m Delay bounds? r Mobility limitations.

1-13 System model r Simple, discrete. r Lots of assumptions. m Realistic? r Performance metrics: m Reliability. m Buffer size. m Delay?

1-14 Main results r Buffer requirements at sensors inversely proportional to ratio of number of mules to grid size. r Buffer requirement at mule inversely proportional to ratio of number of mules to grid size and ratio of APs to grid size. r Relationship between buffer capacity, number of mules, and reliability.

1-15 Energy-efficient routing

1-16 [Schurgers et al.] r Two approaches: m Efficient data collection using aggregation. m Load balancing: spread traffic uniformly.

1-17 Observations r Energy-optimal routing needs to consider future traffic. m Energy limitations. B D F A C E T 0 A and E send 50 pkts to B. T 1 F sends 100 pkts to B. Load balancing: ADB, ECB, FDB. But, if nodes can only send 100 pkts, D would no be able to deliver all of F’s pkts to B. In this case, ACB, ECB, FDB.

1-18 Energy-efficient versus energy-optimal r Statistically optimal and only considers causal information. r Lifetime:worst-case time until node fails.

1-19 Traffic spreading r Make sure that nodes are used uniformly by routing. r Gradient-based routing (GBR): m Directed-diffusion variant. m Use shortest path (in number of hops) to sink to forward data. r Performance metric: E RMS. m Root mean square of the PDF of energy used by nodes.

1-20 Traffic spreading approaches r Stochastic: node picks next-hop randomly (chosen from neighbors with equal gradient). r Energy-based: node increases its “height” when its energy falls below a certain threshold. All nodes need to adjust their height accordingly. r Stream-based: divert streams from nodes that are part of paths used b other streams.

1-21 Results r Target tracking scenario. r Stream-based spreading performs the best. r Stochastic spreading does better than energy-based and pure GBR.

1-22 [Krishnamachari et al.]

1-23 Energy-robustness tradeoff in multipath routing r Multipath for robustness. m Fault-tolerance through redundancy. r Alternatively, reduce number of intermediate nodes. m Single paths. m Nodes use higher transmit power.

1-24 Considerations r Energy metric: number of transmissions * transmit energy. m Independent of number of receivers. r Robustness metric: m Probability message reaches sink in the face of node failures. m Assume that nodes fail with probability p independently from other nodes. r Pareto optimality criteria: m Routing scheme dominates another iff more robust with strictly less energy, or m Iff it uses equal or less energy with strictly higher robustness.

1-25 Results r For the simple scenario chosen (with path loss exponent equal to 2), the Pareto optimal schemes only include single-path routing. r For higher path loss exponent, some multipath schemes are dominated by single path routing.