Enrutamiento basado en el algoritmo de Dijkstra para una red de radio cognitiva
This paper presents the results of the evaluation of a routing protocol for cognitive radio network, based on Dijkstra’s algorithm, in which nodes seek the most optimal way, depending on the weights of each path or link. For development, we used Network Simulator 2 (NS2). This toolimplements the pro...
Main Authors: | Luis F. Pedraza, Danilo López, Octavio Salcedo |
---|---|
Format: | Article |
Language: | Spanish |
Published: |
Universidad Distrital Francisco Jose de Caldas
2011-12-01
|
Series: | Tecnura |
Subjects: | |
Online Access: | http://tecnura.udistrital.edu.co/downloads/revista30/conciencias/Articulo9-30.pdf |
Similar Items
-
Evaluación del establecimiento de la métrica de enrutamiento WCETT en una red de radio cognitiva
by: Gabriel A. Puerta A., et al.
Published: (2013-03-01) -
Maximización del Throughput en una red de radio cognitiva basado en la probabilidad de falsa alarma
by: Luis F. Pedraza, et al.
Published: (2011-12-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Calculating the Shortest Path Using Dijkstra’s Algorithm
by: Bekir Cevizci
Published: (2018-10-01) -
Shortest Path Search Futsal Field Location With Dijkstra Algorithm
by: Delpiah Wahyuningsih, et al.
Published: (2018-07-01)