資源簡介
原始DVHOP算法源程序,有詳細的注釋,算法簡潔,運行速度快。
代碼片段和文件信息
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~??DV-Hop算法??~~~~~~~~~~~~~~~~~~~~~~~~
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
%?BorderLength-----正方形區(qū)域的邊長,單位:m
%?NodeAmount-------網絡節(jié)點的個數
%?BeaconAmount---信標節(jié)點數
%?Sxy--------------用于存儲節(jié)點的序號,橫坐標,縱坐標的矩陣
%Beacon----------信標節(jié)點坐標矩陣;BeaconAmount*BeaconAmount
%UN-------------未知節(jié)點坐標矩陣;2*UNAmount
%?Distance------未知節(jié)點到信標節(jié)點距離矩陣;2*BeaconAmount
%h---------------節(jié)點間初始跳數矩陣
%X---------------節(jié)點估計坐標初始矩陣X=[xy]‘
%?R------------------節(jié)點的通信距離,一般為10-100m
clearclose?all;
BorderLength=100;
NodeAmount=100;
BeaconAmount=20;
UNAmount=NodeAmount-BeaconAmount;
R=30;
%?D=zeros(NodeAmountNodeAmount);%未知節(jié)電到信標節(jié)點距離初始矩陣;BeaconAmount行NodeAmount列
h=zeros(NodeAmountNodeAmount);%初始跳數為0;BeaconAmount行NodeAmount列
X=zeros(2UNAmount);%節(jié)點估計坐標初始矩陣
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~在正方形區(qū)域內產生均勻分布的隨機拓撲~~~~~~~~~~~~~~~~~~~~
C=BorderLength.*rand(2NodeAmount);
%帶邏輯號的節(jié)點坐標
Sxy=[[1:NodeAmount];C];
Beacon=[Sxy(21:BeaconAmount);Sxy(31:BeaconAmount)];%信標節(jié)點坐標
UN=[Sxy(2(BeaconAmount+1):NodeAmount);Sxy(3(BeaconAmount+1):NodeAmount)];%未知節(jié)點坐標
%畫出節(jié)點分布圖
plot(Sxy(21:BeaconAmount)Sxy(31:BeaconAmount)‘r*‘Sxy(2(BeaconAmount+1):NodeAmount)Sxy(3(BeaconAmount+1):NodeAmount)‘k.‘)
xlim([0BorderLength]);
ylim([0BorderLength]);
title(‘*?紅色信標節(jié)點?.?黑色未知節(jié)點‘)
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~初始化節(jié)點間距離、跳數矩陣~~~~~~~~~~~~~~~~~~~~~~
for?i=1:NodeAmount
????for?j=1:NodeAmount
????????Dall(ij)=((Sxy(2i)-Sxy(2j))^2+(Sxy(3i)-Sxy(3j))^2)^0.5;%所有節(jié)點間相互距離
????????if?(Dall(ij)<=R)&(Dall(ij)>0)
????????????h(ij)=1;%初始跳數矩陣
????????elseif?i==j
????????????h(ij)=0;
????????else?h(ij)=inf;
????????end
????end
end
%~~~~~~~~~~~~~~~~~~
評論
共有 條評論