<< NARVAL_G_EdgesOfNode NARVAL NARVAL_G_ForceBasedA >>

NARVAL >> NARVAL > NARVAL_G_FloodLeaves

NARVAL_G_FloodLeaves

Highlight the leaves of a virtual tree (Flood).

Calling Sequence

[gl] = NARVAL_G_FloodLeaves(g,s,cm,pred,sc,sb,sd,ac,ab,ad,lc,lb,ld,ec,ew)

Parameters

g :

network graph.

s :

sink.

cm :

congestion map.

pred :

vector composed by the predecessor of each node in order to reach the sink.

sc :

sink color.

sb :

sink border.

sd :

sink diameter.

ac :

aggregator color.

ab :

aggregator border.

ad :

aggregator diameter.

lc :

leaf color.

lb :

leaf border.

ld :

leaf diameter.

ec :

tree edge color.

ew :

tree edge width.

gl :

output graph.

Description

NARVAL_G_FloodLeaves highlights the leaves of a virtual tree (Flood) extracted from the graph g. The congestion map cm gives information about the number of shortest paths from all the graph nodes towards the sink that cross each node. The predecessor vector pred gives the direction that each node needs to follow in order to reach the sink. The visualization highlights tree components, e.g. the sinks (color: sc, border: sb, diameter: sd), the aggregators (color: ac, border: ab, diameter: ad) and the leaves (color: lc, border: lb, diameter: ld). The edges of the tree are also displayed with the color ec and the width ew. The output graph is stored in gl.

Examples

n=100;//network size
L=1000;//network squared area side
r=150;//Locality radius
[g]=NARVAL_T_LocalityConnex(n,L,r);//generation of a topology
w=1;//window index
f=NARVAL_G_ShowGraph(g,w);//graph visualization
n=g.node_number;//real network size
sink=NARVAL_F_Random(n);//selection of the sink
[cm,np,pred]=NARVAL_R_SinkFlood(g,sink);//flooding from the sink
ind=w+1;//window index
sc=2;//visualization parameters
sb=10;
sd=40;
ac=1;
ab=3;
ad=30;
lc=5;
lb=10;
ld=20;
ec=2;
ew=3;
[gl]=NARVAL_G_FloodLeaves(g,sink,cm,pred,sc,sb,sd,ac,ab,ad,lc,lb,ld,ec,ew);//application of NARVAL_G_AggregationLeaf
ft=NARVAL_G_ShowGraph(gl,ind);//graph visualization

Dependency

NARVAL_F_Remov, NARVAL_G_Nodes2Path

Authors

Foued Melakessou

Contact

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

Home Page


<< NARVAL_G_EdgesOfNode NARVAL NARVAL_G_ForceBasedA >>