A two-objective evolutionary approach to design lossy compression algorithms for tiny nodes of wireless sensor networks

被引:4
作者
Marcelloni F. [1 ]
Vecchio M. [2 ]
机构
[1] Dipartimento di Ingegneria dell'Informazione, University of Pisa, 56122 Pisa
[2] Signal Theory and Communications Department, University of Vigo, Vigo
关键词
Data compression; Energy efficiency; Multi-objective evolutionary algorithms; Signal processing; Wireless sensor networks;
D O I
10.1007/s12065-010-0044-x
中图分类号
学科分类号
摘要
Since tiny nodes of a wireless sensor network (WSN) are typically powered by batteries with, due to miniaturization and costs, a limited capacity, with the aim of extending the lifetime of WSNs and making the exploitation of WSNs appealing, a lot of research has been devoted to save energy. Although a number of factors contribute to power consumption, radio communication has been generally considered its main cause and thus most of the techniques proposed for energy saving have mainly focused on limiting transmission/reception of data, for instance, through data compression. As sensor nodes are equipped with limited computational and storage resources, enabling compression requires to develop purposely-designed algorithms. To this aim, we propose an approach to generate lossy compressors to be deployed on single nodes based on a differential pulse code modulation scheme with quantization of the differences between consecutive samples. The quantization levels and thresholds, which allow achieving different trade-offs between compression performance and information loss, are determined by a two-objective evolutionary algorithm. We tested our approach on four datasets collected by real WSN deployments. We show that the lossy compressors generated by our approach can achieve significant compression ratios despite negligible reconstruction errors and outperform LTC, a lossy compression algorithm purposely designed to be embedded in sensor nodes. © 2010 Springer-Verlag.
引用
收藏
页码:137 / 153
页数:16
相关论文
共 45 条
  • [21] LZO homepage, (2010)
  • [22] Marcelloni F., Vecchio M., A simple algorithm for data compression in wireless sensor networks, IEEE Commun Lett, 12, 6, pp. 411-413, (2008)
  • [23] Marcelloni F., Vecchio M., An efficient lossless compression algorithm for tiny nodes of monitoring wireless sensor networks, Comput J, 52, 8, pp. 969-987, (2009)
  • [24] Marcelloni F., Vecchio M., A multi-objective evolutionary approach to data compression in wireless sensor networks, The 9th international conference on intelligent systems design and applications, pp. 402-407, (2009)
  • [25] Massey F., The Kolmogorov-Smirnov test for goodness of fit, J Am Stat Assoc, 46, 253, pp. 68-78, (1951)
  • [26] Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs, (1994)
  • [27] O'Neal J., Differential pulse-code modulation (PCM) with entropy coding, IEEE Trans Inf Theory, 22, 2, pp. 169-174, (1976)
  • [28] Pradhan S., Kusuma J., Ramchandran K., Distributed compression in a dense microsensor network, IEEE Signal Process Mag, 19, 2, pp. 51-60, (2002)
  • [29] Rebollo-Monedero D., Quantization and transforms for distributed source coding, (2007)
  • [30] Sadler C.M., Martonosi M., Data compression algorithms for energy-constrained devices in delay tolerant networks, Proceedings of the 4th international conference on embedded networked sensor systems (SenSys '06), pp. 265-278, (2006)