电子学报2017，Vol.45Issue(1)：119-127,9.DOI:10.3969/j.issn.0372-2112.2017.01.017
基于连通支配集的无线传感网Top-k查询最优支撑树研究
Connected Dominating Set Based Support-Tree for Top-k Query in Wireless Sensor Networks
摘要
Abstract
Constructing underlying logic trees can effectively reduce the large communication overhead for centralized top-k query.In this paper,an energy-balanced optimal support-tree is proposed to solve the problem of earlier death for nodes near sink in sensor networks without fixed sink.This method aggregates node energy,degree and communication overhead,and nodes with low energy cost are chosen to be dominating nodes for data processing based on connected dominating set.In each query,nodes take turns to be root by location-based ID,which effectively balances the energy cost.The simulation experiment shows that top-k query based on support-tree outperforms the existing trees by similar query time,but lower average energy cost per round and balanced consumption among all sensor nodes after continuous top-k queries,which effectively prolong the network lifetime.关键词
无线传感器网络/top-k查询/连通支配集/能耗均衡/最优支撑树Key words
wireless sensor networks/top-k query/connected dominating set/energy-balanced/optimal support-tree分类
信息技术与安全科学引用本文复制引用
邬海琴,王良民..基于连通支配集的无线传感网Top-k查询最优支撑树研究[J].电子学报,2017,45(1):119-127,9.基金项目
国家自然科学基金(No.61272074) （No.61272074）
国家自然科学基金海峡基金重点项目(No.U1405255) （No.U1405255）
镇江市工业支撑计划(No.GY2013030) （No.GY2013030）
