IPCCC’111 Assessing the Comparative Effectiveness of Map Construction Protocols in Wireless Sensor Networks Abdelmajid Khelil, Hanbin Chang, Neeraj Suri.

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

Decentralized Reactive Clustering in Sensor Networks Yingyue Xu April 26, 2015.
Fault-Tolerant Target Detection in Sensor Networks Min Ding +, Dechang Chen *, Andrew Thaeler +, and Xiuzhen Cheng + + Department of Computer Science,
1 Message Oriented Middleware and Hierarchical Routing Protocols Smita Singhaniya Sowmya Marianallur Dhanasekaran Madan Puthige.
CLUSTERING IN WIRELESS SENSOR NETWORKS B Y K ALYAN S ASIDHAR.
SENSOR NETWORKS ECE 654 Irene Ioannou. Sensor networks communication architecture.
A novel Energy-Efficient and Distance- based Clustering approach for Wireless Sensor Networks M. Mehdi Afsar, Mohammad-H. Tayarani-N.
Highly-Resilient, Energy-Efficient Multipath Routing in Wireless Sensor Networks Computer Science Department, UCLA International Computer Science Institute,
1 Routing Techniques in Wireless Sensor networks: A Survey.
Cluster Tree Based Self Organization of Virtual Sensor Networks Dilum Bandara 1, Anura Jayasumana 1, and Tissa Illangasekare 2 1 Department of Electrical.
산업 및 시스템 공학과 통신시스템 및 인터넷보안연구실 김효원 Optimizing Tree Reconfiguration for Mobile Target Tracking in Sensor Networks Wensheng Zhang and Guohong Cao.
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Wireless Broadcasting with Optimized Transmission Efficiency Jehn-Ruey Jiang and Yung-Liang Lai National Central University, Taiwan.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks.
Progress Report Wireless Routing By Edward Mulimba.
FLIP : Flexible Interconnection Protocol Ignacio Solis Katia Obraczka.
DNA Research Group 1 CountTorrent: Ubiquitous Access to Query Aggregates in Dynamic and Mobile Sensor Networks Abhinav Kamra, Vishal Misra and Dan Rubenstein.
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams Amit Manjhi, Suman Nath, Phillip B. Gibbons Carnegie Mellon University.
IEEE INFOCOM 2005, Miami, FL RID: Radio Interference Detection in Wireless Sensor Networks Gang Zhou, Tian He, John A. Stankovic, Tarek F. Abdelzaher Computer.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
A Cross Layer Approach for Power Heterogeneous Ad hoc Networks Vasudev Shah and Srikanth Krishnamurthy ICDCS 2005.
1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.
On Tree-Based Convergecasting in Wireless Sensor Networks V. Annamalai, S. K. S. Gupta, L. Schwiebert IEEE 2003 Speaker : Chi-Chih Wu.
Distributed and Efficient Classifiers for Wireless Audio-Sensor Networks Baljeet Malhotra Ioanis Nikolaidis Mario A. Nascimento University of Alberta Canada.
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.
TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.
A novel gossip-based sensing coverage algorithm for dense wireless sensor networks Vinh Tran-Quang a, Takumi Miyoshi a,b a Graduate School of Engineering,
Department of Computer Science City University of Hong Kong Department of Computer Science City University of Hong Kong 1 Continuous Residual Energy Monitoring.
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.
Scalable Data Aggregation for Dynamic Events in Sensor Networks Kai-Wei Fan Kai-Wei Fan, Sha Liu, and Prasun.
Distributed Anomaly Detection in Wireless Sensor Networks Ksutharshan Rajasegarar, Christopher Leckie, Marimutha Palaniswami, James C. Bezdek IEEE ICCS2006(Institutions.
COMPUTING AGGREGATES FOR MONITORING WIRELESS SENSOR NETWORKS Jerry Zhao, Ramesh Govindan, Deborah Estrin Presented by Hiren Shah.
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.
Distributed Monitoring and Aggregation in Wireless Sensor Networks INFOCOM 2010 Changlei Liu and Guohong Cao Speaker: Wun-Cheng Li.
Lan F.Akyildiz,Weilian Su, Erdal Cayirci,and Yogesh sankarasubramaniam IEEE Communications Magazine 2002 Speaker:earl A Survey on Sensor Networks.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN) Mohammad Rajiullah & Shigeru Shimamoto.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.
Junfeng Xu, Keqiu Li, and Geyong Min IEEE Globecom 2010 Speak: Huei-Rung, Tsai Layered Multi-path Power Control in Underwater Sensor Networks.
Bounded relay hop mobile data gathering in wireless sensor networks
ELECTIONEL ECTI ON ELECTION: Energy-efficient and Low- latEncy sCheduling Technique for wIreless sensOr Networks Shamim Begum, Shao-Cheng Wang, Bhaskar.
University “Ss. Cyril and Methodus” SKOPJE Cluster-based MDS Algorithm for Nodes Localization in Wireless Sensor Networks Ass. Biljana Stojkoska.
Authors: N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi
Modeling In-Network Processing and Aggregation in Sensor Networks Ajay Mahimkar The University of Texas at Austin March 24, 2004.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Cooperative Location- Sensing for Wireless Networks Authors : Haris Fretzagias Maria Papadopouli Presented by cychen IEEE International Conference on Pervasive.
Weight-Based Clustering Multicast Routing Protocol for Mobile Ad Hoc Networks Chun-Chieh Huang, Ruay-shiung Chang and Ming-Huang Guo National Dong-Hwa.
Ching-Ju Lin Institute of Networking and Multimedia NTU
MCEEC: MULTI-HOP CENTRALIZED ENERGY EFFICIENT CLUSTERING ROUTING PROTOCOL FOR WSNS N. Javaid, M. Aslam, K. Djouani, Z. A. Khan, T. A. Alghamdi.
By: Gang Zhou Computer Science Department University of Virginia 1 Medians and Beyond: New Aggregation Techniques for Sensor Networks CS851 Seminar Presentation.
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
Residual Energy Scan for Monitoring Sensor Network Yonggang Jerry Zhao,Ramesh Govindan Computer Science Department/ISI University of Southern CaliforniaLos.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Dynamic Link Labels for Energy Efficient MAC Headers in Wireless Sensor Networks Sheng-Shih Wang Gautam Kulkarni, Curt Schurgers, and Mani Srivastava IEEE.
ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,
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.
Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.
I-Hsin Liu1 Event-to-Sink Directed Clustering in Wireless Sensor Networks Alper Bereketli and Ozgur B. Akan Department of Electrical and Electronics Engineering.
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)
1 Multipath Routing in WSN with multiple Sink nodes YUEQUAN CHEN, Edward Chan and Song Han Department of Computer Science City University of HongKong.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Presented by Barath Raghavan.
Wireless Access and Networking Technology (WANT) Lab. An Efficient Data Aggregation Approach for Large Scale Wireless Sensor Networks Globecom 2010 Lutful.
Net 435: Wireless sensor network (WSN)
Presentation transcript:

