聚合树是无线传感器网络(WSN)中的一种典型的数据聚合技术.针对多目标约束的Steiner树问题(MCSTP),提出一种基于双层编码机制(TE)和跳跃粒子群优化(JPSO)的启发式算法构建最优树结构.首先,选择总能耗、网络寿命、收敛时间和通信干扰作为优化约束目标.然后,根据提出的双层编码方案对生成树的解进行编码,同时利用跳跃粒子群优化算法寻找帕累托最优解.最后,利用提出的混合适应度函数找出近似最优树结构.实验结果表明,JPSO?TE方法可以产生近似最优的树结构,具有高效性和可行性.
The aggregation tree is a typical data aggregation technology in wireless sensor network (WSN). To solve the multi?constraint optimization Steiner tree problem(MCSTP),a heuristic algorithm based on two?layer encoding(TE)mechanism and jump particle swarm optimization(JPSO)algorithm is proposed to construct the optimal tree structure. The total energy con?sumption,network lifetime,convergence time and communication interference are selected as the optimal constraint targets. And then,the TE scheme is used to encode the solution of spanning tree,and the JPSO algorithm is used to find the Pareto optimal so?lution. The proposed hybrid fitness function is used to find out the approximately?optimal tree structure. The experimental results show that the JPSO?TE method can generate the approximately?optimal tree structure,and has high efficiency and feasibility.