中国邮电高校学报(英文) ›› 2017, Vol. 24 ›› Issue (2): 72-82.doi: 10.1016/S1005-8885(17)60201-2

• Wireless • 上一篇    下一篇

Distributed data storage solution under sink failures in wireless sensor networks

王珺1,易琼2,王悦3,贾莹莹2   

  1. 1. 南京邮电大学通信与信息系统
    2.
    3. 南京邮电大学
  • 收稿日期:2016-09-14 修回日期:2017-04-07 出版日期:2017-04-30 发布日期:2017-04-30
  • 通讯作者: 王悦 E-mail:980941416@qq.com
  • 基金资助:
    中国国家自然科学基金;江苏高等教育机构和江苏政府留学奖学金PAPD项目

Distributed data storage solution under sink failures in wireless sensor networks

  • Received:2016-09-14 Revised:2017-04-07 Online:2017-04-30 Published:2017-04-30
  • Contact: Yue WANG E-mail:980941416@qq.com
  • Supported by:
    the National Natural Science Foundation of China (61401234, 61271234), the Priority Academic Program Development Project of Jiangsu Higher Education Institutions and Jiangsu Government Scholarship for Overseas Studies.

摘要: 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 (D2P2). This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. D2P2 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.

关键词: data storage, data redistribution and retrieval, redistribution contention, data priority, sink failures

Abstract: 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 (D2P2). This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. D2P2 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.

Key words: data storage, data redistribution and retrieval, redistribution contention, data priority, sink failures