Petar Popovski

IT
h-index72
61papers
28,367citations
Novelty38%
AI Score54

61 Papers

6.2NIJul 15
Learning a Decentralized Medium Access Control Protocol for Shared Message Transmission

Lorenzo Mario Amorosa, Zhan Gao, Roberto Verdone et al.

In large-scale Internet of things networks, efficient medium access control (MAC) is critical due to the growing number of devices competing for limited communication resources. In this work, we consider a new challenge in which a set of nodes must transmit a set of shared messages to a central controller, without inter-node communication or retransmissions. To our knowledge, this is the first work to formalize and analyze the multi-shared-message decentralized random access problem. Messages are distributed among random subsets of nodes, which must implicitly coordinate their transmissions over shared communication opportunities. The objective is to guarantee the delivery of all shared messages, regardless of which nodes transmit them. We first prove the existence of an optimal deterministic strategy, and characterize the success rate degradation of a deterministic strategy under dynamic message-transmission patterns. To solve this problem, we propose a decentralized learning-based framework that enables nodes to autonomously synthesize deterministic transmission strategies aiming to maximize message delivery success, together with an online adaptation mechanism that maintains stable performance in dynamic scenarios. Extensive simulations validate the framework's effectiveness, scalability, and adaptability, demonstrating its robustness to varying network sizes and fast adaptation to dynamic changes in transmission patterns, outperforming state-of-the-art approaches.

7.8LGJul 16, 2022
MixTailor: Mixed Gradient Aggregation for Robust Learning Against Tailored Attacks

Ali Ramezani-Kebrya, Iman Tabrizian, Fartash Faghri et al. · utoronto

Implementations of SGD on distributed systems create new vulnerabilities, which can be identified and misused by one or more adversarial agents. Recently, it has been shown that well-known Byzantine-resilient gradient aggregation schemes are indeed vulnerable to informed attackers that can tailor the attacks (Fang et al., 2020; Xie et al., 2020b). We introduce MixTailor, a scheme based on randomization of the aggregation strategies that makes it impossible for the attacker to be fully informed. Deterministic schemes can be integrated into MixTailor on the fly without introducing any additional hyperparameters. Randomization decreases the capability of a powerful adversary to tailor its attacks, while the resulting randomized aggregation scheme is still competitive in terms of performance. For both iid and non-iid settings, we establish almost sure convergence guarantees that are both stronger and more general than those available in the literature. Our empirical studies across various datasets, attacks, and settings, validate our hypothesis and show that MixTailor successfully defends when well-known Byzantine-tolerant schemes fail.

1.2ITMar 3, 2016
Spectrum Pooling in MmWave Networks: Opportunities, Challenges, and Enablers

Federico Boccardi, Hossein Shokri-Ghadikolaei, Gabor Fodor et al.

Motivated by the intrinsic characteristics of mmWave technologies, we discuss the possibility of an authorization regime that allows spectrum sharing between multiple operators, also referred to as spectrum pooling. In particular, considering user rate as the performance measure, we assess the benefit of coordination among the networks of different operators, study the impact of beamforming both at the base stations and at the user terminals, and analyze the pooling performance at different frequency carriers. We also discuss the enabling spectrum mechanisms, architectures, and protocols required to make spectrum pooling work in real networks. Our initial results show that, from a technical perspective, spectrum pooling at mmWave has the potential for a more efficient spectrum use than a traditional exclusive spectrum allocation to a single operator. However, further studies are needed in order to reach a thorough understanding of this matter, and we hope that this paper will help stimulate further research in this area.

14.9ITJun 1, 2022
Federated Learning in Satellite Constellations

Bho Matthiesen, Nasrin Razmi, Israel Leyva-Mayorga et al.

Federated learning (FL) has recently emerged as a distributed machine learning paradigm for systems with limited and intermittent connectivity. This paper presents the new context brought to FL by satellite constellations, where the connectivity patterns are significantly different from the ones observed in conventional terrestrial FL. The focus is on large constellations in low Earth orbit (LEO), where each satellites participates in a data-driven FL task using a locally stored dataset. This scenario is motivated by the trend towards mega constellations of interconnected small satellites in LEO and the integration of artificial intelligence in satellites. We propose a classification of satellite FL based on the communication capabilities of the satellites, the constellation design, and the location of the parameter server. A comprehensive overview of the current state-of-the-art in this field is provided and the unique challenges and opportunities of satellite FL are discussed. Finally, we outline several open research directions for FL in satellite constellations and present some future perspectives on this topic.

9.5CRMar 12, 2023
Blockchain-Empowered Trustworthy Data Sharing: Fundamentals, Applications, and Challenges

Linh T. Nguyen, Lam Duc Nguyen, Thong Hoang et al.

Various data-sharing platforms have emerged with the growing public demand for open data and legislation mandating certain data to remain open. Most of these platforms remain opaque, leading to many questions about data accuracy, provenance and lineage, privacy implications, consent management, and the lack of fair incentives for data providers. With their transparency, immutability, non-repudiation, and decentralization properties, blockchains could not be more apt to answer these questions and enhance trust in a data-sharing platform. However, blockchains are not good at handling the four Vs of big data (i.e., volume, variety, velocity, and veracity) due to their limited performance, scalability, and high cost. Given many related works proposes blockchain-based trustworthy data-sharing solutions, there is increasing confusion and difficulties in understanding and selecting these technologies and platforms in terms of their sharing mechanisms, sharing services, quality of services, and applications. In this paper, we conduct a comprehensive survey on blockchain-based data-sharing architectures and applications to fill the gap. First, we present the foundations of blockchains and discuss the challenges of current data-sharing techniques. Second, we focus on the convergence of blockchain and data sharing to give a clear picture of this landscape and propose a reference architecture for blockchain-based data sharing. Third, we discuss the industrial applications of blockchain-based data sharing, ranging from healthcare and smart grid to transportation and decarbonization. For each application, we provide lessons learned for the deployment of Blockchain-based data sharing. Finally, we discuss research challenges and open research directions.

10.4LGMar 10, 2022
A Contribution-based Device Selection Scheme in Federated Learning

Shashi Raj Pandey, Lam D. Nguyen, Petar Popovski

In a Federated Learning (FL) setup, a number of devices contribute to the training of a common model. We present a method for selecting the devices that provide updates in order to achieve improved generalization, fast convergence, and better device-level performance. We formulate a min-max optimization problem and decompose it into a primal-dual setup, where the duality gap is used to quantify the device-level performance. Our strategy combines \emph{exploration} of data freshness through a random device selection with \emph{exploitation} through simplified estimates of device contributions. This improves the performance of the trained model both in terms of generalization and personalization. A modified Truncated Monte-Carlo (TMC) method is applied during the exploitation phase to estimate the device's contribution and lower the communication overhead. The experimental results show that the proposed approach has a competitive performance, with lower communication overhead and competitive personalization performance against the baseline schemes.

