The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2012 vol.23)
pp: 1819-1830
Rongfei Zeng , Tsinghua University, Beijing
Yixin Jiang , EPRI, China Southern Power Grid Co. Ltd., Guangzhou
Chuang Lin , Tsinghua University, Beijing
Yanfei Fan , University of Waterloo, Waterloo
Xuemin Shen , University of Waterloo, Waterloo
ABSTRACT
Recently, distributed data storage has gained increasing popularity for reliable access to data through redundancy spread over unreliable nodes in wireless sensor networks (WSNs). However, without any protection to guarantee the data integrity and availability, the reliable data storage cannot be achieved since sensor nodes are prone to various failures, and attackers may compromise sensor nodes to pollute or destroy the stored data. Therefore, how to design a robust sensor data storage scheme to efficiently guarantee the data integrity and availability becomes a critical issue for distributed sensor storage networks. In this paper, we propose a distributed fault/intrusion-tolerant data storage scheme based on network coding and homomorphic fingerprinting in volatile WSNs environments. For high data availability, the proposed scheme uses network coding to encode the source data and distribute encoded fragments with original data pieces. With secure, compact, and efficient homomorphic fingerprinting, our scheme can fast locate incorrect fragments and then initialize data maintenance. Extensive theoretical analysis and simulative results demonstrate the efficacy and efficiency of the proposed scheme.
INDEX TERMS
Memory, Distributed databases, Availability, Network coding, Maintenance engineering, Wireless sensor networks, Encoding, data maintenance, Distributed sensor data storage, network coding, homomorphic fingerprinting
CITATION
Rongfei Zeng, Yixin Jiang, Chuang Lin, Yanfei Fan, Xuemin Shen, "A Distributed Fault/Intrusion-Tolerant Sensor Data Storage Scheme Based on Network Coding and Homomorphic Fingerprinting", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 10, pp. 1819-1830, Oct. 2012, doi:10.1109/TPDS.2011.294
REFERENCES
[1] Q. Wang, K. Ren, W. Lou, and Y. Zhang, "Dependable and Secure Sensor Data Storage With Dynamic Integrity and Assurance," Proc. IEEE INFOCOM, 2009.
[2] A.G. Dimakis and K. Ramchandran, "Network Coding for Distributed Storage in Wireless Networks," Networked Sensing Information and Control, Signals and Communication Series, V. Saligrama, Springer, 2008.
[3] A.G. Dimakis, P.B. Godfrey, M.J. Wainwright, and K. Ramchandran, "Network Coding for Distributed Storage System," Proc. IEEE INFOCOM, 2007.
[4] R. Rodrigues and B. Liskov, "High Availability in DHTs: Erasure Coding vs. Replication," Peer-to-Peer Systems, 2005.
[5] A. Kamra and V. Misra, "Growth Codes: Maximizing Sensor Network Data Persistence," Proc. ACM SIGCOMM, 2006.
[6] Y. Lin, B. Liang, and B. Li, "Data Persisitence in Large-Scale Sensor Networks with Decentralized Fountain Codes," Proc. IEEE INFOCOM, 2007.
[7] M. Luby, "LT Codes," Proc. 43rd Symp. Foundations of Computer Science (FOCS '02), 2002.
[8] J. Hendricks, G.R. Ganger, and M.K. Reiter, "Verifying Distributed Erasure-Coded Data," Proc. 26th Ann. ACM Symp. Principles of Distributed Computing (PODC '07), 2007.
[9] A.Z. Broder, "Some Applications of Rabin's Fingerprinting Method," Sequences II: Methods in Comm., Security, and Computer Science, pp. 143-152, 1993.
[10] I.S. Reed and G. Solomon, "Rolynomial Codes Over Certain Finite Fields," J. Soc. for Industrial and Applied Math., vol. 8, pp. 300-304, 1960.
[11] Y. Lin, B. Liang, and B. Li, "Priority Random Linear Codes in Distributed Storage Systems," Proc. IEEE Conf. Distributed Computing Systems (ICDCS), 2007.
[12] J. Girao, D. Westhoff, E. Mykletun, and T. Araki, "Tinypeds: Tiny Persistent Encrypted Data Storage in Asynchronous Wireless Sensor Networks," Elsevier Ad Hoc Networks, vol. 5, no. 7, 1073-1089, 2007.
[13] R.D. Pietro, L.V. Mancini, C. Soriente, A. Spognardi, and G. Tsudik, "Catch Me (If You Can): Data Survival in Unattended Sensor Networks," Proc. IEEE Sixth Ann. Int'l Conf. Pervasive Computing and Comm., 2008.
[14] D. Ma and G. Tsudik, "Forward-Secure Sequential Aggregate Authentication," Proc. IEEE Symp. Security and Privacy, 2007.
[15] S. Chessa, R.D. Pietro, and P. Maestrini, "Dependable and Secure Data Storage in Wireless Ad Hoc Networks: an Assessment of DS2," Proc. WONS, 2004.
[16] W. Zhang, H. Song, S. Zhu, and G. Cao, "Least Privilege and Privilege Deprivation: Towards Tolerating Mobile Sink Compromises in Wireless Sensor Networks," Proc. ACM MobiHoc, 2005.
[17] A. Subbiah and D.M. Blough, "An Approach for Fault Tolerant and Secure Data Storage in Collaborative Work Environments," Proc. Int'l Workshop Storage Security and Survivability, 2005.
[18] N. Subramanian, C. Yang, and W. Zhang, "Securing Distributed Data Storage and Retrieval in Sensor Networks," Proc. IEEE Fifth Int'l Conf. Pervasive Computing and Comm. (PERCOM '07), 2007.
[19] M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
[20] C. Fragouli, J.Y. Boudec, and J. Widmer, "Network Coding: an Instant Primer," ACM SIGCOMM Comm. Rev., vol. 36, 2006.
[21] P.A. Chou, Y. Wu, "Network Coding for the Internet and Wireless Networks," Proc. IEEE Signal Processing Magazine, 2007.
[22] D. Wang, Q. Zhang, and J. Liu, "Partial Network Coding: Theory and Application for Continuous Sensor Data Collection," Proc. IEEE 14th Int'l Workshop Quality of Service (IWQoS), 2006.
[23] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[24] Z. Li, B. Li, and L.C. Lau, "On Achieving Maximum Multicast throughput in Undirected Networks," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2467-2485, June 2006.
[25] Y. Wu, P. Chou, and S. Kung, "Minimum-Energy Multicast in Mobile Ad Hoc Networks Using Network Coding," IEEE Trans. Comm., vol. 53, no. 11, pp. 1906-1918, Nov. 2005.
[26] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An Efficient Signature-Based Scheme for Securing Network Coding against Pollution Attacks," Proc. IEEE INFOCOM, 2008.
[27] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An Efficient Scheme for Securing XOR Network Coding Against Pollution Attacks," Proc. IEEE INFOCOM, 2009.
[28] S. Agrawal and D. Boneh, "Homomorphic MACs: MAC-Based Integrity for Network Coding," Proc. Seventh Int'l Conf. Applied Cryptography and Network Security (ACNS '09), 2009.
[29] P. Zhang, Y. Jiang, C. Lin, H. Yao, A. Wasef, and X. Shen, "Padding for Orthogonality: Efficient Subspace Authentication for Network Coding," Proc. IEEE INFOCOM, 2011.
[30] Y. Jiang, H. Zhu, M. Shi, X. Shen, and C. Lin, "An Efficient Dynamic-Identity Based Signature Scheme for Secure Network Coding," Elsevier Ad Hoc Networks, vol. 54, no. 1, pp. 28-40, 2010.
[31] R. Zeng, Y. Jiang, C. Lin, Y. Fan, and X. Shen, "A Scalable and Robust Key Pre-Distribution Scheme with Network Coding for Sensor Data Storage Networks," ELSEVIER Computer Networks, vol. 55, no. 10, pp. 2534-2544, 2011.
[32] M. Luby, M. Mizenmacher, M.A. Ahokrollahi, and D. Spielman, "Efficient Erasure Correcting Codes," IEEE Trans. Informantion Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
[33] A. Yun, J. Cheon, and Y. Kim, "On Homomorphic Signatures for Network Coding," IEEE Trans. Computers, vol. 59, no. 9, pp. 1295-1296, Sept. 2010.
[34] Y. Fan, Y. Jiang, H. Zhu, and X. Shen, "An Efficient Privacy-Preserving Scheme Against Traffic Analysis Attacks in Network Coding," Proc. IEEE INFOCOM, 2009.
[35] P. Zhang, Y. Jiang, C. Lin, Y. Fan, and X. Shen, "P-Coding: Secure Network Coding against Eavesdropping Attacks," Proc. IEEE INFOCOM, 2010.
46 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool