earticle

논문검색

An Efficient and Robust Data Integrity Verification Algorithm Based on Context Sensitive

원문정보

초록

영어

There exist two key problems about data aggregation that should be thoroughly explored - algorithm design in networking layer, and algorithm design in application layer. Those two problems should be subtlety tackled in termers of high efficiency and robustness. Therefore, the former one requires the survivability and highly reliable design at networking layer, the latter one usually asks for high efficiency and robustness at application layer. Moreover, the optimization of algorithms is also considered for further enhancement. The integrity check is a key requirement for optimization. The context-aware and cross-layer design is applied in the optimization. A dynamic fragment odd-even parity checking code is proposed, and a context-aware aggregative integrity check code is proposed.

목차

Abstract
 1. Introduction
 2. Context Sensitive Efficient Robust Data Integrity Verification Sensitive
  2.1 Modeling of Data Aggregation Integrity Verification Optimization Problem
  2.2 The Integrity Verification Based on DFOEP
  2.3 Performance Analysis
 3. Conclusion
 References

저자정보

  • Feng Xie Naval University of engineering, Wuhan, Hubei, 430033, China
  • Hu Chen Naval University of engineering, Wuhan, Hubei, 430033, China

참고문헌

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

    함께 이용한 논문

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

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