Contribución al diseño de protocolos de encaminamiento en redes móviles ad-hoc basados en reputación
- Autores: Lenin Bladimir Guaya Delgado
- Directores de la Tesis: Esteve Pallarès Segarra (dir. tes.)
- Lectura: En la Universitat Politècnica de Catalunya (UPC) ( España ) en 2019
- Idioma: español
- Tribunal Calificador de la Tesis: Marta Solera Delgado (presid.), Mónica Aguilar Igartua (secret.), José Flores Gómez (voc.)
- Programa de doctorado: Programa de Doctorado en Ingeniería Telemática por la Universidad Politécnica de Catalunya
- Materias:
- Texto completo no disponible (Saber más ...)
- Resumen
The mobile ad-hoc networks are part of the next generation access networks (Next Generation Networking o NGN), "all-IP" networks facing the great scientific and technical challenge that is the ubiquitous computing The mobile ad-hoc networks are useful in situations where rapid deployment is required in an area where there is no infrastructure. The nodes can act as sources, destinations or as routers to transmit data from one node to another node not accessible with a single jump In this thesis we present two new algorithms of reputation-based routing protocols, REMODE_sw (Reputation for Mobile Devices Static Weight) and DrepSR (Dynamic reputation-based Source Routing), which use DSR (Dynamic Source Routing) as a routing protocol engine. The REMODE_sw protocol (Reputation for Mobile Devices Static Weight) is static weight and DrepSR (Dynamic reputation-based Source Routing) is dynamic weight, the difference is in the behavior of beta, which is the weight that reputation values (of each network node) new have in relation to historical values, REMODE_sw (Reputation for Mobile Devices Static Weight) maintains a constant beta value, while DrepSR (Dynamic reputation-based Source Routing) based on the behavior of the variance (of the reputation of each node in the network), independently updates the beta values of each node in the network, achieving that the reputation values(of each node in the network) approximate their average value with greater speed, in order that the reputation system has more accurate information on the behavior of each node The two new algorithms estimate the RFVs (Reputation Forwarding Values) in an ad-hoc mobile network, the main thing is to be able to choose those paths that are formed by the nodes with greater reputation, thus avoiding the less collaborative nodes. Reputation estimation is done using only first-hand information available to the node based on its experience in the network.
For REMODE_sw (Reputation for Mobile Devices Static Weight) we have made the implementation of the algorithm on NS-2.35 (Network Simulator Version 2.35) using scenarios created with Bonnmotion v3.0, while for DrepSR (Dynamic reputation-based Source Routing) we have developed a simulator of an ad-hoc mobile network using MATLAB R2017b, inside this simulator we have implemented the algorithm DrepSR (Dynamic reputation-based Source Routing), likewise this simulation scenarios are created using Bonnmotionv3.0.
As a general conclusion we have verified that the two new algorithms truly identify the most cooperative paths, which implies an improvement of the total packet loss fraction (average of all the paths of the network), since that allows to avoid the selfish nodes of the network