5.9SPFeb 15, 2023Code
Guaranteed Dynamic Scheduling of Ultra-Reliable Low-Latency Traffic via Conformal Prediction

Kfir M. Cohen, Sangwoo Park, Osvaldo Simeone et al.

The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services, such as enhanced mobile broadband (eMBB) devices, by only allocating resources when necessary. The main challenge is posed by the uncertainty in the process of URLLC packet generation, which mandates the use of predictors for URLLC traffic in the coming frames. In practice, such prediction may overestimate or underestimate the amount of URLLC data to be generated, yielding either an excessive or an insufficient amount of resources to be pre-emptively allocated for URLLC packets. In this paper, we introduce a novel scheduler for URLLC packets that provides formal guarantees on reliability and latency irrespective of the quality of the URLLC traffic predictor. The proposed method leverages recent advances in online conformal prediction (CP), and follows the principle of dynamically adjusting the amount of allocated resources so as to meet reliability and latency requirements set by the designer.

11.8LGSep 20, 2022
FedToken: Tokenized Incentives for Data Contribution in Federated Learning

Shashi Raj Pandey, Lam Duc Nguyen, Petar Popovski

Incentives that compensate for the involved costs in the decentralized training of a Federated Learning (FL) model act as a key stimulus for clients' long-term participation. However, it is challenging to convince clients for quality participation in FL due to the absence of: (i) full information on the client's data quality and properties; (ii) the value of client's data contributions; and (iii) the trusted mechanism for monetary incentive offers. This often leads to poor efficiency in training and communication. While several works focus on strategic incentive designs and client selection to overcome this problem, there is a major knowledge gap in terms of an overall design tailored to the foreseen digital economy, including Web 3.0, while simultaneously meeting the learning objectives. To address this gap, we propose a contribution-based tokenized incentive scheme, namely \texttt{FedToken}, backed by blockchain technology that ensures fair allocation of tokens amongst the clients that corresponds to the valuation of their data during model training. Leveraging the engineered Shapley-based scheme, we first approximate the contribution of local models during model aggregation, then strategically schedule clients lowering the communication rounds for convergence and anchor ways to allocate \emph{affordable} tokens under a constrained monetary budget. Extensive simulations demonstrate the efficacy of our proposed method.

1.2SPAug 10, 2022
Fairness Based Energy-Efficient 3D Path Planning of a Portable Access Point: A Deep Reinforcement Learning Approach

Nithin Babu, Igor Donevski, Alvaro Valcarce et al.

In this work, we optimize the 3D trajectory of an unmanned aerial vehicle (UAV)-based portable access point (PAP) that provides wireless services to a set of ground nodes (GNs). Moreover, as per the Peukert effect, we consider pragmatic non-linear battery discharge for the battery of the UAV. Thus, we formulate the problem in a novel manner that represents the maximization of a fairness-based energy efficiency metric and is named fair energy efficiency (FEE). The FEE metric defines a system that lays importance on both the per-user service fairness and the energy efficiency of the PAP. The formulated problem takes the form of a non-convex problem with non-tractable constraints. To obtain a solution, we represent the problem as a Markov Decision Process (MDP) with continuous state and action spaces. Considering the complexity of the solution space, we use the twin delayed deep deterministic policy gradient (TD3) actor-critic deep reinforcement learning (DRL) framework to learn a policy that maximizes the FEE of the system. We perform two types of RL training to exhibit the effectiveness of our approach: the first (offline) approach keeps the positions of the GNs the same throughout the training phase; the second approach generalizes the learned policy to any arrangement of GNs by changing the positions of GNs after each training episode. Numerical evaluations show that neglecting the Peukert effect overestimates the air-time of the PAP and can be addressed by optimally selecting the PAP's flying speed. Moreover, the user fairness, energy efficiency, and hence the FEE value of the system can be improved by efficiently moving the PAP above the GNs. As such, we notice massive FEE improvements over baseline scenarios of up to 88.31%, 272.34%, and 318.13% for suburban, urban, and dense urban environments, respectively.

1.2ITDec 22, 2016
Anti-Jamming Strategy for Distributed Microgrid Control based on Power Talk Communication

Pietro Danzi, Marko Angjelichinoski, Čedomir Stefanović et al.

In standard implementations of distributed secondary control for DC MicroGrids (MGs), the exchange of local measurements among neighboring control agents is enabled via off-the-shelf wireless solutions, such as IEEE 802.11. However, Denial of Service (DoS) attacks on the wireless interface through jamming prevents the secondary control system from performing its main tasks, which might compromise the stability of the MG. In this paper, we propose novel, robust and secure secondary control reconfiguration strategy, tailored to counteract DoS attacks. Specifically, upon detecting the impairment of the wireless interface, the jammed secondary control agent notifies its peers via a secure, low-rate powerline channel based on Power Talk communication. This triggers reconfiguration of the wireless communication graph through primary control mode switching, where the jammed agents leave the secondary control by switching to current source mode, and are replaced by nonjammed current sources that switch to voltage source mode and join the secondary control. The strategy fits within the software-defined networking framework, where the network control is split from the data plane using reliable and secure side power talk communication channel, created via software modification of the MG primary control loops. The simulation results illustrate the feasibility of the solution and prove that the MG resilience and performance can be indeed improved via software-defined networking approaches.

1.2SYDec 22, 2016
Secure and Robust Authentication for DC MicroGrids based on Power Talk Communication

Marko Angjelichinoski, Pietro Danzi, Čedomir Stefanović et al.

We propose a novel framework for secure and reliable authentication of Distributed Energy Resources to the centralized secondary/tertiary control system of a DC MicroGrid (MG), networked using the IEEE 802.11 wireless interface. The key idea is to perform the authentication using power talk, which is a powerline communication technique executed by the primary control loops of the power electronic converters, without the use of a dedicated hardware for its modem. In addition, the scheme also promotes direct and active participation of the control system in the authentication process, a feature not commonly encountered in current networked control systems for MicroGrids. The PLECS-based simulations verifies the viability of our scheme.

5.9ITJul 19, 2024
Integrated Push-and-Pull Update Model for Goal-Oriented Effective Communication

Pouya Agheli, Nikolaos Pappas, Petar Popovski et al.

