An Efficient Lossless Compression Algorithm for Tiny Nodes of Monitoring Wireless Sensor Networks

被引:108
|
作者
Marcelloni, Francesco [1 ]
Vecchio, Massimo [2 ]
机构
[1] Univ Pisa, Dipartimento Ingn Informaz, I-56122 Pisa, Italy
[2] IMT Lucca Inst Adv Studies, I-55100 Lucca, Italy
来源
COMPUTER JOURNAL | 2009年 / 52卷 / 08期
关键词
wireless sensor networks; data compression; power saving; ARCHITECTURE; AGGREGATION; INFORMATION;
D O I
10.1093/comjnl/bxp035
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Energy is a primary constraint in the design and deployment of wireless sensor networks (WSNs), since sensor nodes are typically powered by batteries with a limited capacity. Energy efficiency is generally achieved by reducing radio communication, for instance, limiting transmission/reception of data. Data compression can be a valuable tool in this direction. The limited resources available in a sensor node demand, however, the development of specifically designed compression algorithms. In this paper, we propose a simple lossless entropy compression (LEC) algorithm which can be implemented in a few lines of code, requires very low computational power, compresses data on the fly and uses a very small dictionary whose size is determined by the resolution of the analog-to-digital converter. We have evaluated the effectiveness of LEC by compressing four temperature and relative humidity data sets collected by real WSNs, and solar radiation, seismic and ECG data sets. We have obtained compression ratios up to 70.81% and 62.08% for temperature and relative humidity data sets, respectively, and of the order of 70% for the other data sets. Then, we have shown that LEC outperforms two specifically designed compression algorithms for WSNs. Finally, we have compared LEC with gzip, bzip2, rar, classical Huffman and arithmetic encodings.
引用
收藏
页码:969 / 987
页数:19
相关论文
共 50 条
  • [41] An Efficient Localization Algorithm in Wireless Sensor Networks
    Shen, Shikai
    Yang, Bin
    Qian, Kaiguo
    Jiang, Xiaohong
    PROCEEDINGS OF 2015 THIRD INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2015, : 291 - 294
  • [42] A simple algorithm for data compression in wireless sensor networks
    Marcelloni, Francesco
    Vecchio, Massimo
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (06) : 411 - 413
  • [43] Simple, secure, and lightweight mechanism for mutual authentication of nodes in tiny wireless sensor networks
    Jain, Usha
    Hussain, Muzzammil
    Kakarla, Jagadeesh
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2020, 33 (09)
  • [44] An efficient heuristic for selecting active nodes in wireless sensor networks
    Delicato, Flavia
    Protti, Fabio
    Pirmez, Luci
    de Rezende, Jose Ferreira
    COMPUTER NETWORKS, 2006, 50 (18) : 3701 - 3720
  • [45] Determination of adjacent nodes for power efficient wireless sensor networks
    1600, Institute of Electrical Engineers of Japan (134):
  • [46] SAWR: Scheduling Algorithm for Wireless Sensor Networks with Rendezvous Nodes
    Jukuntla, Amar
    Pendam, Keerthi
    Arjun, N.
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2015, : 600 - 603
  • [47] Hybrid localization algorithm of mobile nodes in wireless sensor networks
    Chen Y.
    Chen J.
    Wang Z.
    Ren T.
    Journal of Communications, 2016, 11 (04): : 358 - 364
  • [48] An effective algorithm for guiding mobile nodes in wireless sensor networks
    Song, Guangming
    Zhuang, Wei
    Wei, Zhigang
    Song, Aiguo
    2007 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS, VOLS 1 AND 2, 2007, : 279 - 282
  • [49] A localization algorithm in wireless sensor networks with mobile anchor nodes
    Shi, Ting-Jun
    Sang, Xia
    Xu, Li-Jie
    Yin, Xin-Chun
    Ruan Jian Xue Bao/Journal of Software, 2009, 20 (SUPPL. 1): : 278 - 285
  • [50] Localization algorithm based on optimal nodes for wireless sensor networks
    Shen, Xuan-Jing
    Li, Cheng-Yue
    Wang, Shuo
    Qian, Qing-Ji
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2011, 41 (SUPPL. 1): : 208 - 214