routing and transport in wireless sensor networks
play

Routing and Transport in Wireless Sensor Networks Ibrahim Matta - PDF document

10/21/2003 Routing and Transport in Wireless Sensor Networks Ibrahim Matta (matta@bu.edu) Niky Riga (inki@bu.edu) Georgios Smaragdakis (gsmaragd@bu.edu) Wei Li (wli@bu.edu) Vijay Erramilli (evijay@bu.edu) References Adaptive Protocols


  1. 10/21/2003 Routing and Transport in Wireless Sensor Networks Ibrahim Matta (matta@bu.edu) Niky Riga (inki@bu.edu) Georgios Smaragdakis (gsmaragd@bu.edu) Wei Li (wli@bu.edu) Vijay Erramilli (evijay@bu.edu) References • Adaptive Protocols for Information Dissemination in Wireless Sensor Networks Wendi Rabiner Heinzelman, J. Kulik, and H. Balakrishnan Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1999) , Seattle, Washington, August 15-20, 1999, pp. 174-185. • Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Chalermek Intanagonwiwat, Ramesh Govindanand Deborah Estrin Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM 2000), August 2000, Boston, Massachusetts. • Rumor Routing Algorithm For Sensor Networks David Braginsky and Deborah Estrin First Workshop on Sensor Networks and Applications (WSNA), September 28, 2002, Atlanta, GA. • Highly Resilient, Energy Efficient Multipath Routing in Wireless Sensor Networks Deepak Ganesan, Ramesh Govindan, Scott Shenker and Deborah Estrin Mobile Computing and Communications Review (MC2R), Vol 1., No. 2. 2002. • GRAdientBroadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks Fan Ye, Gary Zhong, SongwuLu, LixiaZhang ACM WINET (Wireless Networks) • Energy-efficient Communication Protocol for Wireless Microsensor Networks Wendi Heinzelman, Anantha Chandrakasan, Hari Balakrishnan Proceedings of the Hawaii International Conference on Systems Science , January 2000, Maui, HI. • A Two-tier Data Dissemination Model for Large-scale Wireless Sensor Networks Fan Ye, Haiyun Luo, Jerry Cheng, Songwu Lu, LixiaZhang Proceedings of the Eighth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCOM 2002), September 2002, Atlanta, GA. • PSFQ: A Reliable Transport Protocol For Wireless Sensor Networks Chieh-YihWan, Andrew Campbell, Lakshman Krishnamurthy First Workshop on Sensor Networks and Applications (WSNA), September 28, 2002, Atlanta, GA. 10/07/2003 Ibrahim Matta

  2. 10/21/2003 Model • Sensor nodes perform sensing tasks and report back data to user (via the “sink”) • Sensor nodes are resource-constrained (limited battery power, processing power, memory, etc.) • High transmission error rate and low bandwidth when nodes communicate over wireless 10/07/2003 Ibrahim Matta Model (cont’d) • Data flowing from sources (sensors) to “sink” is usually loss-tolerant – E.g., sensing temperature, light, acoustic, etc. • Data flowing from “sink” to sensors is usually loss-sensitive – E.g., sensor management: re-tasking or re-programming sensors 10/07/2003 Ibrahim Matta

  3. 10/21/2003 Application-specific Protocols • Data aggregation opportunities – Remove duplicate or redundant data – “Beamforming” or fusion • Routing and transport intertwined – Data centric • Want a long-lived, robust, low-latency network … – that scales to large number of sensors, sinks, and high mobility 10/07/2003 Ibrahim Matta Protocol Design Goals • Low Energy – Minimize communication � Aggregate data in network – Low Node Duty Cycle � Minimize individual node responsibility � Traffic spreading / Load balancing � Shut down nodes when possible • Robust – Adapt to unpredictable environment without intervention • Scalable – Rely on localized algorithms –no centralized control • Low Latency – Must meet application latency and accuracy requirements • Small Footprint – Must run on hardware with severe memory and computational power constraints 10/07/2003 Ibrahim Matta

  4. 10/21/2003 Example Network Models Sensors Users Interest Data Event Propagation Dissemination (Sources) (Sinks) Static Query Unicast Stationary Stationary Unicast Continuous Multicast Multicast Mobile Mobile Target Broadcast Detection Broadcast 10/07/2003 Ibrahim Matta Protocols • Flooding • Gradient • Clustering • Reliable • Geographic 10/07/2003 Ibrahim Matta

  5. 10/21/2003 Flooding Based Approaches • Flooding • SPIN –Sensor Protocol for Information via Negotiation “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Wendi Rabiner Heinzelman, J. Kulik, and H. Balakrishnan , MobiCom 1999. 10/07/2003 Ibrahim Matta How did we review papers? • Motivation of the work • Single major idea in paper • Model provided in paper • Related work • Advantages of the work • Improvements to the work • Single major result • Future research 10/07/2003 Ibrahim Matta

  6. 10/21/2003 SPIN • Motivation of the work – Overcome limitations of classic flooding • Single major idea in paper – Describe data at a high level (meta-data) and use it for negotiation – Do in-network processing to eliminate redundancy • Model provided in paper – Dissemination to all sensors – meta-data smaller than data • Related work – NNTP: news servers use names and timestamps as meta-data 10/07/2003 Ibrahim Matta SPIN Energy Dissipation: Which one, flooding or SPIN, you expect to converge faster? 10/07/2003 Ibrahim Matta

  7. 10/21/2003 SPIN Sensors Users Interest Data Event Propagation Dissemination (Sources) (Sinks) Static Query Query Unicast Unicast Query Unicast Stationary Stationary Unicast Unicast Unicast Multicast Continuous Multicast Multicast Multicast Multicast Multicast Mobile Mobile Target Broadcast Broadcast Broadcast Detection Broadcast 10/07/2003 Ibrahim Matta SPIN • Advantages of the work – Simple: ADV –REQ –DATA – scalable: only local interactions – Low latency and energy-efficient – Robust to failures and mobility • Improvements to the work – Consider network losses and queuing delays • Single major result – More energy efficient than flooding and close to ideal dissemination • Future research – Can we do efficient dissemination without requiring all nodes to be up all the time? 10/07/2003 Ibrahim Matta

  8. 10/21/2003 Gradient Based Approaches • Directed Diffusion “Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks,” Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, MobiCOM 2000. • GRAB –GRadient Broadcast “GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks,” Fan Ye, Gary Zhong, Songwu Lu, Lixia Zhang, ACM Wireless Networks. 10/07/2003 Ibrahim Matta Directed Diffusion • Motivation of the work – Distributed sensing and not everyone may be interested in the sensed data • Single major idea in paper – Query-initiated: interests set gradients toward sink – Sink reinforces a primary (best) path – Interests refreshed periodically and aggregated inside the network • Model provided in paper – Events described by attribute-value pairs – Users express interest in certain events – Probably works well for long-lived queries • Related work – IP multicast: members join sessions of interest – Reliable multicast: local recovery at routers 10/07/2003 Ibrahim Matta

  9. 10/21/2003 Directed Diffusion Multiple Sources Multiple Sinks Link Failure Do you see any problem here? 10/07/2003 Ibrahim Matta Directed Diffusion Energy Dissipation: Why is Diffusion more efficient than Omniscient Multicast? 10/07/2003 Ibrahim Matta

  10. 10/21/2003 Directed Diffusion Latency: Why does Diffusion have delay comparable to Omniscient Multicast? 10/07/2003 Ibrahim Matta Directed Diffusion • Advantages of the work – Robust: only local interactions – Low latency: data received along best path – Robust: interests refreshed • Improvements to the work – Diffuse interests geographically instead of flooding – Consider congestion – Data aggregation beyond suppressing duplicates – Reinforce multiple paths to avoid energy depletion on primary path • Single major result – More energy efficient than flooding and omniscient multicast (source-rooted tree to all sinks) • Future research – How can we reduce waste in energy due to sink-initiated reinforced paths? – Can we analyze stability of selecting reinforced paths? 10/07/2003 Ibrahim Matta

  11. 10/21/2003 Directed Diffusion Sensors Users Interest Data Event Propagation Dissemination (Sources) (Sinks) Static Static Static Unicast Query Stationary Stationary Unicast Continuous Multicast Multicast Mobile Mobile Mobile Mobile Mobile Mobile Target Broadcast Broadcast Broadcast Broadcast Detection 10/07/2003 Ibrahim Matta GRADient Broadcast: A Robust Data Delivery Protocol For Large Scale Sensor Networks Fan Ye, Gary Zhong, Songwu Lu,Lixia Zhang UCLA ACM WINET Niky Riga Sensor Networks Seminar Fall 2003 Boston University

  12. 10/21/2003 Setup… stimuli source sink 10/07/2003 Ibrahim Matta Flow of data (1) Broadcast High energy consumption 10/07/2003 Ibrahim Matta

  13. 10/21/2003 Flow of data (1) Single Path 10/07/2003 Ibrahim Matta Flow of data (3) Multipath Idea : Maintain more than one path from the source to the sink. 10/07/2003 Ibrahim Matta

  14. 10/21/2003 Multipath Disjoint Paths For each two paths all the nodes along the path are different except the source and the sink 10/07/2003 Ibrahim Matta Multipath Braided Paths Two different paths from the source to the sink differ in at least two nodes 10/07/2003 Ibrahim Matta

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend