A Tree-based Hierarchy Data Storage Framework in a Pervasive Space

Authors

  • Zhuzhong Qian
  • Ilsun You
  • Youyou Lu
  • Sanglu Lu

Keywords:

Host selection, distributed storage, pervasive space

Abstract

Context data is important information for catching the behaviors of applications in a pervasive space. To effectively store huge amount of data, tree-like layered storage architecture is proposed, where the leaf nodes collect data from sensing devices. In order to integrate data from mobile devices, the related leaf nodes that get data from the same device should upload and store the data to the host node. This paper presents a deep study of the data storage problem and proposes a global algorithm GHS and an online algorithm DHS to dynamically select the host node, which reduces the communication cost significantly. This paper also gives the theoretical and experimental analysis of these algorithms, which shows both GHS and DHS are correct and effective.

Downloads

Download data is not yet available.

Author Biographies

Zhuzhong Qian

State Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, China

Ilsun You

School of Information Science, Korean Bible University, South Korea

Youyou Lu

State Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, China

Sanglu Lu

State Key Laboratory for Novel Software Technology, Department of Computer Science and Technology, Nanjing University, Nanjing, China

Downloads

Published

2012-05-02

How to Cite

Qian, Z., You, I., Lu, Y., & Lu, S. (2012). A Tree-based Hierarchy Data Storage Framework in a Pervasive Space. Computing and Informatics, 30(6), 1181–1199. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/811

Issue

Section

Special Section Articles