La qualité de service des services multimédia sur les réseaux ad hoc sans fil à multi-sauts

Notre objectif est d’améliorer la performance d’un réseau mobile Ad Hoc à multi-sauts en essayant d’avoir une meilleure qualité de service en contrôlant le délai de bout en bout, la gigue des services multimédia et de plus réduire les pertes. En fait, nous ajouterons un correcteur d’erreurs de type FEC (Forward Error Correction), le Reed Solomon, au réseau MANET afin de minimiser le nombre d’erreurs causées par les différents problèmes tels que les problèmes des noeuds cachés et la réduction de la puissance. En outre, nous appliquerons le mode EDCA (Enhanced Distributed Channel Access) qui est un protocole d'accès au medium utilisé dans la norme IEEE 802.11e qui permet d’appliquer une différenciation de services sur les réseaux sans fils afin d’avoir une certaine QoS dans le réseau. Vu que les stations d’un réseau MANET sont réduites dans leur capacité de traitement, il est important d’utiliser le minimum de méthodes, à savoir la QoS seule, le FEC seul ou les deux de façon combinée qui apporteront la QoS requise. La simulation a été utilisée pour analyser le réseau MANET sous les conditions requérant la QoS et nous avons appliqué les méthodes mentionnées précédemment pour mesurer notre approche. Le logiciel utilisé est l’OPNET 14.0. Les résultats montrent une amélioration dans la performance du réseau

Previous hop routing: exploiting opportunism in VANETs

Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path between peers in such network environment is difficult. In this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding protocol exploiting previous hop information and distance to destination to make the forwarding decision on a packet-by-packet basis. It is intended for use in highly dynamic network where the life time of a hop-by-hop path between source and destination nodes is short. Exploiting the broadcast nature of wireless communication avoids the need to copy packets, and enables redundant paths to be formed. To save network resources, especially under high network loads, PHR employs probabilistic forwarding. The forwarding probability is calculated based on the perceived network load as measured by the arrival rate at the network interface. We evaluate PHR in an urban VANET environment using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to re ect real-world conditions. The simulation scenarios are configured to use two velocity profiles i.e. Low and high velocity. The results show that the PHR networks able to achieve best performance as measured by Packet Delivery Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing protocols in high velocity scenarios

Simulation and Evaluation of Wired and Wireless Networks with NS2, NS3 and OMNET++

Communication systems are emerging rapidly with the revolutionary growth in terms of networking protocols, wired and wireless technologies, user applications and other IEEE standards. Numbers of industrial as well as academic organizations around the globe are bringing in light new innovations and ideas in the field of communication systems. These innovations and ideas require intense evaluation at initial phases of development with the use of real systems in place. Usually the real systems are expensive and not affordable for the evaluation. In this case, network simulators provide a complete cost-effective testbed for the simulation and evaluation of the underlined innovations and ideas. In past, numerous studies were conducted for the performance evaluation of network simulators based on CPU and memory utilization. However, performance evaluation based on other metrics such as congestion window, throughput, delay, packet delivery ratio and packet loss ratio was not conducted intensively. In this thesis, network simulators such as NS2, NS3 and OMNET++ will be evaluated and compared for wired and wireless networks based on congestion window, throughput, delay, packet delivery and packet loss ratio. In the theoretical part, information will be provided about the wired and wireless networks and mathematical interpretation of various components used for these networks. Furthermore, technical details about the network simulators will be presented including architectural design, programming languages and platform libraries. Advantages and disadvantages of these network simulators will also be highlighted. In the last part, the details about the experiments and analysis conducted for wired and wireless networks will be provided. At the end, findings will be concluded and future prospects of the study will be advised.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

Avaliação do impacto nas métricas de desempenho de protocolos de roteamento em redes MANET: [dissertação]

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.As promessas das redes móveis Wireless em resolver problemas do mundo virtual continuam chamando a atenção dos projetos de pesquisas industriais e acadêmicos. O aumento da performance dos computadores e da tecnologia de comunicação Wireless é notável. Também evidencia-se a necessidade de mobilidade e conectividade que o mundo moderno impõe. A maior parte das pesquisas sobre redes Wireless foi realizada para o desenvolvimento dos mecanismos básicos de operação. Nos últimos tempos, contudo, foco que tem chamado muito a atenção tange os aspectos de segurança. Considerando que este tipo de redes tem sido idealizado para operar em ambientes hostis, onde os sinais possam ser interceptados e/ou alterados, como as aplicações comerciais e as militares, os mecanismos de segurança devemvariar de acordo com o tipo de aplicação a que se destinarem. Esta dissertação tem por objetivo efetuar um mapeamento dos diferentes tipos de protocolos de roteamento para redes MANET e, a partir daí, pretende-se realizar simulações no Network Simulator avaliando a latência, jitter, vazão e perda de pacotes, checando, assim, o desempenho dos protocolos que implementam conceitos mais sólidos de segurança, comparando-os com protocolos que não possuam esta característica. Cada um dos protocolos tem suas vantagens e desvantagens e, pela própria característica da rede, a escolha do protocolo que melhor se adeque as características de mobilidade e volatilidade de rede é uma tarefa complexa. As informações das simulações podem contribuir para se traçar um perfil dos possíveis impactos causados com a agregação de segurança aos protocolos aqui implementados. Os resultados apresentados nas simulações desta dissertação mostram que os protocolos seguros de melhor desempenho e que mais atendem aos requisitos de segurança são o Ariadne e o SEAD

