<< NARVAL_R_RTPathPresence NARVAL NARVAL_R_SearchEnd >>

NARVAL >> NARVAL > NARVAL_R_SearchDistance

NARVAL_R_SearchDistance

Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the minimal distance.

Calling Sequence

[v,c,p] = NARVAL_R_SearchDistance(i,g,v,c,p)

Parameters

i :

current node.

g :

network graph.

v :

vector that gathers the chronological order how network nodes are visited.

c :

vector of candidate nodes.

p :

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

Description

NARVAL_R_SearchDistance updates the vector of candidates c where to propagate the topology discovery tree from the current node i in respect with the minimal distance. The network nodes already visited by the algorithm are stored in v. A tree inside the graph g is constructed in respect with a source node defined as the root. This graph search algorithm begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, unexplored neighbor nodes are explored, and so on. The search is done in respect with a discovery propagation towards the nearest nodes. New candidates are added at the end of c.

Examples

n=100;//network size
l=1000;//network squared area side
d=100;//Locality radius
[g]=NARVAL_T_LocalityConnex(n,l,d);//generation of a topology
nr=length(g.node_x);//real network size
nl=length(g.head);
i=NARVAL_F_Random(length(g.node_x));//selection of the source node
pred=zeros(1,n);//initialization
v=[];//visited
c=[];//candidates
[v,c,pred]=NARVAL_R_SearchDistance(i,g,v,c,pred);//application of RoutingSearchDistance 
p=[];//display the candidates, the first ones are represented with the smallest edge width
for j=1:length(c)
p=[p NARVAL_G_Nodes2Path([v c(j)],g)];
end
EC=ones(1,nl);//edge color
EB=2*ones(1,nl);//edge width
EC(p)=5;
EB(p)=2*(1:length(p));
D=5*ones(1,nr);//node diameter
D([v c])=10;
g.node_border=D;
g.edge_color=EC;
g.edge_width=EB;
ind=1;//window index
f=NARVAL_G_ShowNodesIndex(g,ind);//graph visualization
i
v
c
pred

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_R_RTPathPresence NARVAL NARVAL_R_SearchEnd >>