Key Management Scheme for Routing in Clustered Heterogeneous Sensor Networks
Kanwalinderjit Kaur Gagneja, Kendall E. Nygard · 2012
Adding security using pairwise key establishment in heterogeneous sensor networks is a very challenging task, since sensor networks are usually resource crunched and generally deployed in hostile environments. This paper puts forward an effective and efficient security scheme for launching anonymity in clustered heterogeneous sensor networks. The clustered heterogeneous sensor network has two types of nodes: high end nodes that work as cluster heads and low end nodes. The clusters are formed initially by using Voronoi diagrams and then some node adjustment is done in the clusters using Tabu search. The secure scheme uses a unique technique to conceal its true identity (ID). Once the sensor nodes are deployed, the nodes setup their neighbor table and share their secret key with the neighbors while ensuring that their true identity (ID) is not disclosed and the communication is secured. The empirical performance evaluations support the given approach's efficiency and effectiveness.