energy.m

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

clear;
N=100;
M=100;
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;
%plot(x,y,'o',x(1),y(1),'p');
for i=1:N
    str=num2str(i);
%    text(x(i)-2,y(i)-2,str);
end
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
parent=ones(100,1);
for i=1:N
    k=i;
    for j=1:n(i)-1
        temp=neighbour(i,j);
        if ((x(temp)-M*0.95)^2+(y(temp)-M*0.95)^2<(x(k)-M*0.95)^2+(y(k)-M*0.95)^2 )
            k=temp;
        end
    end
    if k~=i
       parent(i)=k;
    end
    parent(1)=1;
    cordinate_x(1)=x(i);cordinate_x(2)=x(k);cordinate_y(1)=y(i);cordinate_y(2)=y(k);
%  line(cordinate_x,cordinate_y);
end
child=zeros(N,N*0.2);
for i=1:N
    c(i)=1;
   for j=1:N
        if  parent(j)==i
            child(i,c(i))=j;
            c(i)=c(i)+1;
        end
   end
end
for i=1:N
    if c(parent(i))~=0
       b(i)=c(parent(i))-1;
    end
   for j=1:b(i)
       brother(i,j)=child(parent(i),j);
   end
end
for i=1:N
   h(i)=1;
   for j=1:n(i)-1
      for k=1:n(neighbour(i,j))-1
         if i~=neighbour(i,j)
             hop(i,h(i))=neighbour(neighbour(i,j),k);
             h(i)=h(i)+1;
         end
      end
   end
end
t=zeros(N,1);
f=zeros(N,1);
u=1;v=1;
t(u)=1;f(u)=1;
k=1;d=1;
visited=zeros(N+1,1);visited(1)=1;
max_t=1;max_f=1;
p=1;q=1;i=1;
while k<N & d<20*N
    if  child(u,v)~=0 
        if visited(child(u,v))==0 
           u=child(u,v);
           p=1;q=1;i=1;
           while i~=n(u)
                i=1;
                while i<n(u)
                    if   p==t(neighbour(u,i))
                         p=p+1;
                         break;
                    end
                    i=i+1;
                end
           end
%       i=1;
%       while i~=n(u)
%          i=1;
%          while i<n(u)
%             if  q==f(neighbour(u,i)) 
%                q=q+1; 
%                break;
%             end
%             i=i+1;
%          end
%       end
           i=1;
           while i~=h(u)
                 i=1;
                 while i<h(u)
                      if q==f(hop(u,i))
                         q=q+1; 
                         break;
                      end
                      i=i+1;
                 end
            end
%    if u==1
%        q=1;
%    else
%      while i~=b(u) 
%        i=1;
%        while i<b(u)
%            if   q==f(brother(u,i))| q==f(parent(u))| q==f(parent(parent(u)))
%               q=q+1;
%               break;
%            end
%            i=i+1;
%        end
%      end
%    end
          t(u)=p;f(u)=q;
          if t(u)>max_t
          max_t=t(u);
          end
          if f(u)>max_f
             max_f=f(u);
          end
          visited(u)=1; 
          k=k+1;
%      text(x(u)+2,y(u)+2,num2str(t(u)));
%      text(x(u)-2,y(u)-2,num2str(f(u)));
          v=1;
       end
   end
   if child(u,v)==0
      u=parent(u);
      v=1;
    else if visited(child(u,v))==1 
            v=v+1;
        end
    end
    d=d+1;
end
Q_size_max=4000;
P_size_max=80;
S_size=30;
inc_P=1;
total_pack=zeros(6,4);  
total_rpack=zeros(6,4);
total_time=zeros(6,4);
for P_num=30:10:P_size_max
s=zeros(S_size,1);
a=zeros(N,1);
for i=1:S_size
    s(i)=ceil(N*rand(1));
    while a(s(i))==1
        s(i)=ceil(N*rand(1));
    end
    a(s(i))=1;
end
inc_Q=1;
for Q_size=4000:1000:Q_size_max
r=zeros(S_size,P_num);
pack=zeros(S_size,1);
rpack=zeros(S_size,1);
time=zeros(S_size,1);
energy=zeros(S_size,1);
front=ones(N,1);
rear=ones(N,1);
posi=zeros(S_size,P_num);
flag=zeros(S_size,P_num);
%wait=zeros(S_size,P_num);
drop=zeros(S_size,P_num);
error=0;
for i=1:P_num*20
    for l=1:N
        v(l,i)=0;
    end
    for k=1:S_size
        if i<=P_num
           pack(k)=pack(k)+1;
           r(k,pack(k))=s(k);
           posi(k,pack(k))=rear(s(k));  
           rear(s(k))=rear(s(k))+1; 
        end
        for j=1:max_t
            for m=1:pack(k)
                if flag(k,m)==0 & drop(k,m)==0
                   loc=r(k,m);
                   if  t(loc)==j & posi(k,m)==front(loc) & v(loc,i)==0
                        front(loc)=front(loc)+1;
                        v(loc,i)=1;
                        next=parent(loc);                      
                        if  next==1
                            rpack(k)=rpack(k)+1;
                            time(k)=time(k)+i*max_t+j;
                            energy(k)=energy(k)+1
                            flag(k,m)=1;
                            r(k,m)=1;
                        else
                           if  rear(next)-front(next)<Q_size
                               posi(k,m)=rear(next);
                               rear(next)=rear(next)+1;
                               r(k,m)=next;
                               energy(k)=energy(k)+1
                           else
                               drop(k,m)=1;
                           end
                       end
                   end
               end
           end
       end
   end
end
for k=1:S_size
    total_pack(inc_P,inc_Q)=total_pack(inc_P,inc_Q)+pack(k);
    total_rpack(inc_P,inc_Q)=total_rpack(inc_P,inc_Q)+rpack(k);
    total_time(inc_P,inc_Q)=total_time(inc_P,inc_Q)+time(k);
    total_energy(inc_P,inc_Q)=total_energy(inc_P,inc_Q)+energy(k);
end
inc_Q=inc_Q+1;
end
inc_P=inc_P+1;
end
%k=100:100:Q_size_max;
plot(total_pack(:,1),total_rpack(:,1),'d-',total_pack(:,2),total_rpack(:,2),'d-',total_pack(:,3),total_rpack(:,3),'d-',total_pack(:,4),total_rpack(:,4),'d-');
plot(total_energy(:,1)/total_rpack(:,1),total_rpack(:,1),'d-',total_pack(:,2),total_rpack(:,2),'d-',total_pack(:,3),total_rpack(:,3),'d-',total_pack(:,4),total_rpack(:,4),'d-');
axis([30*S_size,P_size_max*S_size,0,4000]);
xlabel('sending packet');
%xlabel('queue size');
ylabel('received packet');
title('thoughput');
legend queuesize=100 queuesize=200 queuesize=300 queuesize=400