Connect a Waxman subnetwork around a node of a graph.
[go] = NARVAL_G_WCirclePlace(a,b,n,d,g,i)
first parameter of the Waxman model.
second parameter of the Waxman model.
quantity of nodes of the new subnetwork.
maximal radius between new nodes and the central node.
initial network graph.
central node index.
output graph.
NARVAL_G_WCirclePlace connects n nodes around the central node with index i inside the original graph g. They are randomly placed inside a disc centered in the node i with the radius d (d/2-->d). New links between these n nodes are created in respect with the Waxman algorithm.
In the previous picture, 4 new nodes have been attached to the node N16.
n=100;//network size L=1000;//network square area side dmax=100;//Locality radius [g]=NARVAL_T_LocalityConnex(n,L,dmax);//generation of a topology in respect with the Locality method i=NARVAL_F_Random(length(g.node_x));//selection of the source node a=0.4;//Waxman parameters b=0.8; newN=20;//quantity of nodes of the new subnetwork newD=150;//maximal radius between new nodes and the central node [ge]=NARVAL_G_WCirclePlace(a,b,newN,newD,g,i);//application of NARVAL_G_WCirclePlace gl=length(g.head);//visualization parameters gel=length(ge.head); gn=length(g.node_x); gen=length(ge.node_x); ec=5*ones(1,gel); ec(1:gl)=ones(1,gl); nc=5*ones(1,gen); nc(1:gn)=ones(1,gn); ge.edge_color=ec; ge.node_color=nc; ind=1;//window index f=NARVAL_G_ShowGraph(ge,ind);//graph visualization | ![]() | ![]() |
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