matlab.rar_PEGASIS matlab code_matlab routing code_matlab 路由_路由算

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % SEP: A Stable Election Protocol for clustered % % heterogeneous wireless sensor networks % % % % (c) Georgios Smaragdakis % % WING group, Computer Science Department, Boston University % % % % You can find full documentation and related information at: % % http://csr.bu.edu/sep % % % % To report your comment or any bug please send e-mail to: % % gsmaragd@cs.bu.edu % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % This is the LEACH [1] code we have used. % % The same code can be used for FAIR if m=1 % % % % [1] W.R.Heinzelman, A.P.Chandrakasan and H.Balakrishnan, % % "An application-specific protocol architecture for wireless % % microsensor networks" % % IEEE Transactions on Wireless Communications, 1(4):660-670,2002 % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% clear; %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PARAMETERS %%%%%%%%%%%%%%%%%%%%%%%%%%%% %Field Dimensions - x and y maximum (in meters) xm = 200; ym = 200; %x and y Coordinates of the Sink sink.x =0.5 * xm; sink.y = ym + 50; %Number of Nodes in the field n = 200 %Optimal Election Probability of a node %to become cluster head p=0.05; packetLength = 4000;%数据包长度 ctrPacketLength = 100;%控制包长度 %Energy Model (all values in Joules) %Initial Energy Eo = 0.5; %Eelec=Etx=Erx ETX=50*0.000000001; ERX=50*0.000000001; %Transmit Amplifier types Efs=10*0.000000000001; Emp=0.0013*0.000000000001; %Data Aggregation Energy EDA=5*0.000000001; %Values for Hetereogeneity %Percentage of nodes than are advanced m=1; %\alpha a=1; INFINITY = 999999999999999; %maximum number of rounds rmax=2000 %%%%%%%%%%%%%%%%%%%%%%%%% END OF PARAMETERS %%%%%%%%%%%%%%%%%%%%%%%% %Computation of do do=sqrt(Efs/Emp); %Creation of the random Sensor Network figure(1); for i=1:1:n S(i).xd=rand(1,1)*xm;%坐标 XR(i)=S(i).xd; S(i).yd=rand(1,1)*ym; YR(i)=S(i).yd; S(i).G=0; %initially there are no cluster heads only nodes S(i).type='N';%普通节点 temp_rnd0 = i; %Random Election of Normal Nodes %if (temp_rnd0>=m*n+1) S(i).E=Eo; S(i).ENERGY=0; % plot(S(i).xd,S(i).yd,'o'); % hold on; % end %Random Election of Advanced Nodes % if (temp_rnd0<m*n+1) % S(i).E=Eo*(1+a) % S(i).ENERGY=1; % %plot(S(i).xd,S(i).yd,'+'); % %hold on; % end end S(n+1).xd=sink.x; S(n+1).yd=sink.y; %plot(S(n+1).xd,S(n+1).yd,'x'); %First Iteration figure(1); %counter for CHs countCHs=0; %counter for CHs per round rcountCHs=0; cluster=1; countCHs; rcountCHs=rcountCHs+countCHs; flag_first_dead=0; for r=0:1:rmax %主循环,每次1轮 r %Operation for epoch if(mod(r, round(1/p) )==0) for i=1:1:n S(i).G=0; S(i).cl=0; end end hold off; %Number of dead nodes dead=0; %Number of dead Advanced Nodes dead_a=0; %Number of dead Normal Nodes dead_n=0; %counter for bit transmitted to Bases Station and to Cluster Heads packets_TO_BS=0; packets_TO_CH=0; %counter for bit transmitted to Bases Station and to Cluster Heads %per round PACKETS_TO_CH(r+1)=0; PACKETS_TO_BS(r+1)=0; figure(1); for i=1:1:n %checking if there is a dead node if (S(i).E<=0) % plot(S(i).xd,S(i).yd,'red .'); dead=dead+1; end if S(i).E>0 S(i).type='N'; end end %plot(S(n+1).xd,S(n+1).yd,'x'); if (dead == n)%节点全部死亡退出循环 break; end STATISTICS(r+1).DEAD=dead; DEAD(r+1)=dead; DEAD_N(r+1)=dead_n; DEAD_A(r+1)=dead_a; %When the first node dies if (dead==1) if(flag_first_dead==0) first_dead=r flag_first_dead=1; end end countCHs=0; cluster=1; for i=1:1:n if(S(i).E>0) temp_rand=rand; if ( (S(i).G)<=0) %如果该节点在候选集合中 %Election of Cluster Heads if( temp_rand <= (p/(1-p*mod(r,round(1/p))))) countCHs = countCHs+1; S(i).type = 'C'; S(i).G = round(1/p)-1; C(cluster).xd = S(i).xd; C(cluster).yd = S(i).yd; %plot(S(i).xd,S(i).yd,'k*'); distance=sqrt( (S(i).xd-(S(n+1).xd) )^2 + (S(i).yd-(S(n+1).yd) )^2 );%到sink的距离 C(cluster).distance = distance; C(cluster).id = i; X(cluster)=S(i).xd; Y(cluster)=S(i).yd; cluster=cluster+1; %%广播自成为簇头 distanceBroad = sqrt(xm*xm+ym*ym); if (distanceBroad > do) S(i).E = S(i).E- ( ETX * ctrPacketLength + Emp* ctrPacketLength*( distanceBroad*distanceBroad*distanceBroad*distanceBroad ));%广播自成为簇头 else S(i).E = S(i).E- ( ETX * ctrPacketLength + Efs * ctrPacketLength*( distanceBroad*distanceBroad)); end %Calculation of Energy dissipated 簇头自己发送数据包能量消耗 distance; if (distance > do) S(i).E = S(i).E- ( (ETX+EDA)*(packetLength) + Emp * packetLength*( distance*distance*distance*distance )); else S(i).E = S(i).E- ( (ETX+EDA)*(packetLength) + Efs * packetLength*( distance * distance )); end packets_TO_BS = packets_TO_BS+1; PACKETS_TO_BS(r+1) = packets_TO_BS; end end end end STATISTICS(r+1).CLUSTERHEADS = cluster-1;%统计第r轮簇头数目,r是从0开始的,所以加1;cluster最后要-1,是应为上面的循环多加了1 CLUSTERHS(r+1)= cluster-1; %Election of Associated Cluster Head for Normal Nodes for i=1:1:n if ( S(i).type=='N' && S(i).E>0 ) %普通节点 % min_dis = sqrt( (S(i).xd-S(n+1).xd)^2 + (S(i).yd-S(n+1).yd)^2 );%默认距离是到sink的距离 min_dis = INFINITY; if(cluster -1 >= 1)%如果有簇头存在 min_dis_cluster = 1; %加入最近的簇头 for c = 1:1:cluster - 1 %簇头数量一共是cluster - 1 %temp = min(min_dis,sqrt( (S(i).xd - C(c).xd)^2 + (S(i).yd - C(c).yd)^2 ) ); temp = sqrt( (S(i).xd - C(c).xd)^2 + (S(i).yd - C(c).yd)^2 ); if ( temp < min_dis ) min_dis = temp; min_dis_cluster = c; end %接收簇头发来的广播的消耗 S(i).E = S(i).E - ETX * ctrPacketLength; end %Energy dissipated by associated Cluster Head普通节点发送数据包到簇头消耗,和加入消息 min_dis; if (min_dis > do) S(i).E = S(i).E - ( ETX*(ctrPacketLength) + Emp * ctrPacketLength*( min_dis * min_dis * min_dis * min_dis)); %向簇头发送加入控制消息 S(i).E = S(i).E - ( ETX*(packetLength) + Emp*packetLength*( min_dis * min_dis * min_dis * min_dis)); %向簇头数据包 else S(i).E = S(i).E - ( ETX*(ctrPacketL