The main aim of this thesis is to familiarize with options of services using real-time data transfer in wireless networks. Theoretical part presents wireless network based on IEEE 802.11 standard and its practical use. Large part is focuses on 802.11e standart, that provides support for quality of service in wireless networks. Furthemore this thesis deals with transport and applicaton protocols supporting multimedia streaming over computer network. Second chapter is focused on analyzing real computer network with purpose in measuring parametrs influencing quality of service such as bandwith, delay, jitter and loss. Last part deals with the design of wireless network in OPNET Modeler enviroment with focus on simulating parameters that influence quality of service.

This diploma thesis deals with the design of temperature sensor and display units, which communicate via a WLAN network. The theoretical part provides an overview of various methods of temperature measurement including several specific types of temperature sensors, and also introduces the WLAN standard as well as TCP and UDP protocols. The design solution is focuses first on the system architecture and design of the communication protocol, followed by the implementation of both types of equipment, starting with selection of components, through design diagrams and printed circuit board patterns, up to production and commissioning. The following parts of this thesis deal with the design of programs for the controlling microcontroller units of both units and the configuration application for PC.

This work deals with the introduction of information security system in a company that provides internet. It is a hardware and software solutions for the benefit of quality information needed to monitor and manage networks on a professional level. Used solutions are versatile with regard to the diversity of the market and the speed of technology development.

The goal of this master's thesis is to describe geolocation techniques in wireless wide-area networks and the ways of expressing the individual node location. Practical part describes implementation of web services that simulate the node movement in these wireless networks and implementation of web service that is going to agregate the coordinate systems of these wireless networks.

