<< NL_R_RPLPath NL_R: Routing NL_R_RPLRT >>

NARVAL >> NL_R: Routing > NL_R_RPLPlot

NL_R_RPLPlot

Highlight a DODAG tree generated by the RPL algorithm.

Calling Sequence

[Go] = NL_R_RPLPlot(G,P)

Arguments

G :

Graph.

P :

Predecessor vector.

:

Output graph.

Description

NL_R_RPLPlot highlights the DODAG tree generated by the RPL algorithm. The predecessor vector P is generated by the RPL algorithm started from a defined root node S.

Examples

n=80;//network size
l=1000;//network squared area side
d=150;//Locality radius
[g]=NL_T_LocalityConnex(n,l,d);//topology generation
ETX=5;
[v] = NL_F_RandVector0nminus1(length(g.head),ETX);//update of weigth
v=v+1;
g.edge_weight=g.edge_length;
g.edge_length=v;
xc=l/2;//area center
yc=l/2;
[s]=NL_G_NodeClose2XY(g,xc,yc)//root node
c=5;//5 possible routes
[pred,dist,ra,DAG,DIO]=NL_R_RPL(g,s,c);//RPL tree construction
[go]=NL_R_RPLPlot(g,pred);//application of NL_R_RPLPlot 
ind=1;//window index
f=NL_G_ShowGraphN(go,ind);//graph visualization

Dependency

NL_G_Nodes2Edge

Report an issue
<< NL_R_RPLPath NL_R: Routing NL_R_RPLRT >>