A scalable and robust key pre-distribution scheme with network coding for sensor data storage

详细信息    查看全文

• 作者：Rongfei Zeng^a ; ^{zengrf@csnet1.cs.tsinghua.edu.cn"" rel=""nofollow} ; Yixin Jiang^a ; ^{yxjiang@csnet1.cs.tsinghua.edu.cn"" rel=""nofollow} ; Chuang Lin^a ; ^{clin@csnet1.cs.tsinghua.edu.cn"" rel=""nofollow} ; Yanfei Fan^b ; ^{yfan@bbcr.uwaterloo.ca"" rel=""nofollow} ; Xuemin (Sherman) Shen^b ; ^{xshen@bbcr.waterloo.ca"" rel=""nofollow} [Author vitae]
• 关键词：Distributed sensor data storage ; Key pre-distribution ; Network coding ; Matrix decomposition
• 刊名：Computer Networks
• 出版年：2011
• 出版时间：14 July 2011
• 年：2011
• 卷：55
• 期：10
• 页码：2534-2544
• 全文大小：676 K

文摘

In this paper, we propose a scalable and robust key pre-distribution scheme based on network coding and matrix decomposition for distributed sensor data storage. As a promising information dissemination technique, network coding is suitable for the key information exchange due to the reduced number of transmissions and the enhanced robustness. Matrix decomposition can help to exchange key information without any central nodes and location knowledge. Our scheme uses LU matrix decomposition to decompose a shared key into two vectors R and C. The vector R is held privately by the sensor, while the other vector C is protected and disseminated using network coding. The combination of network coding and matrix decomposition enhances the scalability, improves the communication performance, and increases the robustness for sensor data storage networks. Extensive theoretical analysis and simulative results both demonstrate the efficacy and efficiency of the proposed key pre-distribution scheme in distributed sensor data storage.