[EN] This thesis dissertation tackles the problem concerning provision of video streaming services over mobile wireless ad hoc networks. Such networks are characterized by their versatility and flexibility, features that make them particularly suited to be used in many scenarios. However, some limitations inherited of the wireless channel and the mobility of the nodes make difficult to guarantee certain degree of quality of service, which is a required condition to the multimedia applications. Furthermore, with the massive demand of video content, it has become very necessary for mobile ad hoc networks to have an efficient routing and quality of services mechanisms to support this traffic. This is because video streaming services require network to provide sufficient bandwidth and an upper bound in delay, jitter and loss rate. Consequently, traditional best-effort protocols are not adequate. The main contribution of this thesis is the development of a comprehensive routing protocol that has a feedback scheme in order to provide information to the application about the network conditions. This protocol has a cross-layer architecture and it incorporates three important enhancements. Firstly, a new route recovery strategy, which provides a mechanism to detect the link failures in a route and re-establish the connections taking into account the conditions of quality of service that have been established during the previous route discovery phase. Secondly, an algorithm for the estimation of the available bandwidth along the route, information that is sent to application layer in order to apply an adaptation procedure that adjusts the bit rate of the video source. This rate-adaptive strategy is performed exploiting the layered scheme of the scalable video coding. In particular, the adaptive method removes, from the scalable video stream, those layers that could not be efficiently supported by network since their bitrates exceed the available bandwidth. The third main feature of the proposed routing protocol is a gateway discovery algorithm to improve the interconnectivity between mobile ad hoc networks and infrastructure-based networks. This algorithm incorporates available bandwidth as a metric during the gateway selection and a dynamic adaptation of some operational parameters such as the size of the proactive area and the frequency of the advertisement messages. Additionally, in order to solve the lack of a software tool to simulate rate-adaptive transmission of scalable video, a new simulation framework had be implemented. This simulation tool is an open source software freely available and, thus, it represents other contribution of this thesis. The results reveal performance improvements in terms of packet delay, dropped packets and the number of link failures while a more efficient use of the available bandwidth is obtained. In terms of video transmission, the results prove that the combined use of the proposed protocol and the scalable video coding provides an efficient platform for supporting rate-adaptive video streaming over mobile ad hoc networks. / [ES] Esta tesis aborda los problemas relacionados con los servicios de video en modo streaming sobre las redes móviles ad hoc. Este tipo de redes se caracterizan por su versatilidad y flexibilidad, lo cual las hace especialmente adecuadas para ser utilizadas en diversos escenarios. Sin embargo, algunas limitaciones inherentes a los enlaces inalámbricos y a la movilidad de los nodos, hace difícil garantizar cierto nivel de calidad de servicio, lo cual es una condición necesaria para el transporte de flujos multimedia. Además, con la masiva demanda de videos desde los dispositivos móviles, hace aún más necesario asegurar un encaminamiento eficiente y un cierto nivel de calidad de servicio en las redes móviles ad hoc. Por lo tanto, los tradicionales protocolos que funcionan bajo el modelo del "mejor esfuerzo" no son adecuados. Esto se debe principalmente a que las aplicaciones multimedia necesitan que la red asegure suficiente ancho de banda y unos valores máximos de retardo, jitter, y tasa de pérdidas. La principal contribución de esta tesis es el desarrollo de un protocolo de encaminamiento que contiene un esquema de realimentación que le permite informar a la aplicación sobre las condiciones de la red. Este protocolo tiene una arquitectura cross-layer e incorpora tres importantes mejoras. Primero, una nueva estrategia de mantenimiento y recuperación de rutas que provee mecanismos para detectar los fallos de conectividad y el posterior re-establecimiento de las conexiones, teniendo en cuenta las condiciones de calidad de servicio que fueron establecidas durante la etapa inicial del descubrimiento de las rutas. Segundo, un algoritmo para la estimación del ancho de banda disponible a lo largo de la ruta, información que es enviada a la capa de aplicación para aplicar un proceso de adaptación que ajusta la tasa de envío de datos de la fuente. Esta estrategia adaptativa de la tasa aprovecha el esquema por capas de la codificación escalable de video. En particular, el método adaptativo elimina del flujo de video escalable, aquellas capas que no pueden ser transmitidas por la red ya que su tasa de bits supera el ancho de banda disponible. La tercera mejora incluida en el protocolo propuesto es un algoritmo de descubrimiento de gateways para mejorar la interconectividad entre las redes móviles ad hoc y las redes basadas en infraestructura. Dicho algoritmo utiliza el ancho de banda disponible para seleccionar el mejor gateway, así mismo, realiza una adaptación dinámica de algunos parámetros operacionales como el alcance y la frecuencia de los mensajes anuncio. Adicionalmente, ha sido desarrollada una herramienta software para simular la transmisión adaptativa de video escalable sobre redes móviles ad hoc. Esta herramienta de simulación es un software de código abierto y constituye otra contribución más de esta tesis. Los resultados muestran mejoras en el funcionamiento de las redes relacionadas con el retardo, la tasa de pérdidas de paquetes y el número de fallos en la conectividad. Simultáneamente, se obtiene un uso más eficiente del ancho de banda. En relación a la calidad del video transmitido, los resultados demuestran que la utilización del protocolo propuesto junto con la codificación de video escalable, provee un eficiente sistema para la transmisión adaptativa de video escalable sobre redes móviles ad hoc. / [CAT] Aquesta tesi aborda els problemes relacionats amb els serveis de vídeo en mode streaming sobre les xarxes mòbils ad hoc. Aquest tipus de xarxes es caracteritzen per la seva versatilitat i flexibilitat, la qual cosa les fa especialment adequades per a ser utilitzades en diversos escenaris. No obstant això, algunes limitacions inherents als enllaços sense fils i a la mobilitat dels nodes, fa difícil garantir cert nivell de qualitat de servei, cosa que és una condició necessària per al transport de fluxos multimèdia. A més, amb la massiva demanda de vídeos des dels dispositius mòbils, fa encara més necessari assegurar un encaminament eficient i un cert nivell de qualitat de servei en les xarxes mòbils ad hoc. Per tant, els tradicionals protocols que funcionen sota el model del "millor esforç" no són adequats. Això es deu principalment al fet que les aplicacions multimèdia necessiten que la xarxa asseguri suficient ample de banda i uns valors màxims de retard, jitter, i taxa de pèrdues. La principal contribució d'aquesta tesi és el desenvolupament d'un protocol d'encaminament que conté un esquema de realimentació que li permet informar l'aplicació sobre les condicions de la xarxa. Aquest protocol té una arquitectura cross-layer i incorpora tres importants millores. Primer, una nova estratègia de manteniment i recuperació de rutes que proveeix mecanismes per detectar les fallades de connectivitat i el posterior re-establiment de les connexions, tenint en compte les condicions de qualitat de servei que van ser establertes durant l'etapa inicial del descobriment de les rutes. Segon, un algoritme per a l'estimació de l'ample de banda disponible al llarg de la ruta, informació que és enviada a la capa d'aplicació per aplicar un procés d'adaptació que ajusta la taxa d'enviament de dades de la font. Aquesta estratègia adaptativa de la taxa aprofita l'esquema per capes de la codificació escalable de vídeo. En particular, el mètode adaptatiu elimina del flux de vídeo escalable aquelles capes que no poden ser transmeses per la xarxa ja que la seva taxa de bits supera l'ample de banda disponible. La tercera millora inclosa en el protocol proposat és un algoritme de descobriment de gateways per millorar la interconnectivitat entre les xarxes mòbils ad hoc i les xarxes basades en infraestructura. Aquest algoritme utilitza l'ample de banda disponible per seleccionar el millor gateway, així mateix, realitza una adaptació dinàmica d'alguns paràmetres operacionals com l'abast i la freqüència dels missatges anunci. Addicionalment, ha estat desenvolupada una eina programari per a simular la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. Aquesta eina de simulació és un programari de codi obert i constitueix una altra contribució més d'aquesta tesi. Els resultats mostren millores en el funcionament de les xarxes relacionades amb el retard, la taxa de pèrdues de paquets i el nombre de fallades en la connectivitat. Simultàniament, se n'obté un ús més eficient de l'ample de banda. En relació a la qualitat del vídeo transmès, els resultats demostren que la utilització del protocol proposat juntament amb la codificació de vídeo escalable, proveeix un eficient sistema per a la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. / Castellanos Hernández, WE. (2015). Quality of Service Routing and Mechanisms for Improving Video Streaming over Mobile Wireless Ad hoc Networks [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/53238 / TESIS

La siguiente tesis, es sobre el diseño de la red inalámbrica para una compañía del sector minero, utilizando fórmulas, estándares y buenas prácticas brindadas por diversas entidades internacionales, que nos permiten el mejor diseño posible. En el capítulo 1 se dará aspectos introductorios acerca de la compañía y los objetivos planteados. En el capítulo 2, se da soporte científico y teórico a la tecnología, estándares y especificaciones empleadas. En el capítulo 3, se plantea el problema a resolver, sus causas, consecuencias, requerimientos y posible solución. En el capítulo 4, a nivel técnico, se propone las especificaciones y mejores prácticas en el desarrollo del diseño como es: las frecuencias libres de 2.4 GHz para acceso a la red, 5 GHz para la utilización de mesh y la frecuencia de 60 GHz para los enlaces microondas. En el capítulo 5, se validará el diseño propuesto contra los objetivos específicos propuestos en el capítulo 1. Finalmente, en el capítulo 6 y 7, se da recomendaciones y conclusiones. / The following thesis is about the design of the wireless network for one mining company, using formulas, standards and good practices provided by various international entities, which allow us the best possible design. In chapter 1 introductory aspects about the company and its objectives will be given. In Chapter 2, scientific and theoretical support is given to the technology, standards and specifications used. In chapter 3, the problem to be solved, its causes, consequences, requirements and possible solution are presented. In chapter 4, at a technical level, the specifications and best practices in the development of the design are proposed, such as: the free frequencies of 2.4 GHz for network access, 5 GHz for the use of mesh and the frequency of 60 GHz for microwave links. In Chapter 5, the proposed design will be validated against the specific objectives proposed in Chapter 1. Finally, in Chapter 6 and 7, recommendations and conclusions are given. / Tesis

Les réseaux de données actuels sont des entités complexes qui opèrent dans des environnements dynamiques et hétérogènes. L'architecture et les protocoles de ces réseaux doivent faire face à plusieurs défis, notamment l'adaptation dynamique et la prise de décisions autonome en présence de plusieurs critères, souvent contradictoires, tels que le délai, le taux de perte, la gigue, l'énergie, etc. Cependant, les problèmes de décision multicritère ont généralement de multiples solutions. Ces problèmes sont résolus par des méthodes qui utilisent des paramètres dont les choix ont des conséquences difficiles à prévoir. De ce fait, la plupart des méthodes de décision multicritère proposées dans la littérature supposent la présence d'un décideur qui guide le processus de décision. Enfin, le choix des paramètres suppose souvent une interactivité avec le décideur, ce qui est difficile, voire impossible, à envisager dans un contexte autonome. Dans cette thèse, nous proposons une nouvelle méthode de décision multicritère adaptée aux systèmes autonomes en général et aux réseaux autonomes en particulier. La méthode de décision multicritère de type ``poupée russe'' que nous introduisons utilise un ensemble de boîtes de qualité englobantes, définies dans l'espace des critères, afin d'estimer une large gamme de fonctions d'utilité. D'une part, la méthode proposée s'adapte au caractère dynamique des réseaux autonomes, afin de maximiser la satisfaction des utilisateurs. D'autre part, elle utilise des paramètres qui sont soit directement déduits de faits objectifs, tels que des normes ou spécifications techniques, soit obtenus à l'aide d'une expérience de type MOS (Mean Opinion Score) au moyen d'une méthode de classification automatique. Nous avons testé les performances de la méthode de la poupée russe sur un cas pratique de routage dans les réseaux ad hoc sans fil. Les expérimentations ont montré que le routage réalisé avec la méthode de la poupée russe est toujours meilleur ou similaire à celui de la méthode de la somme pondérée qui est largement utilisée. Cela est dû à la capacité d'adaptation de la décision offerte par cette nouvelle méthode de décision multicritère / Today's data networks are complex entities that operate in dynamic and heterogeneous environments. The architecture and protocols of these networks have to face several challenges such as dynamic adaptation and autonomous decision-making in the presence of several, often conflicting, criteria such as delay, loss rate, jitter, energy, etc. However, multicriteria decision making problems usually have multiple solutions. These problems are solved by methods that use parameters whose choices have consequences difficult to predict. Thus, most multicriteria decision making methods proposed in the literature assume the presence of a decision maker who guides the decision process. Finally, the choice of parameter values often involves an interaction with the decision maker, which is difficult or impossible to do in an autonomous context. In this thesis, we propose a new multicriteria decision making method suitable for autonomous systems in general and autonomous networks in particular. The Russian doll like method we propose uses a set of nested quality boxes (like Russian dolls) defined in the criteria space, in order to approximate a wide range of utility functions. First, the proposed method adapts to the dynamic nature of autonomous networks in order to maximize user satisfaction. Second, it uses parameters that are directly deduced from objective facts such as technical standards or specifications, or obtained from a MOS (Mean Opinion Score) experiment using an automatic classification method. We tested the performance of the Russian doll like method in a case of routing in wireless ad hoc networks. Experiments have shown that routing done with the Russian doll like method is always better or similar to the one done by the weighted sum method which is widely used. This is due to the adaptation ability of the decision provided by this new multicriteria decision making method

La sécurité des communications sans fil omniprésentes devient, ces dernières années, de plus en plus une exigence incontournable. Bien que la cryptographie symétrique assure largement la confidentialité des données, la difficulté concerne la génération et la distribution de clés secrètes. Récemment, des études indiquent que les caractéristiques inhérentes du canal de propagation peuvent être exploitées afin de consolider la sécurité. En particulier, le canal radio fournit en effet une source d'aléa commune à deux utilisateurs à partir de laquelle des clés secrètes peuvent être générées. Dans la présente dissertation, nous nous intéressons au processus de génération de clés secrètes (SKG), tout en reliant les propriétés du canal radio à la qualité des clés générées. D'abord nous développons un modèle du canal stochastique, traitant la sécurité du point de vue de l'espion, qui montre une mémoire de canal résiduelle bien au-delà d'une distance de quelques longueurs d'onde (scénarios spatialement non-stationnaires). Ensuite, nous exploitons les degrés de liberté (DOF) du canal et analysons leur impact sur la performance de SKG dans différentes conditions, tout en considérant des canaux plus réalistes en environnements extérieur et intérieur (respectivement grâce à des données déterministes simulées et à des mesures). Les résultats montrent que, même pour des bandes modérées (comme standardisées dans la norme IEEE 802.11), le seul DoF de fréquence ou de son association avec le DoF spatial est souvent suffisant pour générer des longues clés, à condition d'utiliser une méthode efficace de quantification des coefficients complexes du canal. / Nowadays, the security of ubiquitous wireless communications becomes more and more a crucial requirement. Even though data is widely protected via symmetric ciphering keys, a well-known difficulty is the generation and distribution of such keys. In the recent years therefore, a set of works have addressed the exploitation of inherent characteristics of the fading propagation channel for security. In particular, secret keys could be generated from the wireless channel, considered as a shared source of randomness, available merely to a pair of communicating entities. ln the present dissertation, we are interested in the approach of secret key generation (SKG) from wireless channels, especially in relating the radio channel properties to the generated keys quality. We first develop a stochastic channel model, focusing on the security with respect to the eavesdropper side, which shows a residual channel memory weil beyond a few wavelengths distance (spatially nonstationary scenarios). Then, we analyze the channel degrees of freedom (DoF) and their impact on the SKG performance in different channel conditions, especially by considering more realistic channels in both outdoor and indoor environments (respectively through simulated ray tracing data and through measurements). The results show that, even for moderately wide band (such as standardized in IEEE 802.11), the sole frequency DOF or its association with the spatial DOF is often enough for generating long keys, provided an efficient quantization method of the complex channel coefficients is used.

The internet has become an essential part of most people's daily lives in recent years, and as more devices connect to the internet, the risk of cyber threats increases dramatically. As malware becomes more sophisticated, traditional security prevention measures are becoming less effective at defending from cyber attacks. As a result, Signature Based Detection and Anomaly Detection are two of many advanced techniques that have become crucial to defend against cyber threats such as malware, but even these are sometimes not enough to stop modern cyberattacks. In this literature review the goal is to discuss how trustworthy each of the mentioned malware detection techniques are at detecting malware in wireless networks. The study will measure trustworthiness by looking further into scalability, adaptability and robustness and resource consumption. This study concludes that both anomaly and signature-based malware detection methods exhibit strengths and weaknesses in scalability, robustness, adaptability, and resource consumption. Furthermore, more research is needed and as malware becomes more sophisticated and an increased threat to the world it is an area that is highly relevant.

Dynamic spectrum access enabled by cognitive radio networks are envisioned to drive the next generation wireless networks that can increase spectrum utility by opportunistically accessing unused spectrum. Due to the policy constraint that there could be no interference to the primary (licensed) users, secondary cognitive radios have to continuously sense for primary transmissions. Typically, sensing reports from multiple cognitive radios are fused as stand-alone observations are prone to errors due to wireless channel characteristics. Such dependence on cooperative spectrum sensing is vulnerable to attacks such as Secondary Spectrum Data Falsification (SSDF) attacks when multiple malicious or selfish radios falsify the spectrum reports. Hence, there is a need to quantify the trustworthiness of radios that share spectrum sensing reports and devise malicious node identification and robust fusion schemes that would lead to correct inference about spectrum usage. In this work, we propose an anomaly monitoring technique that can effectively capture anomalies in the spectrum sensing reports shared by individual cognitive radios during cooperative spectrum sensing in a multi-channel distributed network. Such anomalies are used as evidence to compute the trustworthiness of a radio by its neighbours. The proposed anomaly monitoring technique works for any density of malicious nodes and for any physical environment. We propose an optimistic trust heuristic for a system with a normal risk attitude and show that it can be approximated as a beta distribution. For a more conservative system, we propose a multinomial Dirichlet distribution based conservative trust framework, where Josang*s Belief model is used to resolve any uncertainty in information that might arise during anomaly monitoring. Using a machine learning approach, we identify malicious nodes with a high degree of certainty regardless of their aggressiveness and variations introduced by the pathloss environment. We also propose extensions to the anomaly monitoring technique that facilitate learning about strategies employed by malicious nodes and also utilize the misleading information they provide. We also devise strategies to defend against a collaborative SSDF attack that is launched by a coalition of selfish nodes. Since, defense against such collaborative attacks is difficult with popularly used voting based inference models or node centric isolation techniques, we propose a channel centric Bayesian inference approach that indicates how much the collective decision on a channels occupancy inference can be trusted. Based on the measured observations over time, we estimate the parameters of the hypothesis of anomalous and non-anomalous events using a multinomial Bayesian based inference. We quantitatively define the trustworthiness of a channel inference as the difference between the posterior beliefs associated with anomalous and non-anomalous events. The posterior beliefs are updated based on a weighted average of the prior information on the belief itself and the recently observed data. Subsequently, we propose robust fusion models which utilize the trusts of the nodes to improve the accuracy of the cooperative spectrum sensing decisions. In particular, we propose three fusion models: (i) optimistic trust based fusion, (ii) conservative trust based fusion, and (iii) inversion based fusion. The former two approaches exclude untrustworthy sensing reports for fusion, while the last approach utilizes misleading information. All schemes are analyzed under various attack strategies. We propose an asymmetric weighted moving average based trust management scheme that quickly identifies on-off SSDF attacks and prevents quick trust redemption when such nodes revert back to temporal honest behavior. We also provide insights on what attack strategies are more effective from the adversaries* perspective. Through extensive simulation experiments we show that the trust models are effective in identifying malicious nodes with a high degree of certainty under variety of network and radio conditions. We show high true negative detection rates even when multiple malicious nodes launch collaborative attacks which is an improvement over existing voting based exclusion and entropy divergence techniques. We also show that we are able to improve the accuracy of fusion decisions compared to other popular fusion techniques. Trust based fusion schemes show worst case decision error rates of 5% while inversion based fusion show 4% as opposed majority voting schemes that have 18% error rate. We also show that the proposed channel centric Bayesian inference based trust model is able to distinguish between attacked and non-attacked channels for both static and dynamic collaborative attacks. We are also able to show that attacked channels have significantly lower trust values than channels that are not– a metric that can be used by nodes to rank the quality of inference on channels.