基于动态分簇路由的网内数据聚集  

In-network Data Aggregation Based on Dynamic Clustering Routing

作　　者：谢双双 管有庆[1] 

机构地区：[1]南京邮电大学物联网学院,江苏南京210003

出　　处：《计算机技术与发展》2018年第1期100-103,共4页Computer Technology and Development

基　　金：江苏省高校自然科学研究计划项目(05KJD520146)

摘　　要：数据聚集是无线传感器网络中的基本操作,聚集感测到的数据并发送到Sink节点。传感器网络存在能量约束,网内数据聚集技术可以减少传输的数据量,有效地节省能量。然而大部分的网内数据聚集都采用先发性(proactive)的路由协议,不能根据事件动态建立数据聚集结构。为解决这个问题,提出一种基于动态分簇路由的网内数据聚集算法(In-network Data Aggregation based on Dynamic-Clustering Routing,IDADCR)。该算法考虑节点与Sink节点距离、节点密度和节点剩余能量三个因素,进行簇头选择,实现簇内数据聚集。引入聚集距离的概念,提出了改进的最短路径树,实现簇间数据聚集。实验结果表明,该算法在动态网络环境中有效地降低了数据传输量,实现了网内数据聚集。Data aggregation is a basic operation in wireless sensor network that the data aggregated is sent to the Sink node. There are en- ergy constraints in sensor networks, and in-network data aggregation techniques can reduce the amount of data transferred and save ener- gy effectively. However, most of the intra-network data aggregation use the pro-active routing protocol, which cannot dynamically build the data aggregation structure based on event. To solve this problem, a data aggregation method based on dynamic-clustering routing, IDADCR,is proposed. Taking into account the distance between node and Sink node, node density and residual energy, it chooses the cluster-head and achieves intra-cluster data aggregation. To achieve inter-cluster data aggregation, an improved shortest path tree is pro- posed by introducing the concept of aggregation distance. Experiment shows that the method can effectively reduce the amount of data transmission and achieve in-network data aggregation in dynamic environment.

关 键 词：无线传感器网络 簇头 聚集距离 最短路径树 网内数据聚集 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]