Using Tabu-Voronoi clustering heuristics with key management scheme for heterogeneous sensor networks
Kanwalinderjit Kaur Gagneja, Kendall E. Nygard, Navninderjit Singh · 2012
Clustering, routing and security are essential for better performance of any sensor network. Providing inbuilt security to routing algorithms in sensor networks is essential since some of these sensor networks have applications in hostile environments. Researchers work either on a routing algorithm or on security. However, the security should be embedded to the design of a routing scheme. In this paper, initially we divide the given area of interest into Voronoi clusters and then apply a new Tabu heuristic to form more stable clusters. When some event occurs, a new efficient key management technique is applied with improved tree routing algorithm for data routing in heterogeneous sensor networks. The simulation results show that this scheme offers security and uses less computation with substantial savings in memory requirements. Our simulation results show that when Tabu-Voronoi clustering and secure routing scheme are applied together, it is performing better than some existing algorithms. This approach shows higher throughput, fewer network delays, and less energy utilization.