Search - dv hop matlab

Search - dv hop matlab - List

[Grid Computing] DV-HOP DL : 0: 本方法是采用 DV-HOP算法进行节点之间的定位。-This method is the use of DV-HOP algorithm positioning between nodes.
Update : 2025-02-17 Size : 1kb Publisher : 何明坤
[Other] DV-Hop DL : 0: 无线传感器中的DV-HOp算法仿真，基于MATLAB实现-Wireless Sensor Simulation DV-HOp
Update : 2025-02-17 Size : 4kb Publisher : 张伟
[Program doc] DV-Hopziliao DL : 0: 本文资料对DV-Hop算法进行了分析论述，并且用MATLAB进行了仿真。-In this paper, information on the DV-Hop algorithm on an analysis and simulation with MATLAB.
Update : 2025-02-17 Size : 177kb Publisher : 张伟
[Other] dv-hop DL : 0: 改善DV-Hop算法对节点的定位精度和提高覆盖率，-In order to raise the node localization accuracy and coverage fraction of DV-Hop algorithm,
Update : 2025-02-17 Size : 5kb Publisher : lisi
[matlab] DV-HOP DL : 0: 这是用MATLAB仿真平台，实现无线传感器网络定位算法仿真。-This is a MATLAB simulation platform, wireless sensor network localization algorithm simulation.
Update : 2025-02-17 Size : 221kb Publisher : 都伊林
[matlab] Untitled5 DL : 0: dv-hop算法,无线传感器网络定位算法-dv-hop algorithm, wireless sensor network localization algorithm
Update : 2025-02-17 Size : 1kb Publisher : druid
[Communication-Mobile] DVHOP DL : 0: 实现无线传感器网络定位DV-Hop算法的matlab源码-Wireless sensor network localization DV-Hop algorithm matlab source
Update : 2025-02-17 Size : 1kb Publisher : css
[matlab] DV-hop DL : 0: 无线传感器网络典型定位算法DV-Hop的实现-Typical wireless sensor network localization algorithm implementation of DV-Hop
Update : 2025-02-17 Size : 1kb Publisher : suzie
[matlab] DV-Hop DL : 0: MATLAB对于网络定位的仿真，是针对dv-hop的算法的仿真-MATLAB simulation for network, which is based on the orientation of the dv-hop algorithm simulation
Update : 2025-02-17 Size : 1kb Publisher : 赵林喜
[matlab] dv-hop DL : 0: dv-hop程序，具有一定的参考价值-dv-hop
Update : 2025-02-17 Size : 2kb Publisher : maoyi
[matlab] DV-Hop DL : 0: 无线传感器网络DV-Hop节点定位算法，基于Matlab的源程序。-Wireless sensor network node, DV-Hop localization algorithm, based on the Matlab source code.
Update : 2025-02-17 Size : 2kb Publisher : gongyuevic
[matlab] DV-hop DL : 0: 一种基于DV-hop算法的源代码，仿真结果及图形，有助于对算法的进一步理解-DV-hop algorithm based on the source code, simulation results and graphics to help further understanding of the algorithm
Update : 2025-02-17 Size : 175kb Publisher : 姜涛
[matlab] DV-hop DL : 1: dv-hop算法改进的matlab仿真程序，提高了算法的覆盖率。-Improvement of DV-Hop
Update : 2025-02-17 Size : 1kb Publisher : 孙岩
[matlab] DV-hop DL : 0: Dv-hop定位算法matlab源码，包含pdf文件和m文件(Dv-hop localization algrithm matlab code)
Update : 2025-02-17 Size : 175kb Publisher : Tony.wq
[matlab] dv-hop DL : 0: 无线传感器定位算法的DV-hop matlab仿真代码相信对大家很有帮助(Wireless sensor positioning algorithm DV-hop matlab simulation code, I believe that very helpful to everyone)
Update : 2025-02-17 Size : 2kb Publisher : 糯米沙琪玛
[matlab] DV-hop DL : 0: dv-hop定位算法源码，matlab的m文件，解压可以直接用(dv-hop localization algorithm)
Update : 2025-02-17 Size : 176kb Publisher : dwjhadb
[Other] DV-HOP DL : 0: DV-HOP在MATLAB平台仿真实例,用于基本仿真实验(Simulation example of DV-HOP on MATLAB platform)
Update : 2025-02-17 Size : 1kb Publisher : JeKnight
[Other] Weight-NRDV-Hop DL : 0: 基于多通信半径的加权DV-Hop改进算法(An Improving DV-Hop Algorithm Based on Multi Communication Radius.)
Update : 2025-02-17 Size : 1kb Publisher : 夏沐熙
[matlab] DV-Hop均匀 DL : 0: 所有节点随机分布 DV-Hop算法不同通信半径不同锚节点数(All nodes randomly distributed DV-Hop algorithm with different communication radius and different anchor points.)
Update : 2025-02-17 Size : 182kb Publisher : 大手送
[Data structs] new-DV-Hop-code DL : 0: 改进DV-Hop定位算法首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。第五步用极大似然估计法求未知节点坐标 (Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes)
Update : 2025-02-17 Size : 1kb Publisher : robinkk4

« 12 3 4 »