The k-coverage and m-connected sensor placement problem in target-based wireless sensor networks (WSNs) is assessed here, where all target points must be covered by at least k sensor nodes and all senor nodes must be connected to the sink through at least m separate paths. The potential positions for placing sensor nodes are pre-specified. A new method based on the imperialist competitive algorithm (ICA) is proposed to solve this dual featured problem. The possibility of immigration for colonies from weak to stronger empires is added to the standard ICA. Immigration promotes the ability of the Immigrant imperialist competitive algorithm (IICA) in exploration and prevents the early convergence to local minimums. The mathematical formulation is provided for the immigration process. In simulations, the 2D and 3D environments together with grid and random WSNs are of concern. The main issues of concern here consist of the placed sensor node count and the run time. The experimental results indicate that this proposed method applies less sensor nodes than its counterparts and requires less run time.

在此评估了基于目标的无线传感器网络（WSN）中的k覆盖和m连接的传感器放置问题，其中所有目标点必须至少被k个传感器节点覆盖，并且所有传感器节点必须通过以下位置连接到接收器：至少m不同的路径。预先设置了放置传感器节点的潜在位置。提出了一种基于帝国主义竞争算法（ICA）的新方法来解决这一双重特征问题。标准ICA增加了从弱帝国到强帝国的殖民地移民的可能性。移民提高了移民帝国主义竞争算法（IICA）的探索能力，并阻止了早期收敛到局部极小值。为移民过程提供了数学公式。在仿真中，需要关注2D和3D环境以及网格和随机WSN。这里需要关注的主要问题包括放置的传感器节点数和运行时间。实验结果表明，该方法所应用的传感器节点少于传感器节点，并且所需的运行时间更少。