topo.m

无线传感器网络的可靠路由算法

clear;
N=100;
M=1000;
for i=1:N
    x(i)=rand(1)*M;
    y(i)=rand(1)*M;
end
x(1)=M*0.95;y(1)=M*0.95;
neighbour=zeros(N,N*0.2);
for i=1:N
    n(i)=1;
   for j=1:N
      if (x(i)-x(j))^2+(y(i)-y(j))^2<M^2*0.04 & i~=j
          neighbour(i,n(i))=j;
          n(i)=n(i)+1;
      end
   end
end
hop=100*ones(N,1);hop(1)=0;k=0;computed=1;visited=zeros(N,1);
while computed<=N
    for i=1:N
        for j=1:n(i)-1
             if hop(neighbour(i,j))==k && visited(i)==0
                hop(i)=k+1;
                visited(i)=1;
                computed=computed+1;
             end
        end
    end     
    k=k+1;
end
parent=ones(100,1);children=zeros(N,N*0.2);c=ones(100,1);hop(1)=0;
for i=1:N
    k=i;
    for j=1:n(i)-1
        temp=neighbour(i,j);
        if hop(temp)<hop(k) | (hop(temp)==hop(k) & c(temp)<c(k))
            k=temp;
        end
    end
    if k~=i
       parent(i)=k;
       children(k,c(k))=i;
       c(k)=c(k)+1;
    end
end
 parent(1)=1;