<< NARVAL_R_ShowPath NARVAL NARVAL_R_TBellmanFord >>

NARVAL >> NARVAL > NARVAL_R_SinkFlood

NARVAL_R_SinkFlood

Perform the congestion map and predecessor vectors between a sink and the remaining nodes of a graph.

Calling Sequence

[cm,dm,pred] = NARVAL_R_SinkFlood(g,s)

Parameters

g :

graph.

s :

sink.

cm :

congestion map.

dm :

distance map.

pred :

predecessor vector.

Description

NARVAL_R_SinkFlood performs the congestion map cm and predecessor vectors pred between the sink s and the remaining nodes of the graph g. The congestion map cm gives the information about the number of shortest paths from all the graph nodes towards the sink that cross each node. The predecessor vector pred provides the direction that each node needs to follow in order to reach the sink. The distance map dm gives the distance between each node towards the sink.

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_ShowNodesIndex(g,w);//graph visualization
n=g.node_number;//graph size
sink=NARVAL_F_Random(n);//selection of the sink
[cm,np,pred]=NARVAL_R_SinkFlood(g,sink);//application of NARVAL_R_SinkFlood
cm
np
pred

Dependency

NARVAL_F_Remov, NARVAL_R_Dijkstra_i_j

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_ShowPath NARVAL NARVAL_R_TBellmanFord >>