<< NARVAL_W_CanalWCDS NARVAL NARVAL_W_NucleusGColWCDS >>

NARVAL >> NARVAL > NARVAL_W_GColWCDS

NARVAL_W_GColWCDS

Color a WCDS graph (4 colors).

Calling Sequence

[gc] = NARVAL_W_GColWCDS(g,n,cn)

Parameters

g :

graph.

n :

list of master nodes (nucleus).

cn :

list of channels (nucleus).

gc :

colored graph.

Description

NARVAL_W_GColWCDS colors the WCDS graph g in order to reduce interferences (WIKIPEDIA). A color is assigned to each master node, so that 2 neighbor nodes will have a different channel.n represents the list of WCDS master nodes. The list of colors attributed by the 4-color theorem to each master node is stored in cn (WIKIPEDIA). The output graph is stored in gc.

Examples

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,n,e]=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,n);//extraction of the graph between master nodes (nucleus)
Col=[2 5 6 7];//colors
[gnu_c]=NARVAL_W_NucleusGColWCDS(gnu,n,Col);//selection of each nucleus node color
[g_col]=NARVAL_W_GColWCDS(g,n,gnu_c.node_color);//application of NARVAL_W_GColWCDS
w2=2;//window index
[f2]=NARVAL_G_ShowNodesIndex(gnu_c,w2);//graph visualization
w3=3;//window index
[f3]=NARVAL_G_ShowNodesIndex(g_col,w3);//graph visualization

Dependency

NARVAL_G_NodeNeighbors, 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_W_CanalWCDS NARVAL NARVAL_W_NucleusGColWCDS >>