无线传感器网络中覆盖度和连通度问题的研究

Research of coverage and connectivity problems in wireless sensor networks

对无线传感器网络中的覆盖度和连通度问题进行了研究。传统的求解覆盖度和连通度问题的整数规划算法对于大型的无线传感器网络,其整数规划算法的求解时间复杂度过高,导致算法效率偏低,通过对CCP-WSN的研究,提出了一种新型的求解CCP-WSN的盲覆盖区增强算法,该算法采用启发式的策略,大大降低了求解的时间复杂度,并且能够求出网络的近似最优解,非常适合于分布式应用。

The Coverage and Connectivity Problem （CCP） in Wireless Sensor Networks （WSN） is studied in this paper and a novel algorithm called Break Area Enhanced Algorithm is proposed to solve the CCP. Although Integer Linear Programming （ILP） can also be used to cope with the CCP, it may lead to complex computation efforts in large WSN. Break Area Enhanced Algorithm employs a heuristic strategy which can reduce the computational time greatly. Simulation results show that the Break Area Enhanced Algorithm performs well in large WSN.