Perform the data aggregation on each node of a graph (WCDS+tree).
[d] = NARVAL_R_AggregationWCDS(g,gnu,n,s)
network graph.
nucleus graph.
list of nucleus.
sink.
output data.
NARVAL_R_AggregationWCDS performs the data aggregation d (all information from its children) on each node of the network graph g. The nucleus graph gnu (edges between master nodes) is assumed to be known. n gathers the list of nucleus indexes inside the graph g. The sink is the node s. d is a matrix n*(n+1). It gives the information about the aggregation performed during the WCDS algorithm by all nucleus nodes. In this aggregation approach, the master nodes form a tree towards the sink. Each nucleus aggregates the information forwarded by its children. As a consequence, less packets are used during the collection of all sensed data transmitted by all nodes.
n=200;//network size l=1000;//network squared area side d=100;//Locality radius [g]=NARVAL_T_LocalityConnex(n,l,d);//generation of a topology [go,nucleus,electron]=NARVAL_W_WCDS(g);//calculation of the WCDS of g w=1;//window index f=NARVAL_G_ShowNodesIndex(go,w);//graph visualization [gnu]=NARVAL_W_NucleusGWCDS(g,nucleus);//nucleus graph w2=2;//window index [f2]=NARVAL_G_ShowNodesIndex(gnu,w2);//graph visualization sink=nucleus(NARVAL_F_Random(gnu.node_number));//selection of the sink [d]=NARVAL_R_AggregationWCDS(g,gnu,nucleus,sink);//application of NARVAL_R_AggregationWCDS d w3=3;//window index scf(w3);//display parameters clf(w3); xgrid(1); st=[17];//style lstyle=[1];//style xset("line style",lstyle(1)); plot2d(1:g.node_number,d(:,$)',style=st(1));//graph visualization xtitle('Aggregation Spanning Tree','Sensor ID','Aggregation Level',''); | ![]() | ![]() |
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346