鉴于无线传感网络关键节点探测算法的研究基础,设计了一种基于历史连接数据预测机会网络关键节点的算法(HDPA)。考虑到节点间连接时长与频率对连通概率的影响,提出了一种连通概率的计算方法。
基于8个网页-相关网页
计算机仿真结果表明，利用该模型算法可以发现拓扑图中关键节点，同时度量值均方差可以准确评估给定连通网络拓扑图的抗毁性能。
The simulation on PC shows that the algorithm can find the critical nodes in topology, and the mean square deviation can evaluate accurately the survivability for a given connected topology.
通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
介绍了系统开发的关键技术：模型简化、节点划分、平面图形截面特性的计算、强度计算的算法及分析结果的输出形式。
The key techniques such as model simplification, node division, section feature calculation, strength calculation method and result output format are introduced.
应用推荐