<< MobilityDijkstra Network Topology Generator MobilityDijkstraWeight >>

Network Topology Generator >> Network Topology Generator > MobilityDijkstraMP

MobilityDijkstraMP

Perform the modified Dijkstra's algorithm on a network topology between two nodes in respect with given links weights.

Calling Sequence

[P1,P2,P3,P4,P5]=MobilityDijkstraMP(n,head,tail,weight,ni,nj,w)

Parameters

n :

network size.

head :

links head vector.

tail :

links tail vector.

weight :

links weight vector.

ni :

source node.

nj :

destination node.

w :

weight.

P1 :

first path.

P2 :

second path.

P3 :

third path.

P4 :

fourth path.

P5 :

fifth path.

Description

MobilityDijkstraMP performs the modified Dijkstra's Algorithm in order to find multiple paths between a source node ni and a destination node nj on a network topology. Weights of links are assumed to be stored in the vector weight. The generation of new paths is made according to iterative applications of the Dijkstra's algorithm on a changing topology where weights of links belonging to the current shortest path are changed to larger values.

Examples

n=80;//network size
L=1000;//network square area side
dmax=100;//locality radius
[g]=NtgLocalityConnex(n,L,dmax);//generation of a random topology in respect with the Locality method. 
[ni,nj]=Random_i_j(length(g.node_x));//selection of connection nodes
show_graph(g);
hilite_nodes([ni nj]);
[P1,P2,P3,P4,P5]=MobilityDijkstraMP(length(g.node_x),g.head,g.tail,g.edges.data.length,ni,nj,L);//Application of MobilityDijkstraMP
P1
P2
P3
P4
P5

Dependency

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact


<< MobilityDijkstra Network Topology Generator MobilityDijkstraWeight >>