湖南大学学报（自然科学版）2016，Vol.43Issue(10)：134-138,5.
传感器网络中基于抽样的带权近似Top-k查询算法∗
Research on the Approximate Algorithm of Top-k Query Based on Weighted Sampling in Wireless Sensor Network
摘要
Abstract
An approximate algorithm of Top-k query based on sampling and weight in wireless sensor network was presented.The algorithm divides the network into several disj oint clusters in the sink node and the nodes in cluster to take sampling process.In the process of sampling,greater weight for reliable and important sensor node is given.The sensor node sensing data has a time correlation,and sampling threshold filtering in the cluster.Each cluster head node receives a Top-k candidate subset of the cluster, and then sends the subset to the sink node.Finally,the sink node can receive a Top-k sample candidate that represents the whole network.Simulation experiments show that the algorithm only needs to send small data and smaller samples,and can satisfy arbitrary precision requirements.关键词
无线传感器网络/抽样算法/Top-k查询Key words
wireless sensor networks/sampling algorithm/Top-k query分类
信息技术与安全科学引用本文复制引用
刘彩苹,蔡玉武,毛建旭,龙亚辉..传感器网络中基于抽样的带权近似Top-k查询算法∗[J].湖南大学学报（自然科学版）,2016,43(10):134-138,5.基金项目
国家自然科学基金资助项目(61370096,61573134),National Natural Science Foundation of China(61370096,61573134) （61370096,61573134）
国家科技支撑计划资助项目(2015BAF13B00) （2015BAF13B00）
湖南省科技计划资助项目(2012GK3158) （2012GK3158）
