• Aucun résultat trouvé

Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Localized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks"

Copied!
22
0
0

Texte intégral

Loading

Figure

Figure 1: Some message splitting strategies for geographic multicast routing: s is the source node and T = { t 1 , t 2 } the set of destinations.
Figure 2: A unit disk graph G = (V, E) and two subgraphs.
Figure 3: The message splitting strategy used by MSTEAM: ∆(s, t 1 , t 2 , t 3 , t 4 ) is used to split the message at node s.
Figure 4: Minimum spanning tree based face multicast routing is used in order to recover from concave nodes.
+6

Références

Documents relatifs

A Dominating Sets and Target Radius Based Localized Activity Scheduling and Minimum Energy Broadcast Protocol for Ad Hoc and Sensor Networks... The Third Annual Mediterranean Ad

In this paper, we describe KanGuRou, the first position-based energy efficient k-anycast routing which guarantees the packet delivery to k sinks as long as the connected component

If a malicious router can obtain the (source IP, sequence number) of a packet, it can inject (invalid) packets with exactly the same identification information into the network..

Used by all RSS algorithms, indirect jamming of NHDP is a threat to every SMF router: a malicious router can generate plausible control traffic to in turn trigger receiving routers

1) Pre-play Attack: If a malicious router can obtain the (source IP, sequence number) of a packet, it can inject (invalid) packets with exactly the same identification information

Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

1) Individual Tasks: The first step is to characterize the task set on our platform to assign task deadlines and task chains end-to-end deadlines, as MiBench does not include

Les figures ci-dessous représentent respectivement l’histogramme de déformation, la courbe de distribution de déformation et la variation des déformations en fonction du