Search

The Internet of Things (IoT) can support the evolution towards a digital and green future. However, the introduction of the technology clearly has in itself a direct adverse ecological impact. This paper assesses this impact at both the IoT-node and at the network side. For the nodes, we show that the electronics production of devices comes with a carbon footprint that can be much higher than during operation phase. We highlight that the inclusion of IoT support in existing cellular networks comes with a significant ecological penalty, raising overall energy consumption by more than 15%. These results call for novel design approaches for the nodes and for early consideration of the support for IoT in future networks. Raising the 'Vehicle or bandit?' question on the nature of IoT in the broader sense of sustainability, we illustrate the need for multidisciplinary cooperation to steer applications in desirable directions.

The physical layer foundations of cell-free massive MIMO (CF-mMIMO) have been well-established. As a next step, researchers are investigating practical and energy-efficient network implementations. This paper focuses on multiple sets of access points (APs) where user equipments (UEs) are served in each set, termed a federation, without inter-federation interference. The combination of federations and CF-mMIMO shows promise for highly-loaded scenarios. Our aim is to minimize the total energy consumption while adhering to UE downlink data rate constraints. The energy expenditure of the full system is modelled using a detailed hardware model of the APs. We jointly design the AP-UE association variables, determine active APs, and assign APs and UEs to federations. To solve this highly combinatorial problem, we develop a novel alternating optimization algorithm. Simulation results for an indoor factory demonstrate the advantages of considering multiple federations, particularly when facing large data rate requirements. Furthermore, we show that adopting a more distributed CF-mMIMO architecture is necessary to meet the data rate requirements. Conversely, if feasible, using a less distributed system with more antennas at each AP is more advantageous from an energy savings perspective., Comment: EuCNC/6G Summit 2024

The emergence of sixth-generation (6G) networks has spurred the development of novel testbeds, including sub-THz networks, cell-free systems, and 6G simulators. To maximize the benefits of these systems, it is crucial to make the generated data publicly available and easily reusable by others. Although data sharing has become a common practice, a lack of standardization hinders data accessibility and interoperability. In this study, we propose the Dataset Storage Standard (DSS) to address these challenges by facilitating data exchange and enabling convenient processing script creation in a testbed-agnostic manner. DSS supports both experimental and simulated data, allowing researchers to employ the same processing scripts and tools across different datasets. Unlike existing standardization efforts such as SigMF and NI RF Data Recording API, DSS provides a broader scope by accommodating a common definition file for testbeds and is not limited to RF data storage. The dataset format utilizes a hierarchical structure, with a tensor representation for specific experiment scenarios. In summary, DSS offers a comprehensive and flexible framework for enhancing the FAIR principles (Findability, Accessibility, Interoperability, and Reusability) in 6G testbeds, promoting open and efficient data sharing in the research community.

Cell-Free networking is one of the prime candidates for 6G networks. Despite being capable of providing the 6G needs, practical limitations and considerations are often neglected in current research. In this work, we introduce the concept of federations to dynamically scale and select the best set of resources, e.g., antennas, computing and data resources, to serve a given application. Next to communication, 6G systems are expected to provide also wireless powering, positioning and sensing, further increasing the complexity of such systems. Therefore, each federation is self-managing and is distributed over the area in a cell-free manner. Next to the dynamic federations, new accompanying terminology is proposed to design cell-free systems taking into account practical limitations such as time synchronization and distributed processing. We conclude with an illustration with four federations, serving distinct applications, and introduce two new testbeds to study these architectures and concepts.

Digital twins, which are a new concept in industrial control systems (ICS), play a key role in realizing the vision of a smart factory, and they can have different effective use cases. With digital twins, we have virtual replicas of physical systems so that they precisely mirror the internal behavior of the physical systems. Hence, synchronization is necessary to keep the states of digital twins in sync with those of their physical counterparts. Otherwise, their behavior may be different from each other, and it can lead to wrong decisions about the system that can have catastrophic consequences. In this paper, we propose three different architectures for digital twins, and then by investigating their ability to follow the physical system's behavior, we will determine the best architecture, whose output has the lowest error compared with the physical system's output., Comment: 4 pages, 6 figures

