<< NL_M_Simulation1N2AllAP NL_M: Mobility NL_M_Simulation1N2CAPMP >>

NARVAL >> NL_M: Mobility > NL_M_Simulation1N2CAP

NL_M_Simulation1N2CAP

MANET simulation: connection between 1 node towards the closest Access Points.

Calling Sequence

NL_M_Simulation1N2CAP(R,Rf,Rs,N,Nf,L,VM,T,TM,D,I)

Arguments

R :

Display radius of moving nodes.

:

Display radius of fixed nodes.

:

Display radius of the moving nodes belonging to the connection under studies.

N :

Quantity of moving nodes.

:

Quantity of fixed nodes.

L :

Network square area side.

:

Maximum speed.

T :

Simulation duration.

:

Maximum time break.

D :

Locality radius.

I :

Window index.

Description

NL_M_Simulation1N2AllAP simulates Mobile Ad hoc NETworks (MANETs).

The mobility of nodes follows the random Way Point model (WIKIPEDIA). The network geographic area is composed by a square of side L where each mobile node is allowed to move. N+Nf nodes are randomly placed in this region at the beginning of the simulation (Nf static Access Points and N mobile nodes). The location of each node is defined in respect with its coordinates (X,Y) at the time T. As a matter of course the couple of parameters (X,Y) will continuously change according to the movement of nodes that consists of successive displacements between selected waypoints. Thus each node moves from the given waypoint to the new destination waypoint . For that a direction (respectively a velocity) is randomly chosen inside the range [0:2*π] (respectively ). We assume that displacements are done along straight lines because we consider there a free space where the geodesic between two positions corresponds to the direct segment between them. When reaches its current destination waypoint , it stays there during the time period randomly selected inside the range . After this waiting time, the node restarts its displacement process by selecting a new destination waypoint, a new speed and so on. The node under studies tries to establish a connection towards the closest Access Points according to the shortest paths performed by the Dijkstra's algorithm. The graph is plotted into the window I.

Examples

r=10;//display radius of moving nodes
rf=15;//display radius of fixed nodes
rs=20;//display radius of the moving nodes belonging to the connection under studies
n=50;//quantity of moving nodes
nf=5;//quantity of fixed nodes
L=1000;//network square area side
vm=20;//maximum speed
Tlim=100;//simulation duration
Tmax=100;//maximal waiting time
dmax=180;//Locality radius for the links attribution
ind=1;//window index
NL_M_Simulation1N2CAP(r,rf,rs,n,nf,L,vm,Tlim,Tmax,dmax,ind);//application of NL_M_Simulation1N2CAP

Dependency

NL_F_RandIntNiNjNf, NL_M_GraphAnimation, NL_M_NodeRWP, NL_F_XYExtraction, NL_M_Locality, NL_R_DijkstraHT, NL_R_PredecessorRoute

Report an issue
<< NL_M_Simulation1N2AllAP NL_M: Mobility NL_M_Simulation1N2CAPMP >>