NIS01-1: An Efficient Key Management Scheme for Heterogeneous Sensor Networks

Security is critical for sensor networks deployed in hostile environments. Previous research on sensor network security mainly considers homogeneous sensor networks, i.e., all sensor nodes have the same capabilities. Many security schemes designed for homogeneous sensor networks suffer from high communication/computation overhead, and/or large storage requirement. We adopt a heterogeneous sensor network (HSN) model to overcome these problems. In this paper, we present an efficient asymmetric pre-distribution (AP) key management scheme that takes advantage of the powerful high-end sensors (H-sensors) in an HSN. The AP scheme utilizes the large storage of H-sensors and pre-load each H-sensor with a relatively large number of keys. The AP scheme dramatically reduces the total storage space for key pre-distribution. The performance evaluation and security analysis show that the AP scheme provides better security than existing key management schemes, while achieving significant reduction on sensor storage.

[1]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[2]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[3]  Suresh Singh,et al.  Exploiting heterogeneity in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Xiaoyan Hong,et al.  An ad hoc network with mobile backbones , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[5]  Deborah Estrin,et al.  A system for simulation, emulation, and deployment of heterogeneous sensor networks , 2004, SenSys '04.

[6]  Mingyan Liu,et al.  Analysis of energy consumption and lifetime of heterogeneous wireless sensor networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Xiaojiang Du,et al.  Maintaining Differentiated Coverage in Heterogeneous Sensor Networks , 2005, EURASIP J. Wirel. Commun. Netw..

[8]  Xiaoyan Hong,et al.  Landmark routing in ad hoc networks with mobile backbones , 2003, J. Parallel Distributed Comput..

[9]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Xiaojiang Du,et al.  Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks , 2006, Int. J. Wirel. Mob. Comput..

[11]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[12]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[13]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[14]  Catherine Rosenberg,et al.  A minimum cost heterogeneous sensor network with a lifetime constraint , 2005, IEEE Transactions on Mobile Computing.