论文部分内容阅读
传感器节点的部署包括连通网络和非连通网络2种情况.为了最小化网络部署开销,对非连通网络的传感器节点部署问题进行了研究,建立了整数线性规划模型,并证明该问题为NP-complete问题.为找到该问题的近似最优解,通过理论分析确定了传感器节点的候选部署区域,提出了一种启发式的传感器节点贪婪部署算法,迭代地将传感器节点部署到覆盖目标点数最多的候选部署区域,直到覆盖所有目标点.通过仿真实验将所提出的贪婪部署算法和现有的遗传算法以及问题模型的最优解进行了比较,验证了算法的有效性.
In order to minimize the network deployment overhead, sensor node deployment in non-connected networks is studied, an integer linear programming model is established, and the problem is proved to be NP-complete Problem.In order to find the approximate optimal solution to the problem, the candidate deployment regions of sensor nodes are determined theoretically and a heuristic sensor node greedy deployment algorithm is proposed, which iteratively deploys the sensor nodes to the candidate with the most coverage points The region is deployed until all the target points are covered.A simulation experiment is carried out to compare the proposed greedy deployment algorithm with the existing genetic algorithm and the optimal solution of the problem model to verify the effectiveness of the algorithm.