<< NARVAL_M_Mode1N2CAPMP NARVAL NARVAL_M_Neighborhood >>

NARVAL >> NARVAL > NARVAL_M_ModeVANETRect

NARVAL_M_ModeVANETRect

VANET simulation: connection between 1 vehicle to the closest Access Point.

Calling Sequence

NARVAL_M_ModeVANETRect(r,rf,rs,n1,n2,n3,n4,nf,L,vm,Tlim,Tmax,d,i)

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.

n1 :

quantity of moving nodes on the road 1.

n2 :

quantity of moving nodes on the road 2.

n3 :

quantity of moving nodes on the road 3.

n4 :

quantity of moving nodes on the road 4.

nf :

quantity of fixed nodes.

L :

network square area side.

vm :

maximum speed.

Tlim :

simulation duration.

Tmax :

maximum time break.

d :

locality radius.

i :

window index.

Description

NARVAL_M_ModeVANETRect simulates a simple Vehicular Network (VANET).

The mobility of nodes follows the random Way Point model (available destinations are the vertices of a rectangle). Vehicles are moving on 4 roads (2 roads for each direction). Nodes are randomly placed in each vertex at the beginning of the simulation (4 Access Points). 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 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*π] (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 the 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 closest Access Point according to the shortest path. The graph is plotted into the window i.

Examples

r=10;//display radius of moving nodes
rf=15;//display radius of fixed nodes
rs=15;//display radius of the moving nodes belonging to the connection under studies
n1=15;
n2=15;
n3=15;
n4=15;
L=1000;//network square area side
vm=10;//maximum speed
Tlim=100;//simulation duration
Tmax=20;//maximal waiting time
dmax=150;//Locality radius for the links attribution
ind=1;//window index
NARVAL_M_ModeVANETRect(r,rf,rs,n1,n2,n3,n4,L,vm,Tlim,Tmax,dmax,ind);//application of NARVAL_M_ModeVANETRect

Dependency

NARVAL_M_Random_i_j_nf, NARVAL_M_Graph2Plot, NARVAL_M_NodeRWPoint, NARVAL_M_XYExtractionB, NARVAL_M_Locality, NARVAL_M_Dijkstra, NARVAL_R_PredRoute

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_M_Mode1N2CAPMP NARVAL NARVAL_M_Neighborhood >>