Cristina M. Pinotti

Cristina M. Pinotti
Università degli Studi di Perugia | UNIPG · Department of Mathematics and Computer Science

About

208
Publications
18,024
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,737
Citations
Citations since 2017
38 Research Items
563 Citations
2017201820192020202120222023020406080100120
2017201820192020202120222023020406080100120
2017201820192020202120222023020406080100120
2017201820192020202120222023020406080100120

Publications

Publications (208)
Chapter
Full-text available
We consider Internet of Things (IoT) sensors deployed inside an area to be monitored. Not all the sensors are connected via single-hop to the depot that requires the data. Inversely, a multi-hop implementation can bring the network connectivity at risk because the sensors closer to the depot consume more energy when relaying the aggregated data. Th...
Article
Full-text available
In this work, we investigate the use of drones in a delivery scenario formed by two contiguous areas. In one area the drones can freely fly on straight lines between any two locations (Euclidean metric), while in the other one the drones must follow the open space above the roads (Manhattan metric). We model this delivery scenario as a Euclidean-Ma...
Conference Paper
Full-text available
In this paper, we consider the problem of using a drone to collect information within orchards in order to detect bugs. An orchard can be modeled as an aisle-graph, which is a regular data structure formed by consecutive aisles where trees are arranged in a straight line. For monitoring the presence of bugs, a drone flies close to the trees and tak...
Conference Paper
Full-text available
In this work, we consider the problem of using a drone to collect information within orchards in order to scout insect pests, i.e., the stink bug Halyomorpha halys. An orchard can be modeled as an aisle-graph, which is a regular and constrained data structure formed by consecutive aisles where trees are arranged in a straight line. For monitoring t...
Conference Paper
Full-text available
Unmanned Aerial Vehicles (or drones) can be used for a myriad of civil applications, such as search and rescue, precision agriculture, or last-mile package delivery. Interestingly, the cooperation between drones and ground vehicles (trucks) can even enhance the quality of service. In this paper, we investigate the symbiosis among a truck and multip...
Conference Paper
Full-text available
The use of drones can be a valuable solution for the problem of delivering goods for many reasons. In fact, they can be efficiently employed in time-critical situations when there is a traffic jam on the roads, to serve customers in hard-to-reach places, or simply to expand the business. However, due to limited battery capacities and the fact that...
Conference Paper
Full-text available
We present our ongoing work on the cooperation between a truck and drones in a last-mile package delivery scenario. We model this application as an optimization problem where each delivery is associated with a cost (drone's energy), a profit (delivery's priority), and a time interval (launch and rendezvous times from and to the truck). We aim to fi...
Conference Paper
Full-text available
The impact on the energy consumption of flying drones in favorable winds is investigated in this paper. A tandem system is considered, with only one drone and one truck. The truck moves on a predefined route and brings the drone close to the delivery point. Then, the drone plans its service route by choosing the takeoff and landing points from whic...
Article
Full-text available
In this article, we study the orienteering aisle-graph single-access problem (OASP), a variant of the orienteering problem for a robot moving in a so-called single-access aisle graph, i.e., a graph consisting of a set of rows that can be accessed from one side only. Aisle graphs model, among others, vineyards or warehouses. Each aisle-graph vertex...
Article
Full-text available
In this work, the problem of localizing ground devices (GDs) is studied comparing the performance of four range-free (RF) localization algorithms that use a mobile anchor (MA). All the investigated algorithms are based on the so-called heard/not-heard (HnH) method, which allows the GDs to detect the MA at the border of their antenna communication r...
Preprint
Full-text available
Recently, Unmanned Aerial Vehicles (UAVs) are employed for a plethora of civilian applications. Such flying vehicles can accomplish tasks under the pilot's eyesight within the range of a remote controller, or autonomously according to a certain pre-loaded path configuration. Different path deviation attacks can be performed by malicious users again...
Preprint
Full-text available
In this paper, we study the Orienteering Aisle-graphs Single-access Problem (OASP), a variant of the orienteering problem for a robot moving in a so-called single-access aisle-graph, i.e., a graph consisting of a set of rows that can be accessed from one side only. Aisle-graphs model, among others, vineyards or warehouses. Each aisle-graph vertex i...
Preprint
Full-text available
Localizing ground devices (GDs) is an important requirement for a wide variety of applications, such as infrastructure monitoring, precision agriculture, search and rescue operations, to name a few. To this end, unmanned aerial vehicles (UAVs) or drones offer a promising technology due to their flexibility. However, the distance measurements perfor...
Preprint
Full-text available
In this paper, we study the feasibility of sending drones to deliver goods from a depot to a customer by solving what we call the Mission-Feasibility Problem (MFP). Due to payload constraints, the drone can serve only one customer at a time. To this end, we propose a novel framework based on time-dependent cost graphs to properly model the MFP and...
Article
Full-text available
In this paper, we study the feasibility of sending drones to deliver goods from a depot to a customer by solving what we call the Mission-Feasibility Problem (MFP). Due to payload constraints, the drone can serve only one customer at a time. To this end, we propose a novel framework based on time-dependent cost graphs to properly model the MFP and...
Article
Full-text available
Localizing ground devices (GDs) is an important requirement for a wide variety of applications, such as infrastructure monitoring, precision agriculture, search and rescue operations, to name a few. To this end, unmanned aerial vehicles (UAVs) or drones offer a promising technology due to their flexibility. However, the distance measurements perfor...
Conference Paper
Full-text available
In this paper, we consider the Constant-cost Orienteering Problem (COP) where a robot, constrained by a limited travel budget, aims at selecting a path with the largest reward in an aisle-graph. The aisle-graph consists of a set of loosely connected rows where the robot can change lane only at either end, but not in the middle. Even when considerin...
Conference Paper
Full-text available
Recently, Unmanned Aerial Vehicles (UAVs) are employed for a plethora of civilian applications. Such flying vehicles can accomplish tasks under the pilot's eyesight within the range of a remote controller, or autonomously according to a certain pre-loaded path configuration. Different path deviation attacks can be performed by malicious users again...
Conference Paper
Full-text available
In this paper, we study a variant of the route planning problem for an entity/robot moving along a specific aisle-graph consisting of a set of rows connected via just one column at one endpoint of the rows. Such constrained aisle-graph may model, for instance, a vineyard or warehouse, where each vertex is assigned with a reward that a robot gains w...
Article
Full-text available
In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes. We call this new problem the Maximum Connectivity Improvement (MCI) problem. We first show that,...
Conference Paper
Full-text available
In this work, we compare the performance of range-free localization algorithms either radius-based or radius-free that use a mobile anchor (rover or drone). All the compared algorithms are based on the so called heard/not-heard method. Despite its simplicity, the localization accuracy of the heard/not-heard method heavily depends on the radius of t...
Book
This book constitutes revised selected papers from the 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, held in Pisa, Italy*, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 27 submissions. ALGOSENSORS is an international symposium ded...
Preprint
Full-text available
In this paper, we consider the Constant-cost Orienteering Problem (COP) where a robot, constrained by a limited travel budget, aims at selecting a path with the largest reward in an aisle-graph. The aisle-graph consists of a set of loosely connected rows where the robot can change lane only at either end, but not in the middle. Even when considerin...
Conference Paper
Full-text available
We introduce a drone delivery system for the "last-mile" logistics of small parcels. The system serves mixed delivery areas modeled as EM-grids. The shortest path between two destinations of an EM-grid concatenates the Euclidean-and Manhattan-distance metrics. The drone's mission consists in one delivery for each destination of the grid, and, due t...
Conference Paper
Full-text available
In this work, we evaluate the accuracy of the Drone Range-Free (DRF) localization algorithm presented in the literature on a simple test-bed built using the Decawave Ultra Wide Band (UWB) Sensors Kit MDEK1001 and a customary drone. DRF localizes an IoT device at the intersection of the perpendicular bisectors of two chords of its receiving disk. De...
Conference Paper
Full-text available
We study the possibility of using drones to implement an automated picking system in a warehouse. We imagine a warehouse divided into two contiguous areas: in one area, the drone moves according to the Euclidean distance, while in the other area, the drone moves according to the Manhattan distance. For each customer-order (CO), the automated pickin...
Article
Full-text available
The localization of devices is a key ingredient of Internet of Things (IoT) which may require extra cost for deploying anchor nodes aware of their position. In this work, we propose a range-free localization algorithm, called Drone Range-Free (briefly, Drf), that replaces the anchor nodes with an off-the-shelf drone. When the radio communications a...
Chapter
In this paper, we define a new problem called the Maximum Connectivity Improvement (MCI) problem: given a directed graph \(G = (V,E)\), a weight function \(w:V \rightarrow \mathbb {N}_{\ge 0}\), a profit function \(p:V \rightarrow \mathbb {N}_{\ge 0}\), and an integer B, find a set S of at most B edges not in E that maximises \(f(S)=\sum _{v\in V}w...
Conference Paper
Full-text available
The localization of devices is a key ingredient of Internet of Things (IoT). However, localization requires deploying many anchor nodes that are nodes whose location is known a-priori. Anchor nodes are expensive and their utilization may be unfeasible in some cases, such as in search-and-rescue operations. In this work, we propose a range-free loca...
Article
Full-text available
In this paper we propose two algorithms, called DIR and OMNI, for precisely localizing terrestrial objects, or more simply sensors, using a drone. DIR is based on the observation that, by using directional antennas, it is possible to precisely localize terrestrial sensors just applying a single trilateration. We extend this approach to the case of...
Conference Paper
Full-text available
In this paper, we study a sensor localization technique that replaces fixed anchors with a drone equipped with directional antennas. Our goal is to localize each sensor in the deployment area achieving the localization precision explicitly required by the final user of the sensor networks. Due to the advent of directional antennas, we precisely loc...
Article
Full-text available
We propose a new variant of the standard online knapsack problem where the only information missing to the provided instances is the capacity B of the knapsack. We refer to this problem as the online Knapsack of Unknown Capacity (KUC) problem. Any algorithm solving the KUC problem must provide a strategy for filling online the knapsack until its ca...
Article
We study the problem of broadcasting a common, possibly large, content into a wireless mesh network consisting of N end-users and of one or multiple access points that act as gateways to Internet. Each end-user is characterized by a maximum possible reception rate that depends on the distance and on the interface used to communicate with the associ...
Conference Paper
Full-text available
In this paper, we study the sensor localization problem using a drone. Our goal is to localize each sensor in the deployment area ensuring a predefined localization precision, i.e., a bound on the position error, whatever is the drone's altitude. We show how to guarantee a-priori the precision localization by satisfying few conditions. Such conditi...
Article
Full-text available
Many dependable systems rely on the integrity of the position of their components. In such systems, two key problems are secure localization and secure location verification of the components. Researchers proposed several solutions, which generally require expensive infrastructures of several fixed stations (anchors) with trusted positions. In this...
Article
Full-text available
Today’s mobile devices have changed the way we interact with technology. Internet, cloud access, online banking, instant messaging, and file exchange through the cloud are just a handful of the myriad of smartphone services that we make use of every day. At the same time, the very enablers of these services—mobile internet providers and cloud platf...
Conference Paper
We consider the problem of allocating N uniform data to K transmission channels so as the average Expected Delay (AED) is minimized. This problem arises in designing efficient data-diffusion broadcast algorithms in a smart environment. We show that the basic dynamic rogramming algorithm for solving the uniform pallocation problem can be speedup up...
Conference Paper
Full-text available
We study mesh networks formed by nodes equipped with directional antennas in a high node-density setting. To do so we create a random geometric graph with n nodes placed uniformly at random. The antenna at each node chooses a direction of orientation at random and edges are placed between pairs of nodes based on their distance from each other and t...
Conference Paper
Full-text available
Smartphone usage is increasing rapidly generating an era of nomadic computer users, providing easy access to information anywhere, anytime. As a result, smartphone users do tasks like, accessing email, browsing web, e-banking etc on their mobile devices. Hence, many mobile apps today need secure communications between the smartphone and the end ser...
Conference Paper
We propose a new variant of the more standard online knapsack problem where the only information missing to the provided instances is the capacity \(B\) of the knapsack. We refer to this problem as the online Knapsack of Unknown Capacity problem. Any algorithm must provide a strategy for ordering the items that are inserted in the knapsack in an on...
Article
In standard sensor network applications, sensors generate raw data that have to be sent to a sink node. In order to save energy, special intermediate storage nodes can be exploited in order to compress data before forwarding them to the sink. We consider the problem of locating k storage nodes in order to minimize the energy consumed for converging...
Article
New algorithms are presented to optimally place storage nodes in a sensor network consisting of a path so as to minimize the communication cost of convergecasting towards the sink the data gathered into storage nodes in reply to queries. Such algorithms are faster than previously known algorithms and require optimal running time for finding the opt...
Article
Full-text available
This article addresses wireless sensor networks (WSN) whose nodes are organized in groups (i.e., clusters) and follow a duty-cycle. Each cluster is locally managed by a cluster head which employs a medium access control protocol to avoid interferences in all intra-cluster communications. Nevertheless, inter-cluster interferences can still occur. To...
Article
Full-text available
In a sensor network, data might be stored in so-called storage nodes, which receive raw data from other nodes, compress them, and send them toward a sink. We consider the problem of locating k storage nodes in order to minimize the energy consumed for converging the raw data to the storage nodes as well as to converge the compressed data to the sin...
Conference Paper
Sensor networks are widely used to collect data that are required for future information retrieval. Data might be aggregated in a predefined number \(k\) of special nodes in the network, called storage nodes, which, for replying to external queries, compress the last received raw data and send them towards the sink. We consider the problem of locat...
Article
We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSNs). First, we settle a conjecture of Das et al. [2012] and prove that the connectivity condition on random geometric graphs (RGGs), given by Gupta and Kumar [1989], can be used to derive a weakly sufficient cond...
Article
Full-text available
We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First, we settle a conjecture of Das et. al. (2012) and prove that the connectivity condition on Random Geometric Graphs (RGG), given by Gupta and Kumar (1989), can be used to derive a weak sufficient conditi...
Article
Full-text available
Recent energy measurements on smartphones have shown that parallel communications (e.g., data transfer and voice call) require less energy than their stand-alone execution. Guided by these results, we investigate the possibility of scheduling communications in pairs for minimizing the energy consumption. We define two energy optimization problems t...
Article
In heterogeneous networks, devices can communicate by means of multiple wireless interfaces. By choosing which interfaces to switch on at each device, several connections might be established. That is, the devices at the endpoints of each connection share at least one active interface. In this paper, we consider the standard matching problem in the...
Conference Paper
Full-text available
Energy consumption is one of the main concerns that refrain users from fully exploiting their smartphone capabilities. Guided by energy measurements on smartphones, which show that some services performed in parallel require less energy than their stand-alone executions, we investigate the possibility to delay some services to the time when other s...
Conference Paper
Convergecast is a typical form of data collection in wireless sensor networks (WSNs), wherein nodes sample data from the environment and send them to a common destination. In order to prolong the network lifetime, a duty-cycle mechanism is usually coupled with a routing tree structure, in which nodes are organized in clusters. Each cluster aggregat...
Article
We present a new protocol that manages wireless sensor networks in several scenarios including large scale, high density and high mobility deployments. An example of one of the main applications is to communicate important information from inaccessible areas by spreading “enough” mobile sensors which must self-configure and assemble. According to o...
Article
When the environment does not allow direct access to disseminated data, a sensor network could be one of the most appropriate solutions to retrieve the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider a coarse-grain localization algorithm that ass...
Article
We propose novel localization and routing protocols in an actor-centric wireless sensor network consisting of an actor node and a large number of energy-constrained sensors operating under L different periodic sleep–awake schedules. Specifically, we propose a semidistributed localization algorithm in which a small subset of sensors extracts their p...
Article
In this paper, the broadcast problem in dense Duty-Cycle Wireless Sensor Networks (DC-WSNs) is considered. Sensors are assumed to follow a duty-cycle schedule (d, L): they repeatedly alternate between an awake period of d time slots and an asleep period of L -- d time slots. A DC-WSN (n, r, Δ), with n sensors uniformly and randomly deployed in a un...
Article
In this chapter, we consider a large-scale sensor network, in a circular field, modeled as concentric coronas centered at a sink node. The tiny wireless sensors, severely limited by battery energy, alternate between sleep and awake periods, whereas the sink is equipped with high transmission power and long battery life. The traffic from sensors to...
Article
The paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that m...
Article
Full-text available
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disruptions, such as delays, occurring during the operational phase. The idea is t...
Article
Full-text available
In this work, we consider a large-scale geographic area populated by tiny sensors and some more powerful devices called actors, authorized to organize the sensors in their vicinity into short-lived, actor-centric sensor networks. The tiny sensors run on miniature nonrechargeable batteries, are anonymous, and are unaware of their location. The senso...
Conference Paper
Full-text available
A maximum bandwidth broadcast problem in multi-interface networks is considered, where each transmission, simultaneously serving a group of nodes, achieves a total bandwidth equal to the product between the smallest node bandwidth in the group and the cardinality of the group. Two variants of the problem are studied, called the K-Maximum Bandwidth...
Article
Full-text available
In this work, we consider a large-scale geographic area populated by tiny sensors and some more powerful devices called actors, authorized to organize the sensors in their vicinity into short-lived, actor-centric sensor networks. The tiny sensors run on miniature nonrechargeable batteries, are anonymous, and are unaware of their location. The senso...
Article
Full-text available
We are very pleased and thankful to receive the brilliant contributions and supports from many distinguished authors and organizations all over the world. I give my sincerest appreciation to Ghada Ali, Hindawi Publishing Corporation, for her timely support, excellent advice, and kind words of encouragement. Without her support, this special issue c...
Article
Full-text available
In this work we consider a large-scale geographic area populated by tiny sensors and some more powerful devices called actors, authorized to organize the sensors in their vicinity into short-lived, actor-centric sensor networks. The tiny sensors run on miniature non-rechargeable batteries, are anonymous and are unaware of their location. The sensor...
Conference Paper
When the environment does not allow to access directly to disseminated data, a sensor network could be one of the most appropriate solution to retrieve the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider a coarse-grain localization algorithm whic...
Article
Full-text available
Exploiting high density features of wireless sensor networks represents a challenging issue. In this context, anonymous, asynchronous and randomly distributed sensors are considered along with few devices, called actors, which are more powerful than sensors in terms of energy and transmission capabilities. The paper proposes a new distributed train...
Conference Paper
We consider a wireless sensor and actor network (WSAN) consisting of a large number of tiny, low-cost sensors uniformly and independently distributed in a two-dimensional geographical region around a few powerful entities, called actors. To save energy, the sensors operate according to sleep/awake schedules in an asynchronous manner. In this settin...