无线传感器网络经典分簇算法仿真源码程序 - matlab通信信号

下载频道> 资源分类> matlab源码> 通信信号> 无线传感器网络经典分簇算法仿真源码程序

标题：无线传感器网络经典分簇算法仿真源码程序
分享到：

所属分类: 通信信号资源类型：文件大小: 102.07 KB 上传时间: 2016-01-25 19:15:31 下载次数: 6 资源积分：1分提供者: xiaopeng2 20160125071513758

内容：
无线传感器网络经典分簇算法仿真源码程序，程序员在编程的过程中可以参考学习使用，希望对IT程序员有用，此源码程序简单易懂、方便阅读，有很好的学习价值！

clc;

clear;

close all;

warning off;

xm =100;

ym =100;

%x and y Coordinates of the Sink

sink.x =0.5 * xm;

sink.y = ym + 50;

%Number of Nodes in the field

n = 100

%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=1000

%%%%%%%%%%%%%%%%%%%%%%%%% END OF PARAMETERS %%%%%%%%%%%%%%%%%%%%%%%%

%Computation of do

do=sqrt(Efs/Emp);

set(gcf,'Position',[100 100 260 220]);

set(gca,'Position',[.13 .17 .80 .74]);

figure_FontSize=8;

set(get(gca,'XLabel'),'FontSize',figure_FontSize,'Vertical','top');

set(get(gca,'YLabel'),'FontSize',figure_FontSize,'Vertical','middle');

set(findobj('FontSize',10),'FontSize',figure_FontSize);

set(findobj(get(gca,'Children'),'LineWidth',0.5),'LineWidth',0.5);

%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??

t(r+1).totalE=0;

%Operation for epoch

if(mod(r, round(1/p) )==0)

for i=1:1:n

S(i).G=0;

S(i).cl=0;

end

%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

%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

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

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*(ctrPacketLength) + Efs*ctrPacketLength*( min_dis * min_dis)); %??§??????????????????????

S(i).E = S(i).E - ( ETX*(packetLength) + Efs*packetLength*( min_dis * min_dis)); %??§?????????????§?

end

S(i).E = S(i).E - ETX*(ctrPacketLength); %????????????????????????

%Energy dissipated %??????????????????????§?????????,????????????????????????????

if(min_dis > 0)

S(C(min_dis_cluster).id).E = S(C(min_dis_cluster).id).E - ( (ERX + EDA)*packetLength ); %????????????????????????§?

S(C(min_dis_cluster).id).E = S(C(min_dis_cluster).id).E - ERX *ctrPacketLength ; %????????????

if (min_dis > do)%??????§???????????????????????????

S(C(min_dis_cluster).id).E = S(C(min_dis_cluster).id).E - ( ETX*(ctrPacketLength) + Emp * ctrPacketLength*( min_dis * min_dis * min_dis * min_dis));

else

S(C(min_dis_cluster).id).E = S(C(min_dis_cluster).id).E - ( ETX*(ctrPacketLength) + Efs * ctrPacketLength*( min_dis * min_dis));

end

PACKETS_TO_CH(r+1) = n - dead - cluster + 1; %??§??????????????????ì?????????????????§?

end

S(i).min_dis = min_dis;

S(i).min_dis_cluster = min_dis_cluster;

end

%hold on;

countCHs;

rcountCHs = rcountCHs + countCHs;

%Code for Voronoi Cells

%Unfortynately if there is a small

%number of cells, Matlab's voronoi

%procedure has some problems

%[vx,vy]=voronoi(X,Y);

%plot(X,Y,'r*',vx,vy,'b-');

% hold on;

% voronoi(X,Y);

% axis([0 xm 0 ym]);

for i=1:1:n

if(S(i).E>0)

t(r+1).totalE=t(r+1).totalE+S(i).E;

end

STATISTICS(r+1).E=t(r+1).totalE;

end

for i=1:rmax

x(i)=i;

y(i)=STATISTICS(i).E;

end

plot(x,y,'r');

xlabel('number of rounds');

ylabel('total energy');

text(300,5,'LEACH');

hold on;

文件列表（点击上边下载按钮，如果是垃圾文件请在下面评价差评或者投诉）:

无线传感器网络经典分簇算法仿真源码程序/
无线传感器网络经典分簇算法仿真源码程序/LEACH.m
无线传感器网络经典分簇算法仿真源码程序/截图.jpg

关键词：传感器 算法 源码

matlab源码下载排行

回到顶部

友情链接

matlab源码网站源码编程语言网络编程手机通讯编程 KUNAG 官网 KUNAG 电商更多

: 联系方式| 版权声明| 招聘信息| 广告服务| 银行汇款| 法律顾问| 兼职技术| 付款方式| 关于我们|; 网站客服程序员兼职招聘 411241577@qq.com; 沪ICP备19040327号-3; 公安备案号：沪公网安备 31011802003874号; 库纳格流体控制系统（上海）有限公司版权所有; Copyright © 1999-2014, GUSUCODE.COM, All Rights Reserved

关键词： 传感器 算法 源码

相关推荐

matlab源码下载排行

友情链接

关键词：传感器算法源码