IPCCC’111 Assessing the Comparative Effectiveness of Map Construction Protocols in Wireless Sensor Networks Abdelmajid Khelil, Hanbin Chang, Neeraj Suri IPCCC 2011

IPCCC’112 Maps  Maps are an intuitive data representation technique  provide a visual representation of an attribute in a certain area;  street map, typographic map, world map, etc.  Maps for Wireless Sensor Networks (WSN) applications  help users to understand sensed physical phenomena  help users to make a decision Sensor locationSensor value (112, 209)145 (218, 163)163 (617, 783)158 (530, 745)163 (477, 625)165 (936, 423)157 (745, 817)155 (653, 237) X Y

IPCCC’113 Sink Map Construction in WSN Naive approach for map construction Energy-efficient approaches for map construction Data collection and processing centrally at sinkin-network Energy efficiency (Comm. complexity on sensor nodes) high comm. overhead Lower comm. overhead Map accuracy node-level accuracy, may decrease because of comm. failures may lose detailed information of each individual node Naive Approach Example of Available Approaches

IPCCC’114 Problem statement and Objectives Several approaches have been proposed. However,  Evaluation in carefully selected application scenarios  No assessment of the comparative effectiveness of existing approaches: Which is outperforming in Which application/scenario for Which network configuration?

IPCCC’115 Outline  Motivation  Classification of Existing Map Construction Approaches  Performance Comparison in a Wide Range Scenarios  Conclusions

IPCCC’116 Data Collection Scheme Classification of Map Construction Approaches Map construction approaches for WSN Region Aggregation Data Suppression Tree-based data collection eScan [9] Isobar [8] Iso-node based data collection Cluster- based data collection Isolines [14] Iso-map [10,11] Contour Map [18] CME [19] Cluster- based data collection CREM [7] Multi-path data collection INLR [16] In-network Processing Technique

