• Aucun résultat trouvé

Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks"

Copied!
7
0
0

Texte intégral

Loading

Références

Documents relatifs

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

It follows from the Plancherel-Parseval theorem (see e.g. The results of Propositions 3.3 and 3.2 follow now from Fact A.1 and the particular form of the Laplace transform of

In this case, with a point-to-point model, the MANET interface would not attach to a single link as it should, but to several links at the same time (one per neighbor), a situation

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

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

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

In the basic DCF scheme in IEEE 802.11 for ad hoc networks, the contention window CW is reset to its min- imum value CWmin after each successful transmission and doubled when

For the interaction between the Ana4 system in the Linux kernel and the MagAntA routing daemon in user space, we make use of a new version of Ana4 [233], developed at DTL, in which