用改进蚁群算法求解无线传感器网络多sink节点关联问题

SOLVING PROBLEM OF MULTIPLE SINK NODES ASSOCIATION IN WSN WITH IMPROVED ANT ALGORITHM

在无线传感器网络W SN(wireless sensor networks)中使用多个sink节点既能有效减少传感器节点与sink之间的距离,又能有效降低通信中的能量消耗。如何为传感器节点分配sink节点使得系统总能耗最低,称为多sink节点的关联问题。首先建立带约束的多sink节点关联问题的优化模型,进而用蚂蚁算法解决给定多sink节点部署方案下的普通节点与sink节点间的关联问题,最后给出相关算法的仿真结果。

Using multiple sink nodes in wireless sensor network（WSN） can effectively reduce the distances between sensor nodes and sinks and the energy consumption while communicating.The problem of multiple sink nodes association refers to how to allocate sink nodes for sensors to minimise overall energy of the system.In this paper,we first create an optimised model for restrained WSN multiple sink association problem,and then employ an ant algorithm to solve the association problem between general nodes and sink nodes in given multiple sink nodes disposition scheme.Finally,simulation results are presented with regard to the related algorithm.