CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan.

Slides:



Advertisements
Similar presentations
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY Presented By: Abbas Kazerouni EE 360 paper presentation, winter 2014, EE Department, Stanford.
Advertisements

Directed Diffusion for Wireless Sensor Networking
Dynamic Object Tracking in Wireless Sensor Networks Tzung-Shi Chen 1, Wen-Hwa Liao 2, Ming-De Huang 3, and Hua-Wen Tsai 4 1 National University of Tainan,
CS710 IEEE Transactions on vehicular technology 2005 A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou,
1 X-Matrix Team MSc Data Communications, Networks and Distributed Systems; Computer Science Department, UCL The X – Matrix Team Adaptive Protocols for.
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
Protocols for Wireless Sensor Networks
Kyung Tae Kim, Hee Yong Youn (Sungkyunkwan University)
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Kai Li, Kien Hua Department of Computer Science University of Central Florida.
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU Negotiation-based protocols for Disseminating Information in Wireless.
Adaptive Protocols for Information Dissermination in Wireless Sensor Networks Authors : Joanna Kulik, Wendi Rabiner, Hari Balakrishnan Speaker.
SPIN : S ENSOR P ROTOCOL FOR I NFORMATION VIA N EGOTIATION SUBMITTED BY : SANCHAITA CHATTERJEE ROLL : CSE -4 TH YEAR.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin LECS – UCLA Modified and Presented by Sugata Hazarika.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Computer Science 1 CSC 774 Advanced Network Security Enhancing Source-Location Privacy in Sensor Network Routing (ICDCS ’05) Brian Rogers Nov. 21, 2005.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Wireless sensor networks: a survey 周紹恩 指導教授 : 柯開維 1.
Differentiated Surveillance for Sensor Networks Ting Yan, Tian He, John A. Stankovic CS294-1 Jonathan Hui November 20, 2003.
U NIVERSITY OF M ASSACHUSETTS, A MHERST – Department of Computer Science Routing and Data Dissemination Presented by: Li, Huan Liu, Junning.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Wireless Distributed Sensor Networks Special Thanks to: Jasvinder Singh Hitesh Nama.
Empirical Analysis of Transmission Power Control Algorithms for Wireless Sensor Networks CENTS Retreat – May 26, 2005 Jaein Jeong (1), David Culler (1),
Energy-Aware Synchronization in Wireless Sensor Networks Yanos Saravanos Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
1 Chalermek Intanagonwiwat (USC/ISI) Ramesh Govindan (USC/ISI) Deborah Estrin (USC/ISI and UCLA) DARPA Sponsored SCADDS project Directed Diffusion
LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.
Sidewinder A Predictive Data Forwarding Protocol for Mobile Wireless Sensor Networks Matt Keally 1, Gang Zhou 1, Guoliang Xing 2 1 College of William and.
Energy-Aware Routing Paper #1: “Wireless sensor networks: a survey” Paper #2: “Online Power-aware Routing in Wireless Ad-hoc Networks” Robert Murawski.
Data Dissemination and Fusion In Sensor Networks.
1 A Mutual Exclusion Algorithm for Ad Hoc Mobile networks Presentation by Sanjeev Verma For COEN th Nov, 2003 J. E. Walter, J. L. Welch and N. Vaidya.
College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks Jae-Young Choi, Jun-Hui Lee, and Yeong-Jee Chung Dept. of Computer Engineering, College.
Routing and Data Dissemination. Outline Motivation and Challenges Basic Idea of Three Routing and Data Dissemination schemes in Sensor Networks Some Thoughts.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.
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.
 SNU INC Lab MOBICOM 2002 Directed Diffusion for Wireless Sensor Networking C. Intanagonwiwat, R. Govindan, D. Estrin, John Heidemann, and Fabio Silva.
