搜索资源列表
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
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 Pack
ratioahopaload.tar
- 此文件中的三个awk文件可分别用来分析无线TRACE文件的包获取率、平均跳数和负载。-This file documents are available in three awk are used to analyze files from the package to get wireless TRACE rate, average hop count and load.
Dijkstra
- 设在图G={V,E}中有一顶点r，Dijkstra算法可以求出其他所有点到点r的最短路径的跳数，这是求单源最短路径的一个最基本的算法。-There is a vertex, r, in the graph G={V,E}. As to every other vertex v, there exist several paths between v and r. The Dijkstra algorithm can get the hop count of the shortest path a
OLA_OOPSim
- Opportunistic Large Array 的MATLAB 模拟器. Object oriented Event Based 无线广播 支持OLA 累积Relay重发信号以达到最佳解码效果 节点位置可随机或以网格生成 可控制调变方式 独立节点间无线传输信道模型 可调随机生成信噪比范围 生成显示各节点位置图 生成各节点接收所需OLA副本数量图 生成各节点误码率图 生成各节点HOP-COUNT图
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
05273886.pdf
- Producing the quality of service in wireless network is a complex subject because of constraints related to the ad hoc mode as limited bandwidth, sharing medium...etc. The traditional routing based on hop count metric doesn’t take in its consideratio
testelection
- This a MATLAB code (function) which elects two new nodes each time. Nodes are elected relatively to their distance in term of hop count to the initiator. This code is used by tree construction algorithm in networks modeled as weighted matrix. -This i
jiedian
- 在正方形区域内产生均匀分布的随机拓扑,红色信标节点 . 黑色未知节点,初始化节点间距离,跳数矩阵,最短路径算法计算节点间跳数,球每个信标节点的校正值,最小二乘法求未知点坐标-Generate uniformly distributed random topology in the square area, red beacon nodes. Black unknown nodes, the distance between node initialization, hop count matri
One_Point
- 传感器节点在链状拓扑结构中的传输仿真，可控制跳距，跳数，节点间距离(The transmission simulation of sensor nodes in chain topology can control hop distance, hop count and distance between nodes)
new-DV-Hop-code
- 改进DV-Hop定位算法 首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。 第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。 第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。 第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。 第五