Classification and Comparative Study of Routing Techniques in Adhoc Wireless Networks

Wireless systems have been in use since 1980s. We have seen their evolutions to first, second and third generation's wireless systems. Wireless systems operate with the aid of a centralized supporting structure such as an access point. These access points assist the wireless users to keep connected with the wireless system, when they roam from one place to the other. The presence of a fixed supporting structure limits the adaptability of wireless systems. In other words, the technology cannot work effectively in places where there is no fixed infrastructure. Future generation wireless systems will require easy and quick deployment of wireless networks. This quick network deployment is not possible with the Infrastructured wireless systems. Recent advancements such as Bluetooth introduced a new type of wireless systems known as ad-hoc networks. Ad-hoc networks or "short live" networks operate in the absence of fixed infrastructure. They offer quick and easy network deployment in situations where it is not possible otherwise. Ad-hoc is a Latin word, which means "for this or for this only." Mobile ad-hoc network is an autonomous system of mobile nodes connected by wireless links; each node operates as an end system and a router for all other nodes in the network. Nodes in ad-hoc network are free to move and organize themselves in an arbitrary fashion. Each user is free to roam about while communication with others. The path between each pair of the users may have multiple links and the radio between them can be heterogeneous. This allows an association of various links to be a part of the same network. A mobile ad-hoc network is a collection of mobile nodes forming an ad-hoc network without the assistance of any centralized structures. These networks introduced a new art of network establishment and can be well suited for an environment where either the infrastructure is lost or where deploy an infrastructure is not very cost effective. The popular IEEE 802.11 "WI-FI" protocol is capable of providing ad-hoc network facilities at low level, when no access point is available. However in this case, the nodes are limited to send and receive information but do not route anything across the network. Ad-hoc networks can operate in a standalone fashion or could possibly be connected to a larger network such as the Internet. An ad-hoc network has certain characteristics, which imposes new demands on the routing protocol. The most important characteristic is the dynamic topology, which is a consequence of node mobility. Nodes can change position quite frequently; the nodes in an ad-hoc network can consist of laptops and personal digital assistants and are often very limited in resources such as CPU power, storage capacity, battery power and bandwidth. This means that the routing protocol should try to minimize control traffic, such as periodic update messages. The Internet Engineering Task Force currently has a working group named Mobile Ad-hoc Networks that is working on routing specifications for ad-hoc networks. This M.Phill thesis evaluates some of the protocols put forth by the working group. This evaluation is done by means of simulation using Network simulator 2 from Berkeley. This work aims at classification of the existing routing protocols of adhoc wireless networks using some definite parameters. After classification of routing protocols of adhoc wireless network, their comparative study was undertaken in order to yield category wise distribution. Furthermore performance evaluation of these protocols was carried out by employing different parameters like fading models, mobility models, traffic patterns etc using the network simulator NS-2 Hence I explore and evaluate different methods for validation of ad hoc routing protocols which are used to set up forwarding paths in spontaneous networks of mobile/Adhoc devices to accomplish the above mentioned comparative study and classification

Quality of service support for multimedia applications in mobile ad hoc networks

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Information collection algorithm for vehicular ad-hoc networks (application domain: Urban Traffic Wireless Vehicular Ad-Hoc Networks (VANETs))

Vehicle to vehicle communication (V2VC) is one of the modern approaches for exchanging and generating traffic information with (yet to be realized) potential to improve road safety, driving comfort and traffic control. In this research, we present a novel algorithm which is based on V2V communication, uses in-vehicle sensor information and in collaboration with the other vehicles' sensor information can detect road conditions and determine the geographical area where this road condition exists – e.g. geographical area where there is traffic density, unusual traffic behaviour, a range of weather conditions (raining), etc. The algorithms' built-in automatic geographical restriction of the data collection, aggregation and dissemination mechanisms allows warning messages to be received by any car, not necessarily sharing the identified road condition, which may then be used to identify the optimum route taken by the vehicle e.g. avoid bottlenecks or dangerous areas including accidents or congestions on their current routes. This research covers the middle ground between MANET [1] and collaborative data generation based on knowledge granularity (aggregation). It investigates the possibility of designing, implementing and modelling of the functionality of an algorithm (as part of the design of an intelligent node in an Intelligent Transportation System - ITS) that ensures active participation in the formation, routing and general network support of MANETs and also helps in-car traffic information and real-time control generation and distribution. The work is natural extension of the efforts of several large EU projects like DRIVE [2], GST [3] and SAFESPOT [4]

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