This paper studies decision-making for goal-oriented effective communication. We consider an end-to-end status update system where a sensing agent (SA) observes a source, generates and transmits updates to an actuation agent (AA), while the AA takes actions to accomplish a goal at the endpoint. We integrate the push- and pull-based update communication models to obtain a push-and-pull model, which allows the transmission controller at the SA to decide to push an update to the AA and the query controller at the AA to pull updates by raising queries at specific time instances. To gauge effectiveness, we utilize a grade of effectiveness (GoE) metric incorporating updates' freshness, usefulness, and timeliness of actions as qualitative attributes. We then derive effect-aware policies to maximize the expected discounted sum of updates' effectiveness subject to induced costs. The effect-aware policy at the SA considers the potential effectiveness of communicated updates at the endpoint, while at the AA, it accounts for the probabilistic evolution of the source and importance of generated updates. Our results show the proposed push-and-pull model outperforms models solely based on push- or pull-based updates both in terms of efficiency and effectiveness. Additionally, using effect-aware policies at both agents enhances effectiveness compared to periodic and/or probabilistic effect-agnostic policies at either or both agents.

4.3SPSep 12, 2024
Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints

Meiyi Zhu, Matteo Zecchin, Sangwoo Park et al.

This paper presents communication-constrained distributed conformal risk control (CD-CRC) framework, a novel decision-making framework for sensor networks under communication constraints. Targeting multi-label classification problems, such as segmentation, CD-CRC dynamically adjusts local and global thresholds used to identify significant labels with the goal of ensuring a target false negative rate (FNR), while adhering to communication capacity limits. CD-CRC builds on online exponentiated gradient descent to estimate the relative quality of the observations of different sensors, and on online conformal risk control (CRC) as a mechanism to control local and global thresholds. CD-CRC is proved to offer deterministic worst-case performance guarantees in terms of FNR and communication overhead, while the regret performance in terms of false positive rate (FPR) is characterized as a function of the key hyperparameters. Simulation results highlight the effectiveness of CD-CRC, particularly in communication resource-constrained environments, making it a valuable tool for enhancing the performance and reliability of distributed sensor networks.

3.3NIJun 15, 2022
Strategic Coalition for Data Pricing in IoT Data Markets

Shashi Raj Pandey, Pierre Pinson, Petar Popovski

This paper considers a market for trading Internet of Things (IoT) data that is used to train machine learning models. The data, either raw or processed, is supplied to the market platform through a network and the price of such data is controlled based on the value it brings to the machine learning model. We explore the correlation property of data in a game-theoretical setting to eventually derive a simplified distributed solution for a data trading mechanism that emphasizes the mutual benefit of devices and the market. The key proposal is an efficient algorithm for markets that jointly addresses the challenges of availability and heterogeneity in participation, as well as the transfer of trust and the economic value of data exchange in IoT networks. The proposed approach establishes the data market by reinforcing collaboration opportunities between device with correlated data to avoid information leakage. Therein, we develop a network-wide optimization problem that maximizes the social value of coalition among the IoT devices of similar data types; at the same time, it minimizes the cost due to network externalities, i.e., the impact of information leakage due to data correlation, as well as the opportunity costs. Finally, we reveal the structure of the formulated problem as a distributed coalition game and solve it following the simplified split-and-merge algorithm. Simulation results show the efficacy of our proposed mechanism design toward a trusted IoT data market, with up to 32.72% gain in the average payoff for each seller.

5.0ROFeb 28, 2023
Multi-Agent Reinforcement Learning for Pragmatic Communication and Control

Federico Mason, Federico Chiariotti, Andrea Zanella et al.

The automation of factories and manufacturing processes has been accelerating over the past few years, boosted by the Industry 4.0 paradigm, including diverse scenarios with mobile, flexible agents. Efficient coordination between mobile robots requires reliable wireless transmission in highly dynamic environments, often with strict timing requirements. Goal-oriented communication is a possible solution for this problem: communication decisions should be optimized for the target control task, providing the information that is most relevant to decide which action to take. From the control perspective, networked control design takes the communication impairments into account in its optmization of physical actions. In this work, we propose a joint design that combines goal-oriented communication and networked control into a single optimization model, an extension of a multiagent POMDP which we call Cyber-Physical POMDP (CP-POMDP). The model is flexible enough to represent several swarm and cooperative scenarios, and we illustrate its potential with two simple reference scenarios with a single agent and a set of supporting sensors. Joint training of the communication and control systems can significantly improve the overall performance, particularly if communication is severely constrained, and can even lead to implicit coordination of communication actions.

3.3DCSep 23, 2024
Energy-Aware Federated Learning in Satellite Constellations

Nasrin Razmi, Bho Matthiesen, Armin Dekorsy et al.

Federated learning in satellite constellations, where the satellites collaboratively train a machine learning model, is a promising technology towards enabling globally connected intelligence and the integration of space networks into terrestrial mobile networks. The energy required for this computationally intensive task is provided either by solar panels or by an internal battery if the satellite is in Earth's shadow. Careful management of this battery and system's available energy resources is not only necessary for reliable satellite operation, but also to avoid premature battery aging. We propose a novel energy-aware computation time scheduler for satellite FL, which aims to minimize battery usage without any impact on the convergence speed. Numerical results indicate an increase of more than 3x in battery lifetime can be achieved over energy-agnostic task scheduling.

1.2SYFeb 8, 2018
Software-Defined Microgrid Control for Resilience Against Cyber Attacks

Pietro Danzi, Marko Angjelichinoski, Čedomir Stefanović et al.

Microgrids (MGs) rely on networked control supported by off-the-shelf wireless communications. This makes them vulnerable to cyber-attacks, such as denial-of-service (DoS). In this paper, we mitigate those attacks by applying the concepts of (i) separation of data plane from network control plane, inspired by the software defined networking (SDN) paradigm, and (ii) agile reconfiguration of the data plane connections. In our architecture, all generators operate as either voltage regulators (active agents), or current sources (passive agents), with their operating mode being locally determined, according the global information on the MG state. The software-defined MG control utilizes the fact that, besides the data exchange on the wireless channel, the power-grid bus can be used to create side communication channels that carry control plane information about the state of the MG. For this purpose, we adopt power talk, a modem-less, low-rate, power-line communication designed for direct current (DC) MGs. The results show that the proposed software-defined MG offers superior performance compared to the static MG, as well as resilience against cyber attacks.

1.2SPMay 17, 2022
User Localization using RF Sensing: A Performance comparison between LIS and mmWave Radars

Cristian J. Vaca-Rubio, Dariush Salami, Petar Popovski et al.

Since electromagnetic signals are omnipresent, Radio Frequency (RF)-sensing has the potential to become a universal sensing mechanism with applications in localization, smart-home, retail, gesture recognition, intrusion detection, etc. Two emerging technologies in RF-sensing, namely sensing through Large Intelligent Surfaces (LISs) and mmWave Frequency-Modulated Continuous-Wave (FMCW) radars, have been successfully applied to a wide range of applications. In this work, we compare LIS and mmWave radars for localization in real-world and simulated environments. In our experiments, the mmWave radar achieves 0.71 Intersection Over Union (IOU) and 3cm error for bounding boxes, while LIS has 0.56 IOU and 10cm distance error. Although the radar outperforms the LIS in terms of accuracy, LIS features additional applications in communication in addition to sensing scenarios.

