基于Dijkstra算法的最小暴露路径的求解

On the Solution to Minimal Exposure Path Based on Dijkstra Algorithm

研究了无线传感器网络最小暴露路径的问题。针对节点数量较多,基于节点协作覆盖模型,利用Dijkstra算法求解最小暴露路径,可较快较好地找到最优化的路线,灵活性及适应性好,空间及事件的复杂度均有所提高;仿真结果验证了该方法的有效性。

The minimum exposure path of wireless sensor networks is researched. For a large number of nodes, with Dijkstra algorithm, this research solves the minimum exposure path based on node cooperation mode to achieve the optimal, flexible and adaptive circuit. The space complexity and incident complexity have also been raised. Simulation results show the validity of the algorithm.