DATA DRIVEN INTELLIGENT AGENT NETWORKS FOR ADAPTIVE MONITORING AND CONTROL

To analyze the characteristics and predict the dynamic behaviors of complex systems over time, comprehensive research to enable the development of systems that can intelligently adapt to the evolving conditions and infer new knowledge with algorithms that are not predesigned is crucially needed. This dissertation research studies the integration of the techniques and methodologies resulted from the fields of pattern recognition, intelligent agents, artificial immune systems, and distributed computing platforms, to create technologies that can more accurately describe and control the dynamics of real-world complex systems. The need for such technologies is emerging in manufacturing, transportation, hazard mitigation, weather and climate prediction, homeland security, and emergency response. Motivated by the ability of mobile agents to dynamically incorporate additional computational and control algorithms into executing applications, mobile agent technology is employed in this research for the adaptive sensing and monitoring in a wireless sensor network. Mobile agents are software components that can travel from one computing platform to another in a network and carry programs and data states that are needed for performing the assigned tasks. To support the generation, migration, communication, and management of mobile monitoring agents, an embeddable mobile agent system (Mobile-C) is integrated with sensor nodes. Mobile monitoring agents visit distributed sensor nodes, read real-time sensor data, and perform anomaly detection using the equipped pattern recognition algorithms. The optimal control of agents is achieved by mimicking the adaptive immune response and the application of multi-objective optimization algorithms. The mobile agent approach provides potential to reduce the communication load and energy consumption in monitoring networks. The major research work of this dissertation project includes: (1) studying effective feature extraction methods for time series measurement data; (2) investigating the impact of the feature extraction methods and dissimilarity measures on the performance of pattern recognition; (3) researching the effects of environmental factors on the performance of pattern recognition; (4) integrating an embeddable mobile agent system with wireless sensor nodes; (5) optimizing agent generation and distribution using artificial immune system concept and multi-objective algorithms; (6) applying mobile agent technology and pattern recognition algorithms for adaptive structural health monitoring and driving cycle pattern recognition; (7) developing a web-based monitoring network to enable the visualization and analysis of real-time sensor data remotely. Techniques and algorithms developed in this dissertation project will contribute to research advances in networked distributed systems operating under changing environments

Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks

This book presents collective works published in the recent Special Issue (SI) entitled "Recent Developments on Mobile Ad-Hoc Networks and Vehicular Ad-Hoc Networks”. These works expose the readership to the latest solutions and techniques for MANETs and VANETs. They cover interesting topics such as power-aware optimization solutions for MANETs, data dissemination in VANETs, adaptive multi-hop broadcast schemes for VANETs, multi-metric routing protocols for VANETs, and incentive mechanisms to encourage the distribution of information in VANETs. The book demonstrates pioneering work in these fields, investigates novel solutions and methods, and discusses future trends in these field

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Modeling and forecasting gender-based violence through machine learning techniques

Gender-Based Violence (GBV) is a serious problem that societies and governments must address using all applicable resources. This requires adequate planning in order to optimize both resources and budget, which demands a thorough understanding of the magnitude of the problem, as well as analysis of its past impact in order to infer future incidence. On the other hand, for years, the rise of Machine Learning techniques and Big Data has led different countries to collect information on both GBV and other general social variables that in one way or another can affect violence levels. In this work, in order to forecast GBV, firstly, a database of features related to more than a decade’s worth of GBV is compiled and prepared from official sources available due to Spain’s open access. Then, secondly, a methodology is proposed that involves testing different methods of features selection so that, with each of the subsets generated, four techniques of predictive algorithms are applied and compared. The tests conducted indicate that it is possible to predict the number of GBV complaints presented to a court at a predictive horizon of six months with an accuracy (Root Median Squared Error) of 0.1686 complaints to the courts per 10,000 inhabitants—throughout the whole Spanish territory—with a Multi-Objective Evolutionary Search Strategy for the selection of variables, and with Random Forest as the predictive algorithm. The proposed methodology has also been successfully applied to three specific Spanish territories of different populations (large, medium, and small), pointing to the presented method’s possible use elsewhere in the world

Clustering by compression

