<< NARVAL_M_Mode1N2CAP NARVAL NARVAL_M_ModeVANETRect >>

NARVAL >> NARVAL > NARVAL_M_Mode1N2CAPMP

NARVAL_M_Mode1N2CAPMP

MANET simulation: connection between 1 node to the close Access Point in respect with multiple paths.

Calling Sequence

NARVAL_M_Mode1N2CAPMP(r,rf,rs,n,nf,L,ts,vm,Tlim,Tmax,dmax,ind)

Parameters

r :

display radius of moving nodes.

rf :

display radius of fixed nodes.

rs :

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

n :

quantity of moving nodes.

nf :

quantity of fixed nodes.

L :

network square area side.

ts :

maximum time break.

vm :

maximum speed.

Tlim :

simulation duration.

Tmax :

maximal waiting time at a POI.

dmax :

locality radius.

ind :

window index.

Description

NARVAL_M_Mode1N2CAP simulates Mobile Ad hoc NETworks (MANETs).

The mobility of nodes follows the random Way Point model. 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 Point) 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 node movement that consists of successive displacements between selected waypoints. Thus each node Ni moves from a given waypoint (xi,yi) to a new destination waypoint (xdi,ydi). For that a direction (respectively a velocity) is randomly chosen inside the range [0:2*%pi] (respectively [vmin:vmax]). 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 Ni reaches its current destination waypoint (xdi,ydi), it stays there during a time period ti randomly selected inside the range [Tmin:Tmax]. 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 close Access Point according to multiple paths. The graph is plotted into the window ind.

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
ts=20;//maximum time break
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
NARVAL_M_Mode1N2CAPMP(r,rf,rs,n,nf,L,ts,vm,Tlim,Tmax,dmax,ind);//Application of NARVAL_M_Mode1N2CAPMP

Dependency

NARVAL_M_Random_i_j_nf, NARVAL_M_Graph2Plot, NARVAL_M_NodeRWP, NARVAL_M_XYExtraction, NARVAL_M_Locality, NARVAL_M_Dijkstra, NARVAL_M_DijkstraMP

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact

<< NARVAL_M_Mode1N2CAP NARVAL NARVAL_M_ModeVANETRect >>