Initialize the emission of RREQ packets from a source node inside a network (AODV).
[m,np] = NARVAL_R_AodvRreqInit(g,s,d,TTL)
network graph.
source.
destination.
Time-to-Live.
RREQ packets storage matrix.
quantity of RREQ packets on the network.
NARVAL_R_AodvRreqInit initializes the emission of RREQ packets from the source node s inside the network g towards the destination node d (WEB). The route discovery is defined by the sequence number ID used to distinct old and new routes. The research range is defined by the maximum hop value TTL. The research is limited by the maximal quantity of nodes TTL that a discovery packet can cross before its rejection by the network. The set of possible routes is stored into the matrix m ([route|arrival|TTL|route length]). The current quantity of RREQ packets rates np.
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);//generation of routing tables //rti=final routing table of node i TTL=5;//research Time-To-Live ID=0;//index of the route discovery Source=1;//source node Dest=5;//destination node [RREQmat,np]=NARVAL_R_AodvRreqInit(g,Source,Dest,TTL);//application of NARVAL_R_AodvRreqInit RREQmat np | ![]() | ![]() |
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