Software Defined Radio (SDR)-enabled cognitive radio network architectures are expected to play an important role in the future 5G networks. Despite the increased research interest, the current implementations are of small-scale and provide limited functionality. In this paper, we contribute towards the alleviation of the limitations in SDR deployments by developing and evaluating a resource allocation approach for cognitive radios implemented with SDR technology over two testbeds of the ORCA federation. Resource allocation is based on a Markov Random Field (MRF) framework realizing a distributed cross-layer computation for the secondary nodes of the cognitive radio network. The proposed framework implementation consists of self-contained modules developed in GNU Radio realizing cognitive functionalities, such as spectrum sensing, collision detection, etc. We demonstrate the feasibility of the MRF based resource allocation approach and provide extensive results and performance analysis that highlight its key features. The latter provide useful insights about the advantages of our framework, while allowing to pinpoint current technological barriers of broader interest.

In the highly competitive field of material manufacturing, stakeholders strive for the increased quality of the end products, reduced cost of operation, and the timely completion of their business processes. Digital twin (DT) technologies are considered major enablers that can be deployed to assist the development and effective provision of manufacturing processes. Additionally, knowledge graphs (KG) have emerged as efficient tools in the industrial domain and are able to efficiently represent data from various disciplines in a structured manner while also supporting advanced analytics. This paper proposes a solution that integrates a KG and DTs. Through this synergy, we aimed to develop highly autonomous and flexible DTs that utilize the semantic knowledge stored in the KG to better support advanced functionalities. The developed KG stores information about materials and their properties and details about the processes in which they are involved, following a flexible schema that is not domain specific. The DT comprises smaller Virtual Objects (VOs), each one acting as an abstraction of a single step of the Industrial Business Process (IBP), providing the necessary functionalities that simulate the corresponding real-world process. By executing appropriate queries to the KG, the DT can orchestrate the operation of the VOs and their physical counterparts and configure their parameters accordingly, in this way increasing its self-awareness. In this article, the architecture of such a solution is presented and its application in a real laser glass bending process is showcased.

The demand for Autonomic Network Management (ANM) and optimization is as intense as ever, even though significant research has been devoted towards this direction. This paper addresses such need in Software Defined (SDR) based Cognitive Radio Networks (CRNs). We propose a new framework for ANM and network reconfiguration combining Software Defined Networks (SDN) with SDR via Network Function Virtualization (NFV) enabled Virtual Utility Functions (VUFs). This is the first approach combining ANM with SDR and SDN via NFV, demonstrating how these state-of-the-art technologies can be effectively combined to achieve reconfiguration flexibility, improved performance and efficient use of available resources. In order to show the feasibility of the proposed framework, we implemented its main functionalities in a cross-layer resource allocation mechanism for CRNs over real SDR testbeds provided by the Orchestration and Reconfiguration Control Architecture (ORCA) EU project. We demonstrate the efficacy of our framework, and based on the obtained results, we identify aspects that can be further investigated for improving the applicability and increasing performance of our broader framework.

In this paper, we present a novel data clustering framework for big sensory data produced by IoT applications. Based on a network representation of the relations among multi-dimensional data, data clustering is mapped to node clustering over the produced data graphs. To address the potential very large scale of such datasets/graphs that test the limits of state-of-the-art approaches, we map the problem of data clustering to a community detection one over the corresponding data graphs. Specifically, we propose a novel computational approach for enhancing the traditional Girvan–Newman (GN) community detection algorithm via hyperbolic network embedding. The data dependency graph is embedded in the hyperbolic space via Rigel embedding, allowing more efficient computation of edge-betweenness centrality needed in the GN algorithm. This allows for more efficient clustering of the nodes of the data graph in terms of modularity, without sacrificing considerable accuracy. In order to study the operation of our approach with respect to enhancing GN community detection, we employ various representative types of artificial complex networks, such as scale-free, small-world and random geometric topologies, and frequently-employed benchmark datasets for demonstrating its efficacy in terms of data clustering via community detection. Furthermore, we provide a proof-of-concept evaluation by applying the proposed framework over multi-dimensional datasets obtained from an operational smart-city/building IoT infrastructure provided by the Federated Interoperable Semantic IoT/cloud Testbeds and Applications (FIESTA-IoT) testbed federation. It is shown that the proposed framework can be indeed used for community detection/data clustering and exploited in various other IoT applications, such as performing more energy-efficient smart-city/building sensing.

Community detection and its variations is one of the typically employed approaches for analyzing graph data originating from various diverse fields. In this paper, we focus on a particular approach for community detection capitalizing on hyperbolic network embedding, which is aimed at analyzing large data graphs. In order to enable its scaling to arbitrary sized data sets and respective data graphs, we extend it by incorporating a graph database approach. This allows for handling a larger number of nodes and edges in the data graph. Also, we turn our focus on the discovery and visualization of communities in Resource Description Framework (RDF) data, namely over linked datasets from diverse areas, explaining how our approach can accommodate relevant analysis. We demonstrate the applicability of the new approach over both real-world and artificially generated datasets showing its feasibility in producing correct results, while being able to scale seamlessly in large datasets. The approach can be used for multi-lateral analysis of feature-rich graph data, originating from diverse sources, enabling the discovery of hidden correlations through the hyperbolic network embedding.