• Nenhum resultado encontrado

RouteSpray: A multiple-copy routing algorithm based on transit routes

N/A
N/A
Protected

Academic year: 2018

Share "RouteSpray: A multiple-copy routing algorithm based on transit routes"

Copied!
8
0
0

Texto

Loading

Imagem

Figure 2. Delivered messages in the network.
Figure 3. Comparison of the buffer occupancy of the three algorithms.

Referências

Documentos relacionados

In this paper, we will review the routing protocol in delay tolerant networks and compare the routing protocols that have been proposed specially for Vehicular Delay

In addition, we show multiple kernel k-means to be a special case of MKFC In this paper, a novel clustering algorithm using the 'kernel method' based on

In reactive routing protocols the routes are created only when source wants to send data to destination whereas proactive routing protocols are table driven.. Being a

Therefore, we propose a BRoadcast based Inter-Cluster routing protocol (BRIC) that provides the real-time vehicle information to support effective routing between

We demonstrated this by proposing a simulation based framework for on-demand source routing protocols that allows us to give a precise definition of routing security, to model the

In this routing protocol, each mesh router rapidly finds out multiple paths based upon hop count metric to the Internet gateways by routing protocol designing.. Each mesh

In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users

Routing is the critical issue in the MANET and focus based on routing protocols such as Ad hoc On-demand Distance Routing Protocol (AODV), Dynamic Source Routing (DSR),