This paper investigates the multi-objective problem of deploying wireless sensor networks with cooperative distance-based sensing coverage. This problem considers deploying a number of sensor nodes to cove multiple target points on a deployment area. Based on the locations of target points and the sensor nodes with their own inner and outer coverage radii, the distance-based sensing coverages of target nodes by sensor nodes are divided into three categories: full coverage (i.e., within the inner coverage radius), no coverage (i.e., outside the outer coverage radius), and partial coverage (i.e., between the inner and outer radii). Furthermore, this paper additionally considers the cooperative sensing coverage in which the sensing coverage of a target point is provided by more than one sensor node. The decision of sensor deployment in this paper is to select sensor nodes from potential sensor node positions so as to simultaneously maximize the collective sensing coverage of all target points and minimize the total distances between each target point and the selected sensor node(s). This paper first formulates this problem as a multi-objective optimization model, and then develops a solution procedure to determine the best non-dominated solution set for the problem model. Numerical experiments for the concerned problem by the proposed solution approach are demonstrated.

本文研究了基于协作距离的感应覆盖范围部署无线传感器网络的多目标问题。此问题考虑部署多个传感器节点以在部署区域上覆盖多个目标点。根据目标点的位置以及具有自己的内部和外部覆盖半径的传感器节点，传感器节点对目标节点的基于距离的感应覆盖范围可分为三类：全覆盖（即，在内部覆盖范围内）；没有覆盖（即，在外部覆盖半径之外），并且没有部分覆盖（即，在内半径和外半径之间）。此外，本文还考虑了协作感测范围，其中目标点的感测范围由一个以上的传感器节点提供。本文中传感器部署的决定是从潜在的传感器节点位置中选择传感器节点，以便同时最大化所有目标点的集体感测覆盖范围，并最小化每个目标点与选定传感器节点之间的总距离。本文首先将这个问题表述为一个多目标优化模型，然后开发一种求解过程，以确定问题模型的最佳非支配解集。通过所提出的求解方法，对有关问题进行了数值实验。本文首先将这个问题表述为一个多目标优化模型，然后开发一种求解过程，以确定问题模型的最佳非支配解集。通过所提出的解决方法，对有关问题进行了数值实验。本文首先将这个问题表述为一个多目标优化模型，然后开发一种求解过程，以确定问题模型的最佳非支配解集。通过所提出的求解方法，对有关问题进行了数值实验。