Solving Secure Problems for Wireless Sensor Networks Using Clustering and OKS

Article Preview

Abstract:

A secure scheme for wireless sensor network is presented through dividing sensing area into clusters and using the overlap key sharing (OKS) concept in this paper. The two-dimensional sensing square is divided into a number of small squares called cells, four of which consist of a cluster called logical group. The overlap key sharing protocol creates long bit clusters as the key cluster pools and distributes a sub-group to store every sensor as the key cluster. Analysis and comparison demonstrate this scheme enhances the WSN security, realizes the flexile secure grades for WSNs, and has good network connectivity.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

230-236

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Tmote Sky wireless sensor module. http: /www. moteiv. com/ products/docs/ tmote-sky-datasheet. pdf.

Google Scholar

[2] A. Perrig, R. Szewczyk, J. D. Tygar, V. Wen, D. E. Culler, SPINS: security protocols for sensor networks, Wireless Network, Vol. 8, pp.521-534, (2002).

DOI: 10.1023/a:1016598314198

Google Scholar

[3] R. Brooks, P. Ramanathan, A. Sayeed. Distributed target classification and tracking in sensor networks, Proc. IEEE 91 (8) (2003), pp.1163-1171, (2003).

DOI: 10.1109/jproc.2003.814923

Google Scholar

[4] A. Wood, J. Stankovic. Denial of service in sensor networks, IEEE Comput. Mag, 35(10): 54-62, (2002).

Google Scholar

[5] C. Karlof, D. Wagner. Secure routing in wireless sensor networks: attacks and countermeasures", in: Proc. the 1st IEEE International Workshop on Sensor Network Protocols and Applications (SNPA, 03), 2003, pp.113-127, (2003).

DOI: 10.1109/snpa.2003.1203362

Google Scholar

[6] Cungang Yang, Celia Li, Jie Xiao. Location-based design for secure and efficient wireless sensor networks, Computer Networks 52(2008) 3119-3129.

DOI: 10.1016/j.comnet.2008.07.011

Google Scholar

[7] L. Eschenauer, V. D. Gligor. A key-management scheme for distributed sensor networks", in Proc. CCS, 02: 9th ACM Conference on Computer and Communications Security. New York: ACM Press, Nov. 2002, pp.41-47, (2002).

DOI: 10.1145/586110.586117

Google Scholar

[8] H. Chan, A. Perrig, D. Song. Random key predistribution schemes for sensor networks, Proceedings of the IEEE Syrup. On Research in Security and Privacy, Berkeley, CA, USA, May 11-14 2003, pp.197-213, (2003).

Google Scholar

[9] S. Hussain, F. Kausar, A. Masood. An efficient key distribution scheme for heterogeneous sensor networks, Proceedings of the 2007 international conference on Wireless communications and mobile computing, Honolulu, Hawaii, USA, August 12-16, 2007, pp.388-392, (2007).

DOI: 10.1145/1280940.1281023

Google Scholar

[10] D. Liu, P. Ning. Establishing pairwise keys in distributed sensor networks, In: Proceedings of 10th ACM conference on computer and communications security (CCS03). Washington, DC: ACM Press: 2003, pp.41-47, (2003).

DOI: 10.1145/948109.948119

Google Scholar

[11] D. Lai, Hwang S. Kim, I. Verbauehrde. Reducing Radio Energy Consumption of Key Management Protocols for Wireless Sensor Networks", Proceedings of ACM/ IEEE International Symposium on Low Power Electronics and Design (ISLPED, 04), 2004, pp.351-356, (2004).

DOI: 10.1145/1013235.1013320

Google Scholar

[12] D. Liu, P. Ning. Location-based pairwise key establishments for static sensor networks", in: ACM Workshop on Security in Ad Hoc and Sensor networks (SASN, 03), 2003, pp.72-82, (2003).

DOI: 10.1145/986858.986869

Google Scholar