EACT

In order to solve the problem of inappropriate cluster head election and excessive long transmission distance, EACT ( Energy-Aware Cluster-Tree) algorithm is proposed to organize the cluster tree backbone network.

针对已有分簇算法中簇头选择不合理及传输距离过长的缺陷，提出了用于构建分布式簇树骨干网的EACT算法。

Based on root tree and Maximal Weighted Independent Set, EACT utilizes periodical rotation of cluster heads to balance the energy consumed by nodes.

算法引入了图论中极大权极大独立集和根树的概念，并借助簇头轮换机制均衡节点消耗。

Based on root tree and Maximal Weighted Independent Set, we propose the EACT ( Energy-Aware Clustering Tree) algorithm and the maintenance and update algorithm of the cluster tree backbone network.

文中利用图论中极大权独立集和根树的概念给出一种求簇树骨干网的EACT算法及对该骨干网的维护和更新算法。

The structure and morphological feature of EACT were analyzed using SEM, TGA, XRD and FTIR. The results show that the modified chitosan is more stable and has internal porous structure, enhancing the adsorption performance.

采用SEM、TGA、XRD、FTIR等对EACT进行了结构和形貌分析，结果表明：改性后的壳聚糖性质更稳定，其内部大量的孔洞和褶皱增强了其吸附性能。