VANET simulation: connection between 1 vehicle to the closest Access Point.
NL_M_SimulationVanetRect(R,Rf,Rs,N1,N2,N3,N4,Nf,L,VM,T,TM,D,I)
Display radius of moving nodes.
Display radius of fixed nodes.
Display radius of the moving nodes belonging to the connection under studies.
Quantity of moving nodes on the road 1.
Quantity of moving nodes on the road 2.
Quantity of moving nodes on the road 3.
Quantity of moving nodes on the road 4.
Quantity of fixed nodes.
Network square area side.
Maximum speed.
Simulation duration.
Maximum time break.
Locality radius.
Window index.
NL_M_SimulationVanetRect simulates a simple Vehicular Network (VANET)
The mobility of nodes follows the random Way Point model (WIKIPEDIA). 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 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.