Landmark-Based Information Storage and Retrieval in Sensor Networks Qing Fang Department of Electrical Engineering, Stanford University Jie Gao Department.

Slides:

Advertisements

Similar presentations

Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.

Advertisements

Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting Stephan Olariu Department.

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

An Energy-Efﬁcient Communication Scheme in Wireless Cable Sensor Networks Xiao Chen Neil C. Rowe epartment of Computer Science Department of Computer Science.

1 Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table Sylvia Ratnasamy, Scott Shenker, Brad Karp, Ramesh Govindan, Deborah Estrin, Li.

TASC: Topology Adaptive Spatial Clustering for Sensor Networks Reino Virrankoski, Dimitrios Lymberopoulos and Andreas Savvides Embedded Networks and Application.

Rumor Routing in Sensor Networks David Braginsky and Deborah Estrin Presented By Tu Tran 1.

An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks Zhen Jiang Computer Science Department West Chester University.

Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks Jaehoon Jeong, Taehyun Hwang, Tian He, and David Du Department of Computer.

Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.

1 Data-Centric Storage in Sensornets Sylvia Ratnasamy, Scott Shenker, Brad Karp, Ramesh Govindan, Deborah Estrin ICSI/UCB/USC/UCLA Presenter: Vijay Sundaram.

Yashar Ganjali, and Abtin Keshavarzian Presented by: Isaac Keslassy Computer Systems Laboratory Department of Electrical Engineering Stanford University.

Globecom 2004 Energy-Efficient Self-Organization for Wireless Sensor Networks: A Fully Distributed approach Liang Zhao, Xiang Hong, Qilian Liang Department.

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

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

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

1 Load Balance and Efficient Hierarchical Data-Centric Storage in Sensor Networks Yao Zhao, List Lab, Northwestern Univ Yan Chen, List Lab, Northwestern.

Range Queries in Distributed Networks Jie Gao Stony Brook University Dagstuhl Seminar, March 14 th,

Ad hoc and Sensor Networks Routing protocols (Part II)

Symmetric Replication in Structured Peer-to-Peer Systems Ali Ghodsi, Luc Onana Alima, Seif Haridi.

An adaptive framework of multiple schemes for event and query distribution in wireless sensor networks Vincent Tam, Keng-Teck Ma, and King-Shan Lui IEEE.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)

LPT for Data Aggregation in Wireless Sensor Networks Marc Lee and Vincent W.S. Wong Department of Electrical and Computer Engineering, University of British.

Mobility Limited Flip-Based Sensor Networks Deployment Reporter: Po-Chung Shih Computer Science and Information Engineering Department Fu-Jen Catholic.

Miao Zhao, Ming Ma and Yuanyuan Yang

College of Engineering Non-uniform Grid- based Coordinated Routing Priyanka Kadiyala Major Advisor: Dr. Robert Akl Department of Computer Science and Engineering.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

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.

Benjamin AraiUniversity of California, Riverside Reliable Hierarchical Data Storage in Sensor Networks Song Lin – Benjamin.

RoamHBA ： Maintaining Group Connectivity In Sensor Networks Qing Fang Jie Liu Leonidas Guibas Feng Zhao Department of Electrical Engineering, Stanford.

Xiaobing Wu, Guihai Chen

WEAR: A Balanced, Fault-Tolerant, Energy-Aware Routing Protocol for Wireless Sensor Networks Kewei Sha, Junzhao Du, and Weisong Shi Wayne State University.

/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.

Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks

1 Shape Segmentation and Applications in Sensor Networks Xianjin Xhu, Rik Sarkar, Jie Gao Department of CS, Stony Brook University INFOCOM 2007.

Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.

1 Probabilistic Coverage in Wireless Sensor Networks Nadeem Ahmed, Salil S. Kanhere and Sanjay Jha Computer Science and Engineering, University of New.

Bounded relay hop mobile data gathering in wireless sensor networks

A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.

Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.

Topological Hole Detection in Wireless Sensor Networks and its Applications Stefan Funke Department of Computer Science, Stanford University, U.S.A. DIAL-M-POMC.

Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks.

Iso-Contour Queries and Gradient Descent with Guaranteed Delivery in Sensor Networks Rik Sarkar, Xianjin Zhu, Jie Gao, Joseph S. B. Micchell, Leonidas.

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.

GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Qing Fang, Jie Gao, Leonidas J. Guibas, Vin de Silva, Li Zhang Department of Electrical.

A Dynamic Query-tree Energy Balancing Protocol for Sensor Networks H. Yang, F. Ye, and B. Sikdar Department of Electrical, Computer and systems Engineering.

Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.

