• Aucun résultat trouvé

Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Broadcast-based Directional Routing in Vehicular Ad-Hoc Networks"

Copied!
7
0
0

Texte intégral

Loading

Figure

Fig. 1: Directional beamforming broadcast scheme A very wide angle provides some insurance that the message would reach its destination
Fig. 2: Network topology and distribution of implicated nodes in the transmissions
Fig. 4: Gain in bandwidth
Figure 10 represents the relative error of the model com- com-puted as follows:

Références

Documents relatifs

In certain languages (Rama, Bribri, Teribe, Costa Rican Guaymi, Panamanian Guaymi, Buglere, Cuna, Damana), this construction is the only one used for both meanings; in

6 represents the real available bandwidth on link (C, D), measured by adding a flow between both nodes and by evaluating its maximum achieved throughput that does not degrade the

MEDAL makes use of both the moving directions of vehicles and the destination location to select the next-hop vehicle for forwarding data, and allows a node to make a

Fig. 2 gives an example for illustrating effective neighbor selection. Assume that a source vehicle A within the dotted circle receives a data packet from its left vehicles

Quality of service forest (QoS-F) is a distributed algorithm to construct a forest of high quality links (or nodes) from net- work point of view, and use these for routing

SPADE: A Small Particle Detection Method Using A Dictionary Of Shapes Within The Marked Point Process Framework!. Nicolas Cedilnik, Eric Debreuve, Fabienne De Graeve, Florence

Reverse Path Forwarding Flooding [4] (RPF) augments the mechanism of CF by the requirement that a node may only forward a packet if the “previous hop” of the packet is on the

However, despite being a natural way of evaluating interpretability (Doshi-Velez and Kim, 2017), user-based experiments are not widespread in the machine learning literature (Bibal