• Aucun résultat trouvé

Efficient packet transmission in wireless ad hoc networks with partially informed nodes

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Efficient packet transmission in wireless ad hoc networks with partially informed nodes"

Copied!
20
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Loading

Figure

Fig. 1 In this example, the focus is on what node 1 does to allow node S (source) to route its packets to node D (destination)
Table 1 Simulation settings
Fig. 2 Achievable utility region under various scenarios of information for the nodes: global CSI, local CSI, and no CSI
Figure 4 depicts the evolution of the packet forward- forward-ing rate for SARA, ICARUS, and GTFT for a network of 50 nodes
+3

Références

Télécharger maintenant ( PDF - 20 Page - 1.41 MB )

Documents relatifs

Is there an optimum in ad-hoc networks?

The segment of the wireless ad-hoc network consisted of four nodes: two wireless Wi-Fi routers with special software installed and two computers used to measure the

Security in wireless ad hoc networks

• Security requirements in MANET are stronger than in “classical” networks. • MANET networking still is a

Non cooperative forwarding in ad hoc networks

As already observed in many papers that consider noncooperative behavior in Ad-hoc networks, if we restrict to simplistic policies in which each mobile determines a fixed probability

Some game-theoretic problems in wireless ad hoc networks

As already observed in many papers that consider noncooperative behavior in Ad-hoc networks, if we restrict to simplistic policies in which each mobile determines a fixed probability

The IP source address in the packet, seen at the US server, is

Question 10 Bart’s smartphone, at EPFL, receives an IP packet from a server in the US.. The IP source address in the packet (seen at Bart’s smartphone) is the IP address

INTRODUCTION Key establishment is the heart of data protection that relies on cryptography, and it is an essential component of the packet protection mechanisms described in [RFC2401], for example

group GRP, first authentication choice (which must be the public key encryption algorithm used to encrypt the payload), lack of perfect forward secrecy for protecting

One of the cornerstones of the Brunn-Minkowski theory is the Minkowski problem

The logarithmic Minkowski problem asks for necessary and sufficient conditions for a finite Borel measure on the unit sphere so that it is the cone-volume measure of a convex

2 Formulation of the problem

The technique used here will allow us using geomet- rical interpretation of quantities of the type of d 0 and d 1 to derive stability results concerning this type of behavior for