搜索资源列表
ICONIP97
- GAR算法ppt An Intelligent Network Routing Algorithm by a Genetic Algorithm
Tinyos_Route_LEPSM.rar
- 基于tinyos操作系统的路由算法，是crossbow自带的算法，该文档说明了LEPS算法的工作流程，是一个程序说明文件。,Tinyos-based operating system routing algorithm, the algorithm is self-crossbow, the LEPS document describes the work flow algorithm is a procedure documentation.
OLSR
- 分析研究AODV协议本地修复算法的特点，并对其进行改进，形成了改进的AODV路由协议本地修复算法-A new idea about local repair is used to improve the AODV and formed the Improved AODV algorithm.Otherwise，a new approach is proposed for flooding limit.The approach is implemented by using cross-layer
search
- 在opnet中用于实现吴伟超立方体的路径选择算法-The opnet used to achieve Bambi cube routing algorithm
vrp
- 进化算法及其在全局优化和VRP中的应用的毕业论文-Evolutionary Algorithm and Its Application in GlobalOptimization and Vehicle Routing Problem
13
- construct optimal diameter network and d parftition routing algorithm
Routing-Algorithms-for-Wireless-Sensor-Networks.r
- routing algorithm for sensor network
Cluster-based-Routing-Algorithm
- 在低压电力线中运用分簇路由算法对网络进行网络重构-The use of clustering routing algorithm for network reconfiguration of the network in the low-voltage power line
Routing-search-algorithm
- 提出一种改进的蚁群路由算法来提高抄表的效率-An improved ant colony routing algorithm to improve the efficiency of meter reading
Routing-algorithm
- 提出了一种新的基于节点相关度的动态网络分簇算法-Proposed a new clustering algorithm based on dynamic network of the node degrees
multicast-routing-
- this a fiel about Genetic algorithm and travelling solesman (TSP) problems. I wish that this paper will be useful for every body.-this is a fiel about Genetic algorithm and travelling solesman (TSP) problems. I wish that this paper will be useful for
1-s2.0-S1877705812001245-main
- A QoS Routing Algorithm Based on Ant Colony Optimization and Mobile Agent
01544163
- A Power-Saving Routing Algorithm Based on Ant Algorithm in Mobile Ad hoc Networks -A Power-Saving Routing Algorithm Based on Ant Algorithm in Mobile Ad hoc Networks
Routing-algorithm
- 链路状态算法（也称最短路径算法）发送路由信息到互联网上所有的结点，然而对于每个路由器，仅发送它的路由表中描述了其自身链路状态的那一部分,其算法思想是每一个路由算法必须完成以下的工作，发现它的邻居节点，并知道其网络地址，测量到各邻居节点的延迟或者开销，构造一个分组，分组中包含所有它刚刚知道的信息，将这个分组发送给所有其他的路由器，计算出到每一个其他路由器的最短路径-Link state algorithm (also known as the shortest path algorithm) to
Cpp1
- dijkstra最短路径寻径算法之邻接表加堆排序的优化方法-adjacent table and heap sort Dijkstra shortest path routing algorithm optimization method
routing
- 在图中求两点间的最短路径，用弗洛伊德算法实现，包括图的类定义-In the figure, the shortest path between two points, with the Floyd algorithm, including the definition of the class diagram
WLANPMesh
- 基于WLAN+Mesh路由算法的研究与实现-Routing algorithm based WLAN+Mesh Research and Implementation
nranotes
- ITS THE NOTES FOR NETWORK ROUTING ALGORITHM
NS2-simulation-environment-to-delay
- 本文在掌握多种网络路由算法的基础上，通过广泛地收集资料和学习，深入了解和分析各种经典的路由算法，对国内外时延计算的各种算法进行分析和阐述，并简要说明了各种算法的工作原理、内部联系及相互转化的条件。并实现了基于NS-2的仿真软件环境下，对现有较为经典的Wfq和VC算法进行软件仿真，对算法仿真结果特点进行分析，最终得出两种算法时延结论，从而确保整个网络高性能运行提供理论支持。-In this paper, master a variety of network routing algorithm b
FESHER
- Energy consumption is prominent and critical issue faced by wireless sensor networks. The maximum amount of energy is consumed when the sensors communicate with each other. Therefore energy efficient routing mechanisms are required. In this paper