Cognitive wireless mesh network without common control channel evaluated in NS-3

The CPqD Cognitive Mesh Network (CCMN) has been developed with traditional cognition elements, such as energy detection based sensing and with the ability to switch the data channel to take advantage of any available channels on a given radio-electric spectrum band. Many of the solutions that utilize cognitive mesh networks are based on the fact that it uses a common control channel (CCC) to manage the system. Therefore the Multi-Channel - One Interface Manager (MC-OIM) alg orithm was developed to maximize channel usage with a system that does not depend of any CCC . The MC-OIM algorithm was evaluated using network simulator ns-3 and simulation results were validated with testes that were done in a real scenario

Cascading attacks in Wi-Fi networks: demonstration and counter-measures

Wi-Fi (IEEE 802.11) is currently one of the primary media to access the Internet. Guaranteeing the availability of Wi-Fi networks is essential to numerous online activities, such as e-commerce, video streaming, and IoT services. Attacks on availability are generally referred to as Denial-of-Service (DoS) attacks. While there exists signif- icant literature on DoS attacks against Wi-Fi networks, most of the existing attacks are localized in nature, i.e., the attacker must be in the vicinity of the victim. The purpose of this dissertation is to investigate the feasibility of mounting global DoS attacks on Wi-Fi networks and develop effective counter-measures. First, the dissertation unveils the existence of a vulnerability at the MAC layer of Wi-Fi, which allows an adversary to remotely launch a Denial-of-Service (DoS) attack that propagates both in time and space. This vulnerability stems from a coupling effect induced by hidden nodes. Cascading DoS attacks can congest an entire network and do not require the adversary to violate any protocol. The dissertation demonstrates the feasibility of such attacks through experiments with real Wi-Fi cards, extensive ns-3 simulations, and theoretical analysis. The simulations show the attack is effective both in networks operating under fixed and varying bit rates, as well as ad hoc and infrastructure modes. To gain insight into the root-causes of the attack, the network is modeled as a dynamical system and its limiting behavior is analyzed. The model predicts that a phase transition (and hence a cascading attack) is possible when the retry limit parameter of Wi-Fi is greater or equal to 7. Next, the dissertation identifies a vulnerability at the physical layer of Wi-Fi that allows an adversary to launch cascading attacks with weak interferers. This vulnerability is induced by the state machine’s logic used for processing incoming packets. In contrast to the previous attack, this attack is effective even when interference caused by hidden nodes do not corrupt every packet transmission. The attack forces Wi-Fi rate adaptation algorithms to operate at a low bit rate and significantly degrades network performance, such as communication reliability and throughput. Finally, the dissertation proposes, analyzes, and simulates a method to prevent such attacks from occurring. The key idea is to optimize the duration of packet transmissions. To achieve this goal, it is essential to properly model the impact of MAC overhead, and in particular MAC timing parameters. A new theoretical model is thus proposed, which relates the utilization of neighboring pairs of nodes using a sequence of iterative equations and uses fixed point techniques to study the limiting behavior of the sequence. The analysis shows how to optimally set the packet duration so that, on the one hand, cascading DoS attacks are avoided and, on the other hand, throughput is maximized. The analytical results are validated by extensive ns-3 simulations. A key insight obtained from the analysis and simulations is that IEEE 802.11 networks with relatively large MAC overhead are less susceptible to cascading DoS attacks than networks with smaller MAC overhead

Experimental Study on the Performance of Rate Adaptation Algorithm in IEEE 802.11g Networks

