Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks.

Slides:

Advertisements

Similar presentations

Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.

Advertisements

On the Node Clone Detection inWireless Sensor Networks.

Toward a Statistical Framework for Source Anonymity in Sensor Networks.

Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.

Abstract Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more.

A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.

Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.

Personalized QoS-Aware Web Service Recommendation and Visualization.

WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.

Crowdsourcing Predictors of Behavioral Outcomes. Abstract Generating models from large data sets—and deter¬mining which subsets of data to mine—is becoming.

Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.

Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.

Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.

A Survey of Mobile Cloud Computing Application Models

NICE :Network Intrusion Detection and Countermeasure Selection in Virtual Network Systems.

Dynamic Resource Allocation Using Virtual Machines for Cloud Computing Environment.

Fast Nearest Neighbor Search with Keywords. Abstract Conventional spatial queries, such as range search and nearest neighbor retrieval, involve only conditions.

Security Evaluation of Pattern Classifiers under Attack.

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.

BestPeer++: A Peer-to-Peer Based Large-Scale Data Processing Platform.

Improving Network I/O Virtualization for Cloud Computing.

Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.

m-Privacy for Collaborative Data Publishing

EAACK—A Secure Intrusion-Detection System for MANETs

A Fast Clustering-Based Feature Subset Selection Algorithm for High- Dimensional Data.

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.

Optimal Client-Server Assignment for Internet Distributed Systems.

Protecting Sensitive Labels in Social Network Data Anonymization.

Identity-Based Secure Distributed Data Storage Schemes.

Hiding in the Mobile Crowd: Location Privacy through Collaboration.

LARS*: An Efficient and Scalable Location-Aware Recommender System.

Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.

Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.

Content Sharing over Smartphone-Based Delay- Tolerant Networks.

Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.

Privacy Preserving Delegated Access Control in Public Clouds.

Anomaly Detection via Online Over-Sampling Principal Component Analysis.

A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia.

Keyword Query Routing.

Document Clustering for Forensic Analysis: An Approach for Improving Computer Inspection.

A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.

Abstract With the advent of cloud computing, data owners are motivated to outsource their complex data management systems from local sites to the commercial.

Facilitating Document Annotation using Content and Querying Value.

Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks.

Privacy Preserving Back- Propagation Neural Network Learning Made Practical with Cloud Computing.

Clustering Sentence-Level Text Using a Novel Fuzzy Relational Clustering Algorithm.

Participatory Privacy: Enabling Privacy in Participatory Sensing

Preventing Private Information Inference Attacks on Social Networks.

Video Dissemination over Hybrid Cellular and Ad Hoc Networks.

Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.

DCIM: Distributed Cache Invalidation Method for Maintaining Cache Consistency in Wireless Mobile Networks.

Supporting Privacy Protection in Personalized Web Search.

Twitsper: Tweeting Privately. Abstract Although online social networks provide some form of privacy controls to protect a user's shared content from other.

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power.

m-Privacy for Collaborative Data Publishing

A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization Using MapReduce on Cloud.

A New Algorithm for Inferring User Search Goals with Feedback Sessions.

Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

Privacy-Enhanced Web Service Composition. Abstract Data as a Service (DaaS) builds on service-oriented technologies to enable fast access to data resources.

Privacy-Preserving and Content-Protecting Location Based Queries.

Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud.

Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.

Load Rebalancing for Distributed File Systems in Clouds.

Facilitating Document Annotation Using Content and Querying Value.

Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.

Dynamic Query Forms for Database Queries. Abstract Modern scientific databases and web databases maintain large and heterogeneous data. These real-world.

Spatial Approximate String Search. Abstract This work deals with the approximate string search in large spatial databases. Specifically, we investigate.

Presentation transcript:

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks

Abstract In this paper, we introduce the notion of sufficient set and necessary set for distributed processing of probabilistic top-fc queries in cluster-based wireless sensor networks. These two concepts have very nice properties that can facilitate localized data pruning in clusters. Accordingly, we develop a suite of algorithms, namely, sufficient set-based (SSB), necessary set- based (NSB), and boundary-based (BB), for intercluster query processing with bounded rounds of communications. Moreover, in responding to dynamic changes of data distribution in the network, we develop an adaptive algorithm that dynamically switches among the three proposed algorithms to minimize the transmission cost.

Abstract con… We show the applicability of sufficient set and necessary set to wireless sensor networks with both two-tier hierarchical and tree-structured network topologies. Experimental results show that the proposed algorithms reduce data transmissions significantly and incur only small constant rounds of data communications. The experimental results also demonstrate the superiority of the adaptive algorithm, which achieves a near-optimal performance under various conditions.

Existing system Wireless sensor networks are revolutionizing the ways to collect and use information from the physical world. This new technology has resulted in significant impacts on a wide array of applications in various fields, including military, science, industry, commerce, transporta¬tion, and health-care. However, the quality of sensors varies significantly in terms of their sensing precision, accuracy, tolerance to hardware/external noise, and so on. For example, studies show that the distribution of noise varies widely in different photovoltic sensors [1], precision and accuracy of readings usually vary significantly in humidity sensors [2], and the errors in GPS devices can be up to several meters [3]. Thus, sensor readings are inherently uncertain [4], [5], [6].

Architecture Diagram

System specification HARDWARE REQUIREMENTS Processor : intel Pentium IV Ram : 512 MB Hard Disk : 80 GB HDD SOFTWARE REQUIREMENTS Operating System : windows XP / Windows 7 FrontEnd : Java BackEnd : MySQL 5

CONCLUSION In this paper, we propose the notion of sufficient set and necessary set for efficient in-network pruning of distributed uncertain data in probabilistic top-k query processing. Accordingly, we systematically derive sufficient and neces¬sary boundaries and propose a suite of algorithms, namely SSB, NSB, and BB algorithms, for in-network processing of PT-Topk queries. Additionally, we derive a cost model on communication cost of the three proposed algorithms and propose a cost-based adaptive algorithm that adapts to the application dynamics. Although our work in this paper is based mainly under the setting of two-tier hierarchical network, the concepts of sufficient set and necessary set are universal and can be easily extend to a network with tree topology. The performance evaluation validates our ideas and shows that the proposed algorithms reduce data transmissions significantly. While focusing on PT-Topk query in this paper, the developed concepts can be applied to other top-k query variants. We plan to develop algorithms to support other probabilistic top-k queries in the future.

THANK YOU