基于IACO改进Logistic混沌序列的WSN布局优化

WSN Layout Optimization Based on IACO Optimized Logistic Chaotic Sequence

标准PSPIEL算法存在分簇随机问题,引入混沌算子提出Logistic混沌序列算法,提出一种改进蚁群算法(IACO)。将两种方法相结合寻优,提出IACO改进Logistic混沌序列,该方法能够较好地应用于无线传感器网络(Wireless Sensor Networks,WSN)布局中。通过实验对IACO改进Logistic混沌序列有效性进行验证,结果表明,在同样互信息量下相对pSPIEL算法、贪婪算法、IACO算法达到了最低通信成本。应用IACO改进Logistic混沌序列的过程中,传感器实际使用数量减小,能够满足效益要求。该研究对提高无线传感器布局优化能力具有一定的理论指导意义。

The standard PSPIEL algorithm has the problem of clustering randomization.Logistic chaotic sequence algorithm is proposed by in-troducing chaos operator,and an Improved Ant Colony Algorithm(IACO)is proposed.Combining the two methods,the IACO Lo-gistic chaotic sequence optimization method is proposed,which can be applied to the layout of wireless sensor networks.The validi-ty of IACO optimized Logistic chaotic sequence is verified by experiments.The results show that the communication cost is the lowest compared with PSPIEL algorithm,greedy algorithm and IACO algorithm under the same mutual information amount.In the process of using IACO to improve Logistic chaotic sequence,the actual number of sensors is reduced,which can meet the require-ment of efficiency.The research has a certain theoretical significance to improve the wireless sensor layout optimization ability.