Chap42WSNSecurity Wireless Networks and Security 无线网络与安全 教学课件.ppt

Chapter 4 Part 2 - Sensor Network Security;Outline;*;I. Introduction - Security;I. Introduction - Security;I. Introduction - Key Management ;*;Roadmap;A MICA2-DOT node (top left) and A STARGATE node (bottom);II. The HSN Model - Assumptions ;II. The HSN Model – Node Clustering;All H-sensors form a communication backbone in the network. Powerful H-sensors have sufficient energy supply, long transmission range, and high date rate, hence have many advantages to serve as communication relays. ;Most existing sensor network key management schemes are designed to set up shared keys for all pairs of neighbor sensors, without considering the special communication pattern in sensor networks. ;In a lot of sensor networks, nodes are densely deployed. One node could have as many as 30 or more neighbors. It would cause large communication and computation overhead (and hence excessive energy consumptions) to set up shared keys with all neighbors. c-neighbor: A neighbor node v is referred to as a communication neighbor (c-neighbor) of node u if v is in the route from u to the sink. We proposed a novel idea for efficient key management in sensor networks. Only set up shared keys for each sensor and its c-neighbors Instead of setting up shared keys for each pair of neighbors. The new approach can greatly reduce the overhead of key management in sensor networks. For example, suppose that a sensor node u has 30 neighbors but only communicate with 2 of them. Using the c-neighbor concept, only 2 pairwise keys need to be set up for node u, instead of 30. The saving is significant for sensor networks, since sensor nodes have limited resources.;Roadmap;Many key management schemes designed for homogeneous sensor networks have large communication and computation overhead (a lot of energy consumptions), and/or large storage requirement. and hence may not be suitable for small low-end sensors. For example, using the scheme in [4], for a key pool size P = 10,