Francesco Restuccia

Dr. Francesco Restuccia


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 June 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
FRFrancesco Restuccia
Francesco Restuccia
SDSalvatore D'Oro
Salvatore D'Oro
TMTommaso Melodia
Tommaso Melodia
The Internet of Things (IoT) realizes a vision where billions of interconnected devices are deployed just about everywhere, from inside our bodies to the most remote areas of the globe. As the IoT will soon pervade every aspect of our lives and will be accessible from anywhere, addressing critical IoT security threats is now more important than ever. Traditional approaches where security is applied as an afterthought and as a “patch” against known attacks are insufficient. Indeed, next-generation IoT challenges will require a new secure-by-design vision, where threats are addressed proactively and IoT devices learn to dynamically adapt to different threats. To this end, machine learning and software-defined networking will be key to provide both reconfigurability and intelligence to the IoT devices. In this paper, we first provide a taxonomy and survey the state of the art in IoT security research, and offer a roadmap of concrete research challenges related to the application of machine learning and software-defined networking to address existing and next-generation IoT security threats.

30 November 2017 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
PDF file
FRFrancesco Restuccia
Francesco Restuccia
NGNirnay Ghosh
Nirnay Ghosh
SBShameek Bhattacharjee
Shameek Bhattacharjee
SSajal K. Das
Sajal K. Das
TMTommaso Melodia
Tommaso Melodia
Smartphones have become the most pervasive devices in people’s lives and are clearly transforming the way we live and perceive technology. Today’s smartphones benefit from almost ubiquitous Internet connectivity and come equipped with a plethora of inexpensive yet powerful embedded sensors, such as an accelerometer, a gyroscope, a microphone, and a camera. This unique combination has enabled revolutionary applications based on the mobile crowdsensing paradigm, such as real-time road traffic monitoring, air and noise pollution, crime control, and wildlife monitoring, just to name a few. Differently from prior sensing paradigms, humans are now the primary actors of the sensing process, since they become fundamental in retrieving reliable and up-to-date information about the event being monitored. As humans may behave unreliably or maliciously, assessing and guaranteeing Quality of Information (QoI) becomes more important than ever. In this article, we provide a new framework for defining and enforcing the QoI in mobile crowdsensing and analyze in depth the current state of the art on the topic. We also outline novel research challenges, along with possible directions of future work.

12 November 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SDSalvatore D'Oro
Salvatore D'Oro
FRFrancesco Restuccia
Francesco Restuccia
TMTommaso Melodia
Tommaso Melodia
SPSergio Palazzo
Sergio Palazzo
Radio access network (RAN) slicing is an effective methodology to dynamically allocate networking resources in 5G networks. One of the main challenges of RAN slicing is that it is provably an NP-Hard problem. For this reason, we design near-optimal low-complexity distributed RAN slicing algorithms. First, we model the slicing problem as a congestion game, and demonstrate that such game admits a unique Nash equilibrium (NE). Then, we evaluate the Price of Anarchy (PoA) of the NE, i.e., the efficiency of the NE as compared with the social optimum, and demonstrate that the PoA is upper-bounded by 3/2. Next, we propose two fully-distributed algorithms that provably converge to the unique NE without revealing privacy-sensitive parameters from the slice tenants. Moreover, we introduce an adaptive pricing mechanism of the wireless resources to improve the network owner's profit. We evaluate the performance of our algorithms through simulations and an experimental testbed deployed on the Amazon EC2 cloud, both based on a real-world dataset of base stations from the OpenCellID project. Results conclude that our algorithms converge to the NE rapidly and achieve near-optimal performance, while our pricing mechanism effectively improves the profit of the network owner.

27 November 2024 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
KWKai Wu
Kai Wu
JPJacopo Pegoraro
Jacopo Pegoraro
FMFrancesca Meneghello
Francesca Meneghello
AZAndrew Zhang
Andrew Zhang
JLJesus O. Lacruz
Jesus O. Lacruz
Yingjie Jay GuoYingjie Jay Guo
Yingjie Jay Guo
Integrated Sensing And Communication (ISAC) has been identified as a pillar usage scenario for the impending 6G era. Bi-static sensing, a major type of sensing in ISAC, is promising to expedite ISAC in the near future, as it requires minimal changes to the existing network infrastructure. However, a critical challenge for bi-static sensing is clock asynchronism due to the use of different clocks at far-separated transmitters and receivers. This causes the received signal to be affected by time-varying random phase offsets, severely degrading, or even failing, direct sensing. Hence, to effectively enable ISAC, considerable research has been directed toward addressing the clock asynchronism issue in bi-static sensing. This paper provides an overview of the issue and existing techniques developed in an ISAC background. Based on the review and comparison, we also draw insights into the future research directions and open problems, aiming to nurture the maturation of bi-static sensing in ISAC.

6 August 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
FRFrancesco Restuccia
Francesco Restuccia
PFPierluca Ferraro
Pierluca Ferraro
SSSimone Silvestri
Simone Silvestri
SSajal K. Das
Sajal K. Das
GRGiuseppe Lo Re
Giuseppe Lo Re
Mobile crowdsensing harnesses the sensing power of modern smartphones to collect and analyze data beyond the scale of what was previously possible. In a mobile crowdsensing system, it is paramount to incentivize smartphone users to provide sensing services in a timely and reliable manner. Given sensed information is often valid for a limited period of time, the capability of smartphone users to execute sensing tasks largely depends on their mobility, which is often uncertain. For this reason, in this paper we propose IncentMe, a framework that solves this fundamental problem by leveraging game-theoretical reverse auction mechanism design. After demonstrating that the proposed problem is NP-hard, we derive two mechanisms that are parallelizable and achieve higher approximation ratio than existing work. IncentMe has been extensively evaluated on a road traffic monitoring application implemented using mobility traces of taxi cabs in San Francisco, Rome, and Beijing. Results demonstrate that the mechanisms in IncentMe outperform the state of the art work by improving the efficiency in recruiting participants by 30%.

22 April 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
SDSalvatore D'Oro
Salvatore D'Oro
LBLeonardo Bonati
Leonardo Bonati
FRFrancesco Restuccia
Francesco Restuccia
TMTommaso Melodia
Tommaso Melodia
Radio access network (RAN) slicing is a virtualization technology that partitions radio resources into multiple autonomous virtual networks. Since RAN slicing can be tailored to provide diverse performance requirements, it will be pivotal to achieve the high-throughput and low-latency communications that next-generation (5G) systems have long yearned for. To this end, effective RAN slicing algorithms must (i) partition radio resources so as to leverage coordination among multiple base stations and thus boost network throughput; and (ii) reduce interference across different slices to guarantee slice isolation and avoid performance degradation. The ultimate goal of this paper is to design RAN slicing algorithms that address the above two requirements. First, we show that the RAN slicing problem can be formulated as a 0-1 Quadratic Programming problem, and we prove its NP-hardness. Second, we propose an optimal solution for small-scale 5G network deployments, and we present three approximation algorithms to make the optimization problem tractable when the network size increases. We first analyze the performance of our algorithms through simulations, and then demonstrate their performance through experiments on a standard-compliant LTE testbed with 2 base stations and 6 smartphones. Our results show that not only do our algorithms efficiently partition RAN resources, but also improve network throughput by 27% and increase by 2× the signal-to-interference-plus-noise ratio.