Title Authors Introduction Text, text, text, text, text, text Background Information Text, text, text, text, text, text Observations Text, text, text,

An Adaptive Zone-based Storage Architecture for Wireless Sensor Networks Thang Nam Le, Dong Xuan and *Wei Yu Department of Computer Science and Engineering,

Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †

A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks Wen-Tsuen Chen Department of Computer Science National Tsing Hua University Po-Yu.

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.

Query-based wireless sensor storage management for real time applications Ravinder Tamishetty, Lek Heng Ngoh, and Pung Hung Keng Proceedings of the 2006.

Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime Z. Maria Wang, Emanuel Melachrinoudis Department of Mechanical and Industrial Engineering.

Attribute Allocation in Large Scale Sensor Networks Ratnabali Biswas, Kaushik Chowdhury, and Dharma P. Agrawal International Workshop on Data Management.

EASE: An Energy-Efficient In-Network Storage Scheme for Object Tracking in Sensor Networks Jianliang Xu Department of Computer Science Hong Kong Baptist.

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)

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Junchao Ma +, Wei Lou +, Yanwei Wu *, Xiang-Yang Li *, and Guihai Chen & Energy Efficient TDMA Sleep Scheduling in Wireless Sensor Networks + Department.

Communication Scheme for Loosely Coupled Mobile User Groups in Wireless Sensor Fields Euisin Lee, Soochang Park, Fucai Yu, Min-Sook Jin, and Sang-Ha Kim.

/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio.

1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.

A Spatial-based Multi-resolution Data Dissemination Scheme for Wireless Sensor Networks Jian Chen, Udo Pooch Department of Computer Science Texas A&M University.

Scalable and Distributed GPS free positioning for Sensor Networks Rajagopal Iyengear and Biplab Sikdar IEEE International Conference on Communications.

Efficient Route Update Protocol for Wireless Sensor Networks Xuhui Hu, Yong Liu, Myung J. Lee, Tarek N. Saadawi City University of New York, City College.

Shape Segmentation and Applications in Sensor Networks

Department of Computer Science University of York

Presentation transcript:

Landmark-Based Information Storage and Retrieval in Sensor Networks Qing Fang Department of Electrical Engineering, Stanford University Jie Gao Department of Computer Science, Stony Brook University Leonidas J. Guibas Department of Computer Science, Stanford University INFOCOM 2006

Outline Introduction Related Work Landmark-Based Data Centric Simulation Conclusion

Background sink

Background sink

Background sink

Geographical Hash Table (GHT) lion

Disadvantage of GHT No distance-sensitive producer lion consumer

Disadvantage of GHT No distance-sensitive Communication bottleneck

Disadvantage of GHT No distance-sensitive Communication bottleneck Bad for queries the cross-type data

GHT with Structured Replication quad-tree d = = 4 d = = 16

GHT with Structured Replication d = 1

Related Work Title – GLIDER: Gradient Landmark-Based Distributed Routing for Sensor Networks Author – Qing Fang, Jie Gao, Leonidas J. Guibas, Vin de Silva From – INFOCOM 2005

GLIDER a b c t s d

Overview producer h consumer T1T1 T2T2 T3T3 T4T4 replication path retrieval path

Replication Path producer h LaLa LcLc LdLd a LeLe LfLf b LgLg c consumer No distance-sensitive LbLb

Distance-sensitive

Optimal Principle a → b → c → d → e → f → g c → d → e → f → g

Optimal Principle producer h LaLa LcLc LeLe LfLf LgLg consumer LbLb LdLd

Finger Tree producer h LaLa LcLc LeLe LfLf LgLg consumer LbLb LdLd

Finger Tree LaLa LcLc LeLe LfLf LgLg LbLb LdLd s

Replication Path producer h LaLa LbLb LcLc LeLe LfLf LgLg a consumer LdLd

Replication Path producer 1 h LaLa LbLb LcLc LeLe LfLf LgLg a producer 2 LdLd

Simulation Network Enviroments – 316m × 316m sensing field – 2000 nodes – 11m communication range – 6.2 degrees – 23 landmarks – Simulated with C++

Simulation Data structure and storage requirement – The landmarks – Neighborhood distances to its reference landmarks – The hash function – A bit to record it’s on boundary or not – The IDs of its neighboring sensors

Simulation Compare producer cost with GHT

Simulation Compare consumer cost with GHT

Simulation Retrieval Path Length GHT100% Landmark-based70.2%

Simulation Load distribution of landmark-based Load distribution of GHT

Conclusion A location-free, landmark-based information brokerage scheme for sensor networks – Distance-sensitive – Load-balanced

Thank You !