文件名称:path_discovery
介绍说明--下载内容来自于网络,使用问题请自行百度
自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。
为由50个节点构成的网络。在50m×50m大小的区域内,随机的产生50个节点。由用户指定源节点和目的节点,程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点,均一跳可达。-Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.
为由50个节点构成的网络。在50m×50m大小的区域内,随机的产生50个节点。由用户指定源节点和目的节点,程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点,均一跳可达。-Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
path_discovery_main.m
path_discovery.m
path_discovery.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.