Analysis Of Key Distribution Algorithms In Wireless Sensor Networks

Recent advancement in wireless communications and electronics has enabled the development of low cost sensor networks. The sensor network can be used in many application areas (e.g. health, military, home). For different application areas, there are different technical issues that researchers are currently resolving.Firstly, we divide the whole architecture into these parts as below to introduce the sensor wireless network. It includes the structure of the wireless networks, the key management of the nodes, the data transmission protocols and the routing in the wireless networks. Secondly, we introduce the factors which should be considered while designing the algorithms of the wireless sensor network. At last, we will involve the key-management. If we just send the plain text among the nodes, there is no security at all. So it is necessary to share the keys among the nodes which want to communicate with each other. Comparing with the existing security methods, the polynomial method has some advantages:(1) The polynomial algorithm needs quite few space to store these keys. For the classical one stores the constant keys and the polynomial one store the key constructions, which mean the latter one can only store a few polynomial to product the tens of thousands of the keys.(2) The polynomial algorithm has better safety in the wireless network communications.(3) The polynomial algorithm can support larger sensors in the wireless network which can be well used in the large scale net.