Ronak Tahmasbi - Software Eng. Department of computer, Kish International Branch, Islamic Azad University, Kish Island, Iran
H Haj seyed javadi - Department of Mathematics and Computer Science, Shahed University, Tehran, Iran
M.E Shiri - Industrial Eng. Faculty of Amirkabir University of technology
Ahmad Allahyari - Industrial Eng. Faculty of Industrial Engineering, Alghadir University, Iran

Wireless sensor networks' nodes are divided to Hsensors and L-sensors. H-sensor nodes are more powerful than L-sensor nodes in term of processingand memory. Because of that H-sensors are considered as the cluster head and L-sensor as the cluster member. H-sensor is responsible for thesecurity of this communication. Each node can communicate with neighbor nodes. Problems of the network are security and battery lifetime for eachnode. Proposed algorithm presents a scheme to keep the security, reduce energy consuming and the length of message in wireless sensor network. Inthis scheme each node select as a cluster head based on minimum distance of neighbor nodes. This algorithm, uses Voronoi algorithm, did themost optimal clustering and divides the operational environment to Voronoi spaces and allocate a key to each Voronoi space for secure connection with neighbor spaces. Each Voronoi spaces have special key, so that energy consuming decreases andsecurity increases. This scheme is evaluated byMATLAB, simulation software, and compared with previous algorithms. Results of this simulationshow that this scheme operates better than similarschemes because it decreases the length of message and energy consuming.

key management, wireless sensor network,Voronoi diagram