Analysis of the reliability of the components of a multiservice communication network based on the theory of fuzzy sets

The article presents the results of modeling the solution to the problem of determining the reliability of the components of a multiservice communication network (MCN) based on the theory of fuzzy sets. The main characteristics of the equipment that affect the reliability parameters of the MCN are given. To solve the problem of determining the reliability of MCN components based on the theory of fuzzy sets, a multiservice network is presented in the form of a hierarchical diagram, which shows the main components of each network level. A multiservice network is presented as a parameter of the U function. The reliable state of the MCN depends on the state of the equipment at the corresponding levels. The results of modeling the solution to the problem of determining the reliability of MCN components based on the theory of fuzzy sets are presented using the mathematical apparatus of the theory of fuzzy sets and fuzzy logic in MATLAB fuzzy logic toolbox, fuzzyTECH

Application of reinforcement learning with Q-learning for the routing in industrial wireless sensors networks

Industrial Wireless Sensor Networks (IWSN) usually have a centralized management approach, where a device known as Network Manager is responsible for the overall configuration, definition of routes, and allocation of communication resources. The routing algorithms need to ensure path redundancy while reducing latency, power consumption, and resource usage. Graph routing algorithms are used to address these requirements. The dynamicity of wireless networks has been a challenge for tuning and developing routing algorithms, and Machine Learning models such as Reinforcement Learning have been applied in a promising way in Wireless Sensor Networks to select, adapt and optimize routes. The basic concept of Reinforcement Learning is the existence of a learning agent that acts and changes the state of the environment, and receives rewards. However, the existing approaches do not meet some of the requirements of the IWSN standards. In this context, this thesis proposes the Q-Learning Reliable Routing approach, where the Q-Learning model is used to build graph routes. Two approaches are presented: QLRR-WA and QLRR-MA. QLRR-WA uses a learning agent that adjusts the weights of the cost equation of a state-of-the-art routing algorithm to reduce the latency and increase the network lifetime. QLRR-MA uses several learning agents so nodes can choose connections in the graph trying to reduce the latency. Other contributions of this thesis are the performance comparison of the state-of-the-art graph-routing algorithms and the evaluation methodology proposed. The QLRR algorithms were evaluated in a WirelessHART simulator, considering industrial monitoring applications with random topologies. The performance was analyzed considering the average network latency, network lifetime, packet delivery ratio and the reliability of the graphs. The results showed that, when compared to the state of the art, QLRR-WA reduced the average network latency and improved the lifetime while keeping high reliability, while QLRR-MA reduced latency and increased packet delivery ratio with a reduction in the network lifetime. These results indicate that Reinforcement Learning may be helpful to optimize and improve network performance.As Redes Industriais de Sensores Sem Fio (IWSN) geralmente têm uma abordagem de gerenciamento centralizado, onde um dispositivo conhecido como Gerenciador de Rede é responsável pela configuração geral, definição de rotas e alocação de recursos de comunicação. Os algoritmos de roteamento precisam garantir a redundância de caminhos para as mensagens, e também reduzir a latência, o consumo de energia e o uso de recursos. O roteamento por grafos é usado para alcançar estes requisitos. A dinamicidade das redes sem fio tem sido um desafio para o ajuste e o desenvolvimento de algoritmos de roteamento, e modelos de Aprendizado de Máquina como o Aprendizado por Reforço têm sido aplicados de maneira promissora nas Redes de Sensores Sem Fio para selecionar, adaptar e otimizar rotas. O conceito básico do Aprendizado por Reforço envolve a existência de um agente de aprendizado que atua em um ambiente, altera o estado do ambiente e recebe recompensas. No entanto, as abordagens existentes não atendem a alguns dos requisitos dos padrões das IWSN. Nesse contexto, esta tese propõe a abordagem Q-Learning Reliable Routing, onde o modelo Q-Learning é usado para construir os grafos de roteamento. Duas abordagens são propostas: QLRR-WA e QLRR-MA. A abordagem QLRR-WA utiliza um agente de aprendizado que ajusta os pesos da equação de custo de um algoritmo de roteamento de estado da arte, com o objetivo de reduzir a latência e aumentar a vida útil da rede. A abordagem QLRR-MA utiliza diversos agente de aprendizado de forma que cada dispositivo na rede pode escolher suas conexões tentando reduzir a latência. Outras contribuições desta tese são a comparação de desempenho das abordagens com os algoritmos de roteamento de estado da arte e a metodologia de avaliação proposta. As abordagens do QLRR foram avaliadas com um simulador WirelessHART, considerando aplicações de monitoramento industrial com diversas topologias. O desempenho foi analisado considerando a latência média da rede, o tempo de vida esperado da rede, a taxa de entrega de pacotes e a confiabilidade dos grafos. Os resultados mostraram que, quando comparado com o estado da arte, o QLRR-WA reduziu a latência média da rede e melhorou o tempo de vida esperado, mantendo alta confiabilidade, enquanto o QLRR-MA reduziu a latência e aumentou a taxa de entrega de pacotes, ao custo de uma redução no tempo de vida esperado da rede. Esses resultados indicam que o Aprendizado por Reforço pode ser útil para otimizar e melhorar o desempenho destas redes

Fundamental Limits on Performance for Cooperative Radar-Communications Coexistence

abstract: Spectral congestion is quickly becoming a problem for the telecommunications sector. In order to alleviate spectral congestion and achieve electromagnetic radio frequency (RF) convergence, communications and radar systems are increasingly encouraged to share bandwidth. In direct opposition to the traditional spectrum sharing approach between radar and communications systems of complete isolation (temporal, spectral or spatial), both systems can be jointly co-designed from the ground up to maximize their joint performance for mutual benefit. In order to properly characterize and understand cooperative spectrum sharing between radar and communications systems, the fundamental limits on performance of a cooperative radar-communications system are investigated. To facilitate this investigation, performance metrics are chosen in this dissertation that allow radar and communications to be compared on the same scale. To that effect, information is chosen as the performance metric and an information theoretic radar performance metric compatible with the communications data rate, the radar estimation rate, is developed. The estimation rate measures the amount of information learned by illuminating a target. With the development of the estimation rate, standard multi-user communications performance bounds are extended with joint radar-communications users to produce bounds on the performance of a joint radar-communications system. System performance for variations of the standard spectrum sharing problem defined in this dissertation are investigated, and inner bounds on performance are extended to account for the effect of continuous radar waveform optimization, multiple radar targets, clutter, phase noise, and radar detection. A detailed interpretation of the estimation rate and a brief discussion on how to use these performance bounds to select an optimal operating point and achieve RF convergence are provided.Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201