搜索资源列表
WirelessNetworkingLab105DataThroughput
- This simulation exercise explores the impact of MAC overhead and multiple hops on achievable data throughput in a wireless network.
WirelessNetworkingLab105DataThroughput
- This simulation exercise explores the impact of MAC overhead and multiple hops on achievable data throughput in a wireless network. -This simulation exercise explores the impact of MAC overhead and multiple hops on achie
Threshold_test_main_Q8_L4_U1
- 最佳门限跳数8，每秒跳2，用户一个，实现比较简单-The best threshold of 8 hops per second jump 2, the user a relatively simple to achieve
SHORT_Router
- 在JIST_SWANS平台上实现了路由优化算法SHORT，从而减少到达目标节点的跳数。-At JIST_SWANS platform implementation of the routing optimization algorithm SHORT, thus reducing the arrival target node hops.
BFrequencyHop
- This a Bluetooth Model for frequency hopping in simulink matlab. a transmitter and receiver are shown with frequency hopping, 1Mbps, 1600 hops per second-This is a Bluetooth Model for frequency hopping in simulink matlab
leanch123
- 基于matlab开发环境的LEANCH协议的详细注解，和自己本人改写的一部分关于改变跳数的方法，从而延长网络的生存周期，优化网络。-Matlab development environment based on detailed notes LEANCH agreement, and I rewrote part of their own hops on the change in the method, thereby extendi
shufflenetwork
- 洗牌网路由算法的平均跳数和连通度的变化函数关系-Shuffle network by the algorithm, the average number of hops and changes in function of connectivity
path_discovery
- 自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。 为由50个节点构成的网络。在50m×50m大小的区域内，随机的产生50个节点。由用户指定源节点和目的节点，程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点，均一跳可达。-Write your own realization of the use of matlab simulation of wirel
Basecols
- 跳数场的无线传感器网络路由协议Based on the number of hops field of wireless sensor network routing protocols-Based on the number of hops field of wireless sensor network routing protocols
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, whic
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 i
Triangle_Game
- An interesting math game implemented in Javascr ipt. Rule of the Game: The player try to set a point within an equalliteral triangle. Then starting from this point,hop from point to point based on the double-d
ZRP_Overhead.pdf.tar
- ZRP Overhead Network Model 1. Number of Nodes – N 2. LSU update time – tLSU seconds 3. Traffic(Number of sessions per Node per Second) – λs 4. Zone Radius – ρ hops 5. Network Radius – R hops
tracert_MFC
- 用MFC实现的路由跟踪功能，可以设置最大跳步数，在结果框中可以回显各节点的IP地址-Using MFC to implement trace route function, you can set the maximum number of hops and in the result box you can get the IP address of each node
05571687
- —As WSN is a resource-constrained network, especially the limited energy, so it must maintain smaller router information and reduce the energy consumption as much as possible. This paper briefly introduces the w
Optimal-power-allocation-for-AF
- 。研究了瑞利衰落信道下两跳放大前传协作中继系统的最优化功率分配问题。推导了高信噪比条件下的协作中继系统的中断概率的理论公式. 协作中继 放大前传 最优化功率分配 误符号率 中断概率-Optimal power allocation for two hops amplify- and- forward cooperative relaying communication systems in Rayleigh fading chann
hop_2_leach
- 在leach上的改进，采用matlab模拟两跳leach-two hops leach
jishuqi
- 开关量输入单片机接收并且跳数时不闪烁的开关量输入型计数器-Switch input single-chip receiver and number of hops is not flashing digital input counter
TE-routing-algorithm
- 根据链路的使用情况赋权值，并综合考虑带宽和跳数限制的最小权值TE路由算法。-According to the the link usage Empowerment value and considering the value of the minimum weight limit bandwidth and hops TE routing algorithm.
culster-table
- 通过Dijkstra算法求出路由表中的最短路径和最小跳数。-Dijkstra' s algorithm to find the shortest path and the minimum number of hops in the routing table.