IEEE 802.11 technology provides a low-cost wireless networking solution. In the last few years, we have seen that the demand for high-bandwidth wireless local area networks increases rapidly, due to the proliferation of mobile devices such as laptops, smart phones and tablet PCs. This has driven the widespread deployment of IEEE 802.11 wireless networks to provide Internet access. However, wireless networks present their own unique problems. Wireless channel is extremely variable and can be affected by a number of different factors, such as collisions, multipath fading and signal attenuation. As such, rate adaptation algorithm is a key component of IEEE 802.11 standard which is used to vary the transmission data rate to match the wireless channel conditions, in order to achieve the best possible performance. Rate adaptation algorithm studies and evaluations are always hot research topics. However, despite its popularity, little work has been done on evaluating the performance of rate adaptation algorithms by comparing the throughput of the algorithm with the throughput of the fixed rates. This thesis presents an experimental study that compares the performance ofMikroTik rate adaptation algorithm andMinstrel rate adaptation algorithm against fixed rates in an IEEE 802.11g network. MikroTik and Minstrel rate adaptation algorithm are most commonly used algorithm around the world. All experiments are conducted in a real world environment in this thesis. In a real world environment, wireless channel conditions are not tightly being controlled, and it is extremely vulnerable to interference of surrounding environment. The dynamic changes of wireless channel conditions have a considerable effect on the performance of rate adaptation algorithms. The main challenge of evaluating a rate adaptation algorithm in a real world environment is getting different experiment behaviours from the same experiment. Experiment results may indicate many different behaviours which due to the leak of wireless environment controlling. Having a final conclusion from those experiment results can be a challenge task. In order to perform a comprehensive rate adaptation algorithm evaluation. All experiments run 20 times for 60 seconds. The average result and stand deviation is calculated. We also design and implement an automation experiment controlling program to help us maintain that each run of experiment is following exactly the same procedures. In MikroTik rate adaptation algorithm evaluation, the results show in many cases that fixed rate outperforms rate adaptation. Our findings raise questions regarding the suitability of the adopted rate adaptation algorithm in typical indoor environments. Furthermore, our study indicates that it is not wise to simply ignore fixed rate. A fine selection of a fixed rate could be made to achieve desired performance. The result ofMinstrel rate adaptation evaluation show that whilst Minstrel performs reasonably well in static wireless channel conditions, in some cases the algorithm has difficulty selecting the optimal data rate in the presence of dynamic channel conditions. In addition, Minstrel performs well when the channel condition improves frombad quality to good quality. However, Minstrel has trouble selecting the optimal rate when the channel condition deteriorates from good quality to bad quality. By comparing the experimental results between the performance of rate adaptation algorithms and the performance of fixed data rate against different factors, the experiment results directly pointed out the weakness of these two rate adaptation algorithms. Our findings from both experiments provide useful information on the design of rate adaptation algorithms

Contributions to the routing of traffic flows in multi-hop IEEE 802.11 wireless networks

