2016
Giovanni Albani; Corrado Azzaro; Federico Parisi; Claudia Ferraris; Matteo Giuberti; Laura Contin; Daniele Pianu; Luca G. Pradotto; Veronica Cimolin; Manuela Galli; Roberto Nerino; Gianluigi Ferrari; Alessandro Mauro
A step forward to the future: UPDRS kinematic measures for telemedicine Journal Article
In: Movement Disorders, 31 (suppl. 2), pp. S514, 2016, ISSN: 1531-8257.
@article{Aletal_MDS15,
title = {A step forward to the future: UPDRS kinematic measures for telemedicine},
author = {Giovanni Albani and Corrado Azzaro and Federico Parisi and Claudia Ferraris and Matteo Giuberti and Laura Contin and Daniele Pianu and Luca G. Pradotto and Veronica Cimolin and Manuela Galli and Roberto Nerino and Gianluigi Ferrari and Alessandro Mauro},
url = {http://www.mdsabstracts.org/abstract/a-step-forward-to-the-future-updrs-kinematic-measures-for-telemedicine/
http://dx.doi.org/10.1002/mds.26688},
issn = {1531-8257},
year = {2016},
date = {2016-06-01},
journal = {Movement Disorders},
volume = {31},
number = {suppl. 2},
pages = {S514},
abstract = {\textbf{Objective:} We set up an experimental instrumentation to quantify selected items of UPDRS by a Kinect technology and body sensory-network (BSN), destinated to an easy home-performance.
\textbf{Background:} Remote medical communications in the form of telemedicine is one of the challenges to Parkinson’s disease (PD) problems. Among the tougher hurdles to overcome,there is an accurate, low-cost and manageable quantification of motor symptoms.
\textbf{Methods:} For automatic assignment of UPDRS scores, we studied 20 controls subjects and 64 PD patients both by a BSN-based approach (for leg agility, sit-to stand and gait tasks), composed of a few body-horn wireless inertial nodes and an human-computer interface( Microsoft Kinect®) ((for finger-tapping task) based on a RGB-Depth camera, a monitor and two light-weight gloves with coloured markers. Movements are automatically translated in kinematic parameters and then classified by dedicated algorytms correlating with corresponding UPDRS clinical scores. We calculated the average of the predicted UPDRS classes weigthed by the probabilities that an evaluation belongs to a specific UPDRS classes, by a continuous measure that we call the neuromotor impairment W [figure1]
\textbf{Results:} We found 19 and 34 kinematic parameters respectively both for finger and lower limbs movements correlating which corresponding UPDRS scores tasks [figure2].
\textbf{Conclusions:} These results show that the proposed technology is an accurate, feasible and low-cost approach useful for at distance evaluation of PD patients.
Oral Presentation by Parkinson’s disease World Congress 2016 in Milan.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Objective: We set up an experimental instrumentation to quantify selected items of UPDRS by a Kinect technology and body sensory-network (BSN), destinated to an easy home-performance.
Background: Remote medical communications in the form of telemedicine is one of the challenges to Parkinson’s disease (PD) problems. Among the tougher hurdles to overcome,there is an accurate, low-cost and manageable quantification of motor symptoms.
Methods: For automatic assignment of UPDRS scores, we studied 20 controls subjects and 64 PD patients both by a BSN-based approach (for leg agility, sit-to stand and gait tasks), composed of a few body-horn wireless inertial nodes and an human-computer interface( Microsoft Kinect®) ((for finger-tapping task) based on a RGB-Depth camera, a monitor and two light-weight gloves with coloured markers. Movements are automatically translated in kinematic parameters and then classified by dedicated algorytms correlating with corresponding UPDRS clinical scores. We calculated the average of the predicted UPDRS classes weigthed by the probabilities that an evaluation belongs to a specific UPDRS classes, by a continuous measure that we call the neuromotor impairment W [figure1]
Results: We found 19 and 34 kinematic parameters respectively both for finger and lower limbs movements correlating which corresponding UPDRS scores tasks [figure2].
Conclusions: These results show that the proposed technology is an accurate, feasible and low-cost approach useful for at distance evaluation of PD patients.
Oral Presentation by Parkinson’s disease World Congress 2016 in Milan.
Background: Remote medical communications in the form of telemedicine is one of the challenges to Parkinson’s disease (PD) problems. Among the tougher hurdles to overcome,there is an accurate, low-cost and manageable quantification of motor symptoms.
Methods: For automatic assignment of UPDRS scores, we studied 20 controls subjects and 64 PD patients both by a BSN-based approach (for leg agility, sit-to stand and gait tasks), composed of a few body-horn wireless inertial nodes and an human-computer interface( Microsoft Kinect®) ((for finger-tapping task) based on a RGB-Depth camera, a monitor and two light-weight gloves with coloured markers. Movements are automatically translated in kinematic parameters and then classified by dedicated algorytms correlating with corresponding UPDRS clinical scores. We calculated the average of the predicted UPDRS classes weigthed by the probabilities that an evaluation belongs to a specific UPDRS classes, by a continuous measure that we call the neuromotor impairment W [figure1]
Results: We found 19 and 34 kinematic parameters respectively both for finger and lower limbs movements correlating which corresponding UPDRS scores tasks [figure2].
Conclusions: These results show that the proposed technology is an accurate, feasible and low-cost approach useful for at distance evaluation of PD patients.
Oral Presentation by Parkinson’s disease World Congress 2016 in Milan.
Federico Parisi; Gianluigi Ferrari; Matteo Giuberti; Laura Contin; Veronica Cimolin; Corrado Azzaro; Giovanni Albani; Alessandro Mauro
Inertial BSN-based Characterization and Automatic UPDRS Evaluation of the Gait Task of Parkinsonians Journal Article
In: IEEE Transactions on Affective Computing, 7 (3), pp. 258-271, 2016.
@article{PaFeGiCoCiAzAlMa15TAFFC,
title = {Inertial BSN-based Characterization and Automatic UPDRS Evaluation of the Gait Task of Parkinsonians},
author = {Federico Parisi and Gianluigi Ferrari and Matteo Giuberti and Laura Contin and Veronica Cimolin and Corrado Azzaro and Giovanni Albani and Alessandro Mauro},
url = {http://dx.doi.org/10.1109/TAFFC.2016.2549533},
year = {2016},
date = {2016-04-01},
journal = {IEEE Transactions on Affective Computing},
volume = {7},
number = {3},
pages = {258-271},
abstract = {The analysis and assessment of motor tasks, such as gait, can provide important information on the progress of neurological disorders such as Parkinson’s disease (PD). In this paper, we design a Boby Sensor Network (BSN)-based system for the characterization of gait in Parkinsonians through the extraction of kinematic features, both in time and in frequency domains, embedding information on the status of the PD. The gait features extraction is performed on a set of 34 PD patients using a BSN formed by only three inertial nodes (one on the chest and one per thigh). We investigate also the relationship between the selected kinematic features and the Unified Parkinson’s Disease Rating Scale (UPDRS) scores assigned to patients by an expert neurologist.
This work extends a previously proposed approach to the analysis of the leg agility task and represents a further step to develop a system for automatic evaluation of different PD motor tasks. A performance analysis of different classification techniques is carried out, showing the feasibility of an automatic (and, eventually, remote) UPDRS scoring system, suitable for tele-health applications in the realm of affective medicine.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The analysis and assessment of motor tasks, such as gait, can provide important information on the progress of neurological disorders such as Parkinson’s disease (PD). In this paper, we design a Boby Sensor Network (BSN)-based system for the characterization of gait in Parkinsonians through the extraction of kinematic features, both in time and in frequency domains, embedding information on the status of the PD. The gait features extraction is performed on a set of 34 PD patients using a BSN formed by only three inertial nodes (one on the chest and one per thigh). We investigate also the relationship between the selected kinematic features and the Unified Parkinson’s Disease Rating Scale (UPDRS) scores assigned to patients by an expert neurologist.
This work extends a previously proposed approach to the analysis of the leg agility task and represents a further step to develop a system for automatic evaluation of different PD motor tasks. A performance analysis of different classification techniques is carried out, showing the feasibility of an automatic (and, eventually, remote) UPDRS scoring system, suitable for tele-health applications in the realm of affective medicine.
This work extends a previously proposed approach to the analysis of the leg agility task and represents a further step to develop a system for automatic evaluation of different PD motor tasks. A performance analysis of different classification techniques is carried out, showing the feasibility of an automatic (and, eventually, remote) UPDRS scoring system, suitable for tele-health applications in the realm of affective medicine.
Laura Belli; Simone Cirani; Luca Davoli; Gianluigi Ferrari; Lorenzo Melegari; Marco Picone
Applying Security to a Big Stream Cloud Architecture for the Internet of Things Journal Article
In: International Journal of Distributed Systems and Technologies (IJDST), 7 (1), pp. 37-58, 2016, ISSN: 1947-3532.
@article{becidafemepi2016,
title = {Applying Security to a Big Stream Cloud Architecture for the Internet of Things},
author = {Laura Belli and Simone Cirani and Luca Davoli and Gianluigi Ferrari and Lorenzo Melegari and Marco Picone},
doi = {10.4018/IJDST.2016010103},
issn = {1947-3532},
year = {2016},
date = {2016-01-14},
journal = {International Journal of Distributed Systems and Technologies (IJDST)},
volume = {7},
number = {1},
pages = {37-58},
publisher = {IGI Global},
abstract = {The Internet of Things (IoT) is expected to interconnect billions (around 50 by 2020) of heterogeneous sensor/actuator-equipped devices denoted as Smart Objects (SOs), characterized by constrained resources in terms of memory, processing, and communication reliability. Several IoT applications have real-time and low-latency requirements and must rely on architectures specifically designed to manage gigantic streams of information (in terms of number of data sources and transmission data rate). We refer to Big Stream as the paradigm which best fits the selected IoT scenario, in contrast to the traditional Big Data concept, which does not consider real-time constraints. Moreover, there are many security concerns related to IoT devices and to the Cloud. In this paper, we analyze security aspects in a novel Cloud architecture for Big Stream applications, which efficiently handles Big Stream data through a Graph-based platform and delivers processed data to consumers, with low latency. The authors detail each module defined in the system architecture, describing all refinements required to make the platform able to secure large data streams. An experimentation is also conducted in order to evaluate the performance of the proposed architecture when integrating security mechanisms.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Internet of Things (IoT) is expected to interconnect billions (around 50 by 2020) of heterogeneous sensor/actuator-equipped devices denoted as Smart Objects (SOs), characterized by constrained resources in terms of memory, processing, and communication reliability. Several IoT applications have real-time and low-latency requirements and must rely on architectures specifically designed to manage gigantic streams of information (in terms of number of data sources and transmission data rate). We refer to Big Stream as the paradigm which best fits the selected IoT scenario, in contrast to the traditional Big Data concept, which does not consider real-time constraints. Moreover, there are many security concerns related to IoT devices and to the Cloud. In this paper, we analyze security aspects in a novel Cloud architecture for Big Stream applications, which efficiently handles Big Stream data through a Graph-based platform and delivers processed data to consumers, with low latency. The authors detail each module defined in the system architecture, describing all refinements required to make the platform able to secure large data streams. An experimentation is also conducted in order to evaluate the performance of the proposed architecture when integrating security mechanisms.
Marco Martalò; Carlo Tripodi; Riccardo Raheli
Simple upper bound on the information rate of the phase noise channel Journal Article
In: Electronics Letters, 52 (7), pp. 517-519, 2016, ISSN: 0013-5194.
@article{7444106,
title = {Simple upper bound on the information rate of the phase noise channel},
author = {Marco Martalò and Carlo Tripodi and Riccardo Raheli},
url = {https://dx.doi.org/10.1049/el.2015.3170},
issn = {0013-5194},
year = {2016},
date = {2016-01-01},
journal = {Electronics Letters},
volume = {52},
number = {7},
pages = {517-519},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Marco Martalò; Riccardo Raheli
Models, statistics, and rates of binary correlated sources Journal Article
In: Elsevier Physical Communication, pp. -, 2016, ISSN: 1874-4907.
@article{Martalo2016,
title = {Models, statistics, and rates of binary correlated sources},
author = {Marco Martalò and Riccardo Raheli},
url = {https://dx.doi.org/10.1016/j.phycom.2016.04.002},
issn = {1874-4907},
year = {2016},
date = {2016-01-01},
journal = {Elsevier Physical Communication},
pages = {-},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Michele Amoretti; Laura Belli; Francesco Zanichelli
UTravel: Smart mobility with a novel user profiling and recommendation approach Journal Article
In: Pervasive and Mobile Computing, 38 (2), pp. 474-489, 2016.
@article{amoretti2016utravel,
title = {UTravel: Smart mobility with a novel user profiling and recommendation approach},
author = {Michele Amoretti and Laura Belli and Francesco Zanichelli},
url = {https://www.sciencedirect.com/science/article/pii/S1574119216301341},
doi = {10.1016/j.pmcj.2016.08.008},
year = {2016},
date = {2016-01-01},
journal = {Pervasive and Mobile Computing},
volume = {38},
number = {2},
pages = {474-489},
publisher = {Elsevier},
abstract = {The exponentially growing availability of online information calls for personalized search and recommendation. Such systems provide recommendations typically based on user profiles built taking into account user actions. Not yet fully explored, is the domain of context-aware recommendation. In this article, we introduce a novel approach, where user profiling and context-based data filtering both concur to recommendation production. Based on the aforementioned approach, UTravel is a smart mobility application that recommends points of interest (POIs) to end users. After describing the UTravel architecture and implementation, we present the results of an experimental evaluation we carried out involving both simulated and real users.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The exponentially growing availability of online information calls for personalized search and recommendation. Such systems provide recommendations typically based on user profiles built taking into account user actions. Not yet fully explored, is the domain of context-aware recommendation. In this article, we introduce a novel approach, where user profiling and context-based data filtering both concur to recommendation production. Based on the aforementioned approach, UTravel is a smart mobility application that recommends points of interest (POIs) to end users. After describing the UTravel architecture and implementation, we present the results of an experimental evaluation we carried out involving both simulated and real users.
Gianluigi Ferrari; Umberto Amadei
Two-Level Quantized Soft-Output Demodulation of QAM Signals With Gray Labeling: A Geometric Approach Journal Article
In: IEEE Communications Letters, 20 (10), pp. 1931-1934, 2016, ISSN: 1089-7798.
@article{FeAm_CL16,
title = {Two-Level Quantized Soft-Output Demodulation of QAM Signals With Gray Labeling: A Geometric Approach},
author = {Gianluigi Ferrari and Umberto Amadei},
url = {http://dx.doi.org/10.1109/LCOMM.2016.2592963
http://ieeexplore.ieee.org/document/7516648/},
issn = {1089-7798},
year = {2016},
date = {2016-01-01},
journal = {IEEE Communications Letters},
volume = {20},
number = {10},
pages = {1931-1934},
abstract = {We propose a geometric approach to the design of a look-up table-based two-level quantized soft-output (SO) demodulator for coded schemes with quadrature amplitude modulation (QAM) signals with Gray bit labeling. This allows to derive quantized bit logarithmic likelihood ratios (LLRs) directly from the observables, without requiring the actual computation, followed by quantization, of LLRs at the output of the demodulator. The proposed approach is applied to a bit-interleaved coded modulation (BICM) scheme. The obtained results show a limited performance loss with respect to unquantized SO demodulation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We propose a geometric approach to the design of a look-up table-based two-level quantized soft-output (SO) demodulator for coded schemes with quadrature amplitude modulation (QAM) signals with Gray bit labeling. This allows to derive quantized bit logarithmic likelihood ratios (LLRs) directly from the observables, without requiring the actual computation, followed by quantization, of LLRs at the output of the demodulator. The proposed approach is applied to a bit-interleaved coded modulation (BICM) scheme. The obtained results show a limited performance loss with respect to unquantized SO demodulation.
Stefania Monica; Gianluigi Ferrari
Low-complexity UWB-based collision avoidance system for automated guided vehicles Journal Article
In: ICT Express, 2 (2), pp. 53 - 56, 2016, ISSN: 2405-9595.
@article{Monica201653,
title = {Low-complexity UWB-based collision avoidance system for automated guided vehicles},
author = {Stefania Monica and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S2405959516300182
http://dx.doi.org/10.1016/j.icte.2016.05.004},
issn = {2405-9595},
year = {2016},
date = {2016-01-01},
journal = {ICT Express},
volume = {2},
number = {2},
pages = {53 - 56},
abstract = {This paper describes a low-complexity collision avoidance system for automated guided vehicles (AGVs) based on active ultra-wide band (UWB) modules. In particular, we consider an industrial warehouse where all the AGVs and target nodes (TNs) (e.g., people) are equipped with active UWB modules. A communication session between a pair of UWB modules permits the exchange of information and the estimation of the distance between them. The UWB module positioned on an AGV is connected to an on-board computer; whenever the UWB module on an AGV receives a message from a TN, it communicates all the received data to the on-board computer that can decide to stop the AGV if the range estimate is below a given threshold. This prevents undesired collisions between the AGV and the TN. In this paper, we present the experimental results of the proposed collision avoidance system obtained using the UWB modules, PulsON 410 ranging and communication modules (P410 RCMs), produced by Time Domain.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper describes a low-complexity collision avoidance system for automated guided vehicles (AGVs) based on active ultra-wide band (UWB) modules. In particular, we consider an industrial warehouse where all the AGVs and target nodes (TNs) (e.g., people) are equipped with active UWB modules. A communication session between a pair of UWB modules permits the exchange of information and the estimation of the distance between them. The UWB module positioned on an AGV is connected to an on-board computer; whenever the UWB module on an AGV receives a message from a TN, it communicates all the received data to the on-board computer that can decide to stop the AGV if the range estimate is below a given threshold. This prevents undesired collisions between the AGV and the TN. In this paper, we present the experimental results of the proposed collision avoidance system obtained using the UWB modules, PulsON 410 ranging and communication modules (P410 RCMs), produced by Time Domain.
Francesco Pisani; Elena Pavlidis; Luca Cattani; Gianluigi Ferrari; Riccardo Raheli; Carlotta Spagnoli
Optimizing detection rate and characterisation of subtle paroxysmal neonatal abnormal facial movements with multi-camera video-EEG recordings Journal Article
In: Neuropediatrics, 47 (3), pp. 169-174, 2016.
@article{Pisani2016neuro,
title = {Optimizing detection rate and characterisation of subtle paroxysmal neonatal abnormal facial movements with multi-camera video-EEG recordings},
author = {Francesco Pisani and Elena Pavlidis and Luca Cattani and Gianluigi Ferrari and Riccardo Raheli and Carlotta Spagnoli},
url = {http://www.thieme-connect.com/DOI/DOI?10.1055/s-0036-1582245
https://dx.doi.org/10.1055/s-0036-1582245},
year = {2016},
date = {2016-01-01},
journal = {Neuropediatrics},
volume = {47},
number = {3},
pages = {169-174},
abstract = {\textbf{Objectives} We retrospectively analyze the diagnostic accuracy for paroxysmal abnormal facial movements, comparing one camera versus multi-camera approach. Background Polygraphic video-electroencephalogram (vEEG) recording is the current gold standard for brain monitoring in high-risk newborns, especially when neonatal seizures are suspected. One camera synchronized with the EEG is commonly used.newline
\textbf{Methods} Since mid-June 2012, we have started using multiple cameras, one of which point toward newborns’ faces. We evaluated vEEGs recorded in newborns in the study period between mid-June 2012 and the end of September 2014 and compared, for each recording, the diagnostic accuracies obtained with one-camera and multi-camera approaches.newline
\textbf{Results} We recorded 147 vEEGs from 87 newborns and found 73 episodes of paroxysmal facial abnormal movements in 18 vEEGs of 11 newborns with the multicamera approach. By using the single-camera approach, only 28.8% of these events were identified (21/73). Ten positive vEEGs with multicamera with 52 paroxysmal facial abnormal movements (52/73, 71.2%) would have been considered as negative with the single-camera approach.newline
\textbf{Conclusions} The use of one additional facial camera can significantly increase the diagnostic accuracy of vEEGs in the detection of paroxysmal abnormal facial movements in the newborns},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Objectives We retrospectively analyze the diagnostic accuracy for paroxysmal abnormal facial movements, comparing one camera versus multi-camera approach. Background Polygraphic video-electroencephalogram (vEEG) recording is the current gold standard for brain monitoring in high-risk newborns, especially when neonatal seizures are suspected. One camera synchronized with the EEG is commonly used.newline
Methods Since mid-June 2012, we have started using multiple cameras, one of which point toward newborns’ faces. We evaluated vEEGs recorded in newborns in the study period between mid-June 2012 and the end of September 2014 and compared, for each recording, the diagnostic accuracies obtained with one-camera and multi-camera approaches.newline
Results We recorded 147 vEEGs from 87 newborns and found 73 episodes of paroxysmal facial abnormal movements in 18 vEEGs of 11 newborns with the multicamera approach. By using the single-camera approach, only 28.8% of these events were identified (21/73). Ten positive vEEGs with multicamera with 52 paroxysmal facial abnormal movements (52/73, 71.2%) would have been considered as negative with the single-camera approach.newline
Conclusions The use of one additional facial camera can significantly increase the diagnostic accuracy of vEEGs in the detection of paroxysmal abnormal facial movements in the newborns
Methods Since mid-June 2012, we have started using multiple cameras, one of which point toward newborns’ faces. We evaluated vEEGs recorded in newborns in the study period between mid-June 2012 and the end of September 2014 and compared, for each recording, the diagnostic accuracies obtained with one-camera and multi-camera approaches.newline
Results We recorded 147 vEEGs from 87 newborns and found 73 episodes of paroxysmal facial abnormal movements in 18 vEEGs of 11 newborns with the multicamera approach. By using the single-camera approach, only 28.8% of these events were identified (21/73). Ten positive vEEGs with multicamera with 52 paroxysmal facial abnormal movements (52/73, 71.2%) would have been considered as negative with the single-camera approach.newline
Conclusions The use of one additional facial camera can significantly increase the diagnostic accuracy of vEEGs in the detection of paroxysmal abnormal facial movements in the newborns
Stefania Monica; Gianluigi Ferrari
A swarm-based approach to real-time 3D indoor localization: Experimental performance analysis Journal Article
In: Applied Soft Computing, 43 , pp. 489 - 497, 2016, ISSN: 1568-4946.
@article{Monica2016489,
title = {A swarm-based approach to real-time 3D indoor localization: Experimental performance analysis},
author = {Stefania Monica and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S1568494616300710
http://dx.doi.org/10.1016/j.asoc.2016.02.020},
issn = {1568-4946},
year = {2016},
date = {2016-01-01},
journal = {Applied Soft Computing},
volume = {43},
pages = {489 - 497},
abstract = {In this paper, the problem of indoor localization in wireless networks is addressed relying on a swarm-based approach. We assume to know the positions of a few number of sensor nodes, denoted as anchor nodes (ANs), and we aim at finding the position of a target node (TN) on the basis of the estimated distances between each AN and the considered TN. Since ultra wide band (UWB) technology is particularly suited for localization purposes (owing to its remarkable time resolution), we consider a network composed of UWB devices. More precisely, we carry out an experimental investigation using the PulsOn 410 ranging and communication modules (RCMs) produced by time domain. Using four of them as ANs and one of them as TN, various topologies are considered in order to evaluate the accuracy of the proposed swarm-based localization approach, which relies on the pairwise (AN-TN) distances estimated by the RCMs. Then, we investigate how the accuracy of the proposed localization algorithm changes if we apply to the distance estimates a recently proposed stochastic correction, which is designed to reduce the distance estimation error. Our experimental results show that a good accuracy is obtained in all the considered scenarios, especially when applying the proposed swarm-based localization algorithm to the stochastically corrected distances. The obtained results are satisfying also in terms of software execution time, making the proposed approach applicable to real-time dynamic localization problems.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, the problem of indoor localization in wireless networks is addressed relying on a swarm-based approach. We assume to know the positions of a few number of sensor nodes, denoted as anchor nodes (ANs), and we aim at finding the position of a target node (TN) on the basis of the estimated distances between each AN and the considered TN. Since ultra wide band (UWB) technology is particularly suited for localization purposes (owing to its remarkable time resolution), we consider a network composed of UWB devices. More precisely, we carry out an experimental investigation using the PulsOn 410 ranging and communication modules (RCMs) produced by time domain. Using four of them as ANs and one of them as TN, various topologies are considered in order to evaluate the accuracy of the proposed swarm-based localization approach, which relies on the pairwise (AN-TN) distances estimated by the RCMs. Then, we investigate how the accuracy of the proposed localization algorithm changes if we apply to the distance estimates a recently proposed stochastic correction, which is designed to reduce the distance estimation error. Our experimental results show that a good accuracy is obtained in all the considered scenarios, especially when applying the proposed swarm-based localization algorithm to the stochastically corrected distances. The obtained results are satisfying also in terms of software execution time, making the proposed approach applicable to real-time dynamic localization problems.
Stefania Monica; Gianluigi Ferrari
Maximum likelihood localization: When does it fail? Journal Article
In: ICT Express, 2 (1), pp. 10 - 13, 2016, ISSN: 2405-9595, (Special Issue on Positioning Techniques and Applications).
@article{Monica201610,
title = {Maximum likelihood localization: When does it fail?},
author = {Stefania Monica and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S2405959515300928
http://dx.doi.org/10.1016/j.icte.2016.02.004},
issn = {2405-9595},
year = {2016},
date = {2016-01-01},
journal = {ICT Express},
volume = {2},
number = {1},
pages = {10 - 13},
abstract = {Maximum likelihood is a criterion often used to derive localization algorithms. In particular, in this paper we focus on a distance-based algorithm for the localization of nodes in static wireless networks. Assuming that Ultra Wide Band (UWB) signals are used for inter-node communications, we investigate the ill-conditioning of the Two-Stage Maximum-Likelihood (TSML) Time of Arrival (ToA) localization algorithm as the Anchor Nodes (ANs) positions change. We analytically derive novel lower and upper bounds for the localization error and we evaluate them in some localization scenarios as functions of the ANs’ positions. We show that particular ANs’ configurations intrinsically lead to ill-conditioning of the localization problem, making the TSML-ToA inapplicable. For comparison purposes, we also show, through some examples, that a Particle Swarm Optimization (PSO)-based algorithm guarantees accurate positioning also when the localization problem embedded in the TSML-ToA algorithm is ill-conditioned.},
note = {Special Issue on Positioning Techniques and Applications},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Maximum likelihood is a criterion often used to derive localization algorithms. In particular, in this paper we focus on a distance-based algorithm for the localization of nodes in static wireless networks. Assuming that Ultra Wide Band (UWB) signals are used for inter-node communications, we investigate the ill-conditioning of the Two-Stage Maximum-Likelihood (TSML) Time of Arrival (ToA) localization algorithm as the Anchor Nodes (ANs) positions change. We analytically derive novel lower and upper bounds for the localization error and we evaluate them in some localization scenarios as functions of the ANs’ positions. We show that particular ANs’ configurations intrinsically lead to ill-conditioning of the localization problem, making the TSML-ToA inapplicable. For comparison purposes, we also show, through some examples, that a Particle Swarm Optimization (PSO)-based algorithm guarantees accurate positioning also when the localization problem embedded in the TSML-ToA algorithm is ill-conditioned.
Andrea Abrardo; Marco Martalò; Gianluigi Ferrari
Impact of the knowledge of nodes’ positions on spectrum sensing strategies in cognitive networks Journal Article
In: Physical Communication, 19 , pp. 84 - 92, 2016, ISSN: 1874-4907.
@article{Abrardo201684,
title = {Impact of the knowledge of nodes’ positions on spectrum sensing strategies in cognitive networks},
author = {Andrea Abrardo and Marco Martalò and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S1874490715000701
http://dx.doi.org/10.1016/j.phycom.2015.12.004},
issn = {1874-4907},
year = {2016},
date = {2016-01-01},
journal = {Physical Communication},
volume = {19},
pages = {84 - 92},
abstract = {In this paper, we focus on cognitive wireless networking, where a primary wireless network (PWN) is co-located with a cognitive (or secondary) wireless network (CWN). The shared frequency spectrum is divided into disjoint “subchannels” and each subchannel is “freely” assigned (in a unique way) to a node of the PWN, denoted as primary user equipment (PUE). We assume that the nodes of the CWN, denoted as cognitive user equipments (CUEs), cooperate to sense the frequency spectrum and estimate the idle subchannels which can be used by the CWN (i.e., assigned to CUEs) without interfering the PWN. The sensing correlation among the CUEs is exploited to improve the reliability of the decision, taken by a secondary fusion center (FC), on the occupation status (by a node of the PWN) of each subchannel. In this context, we compute the mutual information between the occupation status and the observations at the FC, with and without knowledge of the positions of the nodes in the network, showing a potential significant benefit brought by this side information. Then, we derive the fusion rules at the FC: our numerical results, in terms of the network-wise probabilities of missed detection (MD) and false alarm (FA) at the secondary FC, indicate a significant performance improvement when knowledge of the CUEs’ positions is available at the secondary FC, confirming the mutual information-based theoretical prediction.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we focus on cognitive wireless networking, where a primary wireless network (PWN) is co-located with a cognitive (or secondary) wireless network (CWN). The shared frequency spectrum is divided into disjoint “subchannels” and each subchannel is “freely” assigned (in a unique way) to a node of the PWN, denoted as primary user equipment (PUE). We assume that the nodes of the CWN, denoted as cognitive user equipments (CUEs), cooperate to sense the frequency spectrum and estimate the idle subchannels which can be used by the CWN (i.e., assigned to CUEs) without interfering the PWN. The sensing correlation among the CUEs is exploited to improve the reliability of the decision, taken by a secondary fusion center (FC), on the occupation status (by a node of the PWN) of each subchannel. In this context, we compute the mutual information between the occupation status and the observations at the FC, with and without knowledge of the positions of the nodes in the network, showing a potential significant benefit brought by this side information. Then, we derive the fusion rules at the FC: our numerical results, in terms of the network-wise probabilities of missed detection (MD) and false alarm (FA) at the secondary FC, indicate a significant performance improvement when knowledge of the CUEs’ positions is available at the secondary FC, confirming the mutual information-based theoretical prediction.
Andrea Gorrieri; Gianluigi Ferrari
DiSIF: A Distance-Based Silencing Technique for Multi-Hop Broadcast Communications in Pedestrian Ad-Hoc Networks Journal Article
In: IEEE Transactions on Mobile Computing, 15 (11), pp. 2706-2718, 2016, ISSN: 1536-1233.
@article{7355348,
title = {DiSIF: A Distance-Based Silencing Technique for Multi-Hop Broadcast Communications in Pedestrian Ad-Hoc Networks},
author = {Andrea Gorrieri and Gianluigi Ferrari},
url = {http://dx.doi.org/10.1109/TMC.2015.2508804},
issn = {1536-1233},
year = {2016},
date = {2016-01-01},
journal = {IEEE Transactions on Mobile Computing},
volume = {15},
number = {11},
pages = {2706-2718},
abstract = {In this paper, we focus on a particular type of opportunistic ad-hoc networks, namely Pedestrian Ad-hoc NETworks (PANETs). In PANETs, nodes are densely distributed and each node may transmit information to all other nodes in the network via multi-hop broadcasting. Even though flooding is the simplest technique to broadcast information with multi-hop communications, it can be very inefficient because of redundant transmissions which may induce collisions. This problem is known, in the literature, as the “broadcast storm problem.” In this work, we present a novel probabilistic forwarding technique, denoted as Distance-based Silencing IF (DiSIF), which is derived from the probabilistic broadcasting protocol Irresponsible Forwarding (IF) and one of its extensions, denotes Silencing IF (SIF). The performance of the DiSIF protocol is analyzed and compared with those of other existing protocols, investigating the impact of fundamental network parameters. Lower bounds (exact and approximate) on the average number of hops, expedient to evaluate the propagation efficiency of DiSIF, are also derived. Finally, under the assumption that each node (e.g., a smartphone) relies on Global Positioning System (GPS) to estimate its position, the robustness of DiSIF against a GPS positioning error is investigated.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we focus on a particular type of opportunistic ad-hoc networks, namely Pedestrian Ad-hoc NETworks (PANETs). In PANETs, nodes are densely distributed and each node may transmit information to all other nodes in the network via multi-hop broadcasting. Even though flooding is the simplest technique to broadcast information with multi-hop communications, it can be very inefficient because of redundant transmissions which may induce collisions. This problem is known, in the literature, as the “broadcast storm problem.” In this work, we present a novel probabilistic forwarding technique, denoted as Distance-based Silencing IF (DiSIF), which is derived from the probabilistic broadcasting protocol Irresponsible Forwarding (IF) and one of its extensions, denotes Silencing IF (SIF). The performance of the DiSIF protocol is analyzed and compared with those of other existing protocols, investigating the impact of fundamental network parameters. Lower bounds (exact and approximate) on the average number of hops, expedient to evaluate the propagation efficiency of DiSIF, are also derived. Finally, under the assumption that each node (e.g., a smartphone) relies on Global Positioning System (GPS) to estimate its position, the robustness of DiSIF against a GPS positioning error is investigated.
Andrea Gorrieri; Marco Martalò; Stefano Busanelli; Gianluigi Ferrari
Clustering and sensing with decentralized detection in vehicular ad hoc networks Journal Article
In: Ad Hoc Networks, 36, Part 2 , pp. 450 - 464, 2016, ISSN: 1570-8705, (Vehicular Networking for Mobile Crowd Sensing).
@article{Gorrieri2016450,
title = {Clustering and sensing with decentralized detection in vehicular ad hoc networks},
author = {Andrea Gorrieri and Marco Martalò and Stefano Busanelli and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S1570870515001249},
issn = {1570-8705},
year = {2016},
date = {2016-01-01},
journal = {Ad Hoc Networks},
volume = {36, Part 2},
pages = {450 - 464},
abstract = {In the near future, vehicles will be more and more advanced sensing platforms: for instance, at least one smartphone (with several on-board sensors) is likely to be inside each vehicle. Smartphone-based inter-vehicle communications thus support the creation of vehicular sensor networks (VSNs). In this paper, we analyze the performance of clustered VSNs, where (hierarchical) decentralized detection schemes are used to estimate the status of an observed spatially constant phenomenon of interest. Clustering makes processing efficient and the architecture scalable. Our approach consists of the creation, during a downlink phase, of a clustered VSN topology through fast broadcast of control messages, started from a remote sink (e.g., in the cloud), through a novel clustering protocol, denoted as cluster-head election irresponsible forwarding (CEIF). This clustered VSN topology is then exploited, during an uplink phase, to collect sensed data from the vehicles and perform distributed detection. The performance of the proposed scheme is investigated considering mostly IEEE 802.11b (smartphone-based) as well as IEEE 802.11p (inter-vehicle) communications in both highway-like and urban-like scenarios. Our results highlight the existing trade-off between decision delay and energy efficiency. The proposed VSN-based distributed detection schemes have to cope with the “ephemeral” nature of clusters. Therefore, proper cluster maintenance strategies are needed to prolong the cluster lifetime and, as a consequence, the maximum amount of data which can be collected before clusters break. This leads to the concept of decentralized detection “on the move.”},
note = {Vehicular Networking for Mobile Crowd Sensing},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In the near future, vehicles will be more and more advanced sensing platforms: for instance, at least one smartphone (with several on-board sensors) is likely to be inside each vehicle. Smartphone-based inter-vehicle communications thus support the creation of vehicular sensor networks (VSNs). In this paper, we analyze the performance of clustered VSNs, where (hierarchical) decentralized detection schemes are used to estimate the status of an observed spatially constant phenomenon of interest. Clustering makes processing efficient and the architecture scalable. Our approach consists of the creation, during a downlink phase, of a clustered VSN topology through fast broadcast of control messages, started from a remote sink (e.g., in the cloud), through a novel clustering protocol, denoted as cluster-head election irresponsible forwarding (CEIF). This clustered VSN topology is then exploited, during an uplink phase, to collect sensed data from the vehicles and perform distributed detection. The performance of the proposed scheme is investigated considering mostly IEEE 802.11b (smartphone-based) as well as IEEE 802.11p (inter-vehicle) communications in both highway-like and urban-like scenarios. Our results highlight the existing trade-off between decision delay and energy efficiency. The proposed VSN-based distributed detection schemes have to cope with the “ephemeral” nature of clusters. Therefore, proper cluster maintenance strategies are needed to prolong the cluster lifetime and, as a consequence, the maximum amount of data which can be collected before clusters break. This leads to the concept of decentralized detection “on the move.”
Marco Martalò; Gianluigi Ferrari; Muhammad Asim; Jonathan Gambini; Christian Mazzucco; Giacomo Cannalire; Sergio Bianchi; Riccardo Raheli
Pragmatic phase noise compensation for high-order coded modulations Journal Article
In: IET Communications, 10 (15), pp. 1956-1963, 2016, ISSN: 1751-8628.
@article{Maetal_IET16,
title = {Pragmatic phase noise compensation for high-order coded modulations},
author = {Marco Martalò and Gianluigi Ferrari and Muhammad Asim and Jonathan Gambini and Christian Mazzucco and Giacomo Cannalire and Sergio Bianchi and Riccardo Raheli},
url = {http://digital-library.theiet.org/content/journals/10.1049/iet-com.2016.0215},
issn = {1751-8628},
year = {2016},
date = {2016-01-01},
journal = {IET Communications},
volume = {10},
number = {15},
pages = {1956-1963},
publisher = {Institution of Engineering and Technology},
abstract = {This study discusses synchronisation in phase noise-impaired spectrally efficient communication systems employing high-order modulations. In particular, an iterative receiver, where demodulation and decoding are separate from maximum a posteriori probability (MAP) synchronisation, is presented. The authors’ separate approach is tailored to the design of pragmatic iterative receiver schemes employing ‘off-the-shelf’ demodulation and decoding blocks. This allows full compatibility with already existing systems, which is attractive from the implementation viewpoint. The proposed MAP synchronisation algorithm also requires very limited knowledge of the phase noise process and achieves near coherent performance with moderate computational complexity. Although the approach is very general, the authors discuss its performance for low-density parity-check-coded pilot symbol-aided quadrature amplitude modulation schemes, demonstrating that a significantly lower computational complexity can be achieved with respect to benchmark joint receivers.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This study discusses synchronisation in phase noise-impaired spectrally efficient communication systems employing high-order modulations. In particular, an iterative receiver, where demodulation and decoding are separate from maximum a posteriori probability (MAP) synchronisation, is presented. The authors’ separate approach is tailored to the design of pragmatic iterative receiver schemes employing ‘off-the-shelf’ demodulation and decoding blocks. This allows full compatibility with already existing systems, which is attractive from the implementation viewpoint. The proposed MAP synchronisation algorithm also requires very limited knowledge of the phase noise process and achieves near coherent performance with moderate computational complexity. Although the approach is very general, the authors discuss its performance for low-density parity-check-coded pilot symbol-aided quadrature amplitude modulation schemes, demonstrating that a significantly lower computational complexity can be achieved with respect to benchmark joint receivers.
Yujin Lim; Gianluigi Ferrari; Hideyuki Takahashi; Màrius Montón
Device-to-device communications in wireless sensor networks Journal Article
In: International Journal of Distributed Sensor Networks, 12 (8), pp. 1550147716664233, 2016.
@article{doi:10.1177/1550147716664233,
title = {Device-to-device communications in wireless sensor networks},
author = {Yujin Lim and Gianluigi Ferrari and Hideyuki Takahashi and Màrius Montón},
url = {https://doi.org/10.1177/1550147716664233},
doi = {10.1177/1550147716664233},
year = {2016},
date = {2016-01-01},
journal = {International Journal of Distributed Sensor Networks},
volume = {12},
number = {8},
pages = {1550147716664233},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2015
Stefano Salsano; Luca Veltri; Luca Davoli; Pier Luigi Ventre; Giuseppe Siracusano
PMSR - Poor Man's Segment Routing, a minimalistic approach to Segment Routing and a Traffic Engineering use case Journal Article
In: CoRR, abs/1512.05281 , 2015.
@article{SaVeDaVeSi_arXiv_2015,
title = {PMSR - Poor Man's Segment Routing, a minimalistic approach to Segment Routing and a Traffic Engineering use case},
author = {Stefano Salsano and Luca Veltri and Luca Davoli and Pier Luigi Ventre and Giuseppe Siracusano},
url = {http://arxiv.org/abs/1512.05281},
year = {2015},
date = {2015-12-16},
journal = {CoRR},
volume = {abs/1512.05281},
abstract = {The current specification of the Segment Routing (SR) architecture requires enhancements to the intra-domain routing protocols (e.g. OSPF and IS-IS) so that the nodes can advertise the Segment Identifiers (SIDs). We propose a simpler solution called PMSR (Poor Man's Segment Routing), that does not require any enhancement to routing protocol. We compare the procedures of PMSR with traditional SR, showing that PMSR can reduce the operation and management complexity. We analyze the set of use cases in the current SR drafts and we claim that PMSR can support the large majority of them. Thanks to the drastic simplification of the Control Plane, we have been able to develop an Open Source prototype of PMSR. In the second part of the paper, we consider a Traffic Engineering use case, starting from a traditional flow assignment optimization problem which allocates hop-by-hop paths to flows. We propose a SR path assignment algorithm and prove that it is optimal with respect to the number of segments allocated to a flow.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The current specification of the Segment Routing (SR) architecture requires enhancements to the intra-domain routing protocols (e.g. OSPF and IS-IS) so that the nodes can advertise the Segment Identifiers (SIDs). We propose a simpler solution called PMSR (Poor Man's Segment Routing), that does not require any enhancement to routing protocol. We compare the procedures of PMSR with traditional SR, showing that PMSR can reduce the operation and management complexity. We analyze the set of use cases in the current SR drafts and we claim that PMSR can support the large majority of them. Thanks to the drastic simplification of the Control Plane, we have been able to develop an Open Source prototype of PMSR. In the second part of the paper, we consider a Traffic Engineering use case, starting from a traditional flow assignment optimization problem which allocates hop-by-hop paths to flows. We propose a SR path assignment algorithm and prove that it is optimal with respect to the number of segments allocated to a flow.
Alessio Baricich; Elisa Grana; Marco Invernizzi; Federico Parisi; Gianluigi Ferrari; Carlo Cisari; Alessandro Mauro
A single-sensor wearable system for gait analysis in stroke patients: a pilot study Journal Article
In: Neurologie und Rehabilitation, Suppl 1:S40 , 2015, ISSN: 0947-2177.
@article{Baetal_REHAB15b,
title = {A single-sensor wearable system for gait analysis in stroke patients: a pilot study},
author = {Alessio Baricich and Elisa Grana and Marco Invernizzi and Federico Parisi and Gianluigi Ferrari and Carlo Cisari and Alessandro Mauro},
issn = {0947-2177},
year = {2015},
date = {2015-12-02},
journal = {Neurologie und Rehabilitation},
volume = {Suppl 1:S40 },
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Laura Belli; Simone Cirani; Luca Davoli; Andrea Gorrieri; Mirko Mancin; Marco Picone; Gianluigi Ferrari
Design and Deployment of an IoT Application-Oriented Testbed Journal Article
In: Computer, 48 (9), pp. 32-40, 2015, ISSN: 0018-9162.
@article{ieee-computer-sep2015-testbed,
title = {Design and Deployment of an IoT Application-Oriented Testbed},
author = {Laura Belli and Simone Cirani and Luca Davoli and Andrea Gorrieri and Mirko Mancin and Marco Picone and Gianluigi Ferrari},
url = {https://ieeexplore.ieee.org/document/7274422},
doi = {10.1109/MC.2015.253},
issn = {0018-9162},
year = {2015},
date = {2015-09-23},
journal = {Computer},
volume = {48},
number = {9},
pages = {32-40},
abstract = {The global reach and extreme heterogeneity of the Internet of Things present major application development challenges. Using the same Web-based approach underlying the Internet's evolution into the IoT, the Web of Things Testbed provides a stable, open, dynamic, and secure infrastructure to simplify application design and testing.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The global reach and extreme heterogeneity of the Internet of Things present major application development challenges. Using the same Web-based approach underlying the Internet's evolution into the IoT, the Web of Things Testbed provides a stable, open, dynamic, and secure infrastructure to simplify application design and testing.
Laura Belli; Simone Cirani; Luca Davoli; Gianluigi Ferrari; Lorenzo Melegari; Màrius Montón; Marco Picone
A Scalable Big Stream Cloud Architecture for the Internet of Things Journal Article
In: International Journal of Systems and Service-Oriented Engineering (IJSSOE), 5 (4), pp. 26-53, 2015, ISSN: 1947-3052.
@article{belli2015scalable,
title = {A Scalable Big Stream Cloud Architecture for the Internet of Things},
author = {Laura Belli and Simone Cirani and Luca Davoli and Gianluigi Ferrari and Lorenzo Melegari and Màrius Montón and Marco Picone},
doi = {10.4018/IJSSOE.2015100102},
issn = {1947-3052},
year = {2015},
date = {2015-09-04},
journal = {International Journal of Systems and Service-Oriented Engineering (IJSSOE)},
volume = {5},
number = {4},
pages = {26-53},
publisher = {IGI Global},
abstract = {The Internet of Things (IoT) will consist of billions (50 billions by 2020) of interconnected heterogeneous devices denoted as “Smart Objects:” tiny, constrained devices which are going to be pervasively deployed in several contexts. To meet low-latency requirements, IoT applications must rely on specific architectures designed to handle the gigantic stream of data coming from Smart Objects. This paper propose a novel Cloud architecture for Big Stream applications that can efficiently handle data coming from Smart Objects through a Graph-based processing platform and deliver processed data to consumer applications with low latency. The authors reverse the traditional “Big Data” paradigm, where real-time constraints are not considered, and introduce the new “Big Stream” paradigm, which better fits IoT scenarios. The paper provides a performance evaluation of a practical open-source implementation of the proposed architecture. Other practical aspects, such as security considerations, and possible business oriented exploitation plans are presented.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Internet of Things (IoT) will consist of billions (50 billions by 2020) of interconnected heterogeneous devices denoted as “Smart Objects:” tiny, constrained devices which are going to be pervasively deployed in several contexts. To meet low-latency requirements, IoT applications must rely on specific architectures designed to handle the gigantic stream of data coming from Smart Objects. This paper propose a novel Cloud architecture for Big Stream applications that can efficiently handle data coming from Smart Objects through a Graph-based processing platform and deliver processed data to consumer applications with low latency. The authors reverse the traditional “Big Data” paradigm, where real-time constraints are not considered, and introduce the new “Big Stream” paradigm, which better fits IoT scenarios. The paper provides a performance evaluation of a practical open-source implementation of the proposed architecture. Other practical aspects, such as security considerations, and possible business oriented exploitation plans are presented.
Federico Parisi; Gianluigi Ferrari; Matteo Giuberti; Laura Contin; Veronica Cimolin; Corrado Azzaro; Giovanni Albani; Alessandro Mauro
In: IEEE Journal of Biomedical and Health Informatics, 19 (6), pp. 1777-1793, 2015, ISBN: 2168-2194.
@article{PaFeGiCoCiAzAlMa15JBHI,
title = {Body Sensor Network-based Kinematic Characterization and Comparative Outlook of UPDRS Scoring in Leg Agility, Sit-to-Stand, and Gait Tasks in Parkinson's Disease},
author = {Federico Parisi and Gianluigi Ferrari and Matteo Giuberti and Laura Contin and Veronica Cimolin and Corrado Azzaro and Giovanni Albani and Alessandro Mauro},
url = {http://dx.doi.org/10.1109/JBHI.2015.2472640},
isbn = {2168-2194},
year = {2015},
date = {2015-08-25},
journal = {IEEE Journal of Biomedical and Health Informatics},
volume = {19},
number = {6},
pages = {1777-1793},
abstract = {Recently, we have proposed a Body Sensor Network (BSN)-based approach, composed of a few body-worn wireless inertial nodes, for automatic assignment of Unified Parkinsons Disease Rating Scale (UPDRS) scores in the following tasks: Leg agility (LA), Sit-to-Stand (S2S), and Gait (G). Unlike our previous works and the majority of the published studies, where UPDRS tasks were the sole focus, in the current paper we carry out a comparative investigation of the LA, S2S, and G tasks. In particular, after providing an accurate description of the features identified for the kinematic characterization of the three tasks, we comment on the correlation between the most relevant kinematic parameters and the UPDRS scoring. We analyzed the performance achieved by the automatic UPDRS scoring system and compared the estimated UPDRS evaluation with the one performed by neurologists, showing that the proposed system compares favorably with typical inter-rater variability. We then investigated the correlations between the UPDRS scores assigned to the various tasks by both the neurologists and the automatic system. The results, based on a limited number of subjects with Parkinson’s Disease (PD) (34 patients, 47 clinical trials), show poor-to-moderate correlations between the UPDRS scores of different tasks, highlighting that the patients’ motor performance may vary significantly from one task to another, since different tasks relate to different aspects of the disease. An aggregate UPDRS score is also considered as a concise parameter which can provide additional information on the overall level of the motor impairments of a Parkinson’s patient. Finally, we discuss a possible implementation of a practical e-health application for the remote monitoring of PD patients.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Recently, we have proposed a Body Sensor Network (BSN)-based approach, composed of a few body-worn wireless inertial nodes, for automatic assignment of Unified Parkinsons Disease Rating Scale (UPDRS) scores in the following tasks: Leg agility (LA), Sit-to-Stand (S2S), and Gait (G). Unlike our previous works and the majority of the published studies, where UPDRS tasks were the sole focus, in the current paper we carry out a comparative investigation of the LA, S2S, and G tasks. In particular, after providing an accurate description of the features identified for the kinematic characterization of the three tasks, we comment on the correlation between the most relevant kinematic parameters and the UPDRS scoring. We analyzed the performance achieved by the automatic UPDRS scoring system and compared the estimated UPDRS evaluation with the one performed by neurologists, showing that the proposed system compares favorably with typical inter-rater variability. We then investigated the correlations between the UPDRS scores assigned to the various tasks by both the neurologists and the automatic system. The results, based on a limited number of subjects with Parkinson’s Disease (PD) (34 patients, 47 clinical trials), show poor-to-moderate correlations between the UPDRS scores of different tasks, highlighting that the patients’ motor performance may vary significantly from one task to another, since different tasks relate to different aspects of the disease. An aggregate UPDRS score is also considered as a concise parameter which can provide additional information on the overall level of the motor impairments of a Parkinson’s patient. Finally, we discuss a possible implementation of a practical e-health application for the remote monitoring of PD patients.
Matteo Giuberti; Marco Martalò; Gianluigi Ferrari
A hybrid radio/accelerometric approach to arm posture recognition Journal Article
In: Journal of Ambient Intelligence and Smart Environments, 7 (4), 2015.
@article{GiMaFe_JAISE15,
title = {A hybrid radio/accelerometric approach to arm posture recognition},
author = {Matteo Giuberti and Marco Martalò and Gianluigi Ferrari},
url = {http://dx.doi.org/10.3233/ais-150326},
year = {2015},
date = {2015-08-01},
journal = {Journal of Ambient Intelligence and Smart Environments},
volume = {7},
number = {4},
abstract = {In this paper, we investigate the feasibility of a hybrid radio/accelerometric approach to perform arm posture recognition. A radio fingerprinting-based approach, through measurements of the Received radio Signal Strengths (RSSs) from anchor nodes, is first used to localize the positions (among a set determined during a training phase) of target nodes properly placed on a user arm. Accelerometric signals generated by the target nodes are then used to estimate the pitch of every device in order to refine the radio fingerprinting results and perform posture recognition, i.e., “continuous” estimation of the positions of the target nodes. We experimentally investigate, through a SunSPOT wireless sensor network testbed, different fingerprinting-based localization algorithms, namely deterministic and probabilistic. In each case, the system parameters are optimized by minimizing a properly defined Position Error (PE). Finally, a comparison between the performance of the proposed system and that of a low-cost optical arm posture recognition system (namely, Kinect) is presented.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we investigate the feasibility of a hybrid radio/accelerometric approach to perform arm posture recognition. A radio fingerprinting-based approach, through measurements of the Received radio Signal Strengths (RSSs) from anchor nodes, is first used to localize the positions (among a set determined during a training phase) of target nodes properly placed on a user arm. Accelerometric signals generated by the target nodes are then used to estimate the pitch of every device in order to refine the radio fingerprinting results and perform posture recognition, i.e., “continuous” estimation of the positions of the target nodes. We experimentally investigate, through a SunSPOT wireless sensor network testbed, different fingerprinting-based localization algorithms, namely deterministic and probabilistic. In each case, the system parameters are optimized by minimizing a properly defined Position Error (PE). Finally, a comparison between the performance of the proposed system and that of a low-cost optical arm posture recognition system (namely, Kinect) is presented.
Luca Davoli; Luca Veltri; Pier Luigi Ventre; Giuseppe Siracusano; Stefano Salsano
Traffic Engineering with Segment Routing: SDN-based Architectural Design and Open Source Implementation Journal Article
In: CoRR, abs/1506.05941 , 2015.
@article{arxivDavoliEWSDNExt2015,
title = {Traffic Engineering with Segment Routing: SDN-based Architectural Design and Open Source Implementation},
author = {Luca Davoli and Luca Veltri and Pier Luigi Ventre and Giuseppe Siracusano and Stefano Salsano},
url = {http://arxiv.org/abs/1506.05941},
year = {2015},
date = {2015-07-12},
journal = {CoRR},
volume = {abs/1506.05941},
abstract = {Traffic Engineering (TE) in IP carrier networks is one of the functions that can benefit from the Software Defined Networking paradigm. By logically centralizing the control of the network, it is possible to "program" per-flow routing based on TE goals. Traditional per-flow routing requires a direct interaction between the SDN controller and each node that is involved in the traffic paths. Depending on the granularity and on the temporal properties of the flows, this can lead to scalability issues for the amount of routing state that needs to be maintained in core network nodes and for the required configuration traffic. On the other hand, Segment Routing (SR) is an emerging approach to routing that may simplify the route enforcement delegating all the configuration and per-flow state at the border of the network. In this work we propose an architecture that integrates the SDN paradigm with SR-based TE, for which we have provided an open source reference implementation. We have designed and implemented a simple TE/SR heuristic for flow allocation and we show and discuss experimental results.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Traffic Engineering (TE) in IP carrier networks is one of the functions that can benefit from the Software Defined Networking paradigm. By logically centralizing the control of the network, it is possible to "program" per-flow routing based on TE goals. Traditional per-flow routing requires a direct interaction between the SDN controller and each node that is involved in the traffic paths. Depending on the granularity and on the temporal properties of the flows, this can lead to scalability issues for the amount of routing state that needs to be maintained in core network nodes and for the required configuration traffic. On the other hand, Segment Routing (SR) is an emerging approach to routing that may simplify the route enforcement delegating all the configuration and per-flow state at the border of the network. In this work we propose an architecture that integrates the SDN paradigm with SR-based TE, for which we have provided an open source reference implementation. We have designed and implemented a simple TE/SR heuristic for flow allocation and we show and discuss experimental results.
Mekkaoui Kheireddine; Rahmoun Abdellatif; Gianluigi Ferrari
Genetic centralized dynamic clustering in wireless sensor networks Journal Article
In: International Journal of Computer Network and Information Security (IJCNIS), 7 (8), pp. 1-8, 2015, ISSN: 2074-9090, (DOI: 10.5815/ijcnis.2015.08.01).
@article{KhAbFe15,
title = {Genetic centralized dynamic clustering in wireless sensor networks},
author = {Mekkaoui Kheireddine and Rahmoun Abdellatif and Gianluigi Ferrari},
url = {http://www.mecs-press.org/ijcnis/ijcnis-v7-n8/v7n8-1.html},
issn = {2074-9090},
year = {2015},
date = {2015-07-01},
journal = {International Journal of Computer Network and Information Security (IJCNIS)},
volume = {7},
number = {8},
pages = {1-8},
abstract = {In order to minimize the energy consumption involved by communications in wireless sensor networks, the use of clustering has proven to be effective. The problem remains to determine the number of cluster-heads, and their distribution in the network to ensure minimal energy consumption and better coverage networks. Unlike Low-Energy Adaptive Clustering Hierarchy algorithm which fixes in advance the number of cluster-heads, and do not guarantee the coverage of the entire network, in this paper, we proposed a genetic centralized dynamic algorithm (GA)-based clustering approach to optimize the clustering configuration (the number of cluster-heads, their distribution and the cluster-members) to limit node energy consumption and the best coverage. The obtained simulation results show that the proposed technique overcomes the Low-Energy Adaptive Clustering Hierarchy algorithm.},
note = {DOI: 10.5815/ijcnis.2015.08.01},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In order to minimize the energy consumption involved by communications in wireless sensor networks, the use of clustering has proven to be effective. The problem remains to determine the number of cluster-heads, and their distribution in the network to ensure minimal energy consumption and better coverage networks. Unlike Low-Energy Adaptive Clustering Hierarchy algorithm which fixes in advance the number of cluster-heads, and do not guarantee the coverage of the entire network, in this paper, we proposed a genetic centralized dynamic algorithm (GA)-based clustering approach to optimize the clustering configuration (the number of cluster-heads, their distribution and the cluster-members) to limit node energy consumption and the best coverage. The obtained simulation results show that the proposed technique overcomes the Low-Energy Adaptive Clustering Hierarchy algorithm.
Yujin Lim; Gianluigi Ferrari; Hideyuki Takahashi; Màrius Montón
Wireless Sensor Networks for Structural Health Monitoring Journal Article
In: International Journal of Distributed Sensor Networks, 11 (8), 2015.
@article{Lim01082015,
title = {Wireless Sensor Networks for Structural Health Monitoring},
author = {Yujin Lim and Gianluigi Ferrari and Hideyuki Takahashi and Màrius Montón},
url = {http://dsn.sagepub.com/content/11/8/425683.short},
year = {2015},
date = {2015-01-01},
journal = {International Journal of Distributed Sensor Networks},
volume = {11},
number = {8},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Marco Picone; Michele Amoretti; Marco Martalò; Francesco Zanichelli; Gianluigi Ferrari
Combining geo-referencing and network coding for distributed large-scale information management Journal Article
In: Concurrency and Computation: Practice and Experience, 27 (13), pp. 3295–3315, 2015, ISSN: 1532-0634.
@article{CPE:CPE3221,
title = {Combining geo-referencing and network coding for distributed large-scale information management},
author = {Marco Picone and Michele Amoretti and Marco Martalò and Francesco Zanichelli and Gianluigi Ferrari},
url = {http://dx.doi.org/10.1002/cpe.3221},
issn = {1532-0634},
year = {2015},
date = {2015-01-01},
journal = {Concurrency and Computation: Practice and Experience},
volume = {27},
number = {13},
pages = {3295--3315},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Marco Picone; Michele Amoretti; Gianluigi Ferrari; Francesco Zanichelli
D4V: a peer-to-peer architecture for data dissemination in smartphone-based vehicular applications Journal Article
In: PeerJ Computer Science, 1 , pp. e15, 2015, ISSN: 2376-5992.
@article{10.7717/peerj-cs.15,
title = {D4V: a peer-to-peer architecture for data dissemination in smartphone-based vehicular applications},
author = {Marco Picone and Michele Amoretti and Gianluigi Ferrari and Francesco Zanichelli},
url = {https://doi.org/10.7717/peerj-cs.15},
issn = {2376-5992},
year = {2015},
date = {2015-01-01},
journal = {PeerJ Computer Science},
volume = {1},
pages = {e15},
abstract = {Vehicular data collection applications are emerging as an appealing technology to monitor urban areas, where a high concentration of connected vehicles with onboard sensors is a near future scenario. In this context, smartphones are, on one side, effective enablers of Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) applications and, on the other side, highly sophisticated sensing platforms. In this paper, we introduce an effective and efficient system, denoted as D4V, to disseminate vehicle-related information and sensed data using smartphones as V2I devices. D4V relies on a Peer-to-Peer (P2P) overlay scheme, denoted as Distributed Geographic Table (DGT), which unifies the concepts of physical and virtual neighborhoods in a scalable and robust infrastructure for application-level services. First, we investigate the discovery procedure of the DGT overlay network, through analytical and simulation results. Then, we present and discuss an extensive simulation-based performance evaluation (considering relevant performance indicators) of the D4V system, in a 4G wireless communication scenario. The simulation methodology combines DEUS (an application-level simulation tool for the study of large-scale systems) with ns-3 (a well-known network simulator, which takes into account lower layers), in order to provide a D4V proof-of-concept. The observed results show that D4V-based information sharing among vehicles allows to significantly reduce risks and nuisances (e.g., due to road defects and congestions).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Vehicular data collection applications are emerging as an appealing technology to monitor urban areas, where a high concentration of connected vehicles with onboard sensors is a near future scenario. In this context, smartphones are, on one side, effective enablers of Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) applications and, on the other side, highly sophisticated sensing platforms. In this paper, we introduce an effective and efficient system, denoted as D4V, to disseminate vehicle-related information and sensed data using smartphones as V2I devices. D4V relies on a Peer-to-Peer (P2P) overlay scheme, denoted as Distributed Geographic Table (DGT), which unifies the concepts of physical and virtual neighborhoods in a scalable and robust infrastructure for application-level services. First, we investigate the discovery procedure of the DGT overlay network, through analytical and simulation results. Then, we present and discuss an extensive simulation-based performance evaluation (considering relevant performance indicators) of the D4V system, in a 4G wireless communication scenario. The simulation methodology combines DEUS (an application-level simulation tool for the study of large-scale systems) with ns-3 (a well-known network simulator, which takes into account lower layers), in order to provide a D4V proof-of-concept. The observed results show that D4V-based information sharing among vehicles allows to significantly reduce risks and nuisances (e.g., due to road defects and congestions).
Matteo Giuberti; Gianluigi Ferrari; Laura Contin; Veronica Cimolin; Corrado Azzaro; Giovanni Albani; Alessandro Mauro
Automatic UPDRS Evaluation in the Sit-to-Stand Task of Parkinsonians: Kinematic Analysis and Comparative Outlook on the Leg Agility Task Journal Article
In: IEEE Journal of Biomedical and Health Informatics, 19 (3), pp. 803-814, 2015, ISSN: 2168-2194.
@article{Gietal_JBHI15,
title = {Automatic UPDRS Evaluation in the Sit-to-Stand Task of Parkinsonians: Kinematic Analysis and Comparative Outlook on the Leg Agility Task},
author = {Matteo Giuberti and Gianluigi Ferrari and Laura Contin and Veronica Cimolin and Corrado Azzaro and Giovanni Albani and Alessandro Mauro},
url = {http://dx.doi.org/10.1109/JBHI.2015.2425296},
issn = {2168-2194},
year = {2015},
date = {2015-01-01},
journal = {IEEE Journal of Biomedical and Health Informatics},
volume = {19},
number = {3},
pages = {803-814},
abstract = {In this study, we first characterize the sit-to-stand (S2S) task, which contributes to the evaluation of the degree of severity of the Parkinson's disease (PD), through kinematic features, which are then linked to the Unified Parkinson's disease rating scale (UPDRS) scores. We propose to use a single body-worn wireless inertial node placed on the chest of a patient. The experimental investigation is carried out considering 24 PD patients, comparing the obtained results directly with the kinematic characterization of the leg agility (LA) task performed by the same set of patients. We show that i) the S2S and LA tasks are rather unrelated and ii) the UPDRS distributions (for both S2S and LA tasks) across the patients have a direct impact on the observed system performance.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this study, we first characterize the sit-to-stand (S2S) task, which contributes to the evaluation of the degree of severity of the Parkinson's disease (PD), through kinematic features, which are then linked to the Unified Parkinson's disease rating scale (UPDRS) scores. We propose to use a single body-worn wireless inertial node placed on the chest of a patient. The experimental investigation is carried out considering 24 PD patients, comparing the obtained results directly with the kinematic characterization of the leg agility (LA) task performed by the same set of patients. We show that i) the S2S and LA tasks are rather unrelated and ii) the UPDRS distributions (for both S2S and LA tasks) across the patients have a direct impact on the observed system performance.
Stefania Monica; Gianluigi Ferrari
UWB-based localization in large indoor scenarios: optimized placement of anchor nodes Journal Article
In: IEEE Transactions on Aerospace and Electronic Systems, 51 (2), pp. 987-999, 2015, ISSN: 0018-9251.
@article{MoFe_TAES15,
title = {UWB-based localization in large indoor scenarios: optimized placement of anchor nodes},
author = {Stefania Monica and Gianluigi Ferrari},
url = {http://dx.doi.org/10.1109/TAES.2014.130722},
issn = {0018-9251},
year = {2015},
date = {2015-01-01},
journal = {IEEE Transactions on Aerospace and Electronic Systems},
volume = {51},
number = {2},
pages = {987-999},
abstract = {In this paper, we consider the problem of locating a target node (TN) moving along a corridor in a large industrial environment by means of ultrawide band signaling from fixed anchor nodes (ANs) uniformly positioned at the same height on both sides of the corridor. For a representative geometry of a large indoor (industrial) scenario, we formulate an analytical approach to the optimized placement (in terms of internode distance) of ANs using the criterion of minimizing the average mean square error (MSE) in the time-difference-of-arrival-based estimated positions of the TN. Under the assumption of a fixed variance of the range estimation error, we derive a simple closed-form expression for the optimal inter-AN distance in terms of the corridor width and the height of the ANs. The effectiveness of the analytical approach is confirmed by simulations. We also show that the proposed approach allows the MSE in the TN position estimates to reach the Cramer Rao lower bound.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we consider the problem of locating a target node (TN) moving along a corridor in a large industrial environment by means of ultrawide band signaling from fixed anchor nodes (ANs) uniformly positioned at the same height on both sides of the corridor. For a representative geometry of a large indoor (industrial) scenario, we formulate an analytical approach to the optimized placement (in terms of internode distance) of ANs using the criterion of minimizing the average mean square error (MSE) in the time-difference-of-arrival-based estimated positions of the TN. Under the assumption of a fixed variance of the range estimation error, we derive a simple closed-form expression for the optimal inter-AN distance in terms of the corridor width and the height of the ANs. The effectiveness of the analytical approach is confirmed by simulations. We also show that the proposed approach allows the MSE in the TN position estimates to reach the Cramer Rao lower bound.
Pietro Gonizzi; Gianluigi Ferrari; Vincent Gay; Jérémie Leguay
Data dissemination scheme for distributed storage for IoT observation systems at large scale Journal Article
In: Information Fusion, 22 , pp. 16 - 25, 2015, ISSN: 1566-2535.
@article{Gonizzi201516,
title = {Data dissemination scheme for distributed storage for IoT observation systems at large scale},
author = {Pietro Gonizzi and Gianluigi Ferrari and Vincent Gay and Jérémie Leguay},
url = {http://www.sciencedirect.com/science/article/pii/S1566253513000444},
issn = {1566-2535},
year = {2015},
date = {2015-01-01},
journal = {Information Fusion},
volume = {22},
pages = {16 - 25},
abstract = {Abstract In the emerging field of the Internet of Things (IoT), Wireless Sensor Networks (WSNs) have a key role to play in sensing and collecting measures on the surrounding environment. In the deployment of large scale observation systems in remote areas, when there is not a permanent connection with the Internet, WSNs are calling for replication and distributed storage techniques that increase the amount of data stored within the WSN and reduce the probability of data loss. Unlike conventional network data storage, WSN-based distributed storage is constrained by the limited resources of the sensors. In this paper, we propose a low-complexity distributed data replication mechanism to increase the resilience of WSN-based distributed storage at large scale. In particular, we propose a simple, yet accurate, analytical modeling framework and an extensive simulation campaign, which complement experimental results on the SensLab testbed. The impact of several key parameters on the system performance is investigated.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Abstract In the emerging field of the Internet of Things (IoT), Wireless Sensor Networks (WSNs) have a key role to play in sensing and collecting measures on the surrounding environment. In the deployment of large scale observation systems in remote areas, when there is not a permanent connection with the Internet, WSNs are calling for replication and distributed storage techniques that increase the amount of data stored within the WSN and reduce the probability of data loss. Unlike conventional network data storage, WSN-based distributed storage is constrained by the limited resources of the sensors. In this paper, we propose a low-complexity distributed data replication mechanism to increase the resilience of WSN-based distributed storage at large scale. In particular, we propose a simple, yet accurate, analytical modeling framework and an extensive simulation campaign, which complement experimental results on the SensLab testbed. The impact of several key parameters on the system performance is investigated.
Matteo Giuberti; Gianluigi Ferrari; Laura Contin; Veronica Cimolin; Corrado Azzaro; Giovanni Albani; Alessandro Mauro
Assigning UPDRS Scores in the Leg Agility Task of Parkinsonians: Can It Be Done Through BSN-Based Kinematic Variables? Journal Article
In: IEEE Internet of Things Journal, 2 (1), pp. 41-51, 2015, ISSN: 2327-4662.
@article{Gietal_IoTJ15,
title = {Assigning UPDRS Scores in the Leg Agility Task of Parkinsonians: Can It Be Done Through BSN-Based Kinematic Variables?},
author = {Matteo Giuberti and Gianluigi Ferrari and Laura Contin and Veronica Cimolin and Corrado Azzaro and Giovanni Albani and Alessandro Mauro},
url = {http://dx.doi.org/10.1109/JIOT.2015.2390075},
issn = {2327-4662},
year = {2015},
date = {2015-01-01},
journal = {IEEE Internet of Things Journal},
volume = {2},
number = {1},
pages = {41-51},
abstract = {In this paper, by characterizing the leg agility (LA) task, which contributes to the evaluation of the degree of severity of the Parkinson's disease (PD), through kinematic variables (including the angular amplitude and speed of thighs' motion), we investigate the link between these variables and unified Parkinson's disease rating scale (UPDRS) scores. Our investigation relies on the use of a few body-worn wireless inertial nodes and represents a first step in the design of a portable system, amenable to be integrated in Internet of Things (IoT) scenarios, for automatic detection of the degree of severity (in terms of UPDRS score) of PD. The experimental investigation is carried out considering 24 PD patients.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, by characterizing the leg agility (LA) task, which contributes to the evaluation of the degree of severity of the Parkinson's disease (PD), through kinematic variables (including the angular amplitude and speed of thighs' motion), we investigate the link between these variables and unified Parkinson's disease rating scale (UPDRS) scores. Our investigation relies on the use of a few body-worn wireless inertial nodes and represents a first step in the design of a portable system, amenable to be integrated in Internet of Things (IoT) scenarios, for automatic detection of the degree of severity (in terms of UPDRS score) of PD. The experimental investigation is carried out considering 24 PD patients.
Simone Cirani; Marco Picone; Pietro Gonizzi; Luca Veltri; Gianluigi Ferrari
IoT-OAS: An OAuth-Based Authorization Service Architecture for Secure Services in IoT Scenarios Journal Article
In: IEEE Sensors Journal, 15 (2), pp. 1224-1234, 2015, ISSN: 1530-437X.
@article{Cietal_Sensors15,
title = {IoT-OAS: An OAuth-Based Authorization Service Architecture for Secure Services in IoT Scenarios},
author = {Simone Cirani and Marco Picone and Pietro Gonizzi and Luca Veltri and Gianluigi Ferrari},
url = {http://dx.doi.org/10.1109/JSEN.2014.2361406},
issn = {1530-437X},
year = {2015},
date = {2015-01-01},
journal = {IEEE Sensors Journal},
volume = {15},
number = {2},
pages = {1224-1234},
abstract = {Open authorization (OAuth) is an open protocol, which allows secure authorization in a simple and standardized way from third-party applications accessing online services, based on the representational state transfer (REST) web architecture. OAuth has been designed to provide an authorization layer, typically on top of a secure transport layer such as HTTPS. The Internet of Things (IoTs) refers to the interconnection of billions of resource-constrained devices, denoted as smart objects, in an Internet-like structure. Smart objects have limited processing/memory capabilities and operate in challenging environments, such as low-power and lossy networks. IP has been foreseen as the standard communication protocol for smart object interoperability. The Internet engineering task force constrained RESTful environments working group has defined the constrained application protocol (CoAP) as a generic web protocol for RESTful-constrained environments, targeting machine-to-machine applications, which maps to HTTP for integration with the existing web. In this paper, we propose an architecture targeting HTTP/CoAP services to provide an authorization framework, which can be integrated by invoking an external oauth-based authorization service (OAS). The overall architecture is denoted as IoT-OAS. We also present an overview of significant IoT application scenarios. The IoT-OAS architecture is meant to be flexible, highly configurable, and easy to integrate with existing services. Among the advantages achieved by delegating the authorization functionality, IoT scenarios benefit by: 1) lower processing load with respect to solutions, where access control is implemented on the smart object; 2) fine-grained (remote) customization of access policies; and 3) scalability, without the need to operate directly on the device.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Open authorization (OAuth) is an open protocol, which allows secure authorization in a simple and standardized way from third-party applications accessing online services, based on the representational state transfer (REST) web architecture. OAuth has been designed to provide an authorization layer, typically on top of a secure transport layer such as HTTPS. The Internet of Things (IoTs) refers to the interconnection of billions of resource-constrained devices, denoted as smart objects, in an Internet-like structure. Smart objects have limited processing/memory capabilities and operate in challenging environments, such as low-power and lossy networks. IP has been foreseen as the standard communication protocol for smart object interoperability. The Internet engineering task force constrained RESTful environments working group has defined the constrained application protocol (CoAP) as a generic web protocol for RESTful-constrained environments, targeting machine-to-machine applications, which maps to HTTP for integration with the existing web. In this paper, we propose an architecture targeting HTTP/CoAP services to provide an authorization framework, which can be integrated by invoking an external oauth-based authorization service (OAS). The overall architecture is denoted as IoT-OAS. We also present an overview of significant IoT application scenarios. The IoT-OAS architecture is meant to be flexible, highly configurable, and easy to integrate with existing services. Among the advantages achieved by delegating the authorization functionality, IoT scenarios benefit by: 1) lower processing load with respect to solutions, where access control is implemented on the smart object; 2) fine-grained (remote) customization of access policies; and 3) scalability, without the need to operate directly on the device.
Andrea Gorrieri; Gianluigi Ferrari
Irresponsible AODV routing Journal Article
In: Vehicular Communications, 2 (1), pp. 47 - 57, 2015, ISSN: 2214-2096.
@article{Gorrieri201547,
title = {Irresponsible AODV routing},
author = {Andrea Gorrieri and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S2214209615000030},
doi = {10.1016/j.vehcom.2015.01.002},
issn = {2214-2096},
year = {2015},
date = {2015-01-01},
journal = {Vehicular Communications},
volume = {2},
number = {1},
pages = {47 - 57},
abstract = {Broadcasting is a common transmission strategy used by several ad-hoc routing protocols in order to solve many issues, such as finding a route to a new host or sending control messages to all nodes in the network. Flooding is the simplest technique to achieve broadcast communications and it is widely used in many existing routing protocols for Mobile Ad-hoc NETworks (MANETs). However, because of multiple access interference, due to redundant transmissions, flooding tends to be inefficient. In this paper, the well-known Ad-hoc On demand Distance Vector (AODV) routing protocol [1] is modified by replacing the flooding mechanism, used in its route discovery process, with the probabilistic forwarding technique given by Irresponsible Forwarding (IF) [2]. The performance of the new routing protocol, denoted as irresponsible AODV (iAODV), is analyzed in three characteristic scenarios (pedestrian, pedestrian–vehicular, and vehicular). The obtained results show that the iAODV protocol can outperform the AODV protocol by significantly reducing the overhead traffic during the route discovery phase. This is more pronounced the higher are the node spatial density and/or data traffic load. The impact, on the system performance, of fundamental network parameters is investigated.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Broadcasting is a common transmission strategy used by several ad-hoc routing protocols in order to solve many issues, such as finding a route to a new host or sending control messages to all nodes in the network. Flooding is the simplest technique to achieve broadcast communications and it is widely used in many existing routing protocols for Mobile Ad-hoc NETworks (MANETs). However, because of multiple access interference, due to redundant transmissions, flooding tends to be inefficient. In this paper, the well-known Ad-hoc On demand Distance Vector (AODV) routing protocol [1] is modified by replacing the flooding mechanism, used in its route discovery process, with the probabilistic forwarding technique given by Irresponsible Forwarding (IF) [2]. The performance of the new routing protocol, denoted as irresponsible AODV (iAODV), is analyzed in three characteristic scenarios (pedestrian, pedestrian–vehicular, and vehicular). The obtained results show that the iAODV protocol can outperform the AODV protocol by significantly reducing the overhead traffic during the route discovery phase. This is more pronounced the higher are the node spatial density and/or data traffic load. The impact, on the system performance, of fundamental network parameters is investigated.
2014
Stefania Monica; Gianluigi Ferrari
Swarm intelligent approaches to auto-localization of nodes in static UWB networks Journal Article
In: Applied Soft Computing, 25 , pp. 426-434, 2014.
@article{Monica2014b,
title = {Swarm intelligent approaches to auto-localization of nodes in static UWB networks},
author = {Stefania Monica and Gianluigi Ferrari},
url = {https://www.sciencedirect.com/science/article/pii/S1568494614004293},
doi = {10.1016/j.asoc.2014.07.025},
year = {2014},
date = {2014-12-01},
journal = {Applied Soft Computing},
volume = {25},
pages = {426-434},
abstract = {In this paper, we address the problem of localizing sensor nodes in a static network, given that the positions of a few of them (denoted as “beacons“) are a priori known. We refer to this problem as “auto-localization.” Three localization techniques are considered: the two-stage maximum-likelihood (TSML) method; the plane intersection (PI) method; and the particle swarm optimization (PSO) algorithm. While the first two techniques come from the communication-theoretic “world,” the last one comes from the soft computing “world.” The performance of the considered localization techniques is investigated, in a comparative way, taking into account (i) the number of beacons and (ii) the distances between beacons and nodes. Since our simulation results show that a PSO-based approach allows obtaining more accurate position estimates, in the second part of the paper we focus on this technique proposing a novel hybrid version of the PSO algorithm with improved performance. In particular, we investigate, for various population sizes, the number of iterations which are needed to achieve a given error tolerance. According to our simulation results, the hybrid PSO algorithm guarantees faster convergence at a reduced computational complexity, making it attractive for dynamic localization. In more general terms, our results show that the application of soft computing techniques to communication-theoretic problems leads to interesting research perspectives.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we address the problem of localizing sensor nodes in a static network, given that the positions of a few of them (denoted as “beacons“) are a priori known. We refer to this problem as “auto-localization.” Three localization techniques are considered: the two-stage maximum-likelihood (TSML) method; the plane intersection (PI) method; and the particle swarm optimization (PSO) algorithm. While the first two techniques come from the communication-theoretic “world,” the last one comes from the soft computing “world.” The performance of the considered localization techniques is investigated, in a comparative way, taking into account (i) the number of beacons and (ii) the distances between beacons and nodes. Since our simulation results show that a PSO-based approach allows obtaining more accurate position estimates, in the second part of the paper we focus on this technique proposing a novel hybrid version of the PSO algorithm with improved performance. In particular, we investigate, for various population sizes, the number of iterations which are needed to achieve a given error tolerance. According to our simulation results, the hybrid PSO algorithm guarantees faster convergence at a reduced computational complexity, making it attractive for dynamic localization. In more general terms, our results show that the application of soft computing techniques to communication-theoretic problems leads to interesting research perspectives.
Simone Cirani; Luca Davoli; Gianluigi Ferrari; Rèmy Lèone; Paolo Medagliani; Marco Picone; Luca Veltri
A Scalable and Self-Configuring Architecture for Service Discovery in the Internet of Things Journal Article
In: Internet of Things Journal, IEEE, 1 (5), pp. 508-521, 2014, ISSN: 2327-4662.
@article{iotJournalServiceDiscovery,
title = {A Scalable and Self-Configuring Architecture for Service Discovery in the Internet of Things},
author = {Simone Cirani and Luca Davoli and Gianluigi Ferrari and Rèmy Lèone and Paolo Medagliani and Marco Picone and Luca Veltri},
url = {https://ieeexplore.ieee.org/document/6899579},
doi = {10.1109/JIOT.2014.2358296},
issn = {2327-4662},
year = {2014},
date = {2014-09-16},
journal = {Internet of Things Journal, IEEE},
volume = {1},
number = {5},
pages = {508-521},
abstract = {The Internet of Things (IoT) aims at connecting billions of devices in an Internet-like structure. This gigantic information exchange enables new opportunities and new forms of interactions among things and people. A crucial enabler of robust applications and easy smart objects’ deployment is the availability of mechanisms that minimize (ideally, cancel) the need for external human intervention for configuration and maintenance of deployed objects. These mechanisms must also be scalable, since the number of deployed objects is expected to constantly grow in the next years. In this work, we propose a scalable and self-configuring Peer-to-Peer (P2P)-based architecture for large-scale IoT networks, aiming at providing automated service and resource discovery mechanisms, which require no human intervention for their configuration. In particular, we focus on both local and global service discovery, showing how the proposed architecture allows the local and global mechanisms to successfully interact, while keeping their mutual independence (from an operational viewpoint). The effectiveness of the proposed architecture is confirmed by experimental results obtained through a real-world deployment.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Internet of Things (IoT) aims at connecting billions of devices in an Internet-like structure. This gigantic information exchange enables new opportunities and new forms of interactions among things and people. A crucial enabler of robust applications and easy smart objects’ deployment is the availability of mechanisms that minimize (ideally, cancel) the need for external human intervention for configuration and maintenance of deployed objects. These mechanisms must also be scalable, since the number of deployed objects is expected to constantly grow in the next years. In this work, we propose a scalable and self-configuring Peer-to-Peer (P2P)-based architecture for large-scale IoT networks, aiming at providing automated service and resource discovery mechanisms, which require no human intervention for their configuration. In particular, we focus on both local and global service discovery, showing how the proposed architecture allows the local and global mechanisms to successfully interact, while keeping their mutual independence (from an operational viewpoint). The effectiveness of the proposed architecture is confirmed by experimental results obtained through a real-world deployment.
Mirko Mancin; Salvatore Di Gennaro; Alessandro Matese; Jacopo Primicerio
An Open-Source and Low-Cost Monitoring System for Precision Enology Journal Article
In: Sciforum Electronic Conference Series, Vol. 1 (g009; doi:10.3390/ecsa-1-g009 ), 2014.
@article{Salvatore2014,
title = {An Open-Source and Low-Cost Monitoring System for Precision Enology},
author = {Mirko Mancin and Salvatore Di Gennaro and Alessandro Matese and Jacopo Primicerio},
editor = {Mirko Mancin and Salvatore Di Gennaro and Alessandro Matese and Jacopo Primicerio},
url = {http://www.sciforum.net/conference/ecsa-1/paper/2409},
year = {2014},
date = {2014-06-02},
journal = {Sciforum Electronic Conference Series},
volume = {Vol. 1},
number = {g009; doi:10.3390/ecsa-1-g009 },
abstract = {Winemaking is a dynamic process where conditions could be strongly different between products of the same vineyard and even among each wine vat, due to microbiological and chemical process. This high variability means an increase in work in term of control and process management. As for Precision Viticulture, the winemaking process requires a site-specific methodology, in order to optimize cellar practices management and quality production. This kind of approach suggest a new concept of winemaking, identified as Precision Enology. The Institute of Biometeorology of the National Research Council has developed a wireless monitoring system, which consists of silicone barrel bungs equipped with sensors for the measurement of physical and chemical parameters in wine stored in barrel. The present work describes an open-source evolution of the preliminary prototype, with Arduino based technology. Results have shown good performance in terms of data transmission and accuracy, minimal size and power consumption. The system has been designed to create a low-cost product, which allows a remote and real-time control of wine evolution in each barrel, minimizing costs and time for sampling and laboratory analysis. The possibility to integrate my kind of sensors makes the system a flexible tool capable to satisfy various monitoring needs.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Winemaking is a dynamic process where conditions could be strongly different between products of the same vineyard and even among each wine vat, due to microbiological and chemical process. This high variability means an increase in work in term of control and process management. As for Precision Viticulture, the winemaking process requires a site-specific methodology, in order to optimize cellar practices management and quality production. This kind of approach suggest a new concept of winemaking, identified as Precision Enology. The Institute of Biometeorology of the National Research Council has developed a wireless monitoring system, which consists of silicone barrel bungs equipped with sensors for the measurement of physical and chemical parameters in wine stored in barrel. The present work describes an open-source evolution of the preliminary prototype, with Arduino based technology. Results have shown good performance in terms of data transmission and accuracy, minimal size and power consumption. The system has been designed to create a low-cost product, which allows a remote and real-time control of wine evolution in each barrel, minimizing costs and time for sampling and laboratory analysis. The possibility to integrate my kind of sensors makes the system a flexible tool capable to satisfy various monitoring needs.
Simone Cirani; Marco Picone; Luca Veltri
A session initiation protocol for the Internet of Things Journal Article
In: Scalable Computing: Practice and Experience, 14 (4), pp. 249–263, 2014, ISSN: 1895-1767.
@article{CiPiVe2014,
title = {A session initiation protocol for the Internet of Things},
author = {Simone Cirani and Marco Picone and Luca Veltri},
url = {http://www.scpe.org/index.php/scpe/article/view/931/393},
issn = {1895-1767},
year = {2014},
date = {2014-01-01},
journal = {Scalable Computing: Practice and Experience},
volume = {14},
number = {4},
pages = {249–263},
abstract = {The Internet of Things (IoT) refers to the interconnection of billions of constrained devices, denoted as “smart objects”, in an Internet-like structure. Smart objects typically feature limited capabilities in terms of computation and memory and operate in constrained environments, such as low-power lossy networks. As the Internet Protocol (IP) has been foreseen as the standard for communications in IoT, an effort to bring IP connectivity to smart objects and define suitable communication protocols (i.e. Constrained Application Protocol (CoAP)) is being carried out within standardization organizations, such as the Internet Engineering Task Force (IETF). In this paper, we propose a constrained version of the Session Initiation Protocol (SIP), named “CoSIP”, whose intent is to allow constrained devices to instantiate communication sessions in a lightweight and standard fashion. Session instantiation can include a negotiation phase of some parameters which will be used for all subsequent communication. CoSIP can be adopted in several application scenarios, such as service discovery and publish/subscribe applications, which are detailed. An evaluation of the proposed protocol is also presented, based on a Java implementation of CoSIP, to show the benefits that its adoption can bring about, in terms of compression rate with the existing SIP protocol and message overhead compared with the use of CoAP.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Internet of Things (IoT) refers to the interconnection of billions of constrained devices, denoted as “smart objects”, in an Internet-like structure. Smart objects typically feature limited capabilities in terms of computation and memory and operate in constrained environments, such as low-power lossy networks. As the Internet Protocol (IP) has been foreseen as the standard for communications in IoT, an effort to bring IP connectivity to smart objects and define suitable communication protocols (i.e. Constrained Application Protocol (CoAP)) is being carried out within standardization organizations, such as the Internet Engineering Task Force (IETF). In this paper, we propose a constrained version of the Session Initiation Protocol (SIP), named “CoSIP”, whose intent is to allow constrained devices to instantiate communication sessions in a lightweight and standard fashion. Session instantiation can include a negotiation phase of some parameters which will be used for all subsequent communication. CoSIP can be adopted in several application scenarios, such as service discovery and publish/subscribe applications, which are detailed. An evaluation of the proposed protocol is also presented, based on a Java implementation of CoSIP, to show the benefits that its adoption can bring about, in terms of compression rate with the existing SIP protocol and message overhead compared with the use of CoAP.
Marco Martalò; Michele Amoretti; Marco Picone; Gianluigi Ferrari
Sporadic Decentralized Resource Maintenance for P2P Distributed Storage Networks Journal Article
In: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 74 , pp. 2029–2038, 2014.
@article{distributedStorageJournal,
title = {Sporadic Decentralized Resource Maintenance for P2P Distributed Storage Networks},
author = {Marco Martalò and Michele Amoretti and Marco Picone and Gianluigi Ferrari},
year = {2014},
date = {2014-01-01},
journal = {JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING},
volume = {74},
pages = {2029--2038},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Stefano Sebastio; Michele Amoretti; Jose Raul Murga; Marco Picone; Stefano Cagnoni
Honest vs. Cheating Bots in PATROL-Based Real-Time Strategy MMOGs Journal Article
In: Evolution, Complexity and Artificial Life, pp. 225–238, 2014.
@article{patrolJournal,
title = {Honest vs. Cheating Bots in PATROL-Based Real-Time Strategy MMOGs},
author = {Stefano Sebastio and Michele Amoretti and Jose Raul Murga and Marco Picone and Stefano Cagnoni},
editor = {Stefano Cagnoni and Marco Mirolli and Marco Villani},
url = {http://www.springer.com/computer/ai/book/978-3-642-37576-7},
year = {2014},
date = {2014-01-01},
booktitle = {Evolution, Complexity and Artificial Life},
issuetitle = {Evolution, Complexity and Artificial Life},
journal = {Evolution, Complexity and Artificial Life},
pages = {225--238},
publisher = {Springer Berlin Heidelberg},
address = {Berlin},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Andrea Abrardo; Gianluigi Ferrari; Marco Martalò; Michele Franceschini; Riccardo Raheli
Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes Journal Article
In: IEEE Transactions on Communications, 62 (7), pp. 2531-2543, 2014, ISSN: 0090-6778.
@article{6817593,
title = {Orthogonal Multiple Access With Correlated Sources: Achievable Region and Pragmatic Schemes},
author = {Andrea Abrardo and Gianluigi Ferrari and Marco Martalò and Michele Franceschini and Riccardo Raheli},
url = {https://dx.doi.org/10.1109/TCOMM.2014.2325039},
issn = {0090-6778},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Communications},
volume = {62},
number = {7},
pages = {2531-2543},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2013
Simone Cirani; Gianluigi Ferrari; Luca Veltri
Enforcing Security Mechanisms in the IP-Based Internet of Things: An Algorithmic Overview Journal Article
In: Algorithms, 6 (2), pp. 197–226, 2013, ISSN: 1999-4893.
@article{CiVeFe2013b,
title = {Enforcing Security Mechanisms in the IP-Based Internet of Things: An Algorithmic Overview},
author = {Simone Cirani and Gianluigi Ferrari and Luca Veltri},
url = {http://www.mdpi.com/1999-4893/6/2/197},
issn = {1999-4893},
year = {2013},
date = {2013-04-02},
journal = {Algorithms},
volume = {6},
number = {2},
pages = {197--226},
abstract = {The Internet of Things (IoT) refers to the Internet-like structure of billions of interconnected constrained devices, denoted as “smart objects”. Smart objects have limited capabilities, in terms of computational power and memory, and might be battery-powered devices, thus raising the need to adopt particularly energy efficient technologies. Among the most notable challenges that building interconnected smart objects brings about, there are standardization and interoperability. The use of IP has been foreseen as the standard for interoperability for smart objects. As billions of smart objects are expected to come to life and IPv4 addresses have eventually reached depletion, IPv6 has been identified as a candidate for smart-object communication. The deployment of the IoT raises many security issues coming from (i) the very nature of smart objects, e.g., the adoption of lightweight cryptographic algorithms, in terms of processing and memory requirements; and (ii) the use of standard protocols, e.g., the need to minimize the amount of data exchanged between nodes. This paper provides a detailed overview of the security challenges related to the deployment of smart objects. Security protocols at network, transport, and application layers are discussed, together with lightweight cryptographic algorithms proposed to be used instead of conventional and demanding ones, in terms of computational resources. Security aspects, such as key distribution and security bootstrapping, and application scenarios, such as secure data aggregation and service authorization, are also discussed.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The Internet of Things (IoT) refers to the Internet-like structure of billions of interconnected constrained devices, denoted as “smart objects”. Smart objects have limited capabilities, in terms of computational power and memory, and might be battery-powered devices, thus raising the need to adopt particularly energy efficient technologies. Among the most notable challenges that building interconnected smart objects brings about, there are standardization and interoperability. The use of IP has been foreseen as the standard for interoperability for smart objects. As billions of smart objects are expected to come to life and IPv4 addresses have eventually reached depletion, IPv6 has been identified as a candidate for smart-object communication. The deployment of the IoT raises many security issues coming from (i) the very nature of smart objects, e.g., the adoption of lightweight cryptographic algorithms, in terms of processing and memory requirements; and (ii) the use of standard protocols, e.g., the need to minimize the amount of data exchanged between nodes. This paper provides a detailed overview of the security challenges related to the deployment of smart objects. Security protocols at network, transport, and application layers are discussed, together with lightweight cryptographic algorithms proposed to be used instead of conventional and demanding ones, in terms of computational resources. Security aspects, such as key distribution and security bootstrapping, and application scenarios, such as secure data aggregation and service authorization, are also discussed.
Pietro Gonizzi; Gianluigi Ferrari; Vincent Gay; Jérémie Leguay
Data Dissemination Scheme for Distributed Storage for IoT Observation Systems at Large Scale Journal Article
In: Information Fusion, (0), pp. -, 2013, ISSN: 1566-2535.
@article{GoFeGaLe13,
title = {Data Dissemination Scheme for Distributed Storage for IoT Observation Systems at Large Scale},
author = {Pietro Gonizzi and Gianluigi Ferrari and Vincent Gay and Jérémie Leguay},
url = {http://www.sciencedirect.com/science/article/pii/S1566253513000444},
issn = {1566-2535},
year = {2013},
date = {2013-01-01},
journal = {Information Fusion},
number = {0},
pages = {-},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Matteo Giuberti; Gianluigi Ferrari
BSN-based Activity Classification: a Low Complexity Windowing-&-Classification Approach Journal Article
In: Advances in Science and Technology, 85 , pp. 53–58, 2013.
@article{GiFe13,
title = {BSN-based Activity Classification: a Low Complexity Windowing-&-Classification Approach},
author = {Matteo Giuberti and Gianluigi Ferrari},
year = {2013},
date = {2013-01-01},
journal = {Advances in Science and Technology},
volume = {85},
pages = {53--58},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Luca Veltri; Simone Cirani; Stefano Busanelli; Gianluigi Ferrari
A novel batch-based group key management protocol applied to the Internet of Things Journal Article
In: Ad Hoc Networks, 11 (8), pp. 2724 - 2737, 2013, ISSN: 1570-8705.
@article{Veltri20132724,
title = {A novel batch-based group key management protocol applied to the Internet of Things},
author = {Luca Veltri and Simone Cirani and Stefano Busanelli and Gianluigi Ferrari},
url = {http://www.sciencedirect.com/science/article/pii/S1570870513001091},
issn = {1570-8705},
year = {2013},
date = {2013-01-01},
journal = {Ad Hoc Networks},
volume = {11},
number = {8},
pages = {2724 - 2737},
abstract = {Many applications for ad hoc networks are based on a point-to-multipoint (multicast) communication paradigm, where a single source sends common data to many receivers, or, inversely, on a multipoint-to-point communication paradigm, where multiple sources send data to a single receiver. In such scenarios, communication can be secured by adopting a common secret key, denoted as “group key”, shared by multiple communication endpoints. In this work, we propose a novel centralized approach to efficiently distribute and manage a group key in generic ad hoc networks and Internet of Things, while reducing the computational overhead and network traffic due to group membership changes caused by users’ joins and leaves. In particular, the proposed protocol takes advantage of two possible leave strategies: (i) at a pre-determined time selected when the user joins the group or (ii) at an unpredictable time, as in the case of membership revocation. The proposed protocol is applied to two following relevant scenarios: (i) secure data aggregation in Internet of Things (IoT) and (ii) Vehicle-to-Vehicle (V2V) communications in Vehicular Ad hoc Networks (VANETs).},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Many applications for ad hoc networks are based on a point-to-multipoint (multicast) communication paradigm, where a single source sends common data to many receivers, or, inversely, on a multipoint-to-point communication paradigm, where multiple sources send data to a single receiver. In such scenarios, communication can be secured by adopting a common secret key, denoted as “group key”, shared by multiple communication endpoints. In this work, we propose a novel centralized approach to efficiently distribute and manage a group key in generic ad hoc networks and Internet of Things, while reducing the computational overhead and network traffic due to group membership changes caused by users’ joins and leaves. In particular, the proposed protocol takes advantage of two possible leave strategies: (i) at a pre-determined time selected when the user joins the group or (ii) at an unpredictable time, as in the case of membership revocation. The proposed protocol is applied to two following relevant scenarios: (i) secure data aggregation in Internet of Things (IoT) and (ii) Vehicle-to-Vehicle (V2V) communications in Vehicular Ad hoc Networks (VANETs).
Luca Veltri; Simone Cirani; Gianluigi Ferrari; Stefano Busanelli
Batch-based group key management with shared key derivation in the Internet of Things Journal Article
In: pp. 1688-1693, 2013.
@article{VeCiFeBu2013_2,
title = {Batch-based group key management with shared key derivation in the Internet of Things},
author = {Luca Veltri and Simone Cirani and Gianluigi Ferrari and Stefano Busanelli},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6583810&tag=1},
year = {2013},
date = {2013-01-01},
booktitle = {Wireless Communications and Mobile Computing Conference (IWCMC), 2013 9th International},
pages = {1688-1693},
abstract = {Many applications for ad-hoc networks are based on a multicast communication paradigm, where a single source sends common data to many receivers. In these contexts, it is possible to efficiently secure the multicast communications by leveraging on a common secret key, denoted as “group key”, shared by multiple users. In this paper, we propose a novel centralized approach that efficiently addresses the problem of deriving and managing a group key in generic ad-hoc networks and Internet of Things (IoT) scenarios, reducing the computation overhead due to group membership changes caused by user's joins and leaves. In particular, the proposed method takes advantage of the assumption of two possible leave strategies: (i) at a pre-determined time interval selected when the member joins the group or (ii) at any unpredictable time interval, as in the case of membership revocation.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Many applications for ad-hoc networks are based on a multicast communication paradigm, where a single source sends common data to many receivers. In these contexts, it is possible to efficiently secure the multicast communications by leveraging on a common secret key, denoted as “group key”, shared by multiple users. In this paper, we propose a novel centralized approach that efficiently addresses the problem of deriving and managing a group key in generic ad-hoc networks and Internet of Things (IoT) scenarios, reducing the computation overhead due to group membership changes caused by user's joins and leaves. In particular, the proposed method takes advantage of the assumption of two possible leave strategies: (i) at a pre-determined time interval selected when the member joins the group or (ii) at any unpredictable time interval, as in the case of membership revocation.
Stefano Busanelli; Filippo Rebecchi; Marco Picone; Nicola Iotti; Gianluigi Ferrari
Cross-Network Information Dissemination in VANETs: Experimental Results from a Smartphone-based Testbed Journal Article
In: Future Internet, 5 (3), pp. 398-428, 2013.
@article{dgtXNetad2013,
title = {Cross-Network Information Dissemination in VANETs: Experimental Results from a Smartphone-based Testbed},
author = {Stefano Busanelli and Filippo Rebecchi and Marco Picone and Nicola Iotti and Gianluigi Ferrari},
year = {2013},
date = {2013-01-01},
journal = {Future Internet},
volume = {5},
number = {3},
pages = {398-428},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Marco Martalò; Chiara Buratti; Gianluigi Ferrari; Roberto Verdone
Clustered IEEE 802.15.4 Sensor Networks with Data Aggregation: Energy Consumption and Probability of Error Journal Article
In: IEEE Wireless Comm. Letters, 2 (1), pp. 70-73, 2013.
@article{MaBuFeVe13,
title = {Clustered IEEE 802.15.4 Sensor Networks with Data Aggregation: Energy Consumption and Probability of Error},
author = {Marco Martalò and Chiara Buratti and Gianluigi Ferrari and Roberto Verdone},
year = {2013},
date = {2013-01-01},
journal = {IEEE Wireless Comm. Letters},
volume = {2},
number = {1},
pages = {70-73},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Marco Martalò; Gianluigi Ferrari; Claudio Malavenda
Low-Complexity Hybrid Time-Frequency Audio Signal Pattern Detection Journal Article
In: IEEE Sensors Journal, 13 (2), pp. 501-509, 2013.
@article{MaFeMa13,
title = {Low-Complexity Hybrid Time-Frequency Audio Signal Pattern Detection},
author = {Marco Martalò and Gianluigi Ferrari and Claudio Malavenda},
year = {2013},
date = {2013-01-01},
journal = {IEEE Sensors Journal},
volume = {13},
number = {2},
pages = {501-509},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Paolo Medagliani; Gianluigi Ferrari; Vincent Gay; Jérémie Leguay
Cross-layer design and analysis of WSN-based mobile target detection systems Journal Article
In: Elsevier Ad Hoc Networks, Special Issue on ``Cross-Layer Design in Ad Hoc and Sensor Networks'', 2013.
@article{MeFeGaLe12,
title = {Cross-layer design and analysis of WSN-based mobile target detection systems},
author = {Paolo Medagliani and Gianluigi Ferrari and Vincent Gay and Jérémie Leguay},
year = {2013},
date = {2013-01-01},
journal = {Elsevier Ad Hoc Networks, Special Issue on ``Cross-Layer Design in Ad Hoc and Sensor Networks''},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2012
Dario Salvi; Marco Picone; Maria Teresa Arredondo; Maria F. Cabrera-Umpierrez; Angel Esteban; Sebastian Steger; Tito Poli
Merging Person-Specific Bio-Markers for Predicting Oral Cancer recurrence through an Ontology Journal Article
In: IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 99 , pp. 216–220, 2012.
@article{neomarkJournalTBME2012,
title = {Merging Person-Specific Bio-Markers for Predicting Oral Cancer recurrence through an Ontology},
author = {Dario Salvi and Marco Picone and Maria Teresa Arredondo and Maria F. Cabrera-Umpierrez and Angel Esteban and Sebastian Steger and Tito Poli},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6293868&tag=1},
year = {2012},
date = {2012-01-01},
journal = {IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING},
volume = {99},
pages = {216--220},
abstract = {One of the major problems related to cancer treatment is its recurrence. Without knowing in advance how likely the cancer will relapse, clinical practice usually recommends adjuvant treatments that have strong side-effects. A way to optimize treatments is to predict the recurrence probability by analysing a set of bio-markers. The NeoMark European project has identified a set of preliminary bio-markers for the case of oral cancer by collecting a large series of data from genomic, imaging and clinical evidences. This heterogeneous set of data needs a proper representation in order to be stored, computed and communicated efficiently. Ontologies are often considered the proper mean to integrate biomedical data, for their high level of formality and for the need of interoperable, universally accepted, models. This paper presents the NeoMark system and how an ontology has been designed to integrate all its heterogeneous data. The system has been validated in a pilot which data will populate the ontology and will be made public for further research.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
One of the major problems related to cancer treatment is its recurrence. Without knowing in advance how likely the cancer will relapse, clinical practice usually recommends adjuvant treatments that have strong side-effects. A way to optimize treatments is to predict the recurrence probability by analysing a set of bio-markers. The NeoMark European project has identified a set of preliminary bio-markers for the case of oral cancer by collecting a large series of data from genomic, imaging and clinical evidences. This heterogeneous set of data needs a proper representation in order to be stored, computed and communicated efficiently. Ontologies are often considered the proper mean to integrate biomedical data, for their high level of formality and for the need of interoperable, universally accepted, models. This paper presents the NeoMark system and how an ontology has been designed to integrate all its heterogeneous data. The system has been validated in a pilot which data will populate the ontology and will be made public for further research.