Research on Data Aggregation Algorithms for Top-k Queries in Query-Driven-Based Two-Tiered Sensor Networks

LIANG Jun-bin; MA Xing-po; KUI Xiao-yan

doi:10.3969/j.issn.0372-2112.2014.10.032

您当前的位置：

首页 >

文章列表页 >

Research on Data Aggregation Algorithms for Top-k Queries in Query-Driven-Based Two-Tiered Sensor Networks

更新时间：2025-07-16

- Research on Data Aggregation Algorithms for Top-k Queries in Query-Driven-Based Two-Tiered Sensor Networks
- Acta Electronica Sinica Vol. 42, Issue 10, Pages: 2075-2080(2014)
- 作者机构：
  
  1. 广西大学计算机与电子信息学院,广西,南宁,530004
  2. 信阳师范学院计算机与信息技术学院,河南,信阳,464000
  3. 中南大学信息科学与工程学院,湖南,长沙,410083
  4. 广西大学计算机与电子信息学院,广西,南宁,530004
  5. 信阳师范学院计算机与信息技术学院,河南,信阳,464000
  6. 中南大学信息科学与工程学院,湖南,长沙,410083
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2014.10.032
  CLC： TP301
- Published：2014
- 稿件说明：
移动端阅览
LIANG Jun-bin, MA Xing-po, KUI Xiao-yan. Research on Data Aggregation Algorithms for Top-k Queries in Query-Driven-Based Two-Tiered Sensor Networks[J]. Acta Electronica Sinica, 2014, 42(10): 2075-2080.
DOI：

LIANG Jun-bin, MA Xing-po, KUI Xiao-yan. Research on Data Aggregation Algorithms for Top-k Queries in Query-Driven-Based Two-Tiered Sensor Networks[J]. Acta Electronica Sinica, 2014, 42(10): 2075-2080. DOI： 10.3969/j.issn.0372-2112.2014.10.032.

摘要

在两层传感器网络中

查询驱动模式是将查询请求在下层传感器网络层进行分布式处理的一种查询处理模式.在传感器节点产生数据的频率较高而用户发出查询请求的频率较低的情况下

查询驱动模式能够大大减少数据传输量

降低节点的能量消耗.在这种模式下

如何有效支持局部区域性Top-k查询是一个很有挑战性的问题.针对这一问题

本文首先构造了一种新的数据汇聚树(DAT)

接着在DAT的基础上提出了一种支持区域性Top-k查询的数据汇聚方案.理论分析和仿真实验表明

与已有算法相比

本文提出的方案更加高效.

Abstract

In two-tiered wireless sensor networks

a query-driven mode means that queries are processed in a distributed way at the sensor network level of the tiered architecture.When the data generating rates of the sensor nodes are high and the query frequencies are low

using query-driven mode can deeply shrink the amount of data flow and decrease the energy consumption of the sensor nodes.Under such mode

how to support region-based Top-k queries efficiently is a challenging problem.To solve this problem

firstly

a novel data aggregation tree named DAT is constructed.Then

a novel data aggregation scheme for region-based Top-k queries is proposed based on DAT.Theory analysis and simulation results show that

compared with existing schemes

our proposed scheme performs much better in efficiency.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Top-k Shortest-Path Query on RDF Graphs

Energy-Efficient Top-k Query Techniques Based on Adaptive Filters in Wireless Sensor Networks

An Extended Graph-Planning Based Top-K Service Composition Method

Related Author

ZHANG Deng-yi

WU Wen-li

OUYANG Chu-fei

ZHENG Ji-ping

SONG Bao-li

WANG Hai-xiang

WANG Yong-ge

XU Meng

Related Institution

School of Computer, Wuhan University

College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics

State Key Laboratory for Novel Software Technology, Nanjing University

College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing Jiangsu China

State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China

⁰