CPChiara Pielli

Chiara Pielli

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chiara Pielli has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • An Analytical Model for CBAP Allocations in IEEE 802.11ad

    by Chiara Pielli, Tanguy Ropitault, Nada Golmie, Michele Zorzi

    The IEEE 802.11ad standard extends WiFi operation to the millimeter wave frequencies, and introduces novel features concerning both the physical (PHY) and mac layers. The hybrid mac layer provides for two different kinds of resource allocations: cbap and contention-free sp. In this paper, we propose a Markov Chain model to represent cbap, taking into account operation interruptions due to scheduled sp and the deafness and hidden node problems that directional communication exacerbates. We also propose a mathematical analysis to evaluate the interference among stations and derive analytical expressions to assess the impact of various system parameters on some key performance metrics such as throughput, delay, and packet drop rate. This information may be used to efficiently design a transmission scheduler that allocates contention-based and contention-free periods based on the application requirements.


  • An Interference-Aware Channel Access Strategy for WSNs Exploiting Temporal Correlation

    by Chiara Pielli, Daniel Zucchetto, Andrea Zanella, Michele Zorzi

    The availability of cheap and easy-to-install sensors is bolstering the development of monitoring applications in IoT scenarios. Although there is a need for periodical measurements of the tracked signals to guarantee an accurate representation at the receiver, choosing an appropriate duration for the reporting window is not trivial. In fact, the energy restrictions of many devices and the interference caused by other users call for longer reporting windows. However, this causes a higher reconstruction error due to the lower sampling resolution, which may be unacceptable in some applications. We propose a probabilistic random channel access scheme for battery-powered devices which monitor time-correlated phenomena and report their measurements to a fusion center. Our goal is to minimize the energy consumption of the sensors, while guaranteeing that the error in the signal estimate at the receiver does not exceed a chosen threshold. We exploit Markov chains and stochastic geometry to characterize the interference caused by the other devices. The numerical evaluation proves that our scheme is scalable and may be used in highly dense scenarios, and that it outperforms other state-of-the-art approaches, which do not consider the impact of interference on both the energy consumption and the accuracy of data representation.


  • Open Access

    An Analytical Model for CBAP Allocations in IEEE 802.11ad

    by Chiara Pielli, Tanguy Ropitault, Nada Golmie, Michele Zorzi

    The IEEE 802.11ad standard extends WiFi operation to the millimeter wave frequencies, and introduces novel features concerning both the physical (PHY) and Medium Access Control (MAC) layers. However, while there are extensive research efforts to develop mechanisms for establishing and maintaining directional links for mmWave communications, fewer works deal with transmission scheduling and the hybrid MAC introduced by the standard. The hybrid MAC layer provides for two different kinds of resource allocations: Contention Based Access Periods (CBAPs) and contention free Service Periods (SPs). In this paper, we propose a Markov Chain model to represent CBAPs, which takes into account operation interruptions due to scheduled SPs and the deafness and hidden node problems that directional communication exacerbates. We also propose a mathematical analysis to assess interference among stations. We derive analytical expressions to assess the impact of various transmission parameters and of the Data Transmission Interval configuration on some key performance metrics such as throughput, delay and packet dropping rate. This information may be used to efficiently design a transmission scheduler that allocates contention-based and contention-free periods based on the application requirements.

  • Access Control for IoT Nodes With Energy and Fidelity Constraints

    by Alessandro Biason, Chiara Pielli, Andrea Zanella, Michele Zorzi

    The presence of many battery-powered sensors in the Internet of Things paradigm calls for the design of energy-aware protocols. Source coding techniques make it possible to save some energy by compressing the packets sent over the network, but at the cost of poorer accuracy in the representation of the data. This paper addresses the problem of designing efficient policies to jointly perform processing and transmission tasks. In particular, we aim at defining a scheduling strategy with the twofold goal of extending the network lifetime and guaranteeing a low overall distortion of the transmitted data. We propose a time division multiple access-based access scheme that efficiently allocates resources to heterogeneous nodes. We use realistic rate-distortion curves to quantify the impact of compression on the data quality and propose a complete energy model that includes the energy spent for processing and transmitting the data, as well as the circuitry energy costs. We consider both full and statistical knowledge of the wireless channels and derive communication policies for the two cases. The overall problem is structured in modules and solved through convex and alternate programming techniques. Finally, we thoroughly evaluate the proposed algorithms and the influence of the design variables on the system performance adopting parameters taken from real sensors.


  • Open Access

    A Dynamic Approach to Rebalancing Bike-Sharing Systems

    by Federico Chiariotti, Chiara Pielli, Andrea Zanella, Michele Zorzi

    Bike-sharing services are flourishing in Smart Cities worldwide. They provide a low-cost and environment-friendly transportation alternative and help reduce traffic congestion. However, these new services are still under development, and several challenges need to be solved. A major problem is the management of rebalancing trucks in order to ensure that bikes and stalls in the docking stations are always available when needed, despite the fluctuations in the service demand. In this work, we propose a dynamic rebalancing strategy that exploits historical data to predict the network conditions and promptly act in case of necessity. We use Birth-Death Processes to model the stations’ occupancy and decide when to redistribute bikes, and graph theory to select the rebalancing path and the stations involved. We validate the proposed framework on the data provided by New York City’s bike-sharing system. The numerical simulations show that a dynamic strategy able to adapt to the fluctuating nature of the network outperforms rebalancing schemes based on a static schedule.


  • Joint Compression, Channel Coding, and Retransmission for Data Fidelity With Energy Harvesting

    by Chiara Pielli, Cedomir Stefanovic, Petar Popovski, Michele Zorzi

    We consider a monitoring application where sensors periodically report data to a common receiver using time division multiplexing. The sensors are constrained by the limited and unpredictable energy availability provided by energy harvesting (EH), and by the channel impairments. To maximize the quality of the reported data, the packets transmitted contain newly generated data blocks together with up to r -1 previously unsuccessfully delivered ones, where r is a design parameter. These data blocks are compressed, concatenated, and encoded with a channel code. The scheme applies lossy compression, such that the fidelity of the individual blocks is traded off with the reliability provided by the channel code. We show that the proposed strategy outperforms the one in which retransmissions are not allowed. We also investigate the tradeoff between the value of r, the compression and the coding rates, under the constraints of the energy availability, and, once r has been decided, use a Markov decision process (MDP) to optimize the compression/coding rates. Finally, we implement a reinforcement learning algorithm, through which devices can learn the optimal transmission policy without knowing a priori the statistics of the EH process, and show that it indeed reaches the performance obtained via MDP.


  • Open Access

    Minimizing Data Distortion of Periodically Reporting IoT Devices with Energy Harvesting

    by Chiara Pielli, Cedomir Stefanovic, Petar Popovski, Michele Zorzi

    Energy harvesting is a promising technology for the Internet of Things (IoT) towards the goal of self-sustainability of the involved devices. However, the intermittent and unreliable nature of the harvested energy demands an intelligent management of devices' operation in order to ensure a sustained performance of the IoT application. In this work, we address the problem of maximizing the quality of the reported data under the constraints of energy harvesting, energy consumption and communication channel impairments. Specifically, we propose an energy-aware joint source-channel coding scheme that minimizes the expected data distortion, for realistic models of energy generation and of the energy spent by the device to process the data, when the communication is performed over a Rayleigh fading channel. The performance of the scheme is optimized by means of a Markov Decision Process framework.

  • Open Access

    Joint Retransmission, Compression and Channel Coding for Data Fidelity under Energy Constraints

    by Chiara Pielli, Cedomir Stefanovic, Petar Popovski, Michele Zorzi

    We consider a monitoring application where sensors periodically report data to a common receiver in a time division multiplex fashion. The sensors are constrained by the limited and unpredictable energy availability provided by Energy Harvesting (EH), and by the channel impairments. To maximize the quality of the reported data, the packets transmitted contain newly generated data blocks together with up to $r - 1$ previously unsuccessfully delivered ones, where $r$ is a design parameter; such blocks are compressed, concatenated and encoded with a channel code. The scheme applies lossy compression, such that the fidelity of the individual blocks is traded with the reliability provided by the channel code. We show that the proposed strategy outperforms the one in which retransmissions are not allowed. We also investigate the tradeoff between the value of $r$, the compression and coding rates, under the constraints of the energy availability, and, once $r$ has been decided, use a Markov Decision Process (MDP) to optimize the compression/coding rates. Finally, we implement a reinforcement learning algorithm, through which devices can learn the optimal transmission policy without knowing a priori the statistics of the EH process, and show that it indeed reaches the performance obtained via MDP.

  • Open Access

    Joint Optimization of Energy Efficiency and Data Compression in TDMA-Based Medium Access Control for the IoT - Extended Version

    by Chiara Pielli, Alessandro Biason, Andrea Zanella, Michele Zorzi

    Energy efficiency is a key requirement for the Internet of Things, as many sensors are expected to be completely stand-alone and able to run for years without battery replacement. Data compression aims at saving some energy by reducing the volume of data sent over the network, but also affects the quality of the received information. In this work, we formulate an optimization problem to jointly design the source coding and transmission strategies for time-varying channels and sources, with the twofold goal of extending the network lifetime and granting low distortion levels. We propose a scalable offline optimal policy that allocates both energy and transmission parameters (i.e., times and powers) in a network with a dynamic Time Division Multiple Access (TDMA)-based access scheme.