<< NARVAL_R_AodvPath NARVAL NARVAL_R_AodvRerr >>

NARVAL >> NARVAL > NARVAL_R_AodvRTables

NARVAL_R_AodvRTables

Initiate the routing table of each node inside a network (AODV).

Calling Sequence

NARVAL_R_AodvRTables(g,rs)

Parameters

g :

network graph.

rs :

vector of each node's routing table size.

Description

NARVAL_R_AodvRTables initiates the routing table rti of each node i inside the network represented by its connectivity graph g. These local routing table will be used by the AODV algorithm (WEB). The routing table rti of the node i can store rs(i) routes. Each route information is stored in a single line inside the matrix rs at the ith line and it is composed by 4 elements ([Node|Next Hop|Seq number|Hop Count]). Routing tables are global variables.

Examples

name='network';//graph name
node_number=5;//quantity of nodes
tail=[2 3 3 4 5 5];//head vector (links)
head=[1 1 2 2 2 4];//tail vector (links)
node_x=[100 500 300 700 900];//x-coordinates of nodes
node_y=[500 500 900 100 500];//y-coordinates of nodes
[g]=NARVAL_G_MakeGraph(name,node_number,tail,head,node_x,node_y);//generation of a topology with 3 nodes
w=1;//window index
f1=NARVAL_G_ShowNodesIndex(g,w);//graph visualization
for i=1:g.node_number
global ('rt'+string(i));//creation of empty routing tables
end
bss=10;//maximum buffer size
bs=bss*ones(1,g.node_number);//buffer matrix
NARVAL_R_AodvRTables(g,bs);//application of NARVAL_R_AodvRTables
rt1

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_AodvPath NARVAL NARVAL_R_AodvRerr >>