Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The quantity of nodes is used in the normalization process.
[t,tn]=TopologyRecDijkstraMS(g,s,w)
network graph.
network sources.
window index.
evolution of the quantity of the discovered nodes in the topology.
vector of discovered nodes.
TopologyRecDijkstraMS discovers the topology g in respect with the route extracted from multiple sources s by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The others are the basic users. The normalized topology recovery metric rating d/D is performed. d is the current quantity of links already discovered and D corresponds to the total amount of topology links. This function is plotted with a normalized scale e.g. the quantity of network targets divided by the network size. Then the quantity of nodes is used in the normalization process. An interesting feature lies on the slope of the curve tangent at the origin. In fact a larger value corresponds to the ability to discover the network topology in a faster way. The line i of t represents the quantity of known topology nodes from the discovery process that started from the nodes s. Targets are randomly selected inside the network. tn gathers the chronological order of the nodes discovery.
n=100;//network size l=1000;//network squared area side d=100;//Locality radius [g]=NtgLocalityConnex(n,l,d);//generation of a topology show_graph(g); ns=5;//quantity of sources c=1:length(g.node_x);//real network size s=[];//generation of network sources for i=1:ns [k,c]=RandWtRepl(c); s=[s k]; end w=1;//window index [t,tn]=TopologyRecDijkstraMS(g,s,w);//application of TopologyRecDijkstraMS s t tn |  |  |