We present a new method for clustering based on compression. The method doesn't use subject-specific features or background knowledge, and works as follows: First, we determine a universal similarity distance, the normalized compression distance or NCD, computed from the lengths of compressed data files (singly and in pairwise concatenation). Second, we apply a hierarchical clustering method. The NCD is universal in that it is not restricted to a specific application area, and works across application area boundaries. A theoretical precursor, the normalized information distance, co-developed by one of the authors, is provably optimal but uses the non-computable notion of Kolmogorov complexity. We propose precise notions of similarity metric, normal compressor, and show that the NCD based on a normal compressor is a similarity metric that approximates universality. To extract a hierarchy of clusters from the distance matrix, we determine a dendrogram (binary tree) by a new quartet method and a fast heuristic to implement it. The method is implemented and available as public software, and is robust under choice of different compressors. To substantiate our claims of universality and robustness, we report evidence of successful application in areas as diverse as genomics, virology, languages, literature, music, handwritten digits, astronomy, and combinations of objects from completely different domains, using statistical, dictionary, and block sorting compressors. In genomics we presented new evidence for major questions in Mammalian evolution, based on whole-mitochondrial genomic analysis: the Eutherian orders and the Marsupionta hypothesis against the Theria hypothesis.Comment: LaTeX, 27 pages, 20 figure

DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN

The optimal multicast tree problem in the Software-Defined Networking (SDN) multicast routing is an NP-hard combinatorial optimization problem. Although existing SDN intelligent solution methods, which are based on deep reinforcement learning, can dynamically adapt to complex network link state changes, these methods are plagued by problems such as redundant branches, large action space, and slow agent convergence. In this paper, an SDN intelligent multicast routing algorithm based on deep hierarchical reinforcement learning is proposed to circumvent the aforementioned problems. First, the multicast tree construction problem is decomposed into two sub-problems: the fork node selection problem and the construction of the optimal path from the fork node to the destination node. Second, based on the information characteristics of SDN global network perception, the multicast tree state matrix, link bandwidth matrix, link delay matrix, link packet loss rate matrix, and sub-goal matrix are designed as the state space of intrinsic and meta controllers. Then, in order to mitigate the excessive action space, our approach constructs different action spaces at the upper and lower levels. The meta-controller generates an action space using network nodes to select the fork node, and the intrinsic controller uses the adjacent edges of the current node as its action space, thus implementing four different action selection strategies in the construction of the multicast tree. To facilitate the intelligent agent in constructing the optimal multicast tree with greater speed, we developed alternative reward strategies that distinguish between single-step node actions and multi-step actions towards multiple destination nodes

Intégration de la blockchain à l'Internet des objets

