搜索资源列表
ksp
- 改进的Dijkstra寻径算法，用来找到从源点到目的节点的前k条最短路径-improved routing algorithm used to find from source to destination node of the first k Shortest Path
maodv-code
- NS2仿真软件中的代码。MAODV协议中关于节点的文件-node.cc node.h 和元MAODV的节点文件的区别：添加了利用信号强度预测链路稳定性的文字。在文件中有详细注解。该文件用于本人的硕士论文，希望对你有用。-The uploaded files are node.cc and node.h which belong to MAODV route protocol. The difference between this file and traditional node.cc i
Decision
- 节点在给定的蜂窝环境中移动，判断是否发生切换。采用的是Fhmip-Node in a given cellular environment, move, to determine whether there has been switched. Uses a Fhmip
jiedian
- 用数组产生盲节点和信标节点，比循环产生好许多-Produce blind node and beacon node with arrays, produce much better than the cycle
min_hop
- 利用matlab进行节点之间通信的仿真，由于通信距离是由限的，某些节点将作为中间节点进行传输，本次采用最短跳数的方法实现各个节点之间的信息传输，最后给出每个节点的最后剩余的电量。-we simulate the communication bewteen the nodes using the matlab.As the communication capability is limited,some nodes will be transmitted as an intermediate no
ieee14
- 电力系统14节点模型，用于计算电力系统潮流计算-Power System 14 node model, used to calculate the power flow calculation