A Dynamic Reputation Management System for Mobile Ad Hoc Networks

This is an open access article distributed under the Creative Commons Attribution License (cc BY 4.0) https://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nodes in mobile ad hoc networks (MANETs) are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the networkPeer reviewedFinal Published versio

A reactive algorithm for deducing nodal forwarding behavior in a multihop ad hoc wireless network in the presence of errors

A novel algorithm is presented to deduce individual nodal forwarding behavior from standard end to end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, in which it performed well in a difficult environment and achieved sound results

A Composite Trust Model for Secure Routing in Mobile Ad-Hoc Networks

It is imperative to address the issue of secure routing in mobile ad-hoc networks (MANETs) where the nodes seek for cooperative and trusted behaviour from the peer nodes in the absence of well-established infrastructure and centralized authority. Due to the inherent absence of security considerations in the traditional ad-hoc routing protocols, providing security and reliability in the routing of data packets is a major challenge. This work addresses this issue by proposing a composite trust metric based on the concept of social trust and quality-of-service (QoS) trust. Extended from the ad-hoc on-demand distance vector (AODV) routing protocol, we propose an enhanced trust-based model integrated with an attack-pattern discovery mechanism, which attempts to mitigate the adversaries craving to carry out distinct types of packet-forwarding misbehaviours. We present the detailed mode of operations of three distinct adversary models against which the proposed scheme is evaluated. Simulation results under different network conditions depict that the combination of social and QoS trust components provides significant improvement in packet delivery ratio, routing overhead, and energy consumption compared to an existing trust-based scheme

A Robust Dirichlet Reputation and Trust Evaluation of Nodes in Mobile Ad Hoc Networks

© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/)The distributed nature of mobile ad hoc networks (MANETs) presents security challenges and vulnerabilities which sometimes lead to several forms of attacks. To improve the security in MANETs, reputation and trust management systems (RTMS) have been developed to mitigate some attacks and threats arising from abnormal behaviours of nodes in networks. Generally, most reputation and trust systems in MANETs focus mainly on penalising uncooperative network nodes. It is a known fact that nodes in MANETs have limited energy resources and as such, the continuous collaboration of cooperative nodes will lead to energy exhaustion. This paper develops and evaluates a robust Dirichlet reputation and trust management system which measures and models the reputation and trust of nodes in the network, and it incorporates candour into the mode of operations of the RTMS without undermining network security. The proposed RTMS employs Dirichlet probability distribution in modelling the individual reputation of nodes and the trust of each node is computed based on the node’s actual network performance and the accuracy of the second-hand reputations it gives about other nodes. The paper also presents a novel candour two-dimensional trustworthiness evaluation technique that categorises the behaviours of nodes based on their evaluated total reputation and trust values. The evaluation and analyses of some of the simulated behaviours of nodes in the deployed MANETs show that the candour two-dimensional trustworthiness evaluation technique is an effective technique that encourages and caters to nodes that continuously contribute to the network despite the reduction in their energy levels.Peer reviewedFinal Published versio

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

Nodes in mobile ad hoc networks (MANETs) are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network

