搜索资源列表
Client
- This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance P
Minimum-Spanning-Tree-and-Clustering---04202010.z
- clustering algorithm
Hyper-Tree-Routing
- 基于最小生成树的无线传感器网络路由算法研究,做该方面研究的可以下载使用。-Based on wireless sensor network routing algorithm minimum spanning tree, do the aspect of the study can be downloaded using the