By Topic

A Dynamic Host Selection Algorithm for Layered Data Storage Architecture in a Pervasive Space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhuzhong Qian ; State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China ; Ilsun You ; Youyou Lu ; Sanglu Lu

Context data is important information for the behaviors of the applications in a pervasive space. To effectively restore huge amount of data, tree-liked layered storage architecture are proposed, where the leaf nodes collect the data from the sensing devices located in its domain. However, the sensing devices may be moving among different domains. In order to integrate the data from the same device, related leaf nodes should upload and store the data to a certain up-layer node, called host node. This paper presents a deep study of the data storage problem and proposes an online algorithm DHS to dynamically select the host node, which reduces the communication cost significantly. We prove the correctness of the algorithm theoretically. The experiment results also show that DHS is correct and effective.

Published in:

Complex, Intelligent and Software Intensive Systems (CISIS), 2010 International Conference on

Date of Conference:

15-18 Feb. 2010