2013
Report
Unknown
ENGAGED - Roadmap templates to support the cluster members in the assembly of raw roadmaps
Braun A., Chessa S., Fullaondo Zabala A.
The deliverable D4.1 - Roadmap templates to support the cluster members in the assembly of raw roadmaps is the first deliverable of WP4. The purpose of this document is to describe the procedure and provide supporting documents that will be used in creating the ENGAGED roadmaps as final results of the work package. The document first gives an overview of the rationale in deciding on the structure of the ENGAGED roadmap, using best practices by third party sources. In the following the roadmap template is described in detail. The next part summarises the Action Plans of the different Action Groups within EIP AHA. The input of those to the ENGAGED roadmap is discussed in detail and potential topics for the ENGAGED workshops are suggested. The next part of the document outlines templates for both workshop agenda and minutes that are specifically tailored to simplify the collection of the inputs relevant to the future roadmaps. Help is provided to the minute takers on filling out the templates, by giving detailed examples on all relevant parts and sections. The document concludes with a résumé and two annexes providing two blank templates for structural roadmap and workshop summary, respectively.Source: Project report, ENGAGED, Deliverable D4.1, 2013
Project(s): ENGAGED
Braun A., Chessa S., Fullaondo Zabala A.
The deliverable D4.1 - Roadmap templates to support the cluster members in the assembly of raw roadmaps is the first deliverable of WP4. The purpose of this document is to describe the procedure and provide supporting documents that will be used in creating the ENGAGED roadmaps as final results of the work package. The document first gives an overview of the rationale in deciding on the structure of the ENGAGED roadmap, using best practices by third party sources. In the following the roadmap template is described in detail. The next part summarises the Action Plans of the different Action Groups within EIP AHA. The input of those to the ENGAGED roadmap is discussed in detail and potential topics for the ENGAGED workshops are suggested. The next part of the document outlines templates for both workshop agenda and minutes that are specifically tailored to simplify the collection of the inputs relevant to the future roadmaps. Help is provided to the minute takers on filling out the templates, by giving detailed examples on all relevant parts and sections. The document concludes with a résumé and two annexes providing two blank templates for structural roadmap and workshop summary, respectively.Source: Project report, ENGAGED, Deliverable D4.1, 2013
Project(s): ENGAGED
See at: CNR ExploRA
2001
Journal article
Unknown
Operative diagnosis of graph-based systems with multiple faults
Chessa S., Santi P.
The problem of multiple faults diagnosis in safety-critical systems is considered. Error propagation between system components is modeled as a directed graph, where the errors propagate instantaneously along the edges. Some of the system components are equipped with alarms, which ring when abnormal conditions are detected. A diagnosis algorithm identifies the set of potential failure sources based on the set of ringing alarms. This paper introduces the D-FAULTS algorithm, which diagnoses the system when at most two nodes can be failure sources at any time. The concept of equential diagnosis is also introduced, to deal with an unknown number of faults. Sequential diagnosis is aimed at locating the smallest set of nodes containing at least one fault. Using this approach, a faulty system can be restored to normal condition by executing repeatedly the diagnosis and repair phases. To this purpose, we introduce the sequential diagnosis algorithm S-DIAG with optimal time complexitySource: IEEE transactions on systems, man and cybernetics. Part A. Systems and humans 31 (2001): 112–119.
Chessa S., Santi P.
The problem of multiple faults diagnosis in safety-critical systems is considered. Error propagation between system components is modeled as a directed graph, where the errors propagate instantaneously along the edges. Some of the system components are equipped with alarms, which ring when abnormal conditions are detected. A diagnosis algorithm identifies the set of potential failure sources based on the set of ringing alarms. This paper introduces the D-FAULTS algorithm, which diagnoses the system when at most two nodes can be failure sources at any time. The concept of equential diagnosis is also introduced, to deal with an unknown number of faults. Sequential diagnosis is aimed at locating the smallest set of nodes containing at least one fault. Using this approach, a faulty system can be restored to normal condition by executing repeatedly the diagnosis and repair phases. To this purpose, we introduce the sequential diagnosis algorithm S-DIAG with optimal time complexitySource: IEEE transactions on systems, man and cybernetics. Part A. Systems and humans 31 (2001): 112–119.
See at: CNR ExploRA
2010
Journal article
Unknown
The effects of weather on the life time of wireless sensor networks using FSO/RF communication
Chessa S., Leitgeb E., Nadeem F., Zaman S.
The increased interest in long lasting wireless sensor networks motivates to use Free Space Optics (FSO) link along with radio frequency (RF) link for communication. Earlier results show that RF/FSO wireless sensor networks have life time twice as long as RF only wireless sensor networks. However, for terrestrial applications, the effect of weather conditions such as fog, rain or snow on optical wireless communication link is major concern, that should be taken into account in the performance analysis. In this paper, life time performance of hybrid wireless sensor networks is compared to wireless sensor networks using RF only for terrestrial applications and weather effects of fog, rain and snow. The results show that combined hybrid network with three threshold scheme can provide efficient power consumption of 6548 seconds, 2118 seconds and 360 seconds for measured fog, snow and rain events respectively resulting in approximately twice of the life time with only RF link.Source: Radioengineering (Praha) 19 (2010): 262–270.
Chessa S., Leitgeb E., Nadeem F., Zaman S.
The increased interest in long lasting wireless sensor networks motivates to use Free Space Optics (FSO) link along with radio frequency (RF) link for communication. Earlier results show that RF/FSO wireless sensor networks have life time twice as long as RF only wireless sensor networks. However, for terrestrial applications, the effect of weather conditions such as fog, rain or snow on optical wireless communication link is major concern, that should be taken into account in the performance analysis. In this paper, life time performance of hybrid wireless sensor networks is compared to wireless sensor networks using RF only for terrestrial applications and weather effects of fog, rain and snow. The results show that combined hybrid network with three threshold scheme can provide efficient power consumption of 6548 seconds, 2118 seconds and 360 seconds for measured fog, snow and rain events respectively resulting in approximately twice of the life time with only RF link.Source: Radioengineering (Praha) 19 (2010): 262–270.
See at: CNR ExploRA
2006
Journal article
Unknown
Bounds on hop distance in greedy routing approach in wireless ad hoc networks
De S., Caruso A., Chaira T., Chessa S.
Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.Source: International journal of wireless and mobile computing (Print) 14 (2006): 131–140.
De S., Caruso A., Chaira T., Chessa S.
Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.Source: International journal of wireless and mobile computing (Print) 14 (2006): 131–140.
See at: CNR ExploRA
2009
Journal article
Unknown
A model with applications for data survivability in critical infrastructures
Albano M., Chessa S., Di Pietro R.
Information assurance in Critical Infrastructures (CIs) is a problem of great practical interest and a challeng- ing research field. Within this scope we focus on the problem of monitoring of CIs. In particular, we propose a model to max- imize the amount of monitoring-related data that can survive after a portion of the CI suffers a disaster. The proposed model addresses a specific CI-oil pipelines-, and it is built on the hypothesis that the monitoring data are provided by means of wireless sensor networks. In particular, we consider a CI where the sensors are deployed along the pipelines and execute a com- mon monitoring task with a given sampling rate. In order to ensure data availability the sensors replicate the sensed data to their peers. This model poses a few unique challenges, calling for the optimization of competing system parameters. For in- stance, a higher sampling rate would allow, on one hand, a finer- grain analysis of the situation while on the other hand would consume more energy. High volume of data replication would allow a higher chance for data to survive a disaster-hence help- ing in forensics or further disaster prevention-, while it would cost more in both energetic and bandwidth terms. We derive an analytical model for this scenario. This model can be processed to derive the optimal sampling rate that maximizes the amount of information collected by the monitoring infras- tructure, while satisfying the complex and competing system parameters. Further, simulations are performed on both reg- ular (tree-based) and random generated oil pipelines and show the wide applicability of our model, as well as providing a few non-intuitive results on the behaviour of the competing system parameters. Finally, we develop a case study on a real-world oil pipeline. Results support the quality of the proposed model and its flexibility.Source: Journal of information assurance and security (Online) 6 (2009): 629–639.
Albano M., Chessa S., Di Pietro R.
Information assurance in Critical Infrastructures (CIs) is a problem of great practical interest and a challeng- ing research field. Within this scope we focus on the problem of monitoring of CIs. In particular, we propose a model to max- imize the amount of monitoring-related data that can survive after a portion of the CI suffers a disaster. The proposed model addresses a specific CI-oil pipelines-, and it is built on the hypothesis that the monitoring data are provided by means of wireless sensor networks. In particular, we consider a CI where the sensors are deployed along the pipelines and execute a com- mon monitoring task with a given sampling rate. In order to ensure data availability the sensors replicate the sensed data to their peers. This model poses a few unique challenges, calling for the optimization of competing system parameters. For in- stance, a higher sampling rate would allow, on one hand, a finer- grain analysis of the situation while on the other hand would consume more energy. High volume of data replication would allow a higher chance for data to survive a disaster-hence help- ing in forensics or further disaster prevention-, while it would cost more in both energetic and bandwidth terms. We derive an analytical model for this scenario. This model can be processed to derive the optimal sampling rate that maximizes the amount of information collected by the monitoring infras- tructure, while satisfying the complex and competing system parameters. Further, simulations are performed on both reg- ular (tree-based) and random generated oil pipelines and show the wide applicability of our model, as well as providing a few non-intuitive results on the behaviour of the competing system parameters. Finally, we develop a case study on a real-world oil pipeline. Results support the quality of the proposed model and its flexibility.Source: Journal of information assurance and security (Online) 6 (2009): 629–639.
See at: CNR ExploRA
2006
Conference article
Unknown
The localized vehicular multicast middleware : a framework for ad hoc inter-vehicles multicast communications
Barsotti F., Caruso A., Chessa S.
This paper defines a novel semantic for multicast in vehicular ad hoc networks (VANETs) and it defines a middleware, the Localized Vehicular Multicast Middleware (LVMM) that enables minimum cost, source-based multicast communications in VANETs. The middleware provides support to find vehicles suitable to sustain multicast communications, to maintain multicast groups, and to execute a multicast routing protocol, the Vehicular Multicast Routing Protocol (VMRP), that delivers messages of multicast applications to all the recipients utilizing a loop-free, minimum cost path from each source to all the recipients. LVMM does not require a vehicle to know all other members: only knowledge of directly reachable nodes is required to perform the source-based routSource: WSEAS International Conference on Communications, pp. 130–136, Athens, Greece, 10-15/07/2006
Barsotti F., Caruso A., Chessa S.
This paper defines a novel semantic for multicast in vehicular ad hoc networks (VANETs) and it defines a middleware, the Localized Vehicular Multicast Middleware (LVMM) that enables minimum cost, source-based multicast communications in VANETs. The middleware provides support to find vehicles suitable to sustain multicast communications, to maintain multicast groups, and to execute a multicast routing protocol, the Vehicular Multicast Routing Protocol (VMRP), that delivers messages of multicast applications to all the recipients utilizing a loop-free, minimum cost path from each source to all the recipients. LVMM does not require a vehicle to know all other members: only knowledge of directly reachable nodes is required to perform the source-based routSource: WSEAS International Conference on Communications, pp. 130–136, Athens, Greece, 10-15/07/2006
See at: CNR ExploRA
2006
Conference article
Unknown
A distributed emulator for interplanetary remote sensing
Baronti P., Chessa S., De Cola T., Franck L., Marchese M.
Monitoring systems based on wireless sensor networks are now becoming a reality, and their use in remote planets monitoring applications to support future space explorations has also been envisioned. These kinds of applications introduce new issues related to the communication between the remotely deployed wireless sensor network and the Earth station due to the specific constraints and traffic generated by the sensor network and to the long delays and errors introduced by the interplanetary links. In this paper we introduce an emulator for interplanetary remote sensing which in being developed in the framework of the EU SatNEx project, and we present some preliminary results on the use of TCP and DTN in the interplanetary links.Source: Advanced Satellite Mobile Systems Conference (ASMS 2006), Herrsching am Ammersee, 29-31/05/2006
Baronti P., Chessa S., De Cola T., Franck L., Marchese M.
Monitoring systems based on wireless sensor networks are now becoming a reality, and their use in remote planets monitoring applications to support future space explorations has also been envisioned. These kinds of applications introduce new issues related to the communication between the remotely deployed wireless sensor network and the Earth station due to the specific constraints and traffic generated by the sensor network and to the long delays and errors introduced by the interplanetary links. In this paper we introduce an emulator for interplanetary remote sensing which in being developed in the framework of the EU SatNEx project, and we present some preliminary results on the use of TCP and DTN in the interplanetary links.Source: Advanced Satellite Mobile Systems Conference (ASMS 2006), Herrsching am Ammersee, 29-31/05/2006
See at: CNR ExploRA
2001
Conference article
Unknown
Comparison-based system-level fault diagnosis in Ad Hoc networks
Chessa S., Santi P.
The problem of identifying faulty mobiles in ad-hoc networks is considered. Current diagnostic models were designed for wired networks, thus they do not take advantage of the shared nature of communication typical of ad-hoc networks. In this paper we introduce a new comparison-based diagnostic model based on the one-tomany communication paradigm. Two implementations of the model are presented. In the first implementation, we assume that the network topology does not change during diagnosis, and we show that both hard and soft faults can be easily detected. Based on this implementation, a diagnosis protocol is presented. The evaluation of the communication and time complexity of the protocol indicates that efficient diagnosis protocols for ad-hoc networks based on our model can be designed. In the second implementation we allow the system topology to change during diagnosis. As expected, the ability of diagnosing faults under this scenario is significantly reduced with respect to the stationary case.Source: Symposium on Reliable and Distributed Systems - IEEE SRDS 2001, pp. 257–266, New Orleans, 28-31 October 200
Chessa S., Santi P.
The problem of identifying faulty mobiles in ad-hoc networks is considered. Current diagnostic models were designed for wired networks, thus they do not take advantage of the shared nature of communication typical of ad-hoc networks. In this paper we introduce a new comparison-based diagnostic model based on the one-tomany communication paradigm. Two implementations of the model are presented. In the first implementation, we assume that the network topology does not change during diagnosis, and we show that both hard and soft faults can be easily detected. Based on this implementation, a diagnosis protocol is presented. The evaluation of the communication and time complexity of the protocol indicates that efficient diagnosis protocols for ad-hoc networks based on our model can be designed. In the second implementation we allow the system topology to change during diagnosis. As expected, the ability of diagnosing faults under this scenario is significantly reduced with respect to the stationary case.Source: Symposium on Reliable and Distributed Systems - IEEE SRDS 2001, pp. 257–266, New Orleans, 28-31 October 200
See at: CNR ExploRA
2007
Conference article
Unknown
Q-NIGHT: adding QoS to data centric storage in non-uniform sensor networks
Albano M., Chessa S., Nidito F., Pelagatti S.
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to fail- ure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent ap- proaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data. They result in a great unbal- ance in the storage usage in each sensor, even when sen- sors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q- NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy sim- ilar to the rejection method to build a hash function which scatters data approximately with the same distribution of sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors dis- tributions on terms of both protocol costs and load balance between sensors.Source: Mobile Data Management. MDM'07, pp. 166–173, Mannheim, Germany, 7-11 May 2007
Albano M., Chessa S., Nidito F., Pelagatti S.
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to fail- ure and/or disconnections, but it can also provide efficient access to sensed data to multiple sink nodes. Recent ap- proaches to data storage rely on Geographic Hash Tables for efficient data storage and retrieval. These approaches however do not support different QoS levels for different classes of data as the programmer has no control on the level of redundancy of data. They result in a great unbal- ance in the storage usage in each sensor, even when sen- sors are uniformly distributed. This may cause serious data losses, waste energy and shorten the overall lifetime of the sensornet. In this paper, we propose a novel protocol, Q- NiGHT, which (1) provides a direct control on the level of QoS in the data dependability, and (2) uses a strategy sim- ilar to the rejection method to build a hash function which scatters data approximately with the same distribution of sensors. The benefits of Q-NiGHT are assessed through a detailed simulation experiment, also discussed in the paper. Results show its good performance on different sensors dis- tributions on terms of both protocol costs and load balance between sensors.Source: Mobile Data Management. MDM'07, pp. 166–173, Mannheim, Germany, 7-11 May 2007
See at: CNR ExploRA
2007
Conference article
Restricted
Virtual naming and geographic routing on wireless sensor networks
Filardi N., Caruso A., Chessa S.
We consider the problem of routing with guaranteed de- livery in wireless sensor networks where physical locations of the sensors are not known. We propose a naming proto- col which defines a 2-dimensional coordinate system and a routing protocol (Ibrid) which ensures guaranteed delivery of packets. We show by means of simulation that in realis- tic settings where the network includes voids and obstacles, Ibrid finds routess hortest than those obtained with existing geographic routing algorithms over physical coordinates.Source: IEEE Symposium on Computers and Communications. ISCC'07, pp. 609–614, Aveiro, Portogallo, 1-4 July 2007
DOI: 10.1109/iscc.2007.4381526
Metrics:
Filardi N., Caruso A., Chessa S.
We consider the problem of routing with guaranteed de- livery in wireless sensor networks where physical locations of the sensors are not known. We propose a naming proto- col which defines a 2-dimensional coordinate system and a routing protocol (Ibrid) which ensures guaranteed delivery of packets. We show by means of simulation that in realis- tic settings where the network includes voids and obstacles, Ibrid finds routess hortest than those obtained with existing geographic routing algorithms over physical coordinates.Source: IEEE Symposium on Computers and Communications. ISCC'07, pp. 609–614, Aveiro, Portogallo, 1-4 July 2007
DOI: 10.1109/iscc.2007.4381526
Metrics:
See at:
doi.org 
| iris.unisalento.it | CNR ExploRA
2009
Conference article
Restricted
Publish/subscribe in wireless sensor networks based on data centric storage
Albano M., Chessa S.
The rapid development of Wireless Sensor Networks (WSN) technologies gave rise to the need for abstraction mecha- nisms that can simplify the data management tasks. Under this respect, the publish/subscribe paradigms play an im- portant role since they can be used to abstract the WSN in terms that are closer to applicative needs. On the other hand, Data Centric Storage systems (DCS) can provide a low-level support to the implementation of publish/subscribe systems in WSN. In this paper we consider different im- plementations of publish/subscribe systems, based either on DCS or basic network primitives and we compare the result- ing approaches in terms of functionalities and performance.Source: 1st International Workshop on Context-Aware Middleware and Services, pp. 37–42, Dublin, Ireland, 16 June 2009
Albano M., Chessa S.
The rapid development of Wireless Sensor Networks (WSN) technologies gave rise to the need for abstraction mecha- nisms that can simplify the data management tasks. Under this respect, the publish/subscribe paradigms play an im- portant role since they can be used to abstract the WSN in terms that are closer to applicative needs. On the other hand, Data Centric Storage systems (DCS) can provide a low-level support to the implementation of publish/subscribe systems in WSN. In this paper we consider different im- plementations of publish/subscribe systems, based either on DCS or basic network primitives and we compare the result- ing approaches in terms of functionalities and performance.Source: 1st International Workshop on Context-Aware Middleware and Services, pp. 37–42, Dublin, Ireland, 16 June 2009
See at:
dl.acm.org | CNR ExploRA
2009
Conference article
Open Access
Comparing the life time of hybrid network using optical wireless and RF links to only RF link for terrestrial wireless sensor networks
Nadeem F., Leitgeb E., Saleem Awan M., Chessa S.
The increased interest in long lasting wireless sensor networks motivates to use Free Space Optics (FSO) link along with radio frequency (RF) link for communication. Earlier results show that RF/FSO wireless sensor networks has life time twice as long as RF only wireless sensor networks. However, for terrestrial applications, the effect of weather conditions such as rain or snow on optical wireless communication link is major concern, that should be taken into account in the performance analysis. In this paper, life time performance of hybrid wireless sensor networks is compared to wireless sensor networks using RF only for terrestrial applications and weather effects of rain and snow.Source: Fifth International Conference on Wireless and Mobile Communications, pp. 134–139, Cannes, Francia, 23-29 August 2009
DOI: 10.1109/icwmc.2009.29
Metrics:
Nadeem F., Leitgeb E., Saleem Awan M., Chessa S.
The increased interest in long lasting wireless sensor networks motivates to use Free Space Optics (FSO) link along with radio frequency (RF) link for communication. Earlier results show that RF/FSO wireless sensor networks has life time twice as long as RF only wireless sensor networks. However, for terrestrial applications, the effect of weather conditions such as rain or snow on optical wireless communication link is major concern, that should be taken into account in the performance analysis. In this paper, life time performance of hybrid wireless sensor networks is compared to wireless sensor networks using RF only for terrestrial applications and weather effects of rain and snow.Source: Fifth International Conference on Wireless and Mobile Communications, pp. 134–139, Cannes, Francia, 23-29 August 2009
DOI: 10.1109/icwmc.2009.29
Metrics:
See at:
ieeexplore.ieee.org 
| doi.org | CNR ExploRA
2009
Conference article
Restricted
Distributed erasure coding in data centric storage for wireless sensor networks
Albano M., Chessa S.
In-network storage of data in wireless sensor net- works contributes to reduce the communications inside the network and to favor data aggregation. In this paper, we consider the use of erasure codes in combination to in-network storage. We provide an abstract model of in-network storage to show how erasure codes can be used, and we discuss how this can be achieved in two cases of study. We also define a model aimed at evaluating the probability of correct data encoding and decoding, and we exploit this model and simulations to show how the parameters of the erasure code and the network should be configured in order to achieve correct data coding and decoding with high probability even in presence of sensors faults.Source: IEEE International Symposium on Computers and Communications, pp. 22–27, Sousse, Tunisia, 5-8 luglio 2009
DOI: 10.1109/iscc.2009.5202250
Metrics:
Albano M., Chessa S.
In-network storage of data in wireless sensor net- works contributes to reduce the communications inside the network and to favor data aggregation. In this paper, we consider the use of erasure codes in combination to in-network storage. We provide an abstract model of in-network storage to show how erasure codes can be used, and we discuss how this can be achieved in two cases of study. We also define a model aimed at evaluating the probability of correct data encoding and decoding, and we exploit this model and simulations to show how the parameters of the erasure code and the network should be configured in order to achieve correct data coding and decoding with high probability even in presence of sensors faults.Source: IEEE International Symposium on Computers and Communications, pp. 22–27, Sousse, Tunisia, 5-8 luglio 2009
DOI: 10.1109/iscc.2009.5202250
Metrics:
See at:
doi.org | CNR ExploRA
2006
Contribution to conference
Open Access
Geographic hash tables with QoS in non uniform sensor networks
Albano M., Chessa S., Nidito F., Susanna P.
Storage of sensed data in wireless sensor networks is essential in those cases where the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sinks. Recent approaches to data storage rely on geographic hash tables for efficient data storage and retrieval. These approaches however fail to provide a given QoS in the storage redundancy (and thus in data dependability), and they result in a great storage unbalance, even if the sensors are uniformly distributed. In this paper, we propose a new approach which can provide a given QoS in the data dependability, and which features a better load balance even with non uniform distribution of the sensors.Source: ACM Mobihoc. Poster session., Firenze, Italy, 26/05/2006
Albano M., Chessa S., Nidito F., Susanna P.
Storage of sensed data in wireless sensor networks is essential in those cases where the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access to sensed data to multiple sinks. Recent approaches to data storage rely on geographic hash tables for efficient data storage and retrieval. These approaches however fail to provide a given QoS in the storage redundancy (and thus in data dependability), and they result in a great storage unbalance, even if the sensors are uniformly distributed. In this paper, we propose a new approach which can provide a given QoS in the data dependability, and which features a better load balance even with non uniform distribution of the sensors.Source: ACM Mobihoc. Poster session., Firenze, Italy, 26/05/2006
See at:
ISTI Repository | CNR ExploRA
2006
Software
Unknown
MaD-WiSe Server
Chessa S., Baronti P.
In the framework of the Mad-Wise development, it has been implemeted a PC-side server for interfacing a set of MaD-WiSe GUIs with the MaD-WiSe-based wireless sensor network.
Chessa S., Baronti P.
In the framework of the Mad-Wise development, it has been implemeted a PC-side server for interfacing a set of MaD-WiSe GUIs with the MaD-WiSe-based wireless sensor network.
See at: CNR ExploRA
2006
Software
Unknown
MaD-WiSe (Data Management in Wireless Sensor networks
Chessa S., Baronti P.
MaD-WiSe (Management of Data in Wireless Sensor networks) is a joint project of the laboratories of Wireless Networks and Multimedia Networked Information Systems of the ISTI - CNR and the Computer Science Department of the University of Pisa. It aims at the integration of database and wireless sensor networks technologies, to let the processing of complex queries in sensor networks, even when the network is disconnected from the sink nodes. This requirement has several implications on the different layers of the sensor network architecture. The MaD-WiSe project investigates these implications at different layers: -at the communication level, addressing routing related problems; -at the data-management level, investigating issues related to database technologies and to their adaptability to the management of streams of sensed data; -at a middleware level, by designing a support the data management level compatible with the sensors constraints.
Chessa S., Baronti P.
MaD-WiSe (Management of Data in Wireless Sensor networks) is a joint project of the laboratories of Wireless Networks and Multimedia Networked Information Systems of the ISTI - CNR and the Computer Science Department of the University of Pisa. It aims at the integration of database and wireless sensor networks technologies, to let the processing of complex queries in sensor networks, even when the network is disconnected from the sink nodes. This requirement has several implications on the different layers of the sensor network architecture. The MaD-WiSe project investigates these implications at different layers: -at the communication level, addressing routing related problems; -at the data-management level, investigating issues related to database technologies and to their adaptability to the management of streams of sensed data; -at a middleware level, by designing a support the data management level compatible with the sensors constraints.
See at: CNR ExploRA
2009
Conference article
Restricted
Relation between gradients and geographic distances in dense sensor networks with greedy message forwarding
Caruso A., Chessa S., De S.
The distributed gradient protocol is a common building block to perform several tasks in a wireless sensor network. The gradient calculates the minimum hop-distances between each sensor and a specified set of anchor sensors. This calculation is performed using a distributed greedy forwarding of messages in the network. Several virtual localization protocols use gradients to compute the virtual coordinates of the sensors. The quality of these coordinate systems depends on the relation between the value of the gradient and the real geographic distances between sensors. In this paper a formal proof of such relation is provided in the case of dense sensor networks with homogeneous sensor communication range r. The minimum-hop distances between a sensor and an achor is bounded to be in a range defined by two geographic distances. The size of this range decreases with increasing density of the network and it is equal to the maximum resolution (the communication range r) when the density is high enough.Source: 4th International Conference on Systems and Networks Communications, pp. 236–241, Porto, Portugal, 20-25 September 2009
DOI: 10.1109/icsnc-2009-82
Metrics:
Caruso A., Chessa S., De S.
The distributed gradient protocol is a common building block to perform several tasks in a wireless sensor network. The gradient calculates the minimum hop-distances between each sensor and a specified set of anchor sensors. This calculation is performed using a distributed greedy forwarding of messages in the network. Several virtual localization protocols use gradients to compute the virtual coordinates of the sensors. The quality of these coordinate systems depends on the relation between the value of the gradient and the real geographic distances between sensors. In this paper a formal proof of such relation is provided in the case of dense sensor networks with homogeneous sensor communication range r. The minimum-hop distances between a sensor and an achor is bounded to be in a range defined by two geographic distances. The size of this range decreases with increasing density of the network and it is equal to the maximum resolution (the communication range r) when the density is high enough.Source: 4th International Conference on Systems and Networks Communications, pp. 236–241, Porto, Portugal, 20-25 September 2009
DOI: 10.1109/icsnc-2009-82
Metrics:
See at:
ieeexplore.ieee.org | CNR ExploRA
2010
Conference article
Restricted
Data centric storage in ZigBeeWireless sensor networks
Albano M., Chessa S.
Data Centric Storage is a recent paradigm that results more efficient than other storage techniques (such as local or external storage) in Wireless Sensor Networks (WSN). In this work we consider the use of this storage paradigm in WSN based on the ZigBee standard. In particular we propose a novel protocol (Z-DaSt) that exploits the routing and addressing features of ZigBee (that are based on routing trees) to distribute data to the sensors. The protocol also features Quality of Service in the storage of data by enabling the user to specify the amount of redundancy to be used in the storage of each datum. This work evaluates Z-DaSt by analysis and simulation, and compares its performance to DCS-GHT. The simulation results show that Z-DaSt is a viable alternative to DCS-GHT for practical cases, in particular for low to moderate network densities.Source: IEEE International Symposium on Computers and Communications, pp. 330–335, Riccione, Italy, 22-25 June 2010
DOI: 10.1109/iscc.2010.5546753
Metrics:
Albano M., Chessa S.
Data Centric Storage is a recent paradigm that results more efficient than other storage techniques (such as local or external storage) in Wireless Sensor Networks (WSN). In this work we consider the use of this storage paradigm in WSN based on the ZigBee standard. In particular we propose a novel protocol (Z-DaSt) that exploits the routing and addressing features of ZigBee (that are based on routing trees) to distribute data to the sensors. The protocol also features Quality of Service in the storage of data by enabling the user to specify the amount of redundancy to be used in the storage of each datum. This work evaluates Z-DaSt by analysis and simulation, and compares its performance to DCS-GHT. The simulation results show that Z-DaSt is a viable alternative to DCS-GHT for practical cases, in particular for low to moderate network densities.Source: IEEE International Symposium on Computers and Communications, pp. 330–335, Riccione, Italy, 22-25 June 2010
DOI: 10.1109/iscc.2010.5546753
Metrics:
See at:
doi.org | CNR ExploRA
2003
Report
Open Access
Sperimentazione di applicazioni DS2 su MAMEt single-hop IEEE 802.11
Chessa S.
This report presents the results of Task 1 - Workpackage 5 (Protocolli per rete MANET:Sperimentazione di una MANET single hop IEEE802.11) of the IS-MANET project. More specifically it reports the experimental results of the tests on a single hop wireless network using the DS2 software for file storage in MANETs.Source: ISTI Technical reports, 2003
Chessa S.
This report presents the results of Task 1 - Workpackage 5 (Protocolli per rete MANET:Sperimentazione di una MANET single hop IEEE802.11) of the IS-MANET project. More specifically it reports the experimental results of the tests on a single hop wireless network using the DS2 software for file storage in MANETs.Source: ISTI Technical reports, 2003
See at:
ISTI Repository | CNR ExploRA
2004
Report
Open Access
Bounds on Hop Distance in Greedy Routing Approach in Wireless Ad Hoc Networks
De S., Caruso A., Chiara T., Chessa S.
Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.Source: ISTI Technical reports, pp.131–140, 2004
De S., Caruso A., Chiara T., Chessa S.
Wireless ad hoc networks are generally characterised by random node locations and multi-hop routes. A quantitative knowledge of the relation between hop count and Euclidean distance could provide a better understanding of important network parameters such as end-to-end delay, power consumption along the route, and node localisation. In this paper, we present an analytic approach to capture the statistics on hop count for a given source-to-destination Euclidean distance in a greedy routing approach. We also show that, for a given hop count, the bounds on Euclidean distance can be computed from the distribution characteristics of per-hop progress.Source: ISTI Technical reports, pp.131–140, 2004
See at:
ISTI Repository | CNR ExploRA