The IEEE 802.11 standard was not initially designed to provide multi-hop capabilities. Therefore, providing a proper traffic performance in Multi-Hop IEEE 802.11 Wireless Networks (MIWNs) becomes a significant challenge. The approach followed in this thesis has been focused on the routing layer in order to obtain applicable solutions not dependent on a specific hardware or driver. Nevertheless, as is the case of most of the research on this field, a cross-layer design has been adopted. Therefore, one of the first tasks of this work was devoted to the study of the phenomena which affect the performance of the flows in MIWNs. Different estimation methodologies and models are presented and analyzed. The first main contribution of this thesis is related to route creation procedures. First, FB-AODV is introduced, which creates routes and forwards packets according to the flows on the contrary to basic AODV which is destination-based. This enhancement permits to balance the load through the network and gives a finer granularity in the control and monitoring of the flows. Results showed that it clearly benefits the performance of the flows. Secondly, a novel routing metric called Weighted Contention and Interference routing Metric (WCIM) is presented. In all analyzed scenarios, WCIM outperformed the other analyzed state-of-the-art routing metrics due to a proper leveraging of the number of hops, the link quality and the suffered contention and interference. The second main contribution of this thesis is focused on route maintenance. Generally, route recovery procedures are devoted to the detection of link breaks due to mobility or fading. However, other phenomena like the arrival of new flows can degrade the performance of active flows. DEMON, which is designed as an enhancement of FB-AODV, allows the preemptive recovery of degraded routes by passively monitoring the performance of active flows. Results showed that DEMON obtains similar or better results than other published solutions in mobile scenarios, while it clearly outperforms the performance of default AODV under congestion Finally, the last chapter of this thesis deals with channel assignment in multi-radio solutions. The main challenge of this research area relies on the circular relationship between channel assignment and routing; channel assignment determines the routes that can be created, while the created routes decide the real channel diversity of the network and the level of interference between the links. Therefore, proposals which join routing and channel assignment are generally complex, centralized and based on traffic patterns, limiting their practical implementation. On the contrary, the mechanisms presented in this thesis are distributed and readily applicable. First, the Interference-based Dynamic Channel Assignment (IDCA) algorithm is introduced. IDCA is a distributed and dynamic channel assignment based on the interference caused by active flows which uses a common channel in order to assure connectivity. In general, IDCA leads to an interesting trade-off between connectivity preservation and channel diversity. Secondly, MR-DEMON is introduced as way of joining channel assignment and route maintenance. As DEMON, MR-DEMON monitors the performance of the active flows traversing the links, but, instead of alerting the source when noticing degradation, it permits reallocating the flows to less interfered channels. Joining route recovery instead of route creation simplifies its application, since traffic patterns are not needed and channel reassignments can be locally decided. The evaluation of MR-DEMON proved that it clearly benefits the performance of IDCA. Also, it improves DEMON functionality by decreasing the number of route recoveries from the source, leading to a lower overhead.El estándar IEEE 802.11 no fue diseñado inicialmente para soportar capacidades multi-salto. Debido a ello, proveer unas prestaciones adecuadas a los flujos de tráfico que atraviesan redes inalámbricas multi-salto IEEE 802.11 supone un reto significativo. La investigación desarrollada en esta tesis se ha centrado en la capa de encaminamiento con el objetivo de obtener soluciones aplicables y no dependientes de un hardware específico. Sin embargo, debido al gran impacto de fenómenos y parámetros relacionados con las capas físicas y de acceso al medio sobre las prestaciones de los tráficos de datos, se han adoptado soluciones de tipo cross-layer. Es por ello que las primeras tareas de la investigación, presentadas en los capítulos iniciales, se dedicaron al estudio y caracterización de estos fenómenos. La primera contribución principal de esta tesis se centra en mecanismos relacionados con la creación de las rutas. Primero, se introduce una mejora del protocolo AODV, que permite crear rutas y encaminar paquetes en base a los flujos de datos, en lugar de en base a los destinos como se da en el caso básico. Esto permite balacear la carga de la red y otorga un mayor control sobre los flujos activos y sus prestaciones, mejorando el rendimiento general de la red. Seguidamente, se presenta una métrica de encaminamiento sensible a la interferencia de la red y la calidad de los enlaces. Los resultados analizados, basados en la simulación de diferentes escenarios, demuestran que mejora significativamente las prestaciones de otras métricas del estado del arte. La segunda contribución está relacionada con el mantenimiento de las rutas activas. Generalmente, los mecanismos de mantenimiento se centran principalmente en la detección de enlaces rotos debido a la movilidad de los nodos o a la propagación inalámbrica. Sin embargo, otros fenómenos como la interferencia y congestión provocada por la llegada de nuevos flujos pueden degradar de forma significativa las prestaciones de los tráficos activos. En base a ello, se diseña un mecanismo de mantenimiento preventivo de rutas, que monitoriza las prestaciones de los flujos activos y permite su reencaminamiento en caso de detectar rutas degradadas. La evaluación de esta solución muestra una mejora significativa sobre el mantenimiento de rutas básico en escenarios congestionados, mientras que en escenarios con nodos móviles obtiene resultados similares o puntualmente mejores que otros mecanismos preventivos diseñados específicamente para casos con movilidad. Finalmente, el último capítulo de la tesis se centra en la asignación de canales en entornos multi-canal y multi-radio con el objetivo de minimizar la interferencia entre flujos activos. El reto principal en este campo es la dependencia circular que se da entre la asignación de canales y la creación de rutas: la asignación de canales determina los enlaces existentes la red y por ello las rutas que se podrán crear, pero son finalmente las rutas y los tráficos activos quienes determinan el nivel real de interferencia que se dará en la red. Es por ello que las soluciones que proponen unificar la asignación de canales y el encaminamiento de tráficos son generalmente complejas, centralizadas y basadas en patrones de tráfico, lo que limita su implementación en entornos reales. En cambio, en nuestro caso adoptamos una solución distribuida y con mayor aplicabilidad. Primero, se define un algoritmo de selección de canales dinámico basado en la interferencia de los flujos activos, que utiliza un canal común en todos los nodos para asegurar la conectividad de la red. A continuación, se introduce un mecanismo que unifica la asignación de canales con el mantenimiento preventivo de las rutas, permitiendo reasignar flujos degradados a otros canales disponibles en lugar de reencaminarlos completamente. Ambas soluciones demuestran ser beneficiosas en este tipo de entornos.Postprint (published version

Real-time wireless networks for industrial control systems

The next generation of industrial systems (Industry 4.0) will dramatically transform manyproductive sectors, integrating emerging concepts such as Internet of Things, artificialintelligence, big data, cloud robotics and virtual reality, to name a few. Most of thesetechnologies heavily rely on the availability of communication networks able to offernearly–istantaneous, secure and reliable data transfer. In the industrial sector, these tasks are nowadays mainly accomplished by wired networks, that combine the speed ofoptical fiber media with collision–free switching technology. However, driven by the pervasive deployment of mobile devices for personal com-munications in the last years, more and more industrial applications require wireless connectivity, which can bring enormous advantages in terms of cost reduction and flex-ibility. Designing timely, reliable and deterministic industrial wireless networks is a complicated task, due to the nature of the wireless channel, intrinsically error–prone andshared among all the devices transmitting on the same frequency band. In this thesis, several solutions to enhance the performance of wireless networks employed in industrial control applications are proposed. The presented approaches differ in terms of achieved performance and target applications, but they are all characterized by an improvement over existing industrial wireless solutions in terms of timeliness, reliability and determinism. When possible, an experimental validation of the designed solutions is provided. The obtained results prove that significant performance improvements are already possible, often using commercially available devices and preserving compliance to existing standards. Future research efforts, combined with the availability of new chipsets and standards, could lead to a world where wireless links effectively replace most of the existing cables in industrial environments, as it is already the case in the consumer market