A Real-Time Sensor Network Aggregation Computing System

@article{Zhou2018ARS,
  title={A Real-Time Sensor Network Aggregation Computing System},
  author={Yumin Zhou and Peng Wang and Wen Wang},
  journal={2018 5th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2018 4th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)},
  year={2018},
  pages={35-40}
}
  • Yumin ZhouPeng WangWen Wang
  • Published 1 June 2018
  • Computer Science
  • 2018 5th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/2018 4th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)
With the advent of Cloud Era, real-time streaming data processing applications are used more and more widely. As a concrete example, real-time queries on a large number of sensors are highly demanding and needs to be carefully designed. Sensor monitoring analysts are inexperienced on coding techniques in spite of the rapid development of real-time processing platforms and communities. What's more, the state-of-the-art systems lacks support for multi-query processing and sharing of the original… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 12 REFERENCES

On-the-fly sharing for streamed aggregation

A major contribution is the sharing technique that does not require any up-front multiple query optimization, a significant departure from existing techniques that rely on complex static analyses of fixed query workloads.

Discretized Streams: An Efficient and Fault-Tolerant Model for Stream Processing on Large Clusters

D-Streams support a new recovery mechanism that improves efficiency over the traditional replication and upstream backup solutions in streaming databases: parallel recovery of lost state across the cluster.

High-performance complex event processing over streams

This paper proposes a complex event language that significantly extends existing event languages to meet the needs of a range of RFID-enabled monitoring applications and describes a query plan-based approach to efficiently implementing this language.

Continuously adaptive continuous queries over streams

We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance benefits over

Two-Tier Multiple Query Optimization for Sensor Networks

The proposed TTMQO scheme efficiently delivers query results by taking advantage of the broadcast nature of the radio channel and sharing the sensor readings among similar queries over time and space at a finer granularity.

Sharing aggregate computation for distributed queries

This paper identifies a class of linear aggregate functions (including SUM, COUNT and AVERAGE) and shows that the sharing potential for such queries can be optimally recovered using standard matrix decompositions from computational linear algebra, and presents a family of heuristic algorithms that perform well for moderate-sized matrices.

Efficient and extensible algorithms for multi query optimization

This paper proposes three cost-based heuristic algorithms: Volcano-SH and Volcano-RU, which are based on simple modifications to the Volcano search strategy, and a greedy heuristic that incorporates novel optimizations that improve efficiency greatly.

Resource Sharing in Continuous Sliding-Window Aggregates

Energy-aware task assignment for mobile cyber-enabled applications in heterogeneous cloud computing

Optimization of sequence queries in database systems

This paper takes the optimal text search algorithm of Knuth, Morris and Pratt, and generalize it to handle complex queries on sequences, and exploits the inter-dependencies between the elements of a sequential pattern to minimize repeated passes over the same data.