基于连通支配集的无线传感网Top-k查询最优支撑树研究

发布时间：2018-02-07 09:16

本文关键词： 无线传感器网络 top-k查询连通支配集能耗均衡最优支撑树　出处：《电子学报》2017年01期 　论文类型：期刊论文

【摘要】：构建底层逻辑树能有效降低集中式top-k查询带来的巨大通信开销,针对现有逻辑树都以固定汇聚节点为根节点,导致其附近节点能耗太大、过早死亡的问题,本文在无固定汇聚节点的网络背景下,基于连通支配集,提出一种能耗均衡的top-k查询最优支撑树构建方法,综合节点能量、度数以及与邻节点通信开销,选取能量代价小的作为支配节点负责查询中间数据处理,在每次查询中,节点基于地理位置ID轮流作为根节点,有效均衡节点的能耗.仿真实验表明,与其他逻辑拓扑树相比,基于最优支撑树的top-k查询具有相近的查询时间,但其平均每轮查询能耗更小,多次查询后各节点能耗达到均衡,有效延长了网络生命周期.
[Abstract]:Constructing the underlying logic tree can effectively reduce the huge communication overhead caused by centralized top-k query. In view of the problem that the existing logic tree takes the fixed convergent node as the root node, the energy consumption of the nodes near it is too large and the nodes die too early. In this paper, based on the connected dominating set, an energy balanced top-k query optimal support tree construction method is proposed to synthesize node energy, degree and communication overhead with adjacent nodes under the background of no fixed convergent nodes. In each query, the node takes turns as the root node based on the geographical location ID, and effectively balances the energy consumption of the node. The simulation results show that, compared with other logical topology trees, the nodes are selected as the dominating nodes to process the intermediate data. The top-k query based on the optimal support tree has similar query time, but its average energy consumption per round query is lower. After multiple queries, the energy consumption of each node reaches equilibrium, which effectively prolongs the network life cycle.
【作者单位】：江苏大学计算机科学与通信工程学院;
【基金】：国家自然科学基金(No.61272074);国家自然科学基金海峡基金重点项目(No.U1405255) 镇江市工业支撑计划(No.GY2013030)
【分类号】：TP212.9;TN929.5

【相似文献】