Please use this identifier to cite or link to this item: http://dspace.utpl.edu.ec/jspui/handle/20.500.11962/23312
Title: Protocolos de enrutamiento jerárquico bajo el Modelo de movilidad Manhattan en NS2
Authors: Luzón Yaguana, Francisco Javier
metadata.dc.contributor.advisor: Enciso Quispe, Liliana Elvira
Keywords: Protocolos de comunicación de datos.
Redes manet - Aplicaciones.
Ingeniero en sistemas informáticos y computación
metadata.dc.date.available: 2018-10-26T16:18:15Z
Issue Date: 2018
Citation: Luzón Yaguana, Francisco Javier. (2018). Protocolos de enrutamiento jerárquico bajo el Modelo de movilidad Manhattan en NS2. (Trabajo de Titulación de Ingeniero en Sistemas Informáticos y Computación ). UTPL, Loja.
Description: Abstract:At present, there is a great need for quick access to information and even without fixed infrastructure. This is an advantage offered by MANET networks with their dynamic and random mobile nodes. The present work shows the analysis, implementation and simulation of the hierarchical routing protocols under the Manhattan mobility model, through a comparative analysis of the routing protocols in an Ad-Hoc network. The implementation was made in the NS2.35 version. In which all configuration files were modified through the "Eclipse" tool so that they can run without errors, because the protocols analyzed did not appear in the selected version. The implemented protocols: are the hierarchical routing protocols BCHP, CBRP and the hybrid routing protocol ZRP. Once the implementation validation was done, the scenarios and connections with different numbers of nodes were defined, under which the simulations were carried out considering the following quality of service metrics: packet sending rate, performance, packet loss, delay average and protocol overload.
metadata.dc.identifier.other: 1284836
URI: http://dspace.utpl.edu.ec/handle/20.500.11962/23312
metadata.dc.type: bachelorThesis
Appears in Collections:Ingeniero en Sistemas Informáticos y Computación



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.