SciELO - Scientific Electronic Library Online

 
vol.9 número4Un método de Discretización Supervisada para Variables Cuantitativas y Cualitativas Ordenadas índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

  • No hay artículos similaresSimilares en SciELO

Compartir


Computación y Sistemas

versión On-line ISSN 2007-9737versión impresa ISSN 1405-5546

Resumen

AQUINO S, Raúl  y  B, Arthur Edwards. A Reactive Location Routing Algorithm with Cluster-Based Flooding for Inter-Vehicle Communication. Comp. y Sist. [online]. 2006, vol.9, n.4, pp.297-313. ISSN 2007-9737.

In this paper, we present a reactive location routing algorithm with cluster-based flooding for inter-vehicle communication. We consider a motorway environment with associated high mobility and compare position-based and non-position-based routing strategies, along with a limiting function for flooding mechanisms in reactive ad-hoc protocols. The performance of Dynamic Source Routing (DSR) and Ad-Hoc On-demand Distance Vector Routing (AODV) for non-positional and Location Routing Algorithm with Cluster-Based Flooding (LORA_CBF) for positional algorithms is considered. First, for small-scale networks, our research validates our proposed simulation model with the results of a test bed and the results of mathematical analysis. Then, for large-scale networks, we use simulations to compare our model with both the AODV and DSR reactive routing algorithms. Finally, we use a microscopic traffic model, developed in OPNET, to ascertain the mobility of 250 vehicles on a motorway with regards to average Route Discovery (RD) time, End-to-End Delay (EED), Routing Load, Routing Overhead, Overhead, and Delivery Ratio.

Palabras llave : nicast routing; multi-hop wireless networks; inter-vehicular data exchange; ad-hoc networks; location routing algorithm with cluster-based flooding.

        · resumen en Español     · texto en Inglés

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons