Perform the AODV Route Request from a source node.
[m,r] = NARVAL_R_AodvRreq(g,s,d,TTL)
network graph.
source.
destination.
Time-to-Live.
RREQ packets storage matrix.
route storage matrix.
NARVAL_R_AodvRreq performs the AODV Route Request process from the source node s towards the destination node d inside the network graph g (WEB). The sequence number Id is assigned to the process in order to distinguish between old and fresh routes. 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 RREQs (respectivelly possible routes) is stored into the matrix m (respectivelly r) with the format [route|arrival|TTL|route length].
l=3;//number of lines c=4;//number of columns Lx=1000;//network area x-side Ly=1000;//network area x-side [g]=NARVAL_T_Grid(l,c,Lx,Ly);//application of NARVAL_T_Grid 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=1;//index of the route discovery Source=1;//source node Destination=7;//destination node [mat,routemat]=NARVAL_R_AodvRreq(g,Source,Destination,TTL);//application of NARVAL_R_AodvRreq mat routemat | ![]() | ![]() |
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