The Reseach on Distributed Data Storage Method Based on Composite Threshold

Abstract

This paper presents a distributed data storage method based on sleep scheduling to resolve the problems of network imbalance and storage hot spots problems. Compared with existing methods, our distributed data storage method has the following advantages: First, take node’s residual energy into account when decides the order of storage node. This can avoid choosing the lower residual energy node blindly which closer to the hash location as frequently data storage node. Second, set a scheduling factor p for each node, which determined by its storage space and residual energy. As the scheduling factor p changes, sensor node switching the state between suspended state and active state, this can turn off the redundant node and reduce unnecessary energy consumption. Finally, multi group analysis of simulate experiments results show that compared to other data storage method the distributed data storage method based on composite threshold have obviously advantages on the sides of overall energy consumption, data storage capacity, the number of failure node and data quality, thus have a significant effect on reducing energy consumption and extending network life cycle.