Affiliations: [a] School of Computing, SASTRA Deemed University, Thirumalaisamudram, Thanjavur, India
| [b] Department of Computer Science and Engineering, R.M.K Engineering College, Kavarapettai, Chennai, India
Correspondence:
[*]
Corresponding author. Veeramuthu Venkatesh, School of Computing, SASTRA Deemed University, Thirumalaisamudram, Thanjavur 613401, India. E-mail: venkatesh@cse.sastra.edu.
Abstract: In wireless sensor networks (WSN), the establishment of large-scale sensor networks has always needed attention. One of the many challenges is to set up an architecture that is different from the rest and find mechanisms that can efficiently scale up with the growing number of nodes that may be essential to ensure sufficient coverage of large areas under study. Concurrently, these new architectures and mechanisms are supposed to maintain low power consumption per node to comply with energy guaranty acceptable network lifetime. The researchers utilized numerous Data collection techniques for the prompt data aggregation, yet still those outcomes the node with path failures. To solve this issue, the mobile sink is being extensively used for data aggregation in large scale wireless sensor networks (WSNs). This technique avoids imbalances in energy consumption due to multi-hop transmission but might lead to extended delay time. In this paper, our focus is on shortening the length of the mobile sink’s travelling path to reduce the delay time during data gathering in large scale WSN. To achieve this, the mobile sink visits the cluster heads in an optimized path instead of sensors one by one. Here Hierarchical clusters are efficiently formed by modified K- means with outlier elimination and node proximity and residual energy based second level clustering algorithm. Next, we determine the optimal path for the mobile sink by formulating KH based Travelling Salesman Problem solving optimization algorithm. This technique proposed reduces not only the length of the path travelled by the mobile sink but also lessens the computational effort that is required for travelling-path planning and enhances the lifetime of nodes. And to ensure aggregation accuracy in cluster heads iterative filtering is implemented. Our experimental results show the proposed algorithm shortens the tour length by 40–60 percent compared to Bacterial foraging optimization-based TSP algorithm. Also delivers better results compared to other’s in terms of the computational effort, time, energy use, and enhances the network lifetime.
