Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.

Slides:



Advertisements
Similar presentations
Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Advertisements

Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.
Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.
Directed Diffusion for Wireless Sensor Networking
Scalable Content-Addressable Network Lintao Liu
A Presentation by: Noman Shahreyar
1 Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table Sylvia Ratnasamy, Scott Shenker, Brad Karp, Ramesh Govindan, Deborah Estrin, Li.
Sensor Network 教育部資通訊科技人才培育先導型計畫. 1.Introduction General Purpose  A wireless sensor network (WSN) is a wireless network using sensors to cooperatively.
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.
Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker Presented by Greg Nims.
Data-Centric Storage in Sensor Networks With GHT Khaldoun A. Ibrahim,
1 Next Century Challenges: Scalable Coordination in sensor Networks MOBICOMM (1999) Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar Presented.
Department of Computer Science, University of Maryland, College Park, USA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Progress Report Wireless Routing By Edward Mulimba.
An Implementation Framework for Trajectory-Based Routing in Ad Hoc Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer,
Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
In-Network Querying Murat Demirbas SUNY Buffalo. Glance: A lightweight querying service for wireless sensor networks Murat Demirbas SUNY Buffalo Anish.
Ad Hoc Networks Routing
Dynamic Medial Axis Based Motion Planning in Sensor Networks Lan Lin and Hyunyoung Lee Department of Computer Science University of Denver
Trajectory-Based Forwarding Mechanisms for Ad-Hoc Sensor Networks Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman Electrical, Computer, and Systems.
Beacon Vector Routing: Scalable Point-to-Point Routing in Wireless Sensornets.
Glance: A lightweight querying service for wireless sensor networks Murat Demirbas SUNY Buffalo Anish Arora, Vinod Kulathumani Ohio State Univ.
Sensor Networks Storage Sanket Totala Sudarshan Jagannathan.
The Zone Routing Protocol (ZRP)
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Load Balancing of In-Network Data-Centric Storage Schemes in Sensor Networks Mohamed Aly In collaboration with Kirk Pruhs and Panos K. Chrysanthis Advanced.
2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.
Scalable Routing Protocols for Mobile Ad Hoc Networks Xiaoyan Hong, Kaixin Xu, and Mario Gerla at UCLA.
ROUTING ALGORITHMS IN AD HOC NETWORKS
Geographic Hash Table S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin and F. Yu.
Data centric Storage In Sensor networks Based on Balaji Jayaprakash’s slides.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Research overview Murat Demirbas University at Buffalo, SUNY CSE Dept. iComp.
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.
Multi-Resolution Spatial and Temporal Coding in a Wireless Sensor Network for Long-Term Monitoring Applications You-Chiun Wang, Member, IEEE, Yao-Yu Hsieh,
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks ChalermekRameshDeborah Intanagonwiwat Govindan Estrin Mobicom 2000.
Zone Sharing: A Hot-Spots Decomposition Scheme for Data-Centric Storage in Sensor Networks Mohamed Aly Nicholas Morsillo Panos K. Chrysanthis Kirk Pruhs.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
DIST: A Distributed Spatio-temporal Index Structure for Sensor Networks Anand Meka and Ambuj Singh UCSB, 2005.
A Mechanized Model for CAN Protocols Context and objectives Our mechanized model Results Conclusions and Future Works Francesco Bongiovanni and Ludovic.
WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.
A Survey of Geocast Routing Protocols 指導教授:許子衡 教授 報告學生:馬敏修 指導教授:許子衡 教授 報告學生:馬敏修.
Selection and Navigation of Mobile sensor Nodes Using a Sensor Network Atul Verma, Hemjit Sawant and Jindong Tan Department of Electrical and Computer.
Communication Support for Location- Centric Collaborative Signal Processing in Sensor Networks Parmesh Ramanathan University of Wisconsin, Madison Acknowledgements:K.-C.
1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
Resilient Approach for Energy Management on Hot Spots in WSNs Fernando Henrique Gielow Michele Nogueira Aldri Luiz dos Santos
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
CarNet/Grid: Scalable Ad-Hoc Geographic Routing Robert Morris MIT / LCS
Scalable Routing Protocols for
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Murat Demirbas Onur Soysal SUNY Buffalo Ali Saman Tosun U. San Antonio Data Salmon: A greedy mobile basestation protocol for efficient data collection.
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.
A Reliability-oriented Transmission Service in Wireless Sensor Networks Yunhuai Liu, Yanmin Zhu and Lionel Ni Computer Science and Engineering Hong Kong.
Massively Distributed Database Systems In-Network Query Processing (Ad-Hoc Sensor Network) Fall 2015 Ki-Joune Li Pusan.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.
Mote Clusters Thanos Stathopoulos CENS Systems Lab Joint work with Ben Greenstein, Lewis Girod, Mohammad Rahimi, Tom Schoellhammer, Ning Xu, Richard Guy.
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
Murat Yuksel, Ritesh Pradhan, Shivkumar Kalyanaraman
GPSR Greedy Perimeter Stateless Routing
Outline Ganesan, D., Greenstein, B., Estrin, D., Heidemann, J., and Govindan, R. Multiresolution storage and search in sensor networks. Trans. Storage.
Presentation transcript:

Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks (WSNs) Murat Demirbas, Xuming Lu Dept of Computer Science and Engineering, University at Buffalo, SUNY, NY {demirbas, URL: iComp

2 In-network querying in WSNs In contrast to traditional WSN applications that perform only data collection, new generation of WSN applications require in-network information querying –Disaster relief applications –Battlefield applications Where is the nearest enemy tank? A soldier queries the WSN via a palm device. Energy-efficiency and latency suffers drastically if queries are always routed to a centralized basestation over many hops In-network querying should satisfy Distance sensitivity Cost of querying for nearby events should be lower Low-cost construction Costly bottom-up constructions (via flooding) should be avoided Graceful resilience Node failures should not impact performance disproportionately

3 Our contributions We present an in-network querying infrastructure that satisfies all these requirements for event querying –Distance sensitivity: the cost is at most (stretch factor) times the distance d to the nearest event –Low-cost maintenance: stateless, minimalist infrastructure, bottom-up construction is avoided –Graceful resilience: single mote failures are masked and performance degrades proportionately wrt the severity of holes (failures of motes in a region)

4 Distributed Quad-Tree (DQT) We embed a DQT over the WSN : DQT is a multi-resolution structure, but for a lightweight representation of DQT we use an encoding trick –Based on the DQT node id, a node determines which level it is at, which children, neighbor, parent it has To achieve low-cost construction, we exploit location info at the nodes –Nodes know the boundary coordinates of deployment, and calculate which DQT node id they fall into using their coordinates –We chose the clusterheads closer to the basestation to avoid backward links during querying and data collection

5 Event Indexing & Querying Indexing of event information A node at level i maintains the event information of its cluster, as well as the event information of its neighbors Event querying algorithm If query point is not current location, query is routed to the query point via GPSR If matching answer is not found, query is sent to next parent progressively (until root is reached) The result is returned to the initiator Query Propagation Path

6 Graceful resilience DQT achieves resilience via: –its stateless nature, and –using GPSR for routing More specifically : –Mote failures do not often lead to failure of level 1 node & are masked –GPSR routes around coverage holes, & delivers the message to a boundary node if destination is inside hole –Since DQT is stateless, any node can act as a proxy node for another Simulations show that s ’ increases slowly wrt failure rate Stretch factor under different failure rate s = ratio of DQT querying cost to dist (q, p) s’ =ratio of DQT querying cost to GPSR cost (q, p)

7 Simulation (ns2) Querying success rate Stretch factor with node failure: Case 1Stretch factor with node failure: Case 2 Settings: 16x16 nodes, unit distance 200m, transmission range 250m Case 1: Failures happen before the event advertisement. Case 2: The event has already been published in the structure before the failure happens.

8 Related work Distance Sensitive Information Brokerage protocol ( Funke et al[2006].) –achieves distance-sensitivity via hierarchically partitions –relies on communication protocol and needs costly construction DIMENSIONS ( Estrin et. al. [2002]) –provides a unified view of data processing and in-network querying via wavelet compression and waveRoute routing protocol –sacrifices flexibility space to achieve multi-resolution capability Geographic Hash Tables ( Ratnasamy et al. [2002] ) –stores and retrieves information using a geographic hash function –querying is not distance sensitive Distributed Index for Features in Sensor Networks (Greenstein et al. [2003]) –addresses complex querying, not restricted to event querying –costly to construct and update –special purposed routing

9 Our current work: Model-based querying in DQT –Only supporting event type of querying is very limited –Complex querying is very costly without prior knowledge of data –We use modeling to capture the correlations of sensor values and reduce the cost of querying We use multi-resolution modeling, and a query is answered with approximate values accompanied by confidence levels The original temperature data Our modeling of the data at high levels