IPCCC’117 Region Aggregation Class  Basic idea  Sensor nodes are ordered hierarchically (clusters, tree..)  Every sensor reports to a dedicated node (cluster head, parent..)  Dedicated node aggregates adjacent similar data to regions  3 Phases: Region Segmentation  At each sensor  Non-overlapping polygons  Vertex representation Data Collection  Aggregator determination Region Aggregation  At aggregator  Regions formation  Aggregation function, e.g. average m m+1 m+2 Tree-based Cluster-basedRing-based

IPCCC’118  Basic idea  A subset of sensor nodes (iso-nodes) report their value to the sink  suppress similar data to be reported  2 Phases Iso-node Identification  what is an iso-node? has a neighbor with different value  how to identify? broadcast snoop Isoline Report Generation  iso-node based generated at Iso-node routed directly to the sink  cluster based generated at cluster-head Iso-node reports to cluster-head a local map Data Suppression Class Isoline Nodes report to the sink Nodes suppress reports to the sink

IPCCC’119 Data Collection Scheme Classification of Map Construction Approaches Map construction approaches for WSN Region Aggregation Data Suppression Tree-based data collection eScan [9] Isobar [8] Iso-node based data collection Cluster- based data collection Isolines [14] Iso-map [10,11] Contour Map [18] CME [19] Cluster- based data collection CREM [7] Multi-path data collection INLR [16] In-network Processing Technique

IPCCC’1110 Selected Map Construction Algorithms  The eScan approach [9]  Nodes ordered as an aggregation-tree  Polygon regions  Aggregation function: Average  The Isoline approach [14]  Local flood to label border nodes  Each iso-node reports to the sink  Map constructed at the sink [9] Y. Zhao et al. Residual Energy Scan for Monitoring Sensor Networks. In IEEE WCNC, [14] I. Solis and K. Obraczka. Isolines: Energy-efficient Mapping in Sensor Networks. In ISCC, 2005.

IPCCC’1111 Outline  Motivation  Classification of Existing Map Construction Approaches  Performance Comparison in a Wide Range Scenarios  Conclusions

IPCCC’1112 Evaluation Framework: Methodology  Selected map construction protocols  Region aggregation class: eScan  Data suppression class: Isoline  Simulations using OMNet++  Network Area : 300 x 300 m² Topology: Grid or random  Tree-based routing protocol  Performance metrics  Map accuracy: The ratio of false classified sensors to all sensor nodes.  Energy efficiency: Network traffic

IPCCC’1113 Evaluation Framework: Comparative Studies Compare for a wide range of parameters:  Impact of physical phenomena properties  Hotspot effect range : limited vs. diffusive  Hotspot number : 1 vs. n  Impact of protocol parameters  Sensor value range [0, 60], classes: [0, GV[, [GV, 2GV[... Signal discretization (Granularity value: GV)GV=5…25  Impact of network properties  Node densityN=256(16x16) (35x35)  Communication failuresBER=0…10 -2  Communication rangeCR=60m

IPCCC’1114  Granularity increases  #Isolines and #Iso-nodes decrease -> lower msg overhead  Region size increase -> lower msg overhead  Accuracy  Isoline always outperforms eScan  Efficiency  Isoline outperforms eScan for lower granularities (b) Step value = 25 unit Comparison: Impact of Granularity (a) Step value = 5 unit

IPCCC’1115 Comparison: Impact of BER  BER increases  Loss of messages -> lower msg overhead  Overhead reduction is higher for eScan  Higher BER decreases map accuracy  Loss of messages -> gaps in the map Higher accuracy drop for eScan

IPCCC’1116 Comparison: Impact of Node Density  Node density increases  #Iso-nodes increases -> higher msg overhead  #Region and “region border information” increase -> higher msg overhead  Node density has low impact on map accuracy  Region border precision increases -> provide a more detailed map

IPCCC’1117 Conclusions Region aggregation class Data suppression class + High accuracy with reliable comm. - Less suitable for less reliable comm. + high accuracy for reliable comm. + performs also well for less reliable comm. + accuracy increases with increasing granularity value + Small granularity value + Low density network - Small granularity value + low density network Accuracy Efficiency

IPCCC’1118 Thanks for Your Attention!