Massive MIMO is a leading technology to connect very large numbers of energy constrained nodes, as it offers both extensive spatial multiplexing and large array gain. A challenge resides in partitioning the many nodes into groups that can communicate simultaneously such that the mutual interference is minimized. We here propose node partitioning strategies that do not require full channel state information, but rather are based on nodes' respective directional channel properties. In our considered scenarios, these typically have a time constant that is far larger than the coherence time of the channel. We developed both an optimal and an approximation algorithm to partition users based on directional channel properties, and evaluated them numerically. Our results show that both algorithms, despite using only these directional channel properties, achieve similar performance in terms of the minimum signal-to-interference-plus-noise ratio for any user, compared with a reference method using full channel knowledge. In particular, we demonstrate that grouping nodes with related directional properties is to be avoided. We hence realise a simple partitioning method requiring minimal information to be collected from the nodes, and where this information typically remains stable over a long term, thus promoting their autonomy and energy efficiency.

In this paper we address the problem of resource allocation for alarm traffic in industrial Internet of Things networks using massive MIMO. We formulate the general problem of how to allocate pilot signals to alarm traffic such that delivery is guaranteed, while also minimising the number of pilots reserved for alarms, thus maximising the channel resources available for other traffic, such as industrial control traffic. We present an algorithm that fulfils these requirements, and evaluate its performance both analytically and through a simulation study. For realistic alarm traffic characteristics, on average our algorithm can deliver alarms within two time slots (of duration equal to the 5G transmission time interval) using fewer than 1.5 pilots per slot, and even in the worst case it uses around 3.5 pilots in any given slot, with delivery guaranteed in an average of approximately four slots., Comment: 11th International Workshop on Resilient Networks Design and Modeling (RNDM) 2019

In this paper we present new optimization formulations for maximizing the network lifetime in wireless mesh networks performing data aggregation and dissemination for machine-to-machine communication in the Internet of Things. We focus on heterogeneous networks in which multiple applications co-exist and nodes may take on different roles for different applications. Moreover, we address network reconfiguration as a means to increase the network lifetime, in keeping with the current trend towards software defined networks and network function virtualization. To test our optimization formulations, we conducted a numerical study using randomly-generated mesh networks from 10 to 30 nodes, and showed that the network lifetime can be increased using network reconfiguration by up to 75% over a single, minimal-energy configuration. Further, our solutions are feasible to implement in practical scenarios: only few configurations are needed, thus requiring little storage for a standalone network, and the synchronization and signalling needed to switch configurations is low relative to each configuration's operating time., Comment: Ad Hoc Networks, in press

Massive multiple-input multiple-output (MIMO) is expected to be a vital component in future 5G systems. As such, there is a need for new modeling in order to investigate the performance of massive MIMO not only at the physical layer, but also higher up the networking stack. In this paper, we present general optimization models for massive MIMO, based on mixed-integer programming and compatible sets, with both maximum ratio combing and zero forcing precoding schemes. We then apply our models to the case of joint device scheduling and power control for heterogeneous devices and traffic demands, in contrast to existing power control schemes that consider only homogeneous users and saturated scenarios. Our results show substantial benefits in terms of energy usage can be achieved without sacrificing throughput, and that both signalling overhead and the complexity of end devices can be reduced by abrogating the need for uplink power control through efficient scheduling.

Internet of Things (IoT) devices can be equipped with multiple heterogeneous network interfaces. An overwhelmingly large amount of services may demand some or all of these interfaces' available resources. Herein, we present a precise mathematical formulation of assigning services to interfaces with heterogeneous resources in one or more rounds. For reasonable instance sizes, the presented formulation produces optimal solutions for this computationally hard problem. We prove the NP-Completeness of the problem and develop two algorithms to approximate the optimal solution for big instance sizes. The first algorithm allocates the most demanding service requirements first, considering the average cost of interfaces resources. The second one calculates the demanding resource shares and allocates the most demanding of them first by choosing randomly among equally demanding shares. Finally, we provide simulation results giving insight into services splitting over different interfaces for both cases., Comment: IEEE Internet of Things Journal