期刊文献+

Distributed data storage solution under sink failures in wireless sensor networks

Distributed data storage solution under sink failures in wireless sensor networks
原文传递
导出
摘要 In challenging environment, sensory data must be stored inside the network in case of sink failures, we need to redistribute overflowing data items from the depleted storage source nodes to sensor nodes with available storage space and residual energy. We design a distributed energy efficient data storage algorithm named distributed data preservation with priority (Dzp2). This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. DZP2 can effectively realize data redistribution by using cooperative communication among sensor nodes. In order to solve the redistribution contention problem, we introduce the concept of data priority, which can avoid contention consultations between source nodes and reduce energy consumption. Finally, we verify the performance of the proposed algorithm by both theory and simulations. We demonstrate that D2p2's performance is close to the optimal centralized algorithm in terms of energy consumption and shows superiority in terms of data preservation time. In challenging environment, sensory data must be stored inside the network in case of sink failures, we need to redistribute overflowing data items from the depleted storage source nodes to sensor nodes with available storage space and residual energy. We design a distributed energy efficient data storage algorithm named distributed data preservation with priority (Dzp2). This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. DZP2 can effectively realize data redistribution by using cooperative communication among sensor nodes. In order to solve the redistribution contention problem, we introduce the concept of data priority, which can avoid contention consultations between source nodes and reduce energy consumption. Finally, we verify the performance of the proposed algorithm by both theory and simulations. We demonstrate that D2p2's performance is close to the optimal centralized algorithm in terms of energy consumption and shows superiority in terms of data preservation time.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2017年第2期72-82,102,共12页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China (61401234,61271234) the Priority Academic Program Development Project of Jiangsu Higher Education Institutions Jiangsu Government Scholarship for Overseas Studies
关键词 data storage data redistribution and retrieval redistribution contention data priority sink failures data storage, data redistribution and retrieval, redistribution contention, data priority, sink failures
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部