Our popular products have been exported to more than 150 countries and are recognized as a money maker in the mining and minerals industry.
E-MAIL
[email protected]
ADDRESS
Zhengzhou, China
Abstract: An important class of queries over sensor networks are network-wide aggregation queries. In this work we study a class of aggregation queries which we refer to as aggregate threshold queries. The goal of an aggregate threshold query is to continuously monitor the network and give a notification every time an aggregated value crosses a predetermined threshold value.
Mar 10, 2015· Section snippets Sensor networks. We consider a sensor network consisting of n stationary sensor nodes {s 1, s 2,,s n} deployed in a field of interest and a powered base station serving as an access point for users to pose ad hoc queries. As a basic primitive to collect sensing data in WSNs, we use an ad hoc spanning tree, such as TinyDB [21], SNEE [10], and AnduIn [16] as the
Mar 10, 2015· In addition, when the sensing areas of sensor nodes are disjoint, the coordinator of each sensor becomes itself and we perform traditional aggregate query processing. Thus, the problem we are considering is a generalization of the traditional in-network aggregation problem.
Aggregate query processing in sensor networks is an orthogonal topic to our discussion. Quite a few papers from the database community have been addressing techniques and solutions for this topic
we introduce our model of a sensor network, sensor data, and the class of queries that we consider in this paper. We then demonstrate our algorithms to process simple aggregate queries with in-network aggregation (Section 3), and investigate the interaction between the routing layer and the query
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.
Interplay of processing and routing in aggregate query optimization for sensor networks Niki Trigoni Alexandre Guitton Antonios Skordylis Computing Laboratory, University of Oxford, Oxford OX1 3QD, UK Abstract. This paper presents a novel approach to processing continuous aggre-gate queries in sensor networks, which lifts the assumption of tree
routing [4, 26] and in-network query processing [14, 15, 16, 28]. A survey of the applications and the challenges that sensor networks introduce is presented in [10]. For monitoring queries that aggregate the observed values from a group of sensor nodes, [14] suggested the construction of a greedy aggregation tree that seeks to maximize the
gate queries over sensor networks in an energy–efficient manner. From the databases perspective, in–network aggregation provides a mechanism for evaluating aggregate queries over sensor networks. The common approach to (aggre-gate) query processing in sensor networks has two phases: the dissemination phase and the aggregation phase. For
sensor networks is similar to saving and query processing in conventional database. Although infrastructure property and data properties of sensor networks is different with a central database system complementally [1]. We use declarative query in interaction networking. Declarative query playas an interface role. User able
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.
Routing and processing multiple aggregate queries in sensor networks
we introduce our model of a sensor network, sensor data, and the class of queries that we consider in this paper. We then demonstrate our algorithms to process simple aggregate queries with in-network aggregation (Section 3), and investigate the interaction between the routing layer and the 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
routing [4, 26] and in-network query processing [14, 15, 16, 28]. A survey of the applications and the challenges that sensor networks introduce is presented in [10]. For monitoring queries that aggregate the observed values from a group of sensor nodes, [14] suggested the construction of a greedy aggregation tree that seeks to maximize the
A Database Query Processing Model in Peer-To-Peer Network This paper presents an extensive evaluation of database query processing model in peer-to-peer networks using top-k query processing technique and Continue Reading →
