Giuseppe Campobello

Parallel CRC realization

This paper presents a theoretical result in the context of realizing high-speed hardware for parallel CRC checksums. Starting from the serial implementation widely reported in the literature, we have identified a recursive formula from which our parallel implementation is derived. In comparison with previous works, the new scheme is faster and more compact and is independent of the technology used in its realization. In our solution, the number of bits processed in parallel can be different from the degree of the polynomial generator. Last, we have also developed high-level parametric codes that are capable of generating the circuits autonomously when only the polynomial is given.

Improving energy saving and reliability in wireless sensor networks using a simple CRT-based packet-forwarding solution

This paper deals with a novel forwarding scheme for wireless sensor networks aimed at combining low computational complexity and high performance in terms of energy efficiency and reliability. The proposed approach relies on a packet-splitting algorithm based on the Chinese Remainder Theorem (CRT) and is characterized by a simple modular division between integers. An analytical model for estimating the energy efficiency of the scheme is presented, and several practical issues such as the effect of unreliable channels, topology changes, and MAC overhead are discussed. The results obtained show that the proposed algorithm outperforms traditional approaches in terms of power saving, simplicity, and fair distribution of energy consumption among all nodes in the network.

GALS Networks on Chip: A New Solution for Asynchronous Delay-Insensitive Links

In this paper a cost effective solution for asynchronous delay-insensitive on-chip communication is proposed. Our solution is based on the Berger coding scheme and allows to obtain a very low wire overhead. For instance, the results of our evaluation show that a 64-bit link can be built paying a wire overhead of 10% and 30 equivalent two-input gates per wire. As a general rule, when the number of bits to be transmitted increases, the wire overhead decreases and the gate overhead remains almost the same

A novel reliable and energy-saving forwarding technique for wireless sensor networks

The main aim of this paper is to generalize and improve a recently proposed forwarding technique based on the Chinese Remainder Theorem (CRT). The proposed technique outperforms more traditional approaches in terms of both energy efficiency and fair distribution of energy consumption, and requires very few changes to the commonly used forwarding schemes for its implementation. In particular, in this paper it is shown how to apply the CRT-based forwarding method on a realistic wireless network where unreliable erasure channels are considered together with topological changes. Furthermore, an analytical model for the novel forwarding technique has been derived and the trade-off between reliability and energy saving has been investigated.

On the Use of Chinese Remainder Theorem for Energy Saving in Wireless Sensor Networks

In this paper we discuss the use of the Chinese Remainder Theorem (CRT) for a novel forwarding scheme in wireless sensor networks. The proposed approach is characterized by a computationally simple packet splitting procedure able to reduce the energy needed for transmission and increase the network lifetime accordingly. Simulation results show that the proposed algorithm outperforms more traditional approaches in terms of both energy efficiency and fair distribution of energy consumption among all nodes in the network.

Applying the Chinese Remainder Theorem to Data Aggregation in Wireless Sensor Networks

In WSNs low complexity techniques for reducing the amount of bits flowing throughout the network are needed to decrease the bandwidth waste and increase the network lifetime. To this purpose, spatial correlation due to the high density of the deployed devices can be exploited. In this paper we propose a novel in-network aggregation technique based on the Chinese Remainder Theorem (CRT), which exploits the well known advantages of the source coding while using a distributed approach with no need of coordination among network nodes. Also, an appropriate network coding mechanism based on the CRT is combined to source coding to enable lossless transmission from the sources to the sink.

LBGS: a smart approach for very large data sets vector quantization

Abstract In this paper, LBGS, a new parallel/distributed technique for Vector Quantization is presented. It derives from the well known LBG algorithm and has been designed for very complex problems where both large data sets and large codebooks are involved. Several heuristics have been introduced to make it suitable for implementation on parallel/distributed hardware. These lead to a slight deterioration of the quantization error with respect to the serial version but a large improvement in computing efficiency.

Comparison of local lossless compression algorithms for Wireless Sensor Networks

Compression algorithms are deeply used in Wireless Sensor Networks (WSNs) for data aggregation in order to reduce energy consumption and therefore increasing network lifetime. In this paper we compare several lossless compression algorithms by means of real-world data. Moreover we present a simple and effective lossless compression algorithm that is able to outperform existing solutions and that, considering its inherent low complexity and memory requirements, is well suited for WSNs.

Data Gathering Techniques for Wireless Sensor Networks

We study the problem of data gathering in wireless sensor networks and compare several approaches belonging to different research fields; in particular, signal processing, compressive sensing, information theory, and networking related data gathering techniques are investigated. Specifically, we derived a simple analytical model able to predict the energy efficiency and reliability of different data gathering techniques. Moreover, we carry out simulations to validate our model and to compare the effectiveness of the above schemes by systematically sampling the parameter space (i.e., number of nodes, transmission range, and sparsity). Our simulation and analytical results show that there is no best data gathering technique for all possible applications and that the trade-off between energy consumptions and reliability could drive the choice of the data gathering technique to be used. In this context, our model could be a useful tool.

Trade-offs between energy saving and reliability in low duty cycle wireless sensor networks using a packet splitting forwarding technique

One of the challenging topics and design constraints in Wireless Sensor Networks (WSNs) is the reduction of energy consumption because, in most application scenarios, replacement of power resources in sensor devices might be unfeasible. In order to minimize the power consumption, some nodes can be put to sleep during idle times and wake up only when needed. Although it seems the best way to limit the consumption of energy, other performance parameters such as network reliability have to be considered. In a recent paper, we introduced a new forwarding algorithm for WSNs based on a simple splitting procedure able to increase the network lifetime. The forwarding technique is based on the Chinese Remainder Theorem and exhibits very good results in terms of energy efficiency and complexity. In this paper, we intend to investigate a trade-off between energy efficiency and reliability of the proposed forwarding scheme when duty-cycling techniques are considered too.