Contribución al diseño de protocolos de encaminamiento en redes móviles ad-hoc basados en reputación

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.Las redes móviles ad-hoc son parte de las redes de acceso de próxima generación (Next Generation Networking o NGN), redes “all-IP” que hacen frente al gran desafío científico y técnico que es la computación ubicua Las redes móviles ad-hoc son útiles en situaciones donde se requiere un rápido despliegue en una zona en la que no hay infraestructura. Los nodos pueden actuar como fuentes, destinos o como encaminadores para transmitir datos de un nodo a otro nodo no accesible con un único salto En esta tesis presentamos dos nuevos algoritmos de protocolos de encaminamiento basados en reputación, REMODE_sw (Reputation for Mobile Devices Static Weight) y DrepSR (Dynamic reputation-based Source Routing), los cuales utilizan DSR (Dynamic Source Routing) como motor de protocolo de encaminamiento. El protocolo REMODE_sw (Reputation for Mobile Devices Static Weight) es de peso estático y DrepSR (Dynamic reputation-based Source Routing) es de peso dinámico, la diferencia se encuentra en el comportamiento de beta, el cual es el peso que los valores de reputación (de cada nodo de la red) nuevos tienen en relación a los valores históricos, REMODE_sw (Reputation for Mobile Devices Static Weight) mantiene un valor de beta constante, mientras que DrepSR (Dynamic reputation-based Source Routing) en base al comportamiento de la varianza (de la reputación de cada nodo de la red), actualiza de forma independiente los valores de beta de cada nodo de la red, consiguiendo que los valores de reputación (de cada nodo de la red) se aproximen a su valor medio con mayor rapidez, con la finalidad de que el sistema de reputación cuente con información más precisa sobre el comportamiento de cada nodo Los dos nuevos algoritmos estiman las RFVs (Reputation Forwarding Values) en una red móvil ad-hoc, lo primordial es poder elegir aquellos caminos que son formados por los nodos con mayor reputación, evitando así los nodos menos colaborativos. La estimación de la reputación se realiza utilizando únicamente información de primera mano disponible para el nodo en función de su experiencia en la red Para REMODE_sw (Reputation for Mobile Devices Static Weight) hemos realizado la implementación del algoritmo sobre NS-2.35 (Network Simulator Version 2.35) utilizando escenarios creados con Bonnmotion v3.0, mientras que para DrepSR (Dynamic reputation-based Source Routing) hemos desarrollado un simulador de una red móvil ad-hoc utilizando MATLAB R2017b, dentro de dicho simulador hemos implementado el algoritmo DrepSR (Dynamic reputation-based Source Routing), igualmente estos escenarios de simulación se crean utilizando Bonnmotion v3.0 Como conclusión general hemos podido comprobar que los dos nuevos algoritmos verdaderamente identifican los caminos más cooperativos, lo que supone una mejora de la fracción de pérdida de paquetes total (promedio de todos los caminos de la red), ya que permite evitar los nodos egoístas de la red.Les xarxes mòbils ad hoc són part de les xarxes d'accés de pròxima generació (Next Generation Networking o NGN), xarxes "all IP" que fan front al gran desafiament científic i tècnic que és la computació ubiqua Les xarxes mòbils ad hoc són útils en situacions on es requereix un ràpid desplegament en una zona en la qual no hi ha infraestructura. Els nodes poden actuar com a fonts, destinacions o com encaminaments per transmetre dades d'un node a un altre node no accessible amb un únic salt En aquesta tesi presentem dos nous algoritmes de protocols d'encaminament basats en reputació, REMODE_sw (Reputation for Mobile Devices Static Weight) i DrepSR (Dynamic reputation based Source Routing), els quals utilitzen DSR (Dynamic Source Routing) com a motor de protocol d'encaminament. El protocol REMODE_sw (Reputation for Mobile Devices Static Weight) és de pes estàtic i DrepSR (Dynamic reputation based Source Routing) és de pes dinàmic, la diferència es troba en el comportament de beta, el qual és el pes que els valors de reputació (de cada node de la xarxa) nous tenen en relació als valors històrics, REMODE_sw (Reputation for Mobile Devices Static Weight) manté un valor de beta constant, mentre que DrepSR (Dynamic reputation based Source Routing) sobre la base del comportament de la variància (de la reputació de cada node de la xarxa), s'actualitza de forma independent els valors de beta de cada node de la xarxa, aconseguint que els valors de reputació (de cada node de la xarxa) s'aproximin al seu valor mitjà amb major rapidesa, amb la finalitat que el sistema de reputació compti amb informació més precisa sobre el comportament de cada node Els dos nous algoritmes estimen les RFVs (Reputation Forwarding Values) en una xarxa mòbil ad hoc, el primordial és poder triar aquells camins que són formats pels nodes amb més reputació, evitant així els nodes menys col·laboratius. L'estimació de la reputació es realitza utilitzant únicament informació de primera mà disponible per al node en funció de la seva experiència a la xarxa Per REMODE_sw (Reputation for Mobile Devices Static Weight) hem realitzat la implementació de l'algoritme sobre NS 2.35 (Network Simulator Version 2.35) utilitzant escenaris creats amb Bonnmotion v3.0, mentre que per DrepSR (Dynamic reputation--based Source Routing) hem desenvolupat un simulador d'una xarxa mòbil ad--hoc utilitzant MATLAB R2017b, dins d'aquest simulador hem implementat l'algoritme DrepSR (Dynamic reputation--based Source Routing), igualment en aquest simulador s'han utilitzant escenaris creats en Bonnmotion v3.0 Com a conclusió general hem pogut comprovar que els dos nous algoritmes veritablement identifiquen els camins més cooperatius, fet que suposa una millora de la fracció de pèrdua de paquets total (mitjana de tots els camins de la xarxa), ja que permet evitar els nodes egoistes de la xarxaPostprint (published version

Contribución al diseño de protocolos de encaminamiento en redes móviles ad-hoc basados en reputación

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.Las redes móviles ad-hoc son parte de las redes de acceso de próxima generación (Next Generation Networking o NGN), redes “all-IP” que hacen frente al gran desafío científico y técnico que es la computación ubicua Las redes móviles ad-hoc son útiles en situaciones donde se requiere un rápido despliegue en una zona en la que no hay infraestructura. Los nodos pueden actuar como fuentes, destinos o como encaminadores para transmitir datos de un nodo a otro nodo no accesible con un único salto En esta tesis presentamos dos nuevos algoritmos de protocolos de encaminamiento basados en reputación, REMODE_sw (Reputation for Mobile Devices Static Weight) y DrepSR (Dynamic reputation-based Source Routing), los cuales utilizan DSR (Dynamic Source Routing) como motor de protocolo de encaminamiento. El protocolo REMODE_sw (Reputation for Mobile Devices Static Weight) es de peso estático y DrepSR (Dynamic reputation-based Source Routing) es de peso dinámico, la diferencia se encuentra en el comportamiento de beta, el cual es el peso que los valores de reputación (de cada nodo de la red) nuevos tienen en relación a los valores históricos, REMODE_sw (Reputation for Mobile Devices Static Weight) mantiene un valor de beta constante, mientras que DrepSR (Dynamic reputation-based Source Routing) en base al comportamiento de la varianza (de la reputación de cada nodo de la red), actualiza de forma independiente los valores de beta de cada nodo de la red, consiguiendo que los valores de reputación (de cada nodo de la red) se aproximen a su valor medio con mayor rapidez, con la finalidad de que el sistema de reputación cuente con información más precisa sobre el comportamiento de cada nodo Los dos nuevos algoritmos estiman las RFVs (Reputation Forwarding Values) en una red móvil ad-hoc, lo primordial es poder elegir aquellos caminos que son formados por los nodos con mayor reputación, evitando así los nodos menos colaborativos. La estimación de la reputación se realiza utilizando únicamente información de primera mano disponible para el nodo en función de su experiencia en la red Para REMODE_sw (Reputation for Mobile Devices Static Weight) hemos realizado la implementación del algoritmo sobre NS-2.35 (Network Simulator Version 2.35) utilizando escenarios creados con Bonnmotion v3.0, mientras que para DrepSR (Dynamic reputation-based Source Routing) hemos desarrollado un simulador de una red móvil ad-hoc utilizando MATLAB R2017b, dentro de dicho simulador hemos implementado el algoritmo DrepSR (Dynamic reputation-based Source Routing), igualmente estos escenarios de simulación se crean utilizando Bonnmotion v3.0 Como conclusión general hemos podido comprobar que los dos nuevos algoritmos verdaderamente identifican los caminos más cooperativos, lo que supone una mejora de la fracción de pérdida de paquetes total (promedio de todos los caminos de la red), ya que permite evitar los nodos egoístas de la red.Les xarxes mòbils ad hoc són part de les xarxes d'accés de pròxima generació (Next Generation Networking o NGN), xarxes "all IP" que fan front al gran desafiament científic i tècnic que és la computació ubiqua Les xarxes mòbils ad hoc són útils en situacions on es requereix un ràpid desplegament en una zona en la qual no hi ha infraestructura. Els nodes poden actuar com a fonts, destinacions o com encaminaments per transmetre dades d'un node a un altre node no accessible amb un únic salt En aquesta tesi presentem dos nous algoritmes de protocols d'encaminament basats en reputació, REMODE_sw (Reputation for Mobile Devices Static Weight) i DrepSR (Dynamic reputation based Source Routing), els quals utilitzen DSR (Dynamic Source Routing) com a motor de protocol d'encaminament. El protocol REMODE_sw (Reputation for Mobile Devices Static Weight) és de pes estàtic i DrepSR (Dynamic reputation based Source Routing) és de pes dinàmic, la diferència es troba en el comportament de beta, el qual és el pes que els valors de reputació (de cada node de la xarxa) nous tenen en relació als valors històrics, REMODE_sw (Reputation for Mobile Devices Static Weight) manté un valor de beta constant, mentre que DrepSR (Dynamic reputation based Source Routing) sobre la base del comportament de la variància (de la reputació de cada node de la xarxa), s'actualitza de forma independent els valors de beta de cada node de la xarxa, aconseguint que els valors de reputació (de cada node de la xarxa) s'aproximin al seu valor mitjà amb major rapidesa, amb la finalitat que el sistema de reputació compti amb informació més precisa sobre el comportament de cada node Els dos nous algoritmes estimen les RFVs (Reputation Forwarding Values) en una xarxa mòbil ad hoc, el primordial és poder triar aquells camins que són formats pels nodes amb més reputació, evitant així els nodes menys col·laboratius. L'estimació de la reputació es realitza utilitzant únicament informació de primera mà disponible per al node en funció de la seva experiència a la xarxa Per REMODE_sw (Reputation for Mobile Devices Static Weight) hem realitzat la implementació de l'algoritme sobre NS 2.35 (Network Simulator Version 2.35) utilitzant escenaris creats amb Bonnmotion v3.0, mentre que per DrepSR (Dynamic reputation--based Source Routing) hem desenvolupat un simulador d'una xarxa mòbil ad--hoc utilitzant MATLAB R2017b, dins d'aquest simulador hem implementat l'algoritme DrepSR (Dynamic reputation--based Source Routing), igualment en aquest simulador s'han utilitzant escenaris creats en Bonnmotion v3.0 Com a conclusió general hem pogut comprovar que els dos nous algoritmes veritablement identifiquen els camins més cooperatius, fet que suposa una millora de la fracció de pèrdua de paquets total (mitjana de tots els camins de la xarxa), ja que permet evitar els nodes egoistes de la xarx