earticle

논문검색

Research on Data Transmission Security Technology of Wireless Sensor Networks

초록

영어

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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.