Processing Approximate Aggregate Queries In Wireless Sensor Networks

  • Processing approximate aggregate queries in wireless

    Processing approximate aggregate queries in wireless sensor networks for approximate in-network data aggregation, combined with the model of TAG,with the latter being used in order to coalesce messages within the aggregation tree. J. GehrkeThe Cougar approach to in-network query processing in sensor networks.

  • Cited by: 56
  • Processing approximate aggregate queries in wireless

    Request PDF Processing approximate aggregate queries in wireless sensor networks Abstract In-network data aggregation has been recently proposed as an eective,means to reduce the number of

  • Processing Approximate Aggregate Queries in Wireless

    CiteSeerX Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): In-network data aggregation has been recently proposed as an e#ective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an aggregation tree, in which parent nodes aggregate the values received from their children and propagate the result to their own

  • Processing approximate aggregate queries in wireless

    Information Systems 31 (2006) 770–792 Processing approximate aggregate queries in wireless sensor networks$ Antonios Deligiannakisa, Yannis Kotidisb,, Nick Roussopoulosa aUniversity of Maryland, USA bDepartment of Information Systems and Analysis, AT&T Labs-Research, P.O. Box 971, Florham Park, NI 07932-0971, USA Received 5 February 2004; received in revised form 1 February

  • Processing approximate aggregate queries in wireless

    Processing approximate aggregate queries in wireless sensor networks. Authors: Antonios Deligiannakis: University of Maryland: Yannis Kotidis: Departrnent of Information Systems and Analysis, AT&T Labs-Research, NI: Nick Roussopoulos: University of Maryland: Published in: · Journal:

  • Cited by: 56
  • Processing approximate aggregate queries in wireless

    Dec 01, 2006· Processing approximate aggregate queries in wireless sensor networks Deligiannakis, Antonios; Kotidis, Yannis; Roussopoulos, Nick 2006-12-01 00:00:00 In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an aggregation tree

  • Processing Precision-Constrained Approximate Queries in

    one-shot approximate queries for wireless sensor networks. Other inspiring work includes querying approximate data over distributed caches and streams. Olston et al. [13] studied error-bounded aggregate queries over distributed data streams. An adaptive scheme for precision adjustment at each individual source was proposed to reduce the com

  • Processing approximate aggregate queries in wireless

    Home Browse by Title Periodicals Information Systems Vol. 31, No. 8 Processing approximate aggregate queries in wireless sensor networks article Processing approximate aggregate queries in wireless sensor networks

  • (PDF) Aggregate Queries in Wireless Sensor Networks

    In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation (BPA).

  • Processing Approximate Aggregate Queries in Wireless

    Processing Approximate Aggregate Queries in Wireless Sensor Networks . By Antonios Deligiannakis, Yannis Kotidis and Nick Roussopoulos. Abstract. In-network data aggregation has been recently proposed as an e#ective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an aggregation tree, in

  • Processing Approximate Aggregate Queries in Wireless

    Processing Approximate Aggregate Queries in Wireless Sensor Networks . By Antonios Deligiannakis, Yannis Kotidis and Nick Roussopoulos. Abstract. In-network data aggregation has been recently proposed as an e#ective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an aggregation tree, in

  • CiteSeerX — Approximate monitoring in wireless sensor networks

    CiteSeerX Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): In this paper, we develop an energy efficient approach to processing continuous aggregate queries in sensor networks with bounded quality constraints. Specifically, we exploit quality-aware in-network aggregation of query information to reduce communication costs.

  • Robust and Efficient Aggregate Query Processing in

    Wireless sensor networks have been widely used in many applications, such as soil temperature monitoring for plant growth and abnormal event detection of industrial parameters. Among these applications, aggregate queries, such as SUM, COUNT, AVERAGE, MIN and MAX are often used to collect statistical data.

  • Approximate Monitoring in Wireless Sensor Networks

    to processing continuousaggregatequeriesin sensornet-works with bounded quality constraints. Specifically, we exploitquality-awarein-networkaggregationof queryin-formation to reduce communication costs. Given clus-ter structures over sensor nodes, we develop an adap-tive approximate data processing protocol to aggregate

  • Approximate in Wireless Sensor

    Approximate Querying in Wireless Sensor Networks Yuzhen Liu WeifaLiang Department ofComputer Science Australian National University Canberra, ACT0200, Australia Abstract-In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly

  • Aggregate query processing in the presence of duplicates

    A wireless sensor network (WSN) consists of spatially distributed autonomous devices with various sensors, and a powered base station which serves as an access point for users to pose ad hoc queries. Wireless sensor networks have a broad range of applications, such as environment and habitat monitoring that collects meteorological data (e.g

  • A Privacy-Preserving Location Monitoring System for

    This paper proposes a privacy-preserving location monitoring system for wireless sensor networks to pro-vide monitoring services. Our system relies on the well established k-anonymity privacy concept, which requires each person is indistinguishable among k persons. In our system, each sensor node blurs its sensing area into a

  • aggregate query processing sensor networks

    Aggregate query processing in the presence of duplicates in wireless sensor networks. L. Chen, Max regional aggregate over sensor networks, in: Cited by: 5; Processing approximate aggregate queries in wireless Processing approximate aggregate queries in wireless in the evaluation of the aggregate query at the to in-network

  • Processing approximate aggregate queries in wireless

    Processing approximate aggregate queries in wireless sensor networks [An article from: Information Systems] [A. Deligiannakis, Y. Kotidis, N. Roussopoulos] on Amazon. *FREE* shipping on qualifying offers. This digital document is a journal article from Information Systems, published by Elsevier in 2006. The article is delivered in HTML format and is available in your

  • Author: A. Deligiannakis,Y. Kotidis,N. Roussopoulos
  • aggregate query processing in wireless sensor network

    aggregate query processing in wireless sensor network. Aggregate Location Monitoring for Wireless Sensor 2009-3-5 components, wireless sensor network and aggregate query processor A third major component that is not shown in the figure is a resource-efficient sensor scheduler that is responsible on tuning a trade-off between energy and bandwidth consumption of the wireless sensor network

  • Maximum Lifetime Continuous Query Processing in

    In wireless sensor networks, the notion of in–network processing was first introduced by In- tanagonwiwat et al [18] to opportunistically eliminate duplicates in the context of directed diffusion. Gehrke and Madden et al [11, 15, 24] are among the first to integrate query processing and sensor

  • Accuracy Vs. Lifetime: Linear Sketches for Approximate

    1.1 Query Processing in Sensor Networks From the database perspective, in{network aggregation is a mode for evaluating aggregate queries over the sensor net-work. The common approach to (aggregate) query process-ing in sensor networks has two phases: the dissemination phase and the aggregation phase. For example consider a

  • aggregate quarry processing sensor networks

    The Design of an Acquisitional Query Processor For Sensor Networks ∗ tend to view query processing in sensor networks simply as a power-constrained version of traditional query processing given some join, project, and aggregate data), but, as we will discuss in this paper, also incorporates a number of other features designed to . Get Price

  • Data Aggregation and Query Processing in WSN

    Data Aggregation and Query Processing in WSN Ayoni Mukherjee,Sanjit Setua Abstract A wireless sensor network (WSN) has a wide range of important applications such as remote environment monitoring,target tracking etc. This has been enabled by the availability of sensors that are smaller, cheaper and intelligent.

  • Approximate Querying in Wireless Sensor Networks

    In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly optimal representative routing trees for query evaluation, where a representative routing tree is such a tree rooted at the base station that each node in it represents a set of non-tree nodes by holding their historical

  • Assembling Regions for Efficacious Aggregate Query

    Assembling Regions for Efficacious Aggregate Query Processing in Wireless Sensor Networks by Apostolos Fertis Diploma, Electrical and Computer Engineering (2003) National Technical University of Athens Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements of

  • Optimizing query processing using selectivity-awareness in

    2.1. In-network data aggregation. In-network data aggregation was one of the first data collection optimization approaches proposed for WSNs (Bonfils and Bonnet, 2003, Considine, 2004, Madden et al., 2002, Nath et al., 2004).In-network aggregation algorithms exploit the fact that a sensor node consumes less energy for information processing than for information

  • In Network Aggregation with Grouped Queries in multi-hop

    This project is about supporting aggregate queries in wireless sensor networks. Aggregate queries are queries of type MAX, MIN, AVG and SUM. The wireless sensor network here refers to a set of sensor nodes forming a multi-hop wireless network. In a multi-hop wireless network, each node is able to communicate with a subset of other nodes which

  • A Privacy-Preserving Location Monitoring System for

    This paper proposes a privacy-preserving location monitoring system for wireless sensor networks to pro-vide monitoring services. Our system relies on the well established k-anonymity privacy concept, which requires each person is indistinguishable among k persons. In our system, each sensor node blurs its sensing area into a

  • Approximate in Wireless Sensor

    Approximate Querying in Wireless Sensor Networks Yuzhen Liu WeifaLiang Department ofComputer Science Australian National University Canberra, ACT0200, Australia Abstract-In this paper, we study the maximization problem of network lifetime for answering a sequence of aggregate queries based on snapshot data. We build a series of nearly

  • Efficient Aggregation Processing in the Presence of

    Wireless sensor networks (WSNs) have received increasing attention in the past decades. Owing to an enhancement of MEMS technology, various types of sensors such as motion detectors, infrared radiation detectors, ultrasonic sensors (sonar), and magnetometers can detect the objects within a certain range. Under such an environment, an object without an identifier

  • Query Processing for Sensor Networks

    3 Simple Aggregate Query Processing A simple aggregate query is an aggregate query without Group By and Having clauses, a very popular class of queries in sensor networks [21]. In this section we outline how to process such simple aggregate queries. Query processing strategies for more general queries are discussed in Section 5. 3.1 In-Network

  • A Study of Approximate Data Management Techniques for

    A Study of Approximate Data Management Techniques for Sensor Networks hence directly influencing the storage management strategy of the sensor network. 2 Approximate Processing of Aggregate Queries Thissection focuses on techniques for processingapproximate aggregatequeries in sensor networks. An aggregate query may use a standard

  • Cost-Efficient Processing of Min/Max Queries over

    The rapid development in micro-sensors and wireless networks has made large-scale sensor networks possible. However, the wide de-ployment of such systems is still hindered by their limited energy which quickly runs out in case of massive communication. In this paper, we study the cost-efficient processing of aggregate queries

  • Poster Abstract: Routing and Processing Multiple Aggregate

    Poster Abstract: Routing and Processing Multiple Aggregate Queries in Sensor Networks Niki Trigoni Alexandre Guitton Antonios Skordylis Birkbeck College, University of London, London WC1E 7HX, United Kingdom fniki,alexandre,[email protected] Abstract We present a novel approach to processing continuous aggregate queries in sensor networks

  • Robust and Efficient Aggregate Query Processing in

    Wireless sensor networks have been widely used in many applications, such as soil temperature monitoring for plant growth and abnormal event detection of industrial parameters. Among these applications, aggregate queries, such as SUM, COUNT, AVERAGE, MIN and MAX are often used to collect statistical data. Due to the low quality sensing devices or random environmental disturbances, sensor

  • IJA: An Efficient Algorithm for Query Processing in Sensor

    Sensor nodes are generally highly constrained, in particular regarding their energy and memory resources. While simple queries such as SELECT and AGGREGATE queries in wireless sensor networks have been addressed in the literature, the processing of join queries in sensor networks remain to be investigated.

  • Tracking Wildfires Electrical and Computer Engineering

    A research team from Carnegie Mellon University has received the Best Paper Award at the 19th ACM/IEEE Conference on Information Processing in Sensor Networks (IPSN) in recognition of their work "Quick (and Dirty) Aggregate Queries on LP-WANs" (QuAiL).. The paper was authored by Akshay Gadre, a Ph.D. student in electrical and computer engineering, summer