L'Internet des objets (IdO) est en train de transformer l'industrie traditionnelle en une industrie intelligente où les décisions sont prises en fonction des données. L'IdO interconnecte de nombreux objets (ou dispositifs) qui effectuent des tâches complexes (e.g., la collecte de données, l'optimisation des services, la transmission de données). Toutefois, les caractéristiques intrinsèques de l'IdO entraînent plusieurs problèmes, tels que la décentralisation, une faible interopérabilité, des problèmes de confidentialité et des failles de sécurité. Avec l'évolution attendue de l'IdO dans les années à venir, il est nécessaire d'assurer la confiance dans cette énorme source d'informations entrantes. La blockchain est apparue comme une technologie clé pour relever les défis de l'IdO. En raison de ses caractéristiques saillantes telles que la décentralisation, l'immuabilité, la sécurité et l'auditabilité, la blockchain a été proposée pour établir la confiance dans plusieurs applications, y compris l'IdO. L'intégration de la blockchain a l'IdO ouvre la porte à de nouvelles possibilités qui améliorent intrinsèquement la fiabilité, la réputation, et la transparence pour toutes les parties concernées, tout en permettant la sécurité. Cependant, les blockchains classiques sont coûteuses en calcul, ont une évolutivité limitée, et nécessitent une bande passante élevée, ce qui les rend inadaptées aux environnements IdO à ressources limitées. L'objectif principal de cette thèse est d'utiliser la blockchain comme un outil clé pour améliorer l'IdO. Pour atteindre notre objectif, nous relevons les défis de la fiabilité des données et de la sécurité de l'IdO en utilisant la blockchain ainsi que de nouvelles technologies émergentes, notamment l'intelligence artificielle (IA). Dans la première partie de cette thèse, nous concevons une blockchain qui garantit la fiabilité des données, adaptée à l'IdO. Tout d'abord, nous proposons une architecture blockchain légère qui réalise la décentralisation en formant un réseau superposé où les dispositifs à ressources élevées gèrent conjointement la blockchain. Ensuite, nous présentons un algorithme de consensus léger qui réduit la puissance de calcul, la capacité de stockage, et la latence de la blockchain. Dans la deuxième partie de cette thèse, nous concevons un cadre sécurisé pour l'IdO tirant parti de la blockchain. Le nombre croissant d'attaques sur les réseaux IdO, et leurs graves effets, rendent nécessaire la création d'un IdO avec une sécurité plus sophistiquée. Par conséquent, nous tirons parti des modèles IA pour fournir une intelligence intégrée dans les dispositifs et les réseaux IdO afin de prédire et d'identifier les menaces et les vulnérabilités de sécurité. Nous proposons un système de détection d'intrusion par IA qui peut détecter les comportements malveillants et contribuer à renforcer la sécurité de l'IdO basé sur la blockchain. Ensuite, nous concevons un mécanisme de confiance distribué basé sur des contrats intelligents de blockchain pour inciter les dispositifs IdO à se comporter de manière fiable. Les systèmes IdO existants basés sur la blockchain souffrent d'une bande passante de communication et d’une évolutivité limitée. Par conséquent, dans la troisième partie de cette thèse, nous proposons un apprentissage machine évolutif basé sur la blockchain pour l'IdO. Tout d'abord, nous proposons un cadre IA multi-tâches qui exploite la blockchain pour permettre l'apprentissage parallèle de modèles. Ensuite, nous concevons une technique de partitionnement de la blockchain pour améliorer l'évolutivité de la blockchain. Enfin, nous proposons un algorithme d'ordonnancement des dispositifs pour optimiser l'utilisation des ressources, en particulier la bande passante de communication.Abstract : The Internet of Things (IoT) is reshaping the incumbent industry into a smart industry featured with data-driven decision making. The IoT interconnects many objects (or devices) that perform complex tasks (e.g., data collection, service optimization, data transmission). However, intrinsic features of IoT result in several challenges, such as decentralization, poor interoperability, privacy issues, and security vulnerabilities. With the expected evolution of IoT in the coming years, there is a need to ensure trust in this huge source of incoming information. Blockchain has emerged as a key technology to address the challenges of IoT. Due to its salient features such as decentralization, immutability, security, and auditability, blockchain has been proposed to establish trust in several applications, including IoT. The integration of IoT and blockchain opens the door for new possibilities that inherently improve trustworthiness, reputation, and transparency for all involved parties, while enabling security. However, conventional blockchains are computationally expensive, have limited scalability, and incur significant bandwidth, making them unsuitable for resource-constrained IoT environments. The main objective of this thesis is to leverage blockchain as a key enabler to improve the IoT. Toward our objective, we address the challenges of data reliability and IoT security using the blockchain and new emerging technologies, including machine learning (ML). In the first part of this thesis, we design a blockchain that guarantees data reliability, suitable for IoT. First, we propose a lightweight blockchain architecture that achieves decentralization by forming an overlay network where high-resource devices jointly manage the blockchain. Then, we present a lightweight consensus algorithm that reduces blockchain computational power, storage capability, and latency. In the second part of this thesis, we design a secure framework for IoT leveraging blockchain. The increasing number of attacks on IoT networks, and their serious effects, make it necessary to create an IoT with more sophisticated security. Therefore, we leverage ML models to provide embedded intelligence in the IoT devices and networks to predict and identify security threats and vulnerabilities. We propose a ML intrusion detection system that can detect malicious behaviors and help further bolster the blockchain-based IoT’s security. Then, we design a distributed trust mechanism based on blockchain smart contracts to incite IoT devices to behave reliably. Existing blockchain-based IoT systems suffer from limited communication bandwidth and scalability. Therefore, in the third part of this thesis, we propose a scalable blockchain-based ML for IoT. First, we propose a multi-task ML framework that leverages the blockchain to enable parallel model learning. Then, we design a blockchain partitioning technique to improve the blockchain scalability. Finally, we propose a device scheduling algorithm to optimize resource utilization, in particular communication bandwidth