An Efficient Model-Based Clustering via Joint Multiple Sink Placement for WSNs
Soukaina Bouarourou, Abderrahim Zannou, El Habib Nfaoui, Abdelhak Boulaalam
Abstract
Wireless sensor networks consist of many restrictive sensor nodes with limited abilities, including limited power, low bandwidth and battery, small storage space, and limited computational capacity. Sensor nodes produce massive amounts of data that are then collected and transferred to the sink via single or multihop pathways. Since the nodes’ abilities are limited, ineffective data transmission across the nodes makes the network unstable due to the rising data transmission delay and the high consumption of energy. Furthermore, sink location and sensor-to-sink routing significantly impact network performance. Although there are suggested solutions for this challenge, they suffer from low-lifetime networks, high energy consumption, and data transmission delay. Based on these constrained capacities, clustering is a promising technique for reducing the energy use of wireless sensor networks, thus improving their performance. This paper models the problem of multiple sink deployment and sensor-to-sink routing using the clustering technique to extend the lifetime of wireless sensor networks. The proposed model determines the sink placements and the most effective way to transmit data from sensor nodes to the sink. First, we propose an improved ant clustering algorithm to group nodes, and we select the cluster head based on the chance of picking factor. Second, we assign nodes to sinks that are designated as data collectors. Third, we provide optimal paths for nodes to relay the data to the sink by maximizing the network’s lifetime and improving data flow. The results of simulation on a real network dataset demonstrate that our proposal outperforms the existing state-of-the-art approaches in terms of energy consumption, network lifetime, data transmission delay, and scalability.