基于节点度-限制的数据融合树构建算法

在无线传感网络部分应用中,数据传输必须在指定时延约束下完成.因此,最小化网络时延和最大化网络寿命成为无线传感网络的研究热点.为此,提出基于节点度-限制的数据融合树构建DC-DATC(Degree-Constrained-Based Data Aggregation Tree Constructing)算法.DC-DATC算法减少了高节点度对数据融合时延的影响.依据预设的节点度阈值,只有节点度小于阈值的节点才能加入数据融合树.利用数据融合树传输数据,降低了数据传输量,提高了能量利用率.实验结果表明,DC-DATC算法降低了融合时延,且平衡了网络能耗,最终实现了网络寿命的扩延.

Degree-Constrained-based data aggregation tree constructing algorithm in Wireless sensor Networks

In Wireless sensor networks( WSNs) ,data aggregation must be performed within a specified latency con-straint. Therefore,minimizing network delay and maximizing sensor( node) lifetime are important challenges. Degree-Constrained-based data aggregation tree constructing( DC-DATC) algorithm is proposed in this paper. DC-DATC al-gorithm reduces the effect of high degree nodes on the data aggregation delay. Given a predefined degree threshold, a data aggregation tree where the number of child nodes of each node is not greater than the threshold is construc-ted. The data are transmitted through tree. DC-DATC algorithm reduce traffic,and improve the energy efficiency. The simulation results show that DC-DATC algorithm outperforms other distributed schemes in terms of data aggre-gation delay.