<< NL_R_RPLDIO NL_R: Routing NL_R_RPLMultiPath >>

NARVAL >> NL_R: Routing > NL_R_RPLInitialization

NL_R_RPLInitialization

Initialize the RPL algorithm from a root node inside a graph.

Calling Sequence

[DAG,P,D,R] = NL_R_RPLInitialization(G,I,N)

Arguments

G :

Graph.

I :

Node index.

N :

Storage size.

DAG :

DAG vector.

P :

Predecessor vector.

D :

Distance vector.

R :

Rank vector.

Description

NL_R_RPLInitialization initializes the RPL algorithm from the root node I inside the graph G. Each node can store N routes towards the root node. DAG provides information about how nodes join the DAG. R provides the rank of each node in respect with each predecessor stored in its routing table (N).

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
[DA,pred,dist,ra]=NL_R_RPLInitialization(g,s,c)//application of NL_R_RPLInitialization

Report an issue
<< NL_R_RPLDIO NL_R: Routing NL_R_RPLMultiPath >>