Mobile Dynamic Khalimsky k-Clustering and Data Routing in Wireless Sensor Networks with obstacles

In this paper we propose an efficient Mobile Dynamic Khalimsky k-Clustering (MDKC) algorithm for efficient data gathering and routing in Wireless Sensor Networks (WSNs). The aim of this algorithm is to optimize routing paths reducing the energy consumption and resolving the holes problem of isolated nodes with the presence of obstacles in the sensing field. At first, the MDKC algorithm clusters the deployed nodes into k-hop (k>= 2) compact dynamic clusters. For each cluster, a node is elected cluster-head in its k-neighborhood according to some criteria such as the remaining energy, the k-degree and the communication probability average. Then, some nodes are selected as Khalimsky anchors by the triangulation technique to optimize the intra-cluster data routing process. The Khalimsky anchors at the border layers ensure the inter-cluster data routing between adjacent clusters.In the next phase of MDKC, a Mobile Collector (MC) is used for data collecting from isolated nodes/clusters due to the presence of obstacles and holes in the network.The obtainedsimulation results prove that MDKC minimizes the energy consumption and improvesthe connectivity rate between sensors and the delivery rate as well as the network lifetime compared to some existing approaches.