1.2SPJun 21, 2022
Floor Map Reconstruction Through Radio Sensing and Learning By a Large Intelligent Surface

Cristian J. Vaca-Rubio, Roberto Pereira, Xavier Mestre et al.

Environmental scene reconstruction is of great interest for autonomous robotic applications, since an accurate representation of the environment is necessary to ensure safe interaction with robots. Equally important, it is also vital to ensure reliable communication between the robot and its controller. Large Intelligent Surface (LIS) is a technology that has been extensively studied due to its communication capabilities. Moreover, due to the number of antenna elements, these surfaces arise as a powerful solution to radio sensing. This paper presents a novel method to translate radio environmental maps obtained at the LIS to floor plans of the indoor environment built of scatterers spread along its area. The usage of a Least Squares (LS) based method, U-Net (UN) and conditional Generative Adversarial Networks (cGANs) were leveraged to perform this task. We show that the floor plan can be correctly reconstructed using both local and global measurements.

1.2SPMay 23, 2022
User Clustering for Rate Splitting using Machine Learning

Roberto Pereira, Anay Ajit Deshpande, Cristian J. Vaca-Rubio et al.

Hierarchical Rate Splitting (HRS) schemes proposed in recent years have shown to provide significant improvements in exploiting spatial diversity in wireless networks and provide high throughput for all users while minimising interference among them. Hence, one of the major challenges for such HRS schemes is the necessity to know the optimal clustering of these users based only on their Channel State Information (CSI). This clustering problem is known to be NP hard and, to deal with the unmanageable complexity of finding an optimal solution, in this work a scalable and much lighter clustering mechanism based on Neural Network (NN) is proposed. The accuracy and performance metrics show that the NN is able to learn and cluster the users based on the noisy channel response and is able to achieve a rate comparable to other more complex clustering schemes from the literature.

7.7NIJun 3
A Combined Push-Pull Access Framework for Digital Twin Alignment and Anomaly Reporting

Federico Chiariotti, Fabio Saggese, Andrea Munari et al.

A digital twin (DT) contains a set of virtual models of real systems that are synchronized to their physical counterparts. This enables quick experimentation, simulating the consequences of decisions in real time. However, the DT's accuracy depends on timely updates that maintain alignment with the real system. We can distinguish between: (i) pull-updates, which follow a request from the DT to the sensors, to decrease its drift from the physical state; (ii) push-updates, which contain anomalies and are sent proactively by the sensors. In this work, we devise a push-pull scheduler (PPS) to integrate the two types of updates and dynamically allocate resources. Our scheme strikes a balance in the trade-off between DT alignment in normal conditions and anomaly reporting, reducing model drift by over 20% with respect to state-of-the-art solutions, while maintaining the same anomaly detection guarantees, as well as reducing the worst-case anomaly detection age of incorrect information (AoII) from 70 ms to 30 ms under the same drift constraint.

8.0NIJun 3
Dual-Mode Wireless Devices for Adaptive Pull and Push-Based Communication

Sara Cavallero, Fabio Saggese, Junya Shiraishi et al.

This paper introduces a dual-mode communication framework for wireless devices that integrates query-driven (pull) and event-driven (push) transmissions within a unified time-frame structure. Devices typically respond to information requests in pull mode, but if an anomaly is detected, they preempt the regular response to report the critical condition. Additionally, push-based communication is used to proactively send critical data without waiting for a request. This adaptive approach ensures timely, context-aware, and efficient data delivery across different network conditions. To achieve high energy efficiency, we incorporate a wake-up radio mechanism and we design a tailored medium access control (MAC) protocol that supports data traffic belonging to the different communication classes. A comprehensive system-level analysis is conducted, accounting for the wake-up control operation and evaluating three key performance metrics: the success probability of anomaly reports (push traffic), the success probability of query responses (pull traffic) and the total energy consumption. Numerical results characterize the system's behavior and highlight the inherent trade-off between push and pull success probabilities as a function of allocated communication resources. Our analysis demonstrates that the proposed approach achieves up to a 42% reduction in energy consumption per served packet compared to traditional approaches, while maintaining reliable support for both communication paradigms.

8.5NIMar 9Code
Medium Access for Push-Pull Data Transmission in 6G Wireless Systems

Shashi Raj Pandey, Fabio Saggese, Junya Shiraishi et al.

Medium access in 5G systems was tailored to accommodate diverse traffic classes through network resource slicing. 6G wireless systems are expected to be significantly reliant on Artificial Intelligence (AI), leading to data-driven and goal-oriented communication. This leads to augmentation of the design space for Medium Access Control (MAC) protocols, which is the focus of this article. We introduce a taxonomy based on push-based and pull-based communication, which is useful to categorize both the legacy and the AI-driven access schemes. We provide MAC protocol design guidelines for pull- and push-based communication in terms of goal-oriented criteria, such as timing and data relevance. We articulate a framework for co-existence between pull and push-based communications in 6G systems, combining their advantages. We highlight the design principles and main tradeoffs, as well as the architectural considerations for integrating these designs in Open-Radio Access Network (O-RAN) and 6G systems.

1.2ITMay 21, 2018
Joint Configuration of Transmission Direction and Altitude in UAV-based Two-Way Communication

Wenqian Huang, Dong Min Kim, Wenrui Ding et al.

When considering unidirectional communication for unmanned aerial vehicles (UAVs) as flying Base Stations (BSs), either uplink or downlink, the system is limited through the co-channel interference that takes place over line-of-sight (LoS) links. This paper considers two-way communication and takes advantage of the fact that the interference among the ground devices takes place through non-line-of-sight (NLoS) links. UAVs can be deployed at the high altitudes to have larger coverage, while the two-way communication allows to configure the transmission direction. Using these two levers, we show how the system throughput can be maximized for a given deployment of the ground devices.

1.2SYMar 29, 2017
Secure and Resilient Low-Rate Connectivity for Smart Energy Applications through Power Talk in DC Microgrids

Cedomir Stefanovic, Marko Angjelichinoski, Pietro Danzi et al.

The future smart grid is envisioned as a network of interconnected microgrids (MGs) - small-scale local power networks comprising generators, storage capacities and loads. MGs bring unprecedented modularity, efficiency, sustainability, and resilience to the power grid as a whole. Due to the high share of renewable generation, MGs require innovative concepts for control and optimization, giving rise to a novel class of smart energy applications, in which communications represent an integral part. In this paper, we review power talk, a communication technique specifically developed for direct current MGs, which exploits the communication potential residing within the MG power equipment. Depending on the smart energy application, power talk can be used either as a primary communication enabler, or an auxiliary communication system that provides resilient and secure operation. The key advantage of power talk is that it derives its availability, reliability, and security from the very MG elements, outmatching standard, off-the shelf communication solutions.

