Earticle

초록

영어

Sensor data exhibit strong correlation in both space and time. Many algorithms have been proposed to utilize these characteristics. However, each sensor just utilizes neighboring information, because its communication range is restrained. Information that includes the distribution and characteristics of whole sensor data provides other opportunities to enhance the compression technique. In this paper, we propose an orthogonal approach for compressing sensor readings based on a novel feedback technique. That is, the base station or a super node generates Huffman code for the compression of sensor data and broadcasts it into sensor networks as Huffman code. All sensor nodes that have received the information compress their sensor data and transmit them to the base station. We call this approach as feedback-diffusion and this modified Huffman coding as sHuffman coding. In order to show the superiority of our approach, we compare it with the existing data compression algorithms in terms of the lifetime of the sensor network. As a result, our experimental results show that the whole network lifetime was prolonged by about 30%.

목차

Abstract
 1. Introduction
 2. Related Work
  2.1. Sensor Data Compression Algorithm
  2.2. Huffman Coding
 3. Feedback-Diffusion Algorithm
 4. Huffman Coding in WSNs
  4.1. Creation of Huffman Code
  4.2. Sensor Data Compression Utilizing a Feedback
  4.3 Update Huffman Code
 5. Performance Evaluation
  5.1 Experiment Environment
  5.2 Network Traffic
  5.3. Network Lifetime
 6. Conclusions
 Acknowledgements
 References

키워드

저자

• Byoungyup Lee [ Paichai University ]
• Myoungho Yeo [ Chungbuk National University, Korea ]
• Kyungsoo Bok [ Chungbuk National University, Korea ]
• Jaesoo Yoo [ Chungbuk National University, Korea ] Corresponding Author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605