Earticle

초록

영어

In this paper, regarding to the online data compression issue of wireless sensor networks, a disconnected segmented linear compression algorithm GDPLA is proposed. The algorithm uses the least number of disconnected segments to approximate describing the original time series under the condition of the error limit ε be guaranteed. The algorithm GDPLA is an optimal algorithm from the number of segments generated. In addition, the GDPLA algorithm requires linear run-time only, and the linear coefficient is 6, which makes it suitable for resource-constrained wireless sensor networks. Finally, the experiments on two real data sets show that the compression rate of our algorithm is obviously superior to other algorithms.

목차

Abstract
 1. Introduction
 2. Design of GDPLA Algorithm
 3. Analysis of GDPLA Algorithm
  3.1. Space Complexity
  3.2. Time Complexity
  3.3. Optimality
 4. Experimental Results
  4.1. Contrast Results of Compression Ratio
  4.2. Contrast Results of Average Error
  4.3. Contrast Results of Processing Time
 5. Conclusion
 References

키워드

저자

• Jinsong Zhang [ Qiqihar University, Qiqihar, China ]
• Hua Zhang [ Qiqihar University, Qiqihar, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605