2.0LGNov 14, 2023
Batch Selection and Communication for Active Learning with Edge Labeling

Victor Croisfelt, Shashi Raj Pandey, Osvaldo Simeone et al.

Conventional retransmission (ARQ) protocols are designed with the goal of ensuring the correct reception of all the individual transmitter's packets at the receiver. When the transmitter is a learner communicating with a teacher, this goal is at odds with the actual aim of the learner, which is that of eliciting the most relevant label information from the teacher. Taking an active learning perspective, this paper addresses the following key protocol design questions: (i) Active batch selection: Which batch of inputs should be sent to the teacher to acquire the most useful information and thus reduce the number of required communication rounds? (ii) Batch encoding: Can batches of data points be combined to reduce the communication resources required at each communication round? Specifically, this work introduces Communication-Constrained Bayesian Active Knowledge Distillation (CC-BAKD), a novel protocol that integrates Bayesian active learning with compression via a linear mix-up mechanism. Comparisons with existing active learning protocols demonstrate the advantages of the proposed approach.

10.7LGDec 14, 2023Code
Greedy Shapley Client Selection for Communication-Efficient Federated Learning

Pranava Singhal, Shashi Raj Pandey, Petar Popovski

The standard client selection algorithms for Federated Learning (FL) are often unbiased and involve uniform random sampling of clients. This has been proven sub-optimal for fast convergence under practical settings characterized by significant heterogeneity in data distribution, computing, and communication resources across clients. For applications having timing constraints due to limited communication opportunities with the parameter server (PS), the client selection strategy is critical to complete model training within the fixed budget of communication rounds. To address this, we develop a biased client selection strategy, GreedyFed, that identifies and greedily selects the most contributing clients in each communication round. This method builds on a fast approximation algorithm for the Shapley Value at the PS, making the computation tractable for real-world applications with many clients. Compared to various client selection strategies on several real-world datasets, GreedyFed demonstrates fast and stable convergence with high accuracy under timing constraints and when imposing a higher degree of heterogeneity in data distribution, systems constraints, and privacy requirements.

13.4LGMay 20, 2024
Continual Deep Reinforcement Learning for Decentralized Satellite Routing

Federico Lozano-Cuadra, Beatriz Soret, Israel Leyva-Mayorga et al.

This paper introduces a full solution for decentralized routing in Low Earth Orbit satellite constellations based on continual Deep Reinforcement Learning (DRL). This requires addressing multiple challenges, including the partial knowledge at the satellites and their continuous movement, and the time-varying sources of uncertainty in the system, such as traffic, communication links, or communication buffers. We follow a multi-agent approach, where each satellite acts as an independent decision-making agent, while acquiring a limited knowledge of the environment based on the feedback received from the nearby agents. The solution is divided into two phases. First, an offline learning phase relies on decentralized decisions and a global Deep Neural Network (DNN) trained with global experiences. Then, the online phase with local, on-board, and pre-trained DNNs requires continual learning to evolve with the environment, which can be done in two different ways: (1) Model anticipation, where the predictable conditions of the constellation are exploited by each satellite sharing local model with the next satellite; and (2) Federated Learning (FL), where each agent's model is merged first at the cluster level and then aggregated in a global Parameter Server. The results show that, without high congestion, the proposed Multi-Agent DRL framework achieves the same E2E performance as a shortest-path solution, but the latter assumes intensive communication overhead for real-time network-wise knowledge of the system at a centralized node, whereas ours only requires limited feedback exchange among first neighbour satellites. Importantly, our solution adapts well to congestion conditions and exploits less loaded paths. Moreover, the divergence of models over time is easily tackled by the synergy between anticipation, applied in short-term alignment, and FL, utilized for long-term alignment.

3.3ITDec 8, 2023
Generative Network Layer for Communication Systems with Artificial Intelligence

Mathias Thorsager, Israel Leyva-Mayorga, Beatriz Soret et al.

The traditional role of the network layer is the transfer of packet replicas from source to destination through intermediate network nodes. We present a generative network layer that uses Generative AI (GenAI) at intermediate or edge network nodes and analyze its impact on the required data rates in the network. We conduct a case study where the GenAI-aided nodes generate images from prompts that consist of substantially compressed latent representations. The results from network flow analyses under image quality constraints show that the generative network layer can achieve an improvement of more than 100% in terms of the required data rate.

3.3SYMay 10, 2024
Intelligent Duty Cycling Management and Wake-up for Energy Harvesting IoT Networks with Correlated Activity

David E. Ruíz-Guirola, Onel L. A. López, Samuel Montejo-Sánchez et al.

This paper presents an approach for energy-neutral Internet of Things (IoT) scenarios where the IoT devices (IoTDs) rely entirely on their energy harvesting capabilities to sustain operation. We use a Markov chain to represent the operation and transmission states of the IoTDs, a modulated Poisson process to model their energy harvesting process, and a discrete-time Markov chain to model their battery state. The aim is to efficiently manage the duty cycling of the IoTDs, so as to prolong their battery life and reduce instances of low-energy availability. We propose a duty-cycling management based on K- nearest neighbors, aiming to strike a trade-off between energy efficiency and detection accuracy. This is done by incorporating spatial and temporal correlations among IoTDs' activity, as well as their energy harvesting capabilities. We also allow the base station to wake up specific IoTDs if more information about an event is needed upon initial detection. Our proposed scheme shows significant improvements in energy savings and performance, with up to 11 times lower misdetection probability and 50\% lower energy consumption for high-density scenarios compared to a random duty cycling benchmark.

2.3NIApr 15, 2024
Decentralized Multi-Party Multi-Network AI for Global Deployment of 6G Wireless Systems

Merim Dzaferagic, Marco Ruffini, Nina Slamnik-Krijestorac et al.

Multiple visions of 6G networks elicit Artificial Intelligence (AI) as a central, native element. When 6G systems are deployed at a large scale, end-to-end AI-based solutions will necessarily have to encompass both the radio and the fiber-optical domain. This paper introduces the Decentralized Multi-Party, Multi-Network AI (DMMAI) framework for integrating AI into 6G networks deployed at scale. DMMAI harmonizes AI-driven controls across diverse network platforms and thus facilitates networks that autonomously configure, monitor, and repair themselves. This is particularly crucial at the network edge, where advanced applications meet heightened functionality and security demands. The radio/optical integration is vital due to the current compartmentalization of AI research within these domains, which lacks a comprehensive understanding of their interaction. Our approach explores multi-network orchestration and AI control integration, filling a critical gap in standardized frameworks for AI-driven coordination in 6G networks. The DMMAI framework is a step towards a global standard for AI in 6G, aiming to establish reference use cases, data and model management methods, and benchmarking platforms for future AI/ML solutions.

