Group key dynamic management method for wireless sensor network

Abstract

The current group key management methods in wireless sensor networks despise the overhead in the actual use of the protocol while enhancing the security performance. In order to solve the problem of high computational complexity and high communication cost, a group key dynamic management method for wireless sensor networks is proposed in this paper. The hash function is used to select the key, establish the wireless sensor network group structure, and generate the leading node by election for identity authentication and data processing. A key agreement protocol is proposed in the group to establish a secure communication channel for terminal groups distributed among different domains. The node obtains the public key of other nodes according to the identifier, mapping algorithm and matrix of the communication partner, and updates the key only for the group users who join or leave, so as to reduce the traffic and computation. Set the threshold value for the number of member nodes. When the number of sub key components obtained by a node reaches or exceeds the threshold value, the cluster key can be recovered and saved, and then other sub key components can be deleted. The simulation results show that compared with the key management method based on symmetric polynomial and logical key tree, this method uses less communication overhead and storage overhead, reduces the time overhead and improves the communication efficiency of the management protocol.