| 基于Dijkstra算法的最小暴露路径的求解 |
| |
| 引用本文： | 居金娟,姚弘.基于Dijkstra算法的最小暴露路径的求解[J].南通职业大学学报,2009,23(2):86-88. |
| |
| 作者姓名： | 居金娟 姚弘 |
| |
| 作者单位： | 南通职业大学,电子工程系,江苏,南通,226007 |
| |
| 摘 要： | 研究了无线传感器网络最小暴露路径的问题。针对节点数量较多,基于节点协作覆盖模型,利用Dijkstra算法求解最小暴露路径,可较快较好地找到最优化的路线,灵活性及适应性好,空间及事件的复杂度均有所提高;仿真结果验证了该方法的有效性。
|
| 关 键 词： | 无线传感器网络 最小暴露路径 Dijkstra算法 |
On the Solution to Minimal Exposure Path Based on Dijkstra Algorithm |
| |
| JU Jin-juan,YAO Hong.On the Solution to Minimal Exposure Path Based on Dijkstra Algorithm[J].Journal of Nantong Vocational College,2009,23(2):86-88. |
| |
| Authors: | JU Jin-juan YAO Hong |
| |
| Institution: | Department of Electronic Engineering;Nantong Vocational College;Nantong 226007;China |
| |
| Abstract: | 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. |
| |
| Keywords: | wireless sensor networks minimal exposure path Dijkstra algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