3.3DCFeb 14, 2024
Scheduling for On-Board Federated Learning with Satellite Clusters

Nasrin Razmi, Bho Matthiesen, Armin Dekorsy et al.

Mega-constellations of small satellites have evolved into a source of massive amount of valuable data. To manage this data efficiently, on-board federated learning (FL) enables satellites to train a machine learning (ML) model collaboratively without having to share the raw data. This paper introduces a scheme for scheduling on-board FL for constellations connected with intra-orbit inter-satellite links. The proposed scheme utilizes the predictable visibility pattern between satellites and ground station (GS), both at the individual satellite level and cumulatively within the entire orbit, to mitigate intermittent connectivity and best use of available time. To this end, two distinct schedulers are employed: one for coordinating the FL procedures among orbits, and the other for controlling those within each orbit. These two schedulers cooperatively determine the appropriate time to perform global updates in GS and then allocate suitable duration to satellites within each orbit for local training, proportional to usable time until next global update. This scheme leads to improved test accuracy within a shorter time.

3.8LGDec 5, 2023
Privacy-Aware Data Acquisition under Data Similarity in Regression Markets

Shashi Raj Pandey, Pierre Pinson, Petar Popovski

Data markets facilitate decentralized data exchange for applications such as prediction, learning, or inference. The design of these markets is challenged by varying privacy preferences as well as data similarity among data owners. Related works have often overlooked how data similarity impacts pricing and data value through statistical information leakage. We demonstrate that data similarity and privacy preferences are integral to market design and propose a query-response protocol using local differential privacy for a two-party data acquisition mechanism. In our regression data market model, we analyze strategic interactions between privacy-aware owners and the learner as a Stackelberg game over the asked price and privacy factor. Finally, we numerically evaluate how data similarity affects market participation and traded data value.

6.8LGMar 8
Online Continual Learning for Anomaly Detection in IoT under Data Distribution Shifts

Matea Marinova, Shashi Raj Pandey, Junya Shiraishi et al.

In this work, we present OCLADS, a novel communication framework with continual learning (CL) for Internet of Things (IoT) anomaly detection (AD) when operating in non-stationary environments. As the statistical properties of the observed data change with time, the on-device inference model becomes obsolete, which necessitates strategic model updating. OCLADS keeps track of data distribution shifts to timely update the on-device IoT AD model. To do so, OCLADS introduces two mechanisms during the interaction between the resource-constrained IoT device and an edge server (ES): i) an intelligent sample selection mechanism at the device for data transmission, and ii) a distribution-shift detection mechanism at the ES for model updating. Experimental results with TinyML demonstrate that our proposed framework achieves high inference accuracy while realizing a significantly smaller number of model updates compared to the baseline schemes.

4.1LGNov 20, 2025
Real-Time Inference for Distributed Multimodal Systems under Communication Delay Uncertainty

Victor Croisfelt, João Henrique Inacio de Souza, Shashi Raj Pandey et al.

Connected cyber-physical systems perform inference based on real-time inputs from multiple data streams. Uncertain communication delays across data streams challenge the temporal flow of the inference process. State-of-the-art (SotA) non-blocking inference methods rely on a reference-modality paradigm, requiring one modality input to be fully received before processing, while depending on costly offline profiling. We propose a novel, neuro-inspired non-blocking inference paradigm that primarily employs adaptive temporal windows of integration (TWIs) to dynamically adjust to stochastic delay patterns across heterogeneous streams while relaxing the reference-modality requirement. Our communication-delay-aware framework achieves robust real-time inference with finer-grained control over the accuracy-latency tradeoff. Experiments on the audio-visual event localization (AVEL) task demonstrate superior adaptability to network dynamics compared to SotA approaches.

2.3ITSep 29, 2025
Prediction-Powered Communication with Distortion Guarantees

Matteo Zecchin, Unnikrishnan Kunnath Ganesan, Giuseppe Durisi et al.

The development of 6G wireless systems is taking place alongside the development of increasingly intelligent wireless devices and network nodes. The changing technological landscape is motivating a rethinking of classical Shannon information theory that emphasizes semantic and task-oriented paradigms. In this paper, we study a prediction-powered communication setting, in which devices, equipped with artificial intelligence (AI)-based predictors, communicate under zero-delay constraints with strict distortion guarantees. Two classes of distortion measures are considered: (i) outage-based metrics, suitable for tasks tolerating occasional packet losses, such as real-time control or monitoring; and (ii) bounded distortion metrics, relevant to semantic-rich tasks like text or video transmission. We propose two zero-delay compression algorithms leveraging online conformal prediction to provide per-sequence guarantees on the distortion of reconstructed sequences over error-free and packet-erasure channels with feedback. For erasure channels, we introduce a doubly-adaptive conformal update to compensate for channel-induced errors and derive sufficient conditions on erasure statistics to ensure distortion constraints. Experiments on semantic text compression validate the approach, showing significant bit rate reductions while strictly meeting distortion guarantees compared to state-of-the-art prediction-powered compression methods.

7.8MLJul 18, 2025
Conformal Data Contamination Tests for Trading or Sharing of Data

Martin V. Vejling, Shashi Raj Pandey, Christophe A. N. Biscio et al.

The amount of quality data in many machine learning tasks is limited to what is available locally to data owners. The set of quality data can be expanded through trading or sharing with external data agents. However, data buyers need quality guarantees before purchasing, as external data may be contaminated or irrelevant to their specific learning task. Previous works primarily rely on distributional assumptions about data from different agents, relegating quality checks to post-hoc steps involving costly data valuation procedures. We propose a distribution-free, contamination-aware data-sharing framework that identifies external data agents whose data is most valuable for model personalization. To achieve this, we introduce novel two-sample testing procedures, grounded in rigorous theoretical foundations for conformal outlier detection, to determine whether an agent's data exceeds a contamination threshold. The proposed tests, termed conformal data contamination tests, remain valid under arbitrary contamination levels while enabling false discovery rate control via the Benjamini-Hochberg procedure. Empirical evaluations across diverse collaborative learning scenarios demonstrate the robustness and effectiveness of our approach. Overall, the conformal data contamination test distinguishes itself as a generic procedure for aggregating data with statistically rigorous quality guarantees.

2.3SPMay 9, 2025
Multi-User Beamforming with Deep Reinforcement Learning in Sensing-Aided Communication

Xiyu Wang, Gilberto Berardinelli, Hei Victor Cheng et al.

