搜索资源列表
-
0下载：
Routing in WSN as an Optimization Problem
Routing in Wireless sensor networks can be viewed as an optimization problem in which there is a need to find the optimal path (which is not necessarily the shortest one) in terms of some parameters like
-
-
0下载：
链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to
-
-
0下载：
dijkstra最短路径寻径算法之邻接表加堆排序的优化方法-adjacent table and heap sort Dijkstra shortest path routing algorithm optimization method
-
-
0下载：
在图中求两点间的最短路径，用弗洛伊德算法实现，包括图的类定义-In the figure, the shortest path between two points, with the Floyd algorithm, including the definition of the class diagram
-
-
0下载：
就网络层中的路由选择算法进行了归纳和总结 ,并使用JAVA语言编写出最短通路路由选择算法的具体程序。
-On network layer routing algorithms and summarized, and the use of JAVA language shortest path routing algorithm specific procedures.
-
-
0下载：
一个本地路由选择算法，用地杰斯特拉算法构建，实现最短路径选择-A local routing algorithm, land Jess Tel algorithm to construct, the shortest path selection, etc.
-
