Journal of Computer Research and Development (计算机研究与发展) 2009/2009:12 PP.2093-2100

A Secure and Efficient Data Survival Strategy in Unattended Wireless Sensor Network

Unattended wireless sensor network (UWSN) have attracted more and more interests in recent research community. In UWSN, sensed data are stored locally for a long term, instead of being sent to a central sink immediately. It is motivated by certain applications that only digest information (e.g. historical information), not real-time data, are of interest. The digest information can be extracted on-site upon request and real-time data are avoided to be forwarded away in order to mitigate the communication overhead. As UWSN always confront many security risks and adversaries that result in node's random failure or node compromise, such stored data need to be survived to the collecting moment. Therefore, the security problem arises: how to maximize the data survival till the data are collected, or to maximize the valid data upon data retrieval. In particular, the involved defense strategies need to be efficient due to the resource constraints. A family of strategies is proposed to improve the data survival in this paper. Some observations are proofed such as location entropy based hopping limited data moving strategy. The proposed advanced strategy makes use of such observation to achieve efficiency and takes the advantage of computational secret sharing to achieve both fault tolerance and compromise resilience. The analysis of the performance and security are also presented extensively.

Key words:data survival,distributed storage,data security,wireless sensor network,secret sharing

ReleaseDate:2014-07-21 15:00:27

[1] Li Jianzhong, Gao Hong. Survey on sensor network research [J]. Journal of Computer Research and Development, 2008, 45(1): 1-15 (in Chinese)(李建中, 高宏. 无线传感器网络的研究进展 [J]. 计算机研究与发展, 2008, 45(1): 1-15)

[2] Pietro R D, Mancini L V, Soriente C, et al. Catch me (if you can): Data survival in unattended sensor networks [C]//Proc of IEEE PerCom'08. Piscataway, NJ: IEEE, 2008: 185-194

[3] Zeinalipour-Yazti D, Kalogeraki V, Gunopulos D, et al. Towards in-situ data storage in sensor databases [C]//LNCS 3746: Proc of the 10th Panhellenic Conf on Informatics (PCI'05). Berlin: Springer, 2005: 36-46

[4] Diao Y, Ganesan D, Mathur G, et al. Rethinking data management for storage-centric sensor networks[C/OL]//Proc of CIDR'07. [2009-08-08].

[5] Girao J, Westhoff D, Mykletun E, et al. Tinypeds: Tiny persistent encrypted data storage in asynchronous wireless sensor network [J]. Ad Hoc Networks, 2007, 5(7): 1073-1089

[6] Ganesan D, Greenstein B, Perelyubskiy D, et al. Multi-resolution storage and search in sensor networks [J]. ACM Trans on Storage, 2005, 1(3): 277-315

[7] Nath S, Kansai A. Flashdb: Dynamic self-tuning database for nand flash [C]//Proc of IPSN'07. Piscataway, NJ: IEEE, 2007: 410-419

[8] Banerjee A, Mitra A, Najjar W, et al. Rise co-s: High performance sensor storage and co-processing architecture [C]//Proc of SECON'05. Piscataway, NJ: IEEE, 2005: 1-12

[9] Osrovsky R, Yung M. How to withstand mobile virus attacks [C]//Proc of PODC'91. New York: ACM, 1991: 51-59

[10] Mathur G, Desnoyers P, Ganesan D, et al. Ultra-low power data storage for sensor networks [C]//Proc of IPSN'06. Piscataway, NJ: IEEE, 2006: 374-381

[11] Perrig A, Stankovic J A, Wagner D. Security in wireless sensor network [J]. Communication of ACM, 2004, 47(6): 53-57

[12] Zhang Q, Yu T, Ning P. A framework for identifying compromised nodes in wireless sensor network [J]. ACM Trans in Information and Systems Security (TISSEC), 2008, 12: 1-37

[13] Shamir A. How to share a secret [J]. Communications of the ACM, 1979, 22(11): 612-613

[14] Reed S, Solomon G. Polynomial codes over certain finite field [J]. SIAM Journal on Applied Mathematics, 1960, 8(2): 300-304

[15] Krawczyk H. Secret sharing made short [C]//Proc of CRYPTO'93. Berlin: Springer, 1993: 136-146