Mobile users are prone to experience beam failure due to beam drifting in millimeter wave (mmWave) communications. Sensing can help alleviate beam drifting with timely beam changes and low overhead since it does not need user feedback. This work studies the problem of optimizing sensing-aided communication by dynamically managing beams allocated to mobile users. A multi-beam scheme is introduced, which allocates multiple beams to the users that need an update on the angle of departure (AoD) estimates and a single beam to the users that have satisfied AoD estimation precision. A deep reinforcement learning (DRL) assisted method is developed to optimize the beam allocation policy, relying only upon the sensing echoes. For comparison, a heuristic AoD-based method using approximated Cramér-Rao lower bound (CRLB) for allocation is also presented. Both methods require neither user feedback nor prior state evolution information. Results show that the DRL-assisted method achieves a considerable gain in throughput than the conventional beam sweeping method and the AoD-based method, and it is robust to different user speeds.

1.2NIMar 20, 2025
Integrating Atmospheric Sensing and Communications for Resource Allocation in NTNs

Israel Leyva-Mayorga, Fabio Saggese, Lintao Li et al.

The integration of Non-Terrestrial Networks (NTNs) with Low Earth Orbit (LEO) satellite constellations into 5G and Beyond is essential to achieve truly global connectivity. A distinctive characteristic of LEO mega constellations is that they constitute a global infrastructure with predictable dynamics, which enables the pre-planned allocation of radio resources. However, the different bands that can be used for ground-to-satellite communication are affected differently by atmospheric conditions such as precipitation, which introduces uncertainty on the attenuation of the communication links at high frequencies. Based on this, we present a compelling case for applying integrated sensing and communications (ISAC) in heterogeneous and multi-layer LEO satellite constellations over wide areas. Specifically, we propose a sensing-assisted communications framework and frame structure that not only enables the accurate estimation of the atmospheric attenuation in the communication links through sensing but also leverages this information to determine the optimal serving satellites and allocate resources efficiently for downlink communication with users on the ground. The results show that, by dedicating an adequate amount of resources for sensing and solving the association and resource allocation problems jointly, it is feasible to increase the average throughput by 59% and the fairness by 700% when compared to solving these problems separately.

5.1NIApr 19, 2024
Coexistence of Push Wireless Access with Pull Communication for Content-based Wake-up Radios

Junya Shiraishi, Sara Cavallero, Shashi Raj Pandey et al.

This paper considers energy-efficient connectivity for Internet of Things (IoT) devices in a coexistence scenario between two distinctive communication models: pull- and push-based. In pull-based, the base station (BS) decides when to retrieve a specific type of data from the IoT devices, while in push-based, the IoT device decides when and which data to transmit. To this end, this paper advocates introducing the content-based wake-up (CoWu), which enables the BS to remotely activate only a subset of pull-based nodes equipped with wake-up receivers, observing the relevant data. In this setup, a BS pulls data with CoWu at a specific time instance to fulfill its tasks while collecting data from the nodes operating with a push-based communication model. The resource allocation plays an important role: longer data collection duration for pull-based nodes can lead to high retrieval accuracy while decreasing the probability of data transmission success for push-based nodes, and vice versa. Numerical results show that CoWu can manage communication requirements for both pull-based and push-based nodes while realizing the high energy efficiency (up to 38%) of IoT devices, compared to the baseline scheduling method.

3.3ITOct 30, 2023Code
On the Impact of Control Signaling in RIS-Empowered Wireless Communications

Fabio Saggese, Victor Croisfelt, Radosław Kotaba et al.

The research on Reconfigurable Intelligent Surfaces (RISs) has dominantly been focused on physical-layer aspects and analyses of the achievable adaptation of the wireless propagation environment. Compared to that, questions related to system-level integration of RISs have received less attention. We address this research gap by analyzing the necessary control/signaling operations that are necessary to integrate RIS as a new type of wireless infrastructure element. We build a general model for evaluating the impact of control operations along two dimensions: i) the allocated bandwidth of the control channels (in-band and out-of-band), and ii) the rate selection for the data channel (multiplexing or diversity). Specifically, the second dimension results in two generic transmission schemes, one based on channel estimation and the subsequent optimization of the RIS, while the other is based on sweeping through predefined RIS phase configurations. We analyze the communication performance in multiple setups built along these two dimensions. While necessarily simplified, our analysis reveals the basic trade-offs in RIS-assisted communication and the associated control operations. The main contribution of the paper is a methodology for systematic evaluation of the control overhead in RIS-aided networks, regardless of the specific control schemes used.

5.1DCMay 19, 2023
Goal-Oriented Communications in Federated Learning via Feedback on Risk-Averse Participation

Shashi Raj Pandey, Van Phuc Bui, Petar Popovski

We treat the problem of client selection in a Federated Learning (FL) setup, where the learning objective and the local incentives of the participants are used to formulate a goal-oriented communication problem. Specifically, we incorporate the risk-averse nature of participants and obtain a communication-efficient on-device performance, while relying on feedback from the Parameter Server (\texttt{PS}). A client has to decide its transmission plan on when not to participate in FL. This is based on its intrinsic incentive, which is the value of the trained global model upon participation by this client. Poor updates not only plunge the performance of the global model with added communication cost but also propagate the loss in performance on other participating devices. We cast the relevance of local updates as \emph{semantic information} for developing local transmission strategies, i.e., making a decision on when to ``not transmit". The devices use feedback about the state of the PS and evaluate their contributions in training the learning model in each aggregation period, which eventually lowers the number of occupied connections. Simulation results validate the efficacy of our proposed approach, with up to $1.4\times$ gain in communication links utilization as compared with the baselines.

2.3ITMar 22, 2023Code
Localization-based OFDM framework for RIS-aided systems

Fabio Saggese, Kimmo Kansanen, Petar Popovski

Efficient integration of reconfigurable intelligent surfaces (RISs) into the current wireless network standard is not a trivial task due to the overhead generated by performing channel estimation (CE) and phase-shift optimization. In this paper, we propose a framework enabling the coexistence between orthogonal-frequency division multiplexing (OFDM) and RIS technologies. Instead of wasting communication symbols for the CE and optimization, the proposed framework exploits the localization information obtainable by RIS-aided communications to provide a robust allocation strategy for user multiplexing. The results demonstrate the effectiveness of the proposed approach with respect to CE-based transmission methods.

1.2ITNov 16, 2022Code
Efficient URLLC with a Reconfigurable Intelligent Surface and Imperfect Device Tracking

Fabio Saggese, Federico Chiariotti, Kimmo Kansanen et al.

The use of Reconfigurable Intelligent Surfaces (RIS) technology to extend coverage and allow for better control of the wireless environment has been proposed in several use cases, including Ultra-Reliable Low-Latency Communications (URLLC), communications. However, the extremely challenging latency constraint makes explicit channel estimation difficult, so positioning information is often used to configure the RIS and illuminate the receiver device. In this work, we analyze the effect of imperfections in the positioning information on the reliability, deriving an upper bound to the outage probability. We then use this bound to perform power control, efficiently finding the minimum power that respects the URLLC constraints under positioning uncertainty. The optimization is conservative, so that all points respect the URLLC constraints, and the bound is relatively tight, with an optimality gap between 1.5 and 4.5~dB.

1.2ITJul 4, 2022
Power Minimization of Downlink Spectrum Slicing for eMBB and URLLC Users

Fabio Saggese, Marco Moretti, Petar Popovski

5G technology allows heterogeneous services to share the wireless spectrum within the same radio access network. In this context, spectrum slicing of the shared radio resources is a critical task to guarantee the performance of each service. We analyze a downlink communication serving two types of traffic: enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC). Due to the nature of low-latency traffic, the base station knows the channel state information (CSI) of the eMBB users while having statistical CSI for the URLLC users. We study the power minimization problem employing orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) schemes. Based on this analysis, we propose a lookup table-based approach and a block coordinated descent (BCD) algorithm. We show that the BCD is optimal for the URLLC power allocation. The numerical results show that NOMA leads to lower power consumption than OMA, except when the average channel gain of the URLLC user is very high. For the latter case, the optimal approach depends on the channel condition of the eMBB user. Even when OMA attains the best performance, the gap with NOMA is negligible, showing the capability of NOMA to reduce power consumption in practically every condition.

2.3ITMar 15, 2022Code
A Random Access Protocol for RIS-Aided Wireless Communications

Victor Croisfelt, Fabio Saggese, Israel Leyva-Mayorga et al.

Reconfigurable intelligent surfaces (RISs) are arrays of passive elements that can control the reflection of the incident electromagnetic waves. While RIS are particularly useful to avoid blockages, the protocol aspects for their implementation have been largely overlooked. In this paper, we devise a random access protocol for a RIS-assisted wireless communication setting. Rather than tailoring RIS reflections to meet the positions of users equipment (UEs), our protocol relies on a finite set of RIS configurations designed to cover the area of interest. The protocol is comprised of a downlink training phase followed by an uplink access phase. During these phases, a base station (BS) controls the RIS to sweep over its configurations. The UEs then receive training signals to measure the channel quality with the different RIS configurations and refine their access policies. Numerical results show that our protocol increases the average number of successful access attempts; however, at the expense of increased access delay due to the realization of a training period. Promising results are further observed in scenarios with a high access load.

8.4LGDec 6, 2021
A Marketplace for Trading AI Models based on Blockchain and Incentives for IoT Data

Lam Duc Nguyen, Shashi Raj Pandey, Soret Beatriz et al.

As Machine Learning (ML) models are becoming increasingly complex, one of the central challenges is their deployment at scale, such that companies and organizations can create value through Artificial Intelligence (AI). An emerging paradigm in ML is a federated approach where the learning model is delivered to a group of heterogeneous agents partially, allowing agents to train the model locally with their own data. However, the problem of valuation of models, as well the questions of incentives for collaborative training and trading of data/models, have received limited treatment in the literature. In this paper, a new ecosystem of ML model trading over a trusted Blockchain-based network is proposed. The buyer can acquire the model of interest from the ML market, and interested sellers spend local computations on their data to enhance that model's quality. In doing so, the proportional relation between the local data and the quality of trained models is considered, and the valuations of seller's data in training the models are estimated through the distributed Data Shapley Value (DSV). At the same time, the trustworthiness of the entire trading process is provided by the distributed Ledger Technology (DLT). Extensive experimental evaluation of the proposed approach shows a competitive run-time performance, with a 15\% drop in the cost of execution, and fairness in terms of incentives for the participants.

2.3ITOct 27, 2021
NOMA Power Minimization of Downlink Spectrum Slicing for eMBB and URLLC Users

Fabio Saggese, Marco Moretti, Petar Popovski

Spectrum slicing of the shared radio resources is a critical task in 5G networks with heterogeneous services, through which each service gets performance guarantees. In this paper, we consider a setup in which a Base Station (BS) should serve two types of traffic in the downlink, enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC), respectively. Two resource allocation strategies are compared: non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). A framework for power minimization is presented, in which the BS knows the channel state information (CSI) of the eMBB users only. Nevertheless, due to the resource sharing, it is shown that this knowledge can be used also to the benefit of the URLLC users. The numerical results show that NOMA leads to a lower power consumption compared to OMA for every simulation parameter under test.

1.2DCOct 4, 2021
Learning, Computing, and Trustworthiness in Intelligent IoT Environments: Performance-Energy Tradeoffs

Beatriz Soret, Lam D. Nguyen, Jan Seeger et al.

An Intelligent IoT Environment (iIoTe) is comprised of heterogeneous devices that can collaboratively execute semi-autonomous IoT applications, examples of which include highly automated manufacturing cells or autonomously interacting harvesting machines. Energy efficiency is key in such edge environments, since they are often based on an infrastructure that consists of wireless and battery-run devices, e.g., e-tractors, drones, Automated Guided Vehicle (AGV)s and robots. The total energy consumption draws contributions from multipleiIoTe technologies that enable edge computing and communication, distributed learning, as well as distributed ledgers and smart contracts. This paper provides a state-of-the-art overview of these technologies and illustrates their functionality and performance, with special attention to the tradeoff among resources, latency, privacy and energy consumption. Finally, the paper provides a vision for integrating these enabling technologies in energy-efficient iIoTe and a roadmap to address the open research challenges

6.5CVSep 14, 2021
Tesla-Rapture: A Lightweight Gesture Recognition System from mmWave Radar Point Clouds

Dariush Salami, Ramin Hasibi, Sameera Palipana et al.

We present Tesla-Rapture, a gesture recognition interface for point clouds generated by mmWave Radars. State of the art gesture recognition models are either too resource consuming or not sufficiently accurate for integration into real-life scenarios using wearable or constrained equipment such as IoT devices (e.g. Raspberry PI), XR hardware (e.g. HoloLens), or smart-phones. To tackle this issue, we developed Tesla, a Message Passing Neural Network (MPNN) graph convolution approach for mmWave radar point clouds. The model outperforms the state of the art on two datasets in terms of accuracy while reducing the computational complexity and, hence, the execution time. In particular, the approach, is able to predict a gesture almost 8 times faster than the most accurate competitor. Our performance evaluation in different scenarios (environments, angles, distances) shows that Tesla generalizes well and improves the accuracy up to 20% in challenging scenarios like a through-wall setting and sensing at extreme angles. Utilizing Tesla, we develop Tesla-Rapture, a real-time implementation using a mmWave Radar on a Raspberry PI 4 and evaluate its accuracy and time-complexity. We also publish the source code, the trained models, and the implementation of the model for embedded devices.