SciELO - Scientific Electronic Library Online

 
vol.36 número3Modelación matemática para el control de la postcombustión en un horno de reducción de níquelAnálisis de la respuesta temporal del diseño de un controlador de SSRAM índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

  • No hay articulos citadosCitado por SciELO

Links relacionados

  • No hay articulos similaresSimilares en SciELO

Compartir


Ingeniería Electrónica, Automática y Comunicaciones

versión On-line ISSN 1815-5928

Resumen

ORTIZ GUERRA, Erik  y  ALFONSO REGUERA, Vitalio. Rendezvous algorithms for cognitive radio networks. EAC [online]. 2015, vol.36, n.3, pp. 35-45. ISSN 1815-5928.

Cognitive radio is a promising paradigm to address the scarcity of radio spectrum as well as for efficient usage. The rendezovus process allows two cognitive users to meet on the same channel and establish a communication link. This work focuses on the study and comparison of different rendezvous algorithms proposed in the literature. We present the major rendezvuos challenges in the context of cognitive networks as well as the main metrics used for evaluation. Through simulation, we evaluate the performance of a group of rendezvous algorithms in practical scenarios and the results are contrasted with the theoretical results given by the authors. The simulation results show that for most of the rendezvous algorithms proposed in the literature the theoretical results provided by the authors are far from the real results achieved by the algorithms. Additionally, in symmetric scenarios, the EJS algorithm has the better results in terms of ETTR and MTTR, while in asymmetric scenarios the FRCH and SSB algorithms outperform the others rendezvous strategies.

Palabras clave : Cognitive radio networks; blind rendezvous; rendezvous algorithm.

        · resumen en Español     · texto en Español     · Español ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License