College of Engineering Grid-based Coordinated Routing in Wireless Sensor Networks Uttara Sawant Major Advisor : Dr. Robert Akl Department of Computer Science.
Improving Routing in Sensor Networks with Heterogeneous Sensor Nodes Xiaojiang Du & Fengjing Lin Vehicular Technology Conference,2005 Spring,Volume 4.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
A Survey on Sensor Networks Hussein Alzoubi Rami Alnamneh
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Data Dissemination in Sensor Networks Challenges and Solutions by Sovrin Tolia.
Ching-Ju Lin Institute of Networking and Multimedia NTU
An Energy-Efficient Geographic Routing with Location Errors in Wireless Sensor Networks Julien Champ and Clement Saad I-SPAN 2008, Sydney (The international.
A Cluster Based On-demand Multi- Channel MAC Protocol for Wireless Multimedia Sensor Network Cheng Li1, Pu Wang1, Hsiao-Hwa Chen2, and Mohsen Guizani3.
RBP: Robust Broadcast Propagation in Wireless Networks Fred Stann, John Heidemann, Rajesh Shroff, Muhammad Zaki Murtaza USC/ISI In SenSys 2006.
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.
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Routing and Dissemination in Wireless Sensor Networks Sandeep Gupta Based on Slides by Huan and Junning U. Mass.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
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)
Structure-Free Data Aggregation in Sensor Networks.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
ROUTING TECHNIQUES IN WIRELESS SENSOR NETWORKS: A SURVEY.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
A Secure Routing Protocol with Intrusion Detection for Clustering Wireless Sensor Networks International Forum on Information Technology and Applications.
2016/7/31 A Survey on Sensor Networks Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci Georgia Institute of Technology Report.
Data Query in Sensor Networks Carmelissa Valera Jason Torre Carmelissa Valera Jason Torre.
SPIN: Sensor Protocols for Information via Negotiation
Protocols for Wireless Sensor Networks
Introduction to Wireless Sensor Networks
Routing and Data Dissemination
A Survey on Routing Protocols for Wireless Sensor Networks
Presentation transcript:

CS 599 Intelligent Embedded Systems1 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks W.R.Heinzelman, J.kulik, H.Balakrishnan

CS 599 Intelligent Embedded Systems2 Outline  Introduction  SPIN  Other Data Dissemination Algorithms  Sensor Network Simulations  Conclusions  Strengths and Weaknesses

CS 599 Intelligent Embedded Systems3 Introduction  Wide deployment of Wireless sensor networks  Wireless sensor networks  Can aggregate sensor data to provide multi- dimensional view  Improve sensing accuracy  Focus on critical events (e.g. intruder entering)  Fault tolerant network  Can improve remote access to sensor data – sink nodes

CS 599 Intelligent Embedded Systems4 Introduction contd.  Limitations of Wireless sensor networks  Energy  Computation  Communication

CS 599 Intelligent Embedded Systems5 Sensor Protocols for Information via Negotiation (SPIN)  Classic flooding limitations  Implosion  Overlap  Resource blindness

CS 599 Intelligent Embedded Systems6 Implosion Problem

CS 599 Intelligent Embedded Systems7 Overlap problem

CS 599 Intelligent Embedded Systems8 SPIN contd..  SPIN overcomes these deficiencies  Negotiation  Resource-adaptation  Each sensor node has resource manager  Keeps track of resource consumption  Applications probe the manager before any activity  Cut down activity to save energy  Motivated by principle of ALF  Common data naming (meta-data)

CS 599 Intelligent Embedded Systems9 SPIN Meta-Data  Sensors use meta-data to describe the sensor data briefly  If x is the meta-data descriptor for data X sizeof (x) < sizeof (X)  If x==y sensor-data-of (x) = sensor-data-of (y)  If X==Y meta-data-of (X) = meta-data-of (Y)  Meta-data format is application specific

CS 599 Intelligent Embedded Systems10 SPIN Messages  ADV – new data advertisement  REQ – request for data  DATA – data message ADV and REQ messages contain only meta- data so they are smaller in size.

CS 599 Intelligent Embedded Systems11 SPIN-1 and SPIN-2  SPIN-1  Simple 3-stage handshake protocol  Data aggregation is possible  Can adapt to work in lossy or mobile network  Can run in a completely unconfigured network

CS 599 Intelligent Embedded Systems12 Node B sends a REQ listing all of the data it would like to acquire.

CS 599 Intelligent Embedded Systems13 If node B had its own data, it could aggregate this with the data of node A and advertise.

CS 599 Intelligent Embedded Systems14 Nodes need not respond to every message

CS 599 Intelligent Embedded Systems15 SPIN-2  SPIN-1 with a Low-Energy Threshold  When energy below energy threshold – stop participating in the protocol  Can just receive data avoiding ADV-REQ phase

CS 599 Intelligent Embedded Systems16 Other data dissemination algos.  Classic Flooding  Converges in O(d), d-diameter of the network  Gossiping  Forward data to a random neighbor  Avoids implosion  Disseminates at a slow rate  Fastest rate = 1 node/round

CS 599 Intelligent Embedded Systems17

CS 599 Intelligent Embedded Systems18 Ideal dissemination  Every node sends sensor data along shortest path  Receives each piece of distinct data only once  Implementation  Network level multicast (source specific)  To handle losses, reliable multicast has to be deployed  SPIN is a form of application-level multicast

CS 599 Intelligent Embedded Systems19

CS 599 Intelligent Embedded Systems20 Sensor Network Simulations  Simulated using ns simulator  Extended ns to create a Resource- Adaptive Node

CS 599 Intelligent Embedded Systems21 Simulation Testbed

CS 599 Intelligent Embedded Systems22 SPIN-1 Results  Higher throughput than gossiping  Same throughput as flooding  Uses substantially less energy than other protocols  SPIN-2 delivers more data per unit energy than SPIN-1  SPIN-2 performs closer to Ideal dissemination  Nodes with higher degree tend to dissipate more energy than nodes with lower degree

CS 599 Intelligent Embedded Systems23 Data Acquired Over Time

CS 599 Intelligent Embedded Systems24 Energy Dissipated Over Time

CS 599 Intelligent Embedded Systems25 Energy Dissipated Over Time

CS 599 Intelligent Embedded Systems26 Unlimited Energy Simulations

CS 599 Intelligent Embedded Systems27 Limited Energy Simulations

CS 599 Intelligent Embedded Systems28 Limited Energy Simulations contd..

CS 599 Intelligent Embedded Systems29 Best-Case Convergence Times  For overlapping sensor data  Convergence times for ideal and flooding are the same  For non-overlapping sensor data  Flooding converges faster than SPIN-1  To understand these results, we develop equations that predict convergence times of each of these protocols.

CS 599 Intelligent Embedded Systems30 Transmission time per data packet = 8s/d Since SPIN-1 has to process ADV, REQ, DATA so processing time = 3(d+r) Convergence Time – no overlap

CS 599 Intelligent Embedded Systems31 Convergence Time – overlapping data

CS 599 Intelligent Embedded Systems32  For the testbed network parameters  Simulation results  Flooding converges in 135ms  Ideal converges in 125ms  SPIN-1 converges in 215ms  Convergence times of flooding and ideal are closer to their upper bound unlike SPIN-1

CS 599 Intelligent Embedded Systems33 Conclusions  SPIN solves the implosion and overlap problems.  SPIN-1 and SPIN-2 are simple protocols for wireless sensor networks.  SPIN outperforms gossiping.  SPIN-1 consumes only 25% energy w.r.t flooding  SPIN-2 distributes 60% more data per unit energy w.r.t flooding.

CS 599 Intelligent Embedded Systems34 Strengths and Weaknesses  Implosion problem still exists in the REQ stage  The paper doesn’t consider the collisions in the REQ stage  No justification for the network parameters chosen i

CS 599 Intelligent Embedded Systems35 Questions ?