%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~??DV-Hop算法??~~~~~~~~~~~~~~~~~~~~~~~~
%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
%?BorderLength-----正方形區(qū)域的邊長，單位：m
%?NodeAmount-------網(wǎng)絡節(jié)點的個數(shù)
%?BeaconAmount---信標節(jié)點數(shù)
%?Sxy--------------用于存儲節(jié)點的序號，橫坐標，縱坐標的矩陣
%Beacon----------信標節(jié)點坐標矩陣;BeaconAmount*BeaconAmount
%UN-------------未知節(jié)點坐標矩陣;2*UNAmount
%?Distance------未知節(jié)點到信標節(jié)點距離矩陣;2*BeaconAmount
%h---------------節(jié)點間初始跳數(shù)矩陣
%X---------------節(jié)點估計坐標初始矩陣X=[xy]‘
%?R------------------節(jié)點的通信距離，一般為10-100m

clearclose?all;
BorderLength=100;
NodeAmount=23;
BeaconAmount=20;
UNAmount=NodeAmount-BeaconAmount;
R=60;
%?D=zeros（NodeAmountNodeAmount）;%未知節(jié)電到信標節(jié)點距離初始矩陣；BeaconAmount行NodeAmount列
h=zeros（NodeAmountNodeAmount）;%初始跳數(shù)為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é)點間距離、跳數(shù)矩陣~~~~~~~~~~~~~~~~~~~~~~
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;%初始跳數(shù)矩陣
????????elseif?i==j
????????????h（ij）=0;
????????else?h（ij）=inf;
????????end
????end
end
%~~~~~~~~~~~~~~~~~~~~~~~~~最短路經算法計算節(jié)點間跳數(shù)~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
for?k=1:NodeAmount
????for?i=1:NodeAmount
????????for?j=1:NodeAmount
????????????if?h（ik）+h（kj）????????????????h（ij）=h（ik）+h（kj）;
????????????end
????????end
????end
end
h
%~~~~~~~~~~~~~~~~~~~~~~~~~求每個信標節(jié)點的校正值~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
h1=h（1:BeaconAmount1:BeaconAmount）;?
D1=Dall（1:BeaconAmount1:BeaconAmount）;
for?i=1:BeaconAmount
????dhop（i1）=sum（D1（i:））/sum（h1（i:））;%每個信標節(jié)點的平均每跳距離
end
D2=Dall（1:BeaconAmount（BeaconAmount+1）:NodeAmount）;%BeaconAmount行UNAmount列
for?i=1:BeaconAmount
????for?j=1:UNAmount
????????if?min（D2（:j））==D2（ij）
????????????Dhop（1j）=D2（ij）;%未知節(jié)點從最近的信標獲得校正值
????????end
????end
end
Dhop
%~~~~~~~~~~~~~~~~~~~~~~~~~~~用跳數(shù)估計距離~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hop1=h（1:BeaconAmount（BeaconAmount+1）:NodeAmount）%未知節(jié)點到信標跳數(shù)，BeaconAmount行UNAmount列
for?i=1:UNAmount
????hop=Dhop（1i）;%hop為從最近信標獲得的校正值
????Distance（:i）=hop*hop1（:i）;%%Beacon行UN列；
end
%?%~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~最小二乘法求未知點坐標~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
d=Distance;
for?i=1:2
????for?j=1:（BeaconAmount-1）
??????a（ij）=Beacon（ij）-Beacon（iBeaconAmount）;
????end
end
A=-2*（a‘）;
%?d=d1‘;
?for?m=1:UNAmount?
?????for?i=1:（BeaconAmount-1）
?????????B（i

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件???????3807??2010-01-07?10:50??DV-Hop算法.m

?????文件???????3807??2010-01-07?10:57??DV-Hop算法.txt

-----------?---------??----------?-----??----

?????????????????7614????????????????????2