Secure Dynamic Distributed Routing Algorithm for Ad Hoc Wireless Networks
Texte intégral
Figure
Documents relatifs
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
It is concluded that, both from the performance and the spatial re-use point-of-views, it can be taken advantage from the cross-layering between the physi- cal and the routing layers
In particular, thanks to the defined redundancy ratio metric, vehicles transmitters are able to dynamically adjust the probability of rebroadcast according to the
In a network running a link state routing protocol, the number of hops between any random source and destination increases when the neighborhood size decreases, this way augmenting
The performance used in the analysis is the time interval between route discoveries for a data transmission in. an on-demand
Le traitement percutané des kystes hydatiques rénaux a évité la morbidité de la chirurgie ouverte et préservé la fonction résiduelle du rein dans les séries
Each forward ant contains the IP address of its source node, the IP address of the destination node, a sequence number, a hop count field and a dynamically growing stack. The
At first, if E u 0 > 0, the node communicates its status to the central network controller (which uses the method presented in [6] for computing the data distribution