一种改进的DV-HOP算法matlab仿真代码

%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~  DV-Hop算法  ~~~~~~~~~~~~~~~~~~~~~~~~

% clear all ,close all;
for BeaconAmount=6:2:14                   % BeaconAmount---信标节点数
BorderLength=10; % BorderLength-----正方形区域的边长，单位：m
NodeAmount=100; % NodeAmount-------网络节点的个数
UNAmount=NodeAmount-BeaconAmount; %未知节点个数
R=8;                                 %通信半径
Dall=zeros(NodeAmount,NodeAmount);%未知节点到信标节点距离初始矩阵；NodeAmoun行NodeAmount列
h=zeros(NodeAmount,NodeAmount);%初始跳数为0；NodeAmoun行NodeAmount列
X=zeros(2,UNAmount);%节点估计坐标初始矩阵

%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~在正方形区域内产生均匀分布的随机拓扑~~~~~~~~~~~~~~~~~~~~
C=BorderLength*rand(2,NodeAmount);
%带逻辑号的节点坐标
Sxy=[[1:NodeAmount];C];  % Sxy--------------用于存储节点的序号，横坐标，纵坐标的矩阵
Beacon=[Sxy(2,1:BeaconAmount);Sxy(3,1:BeaconAmount)];%信标节点坐标
UN=[Sxy(2,(BeaconAmount+1):NodeAmount);Sxy(3,(BeaconAmount+1):NodeAmount)];%未知节点坐标
%画出节点分布图
plot(Sxy(2,1:BeaconAmount),Sxy(3,1:BeaconAmount),'ro',Sxy(2,(BeaconAmount+1):NodeAmount),Sxy(3,(BeaconAmount+1):NodeAmount),'b*')
xlim([0,BorderLength]);
ylim([0,BorderLength]);
title('o 红色信标节点 * 蓝色未知节点')
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~初始化节点间距离、跳数矩阵~~~~~~~~~~~~~~~~~~~~~~
for i=1:NodeAmount
    for j=1:NodeAmount
        Dall(i,j)=((Sxy(2,i)-Sxy(2,j))^2+(Sxy(3,i)-Sxy(3,j))^2)^0.5;%所有节点间相互距离
        if (Dall(i,j)<=R)&(Dall(i,j)>0)
            h(i,j)=1;%初始跳数矩阵
        elseif i==j