An Efficient Model-Based Clustering via Joint Multiple Sink Placement for WSNs

Soukaina Bouarourou (), Abderrahim Zannou, El Habib Nfaoui and Abdelhak Boulaalam
Additional contact information
Soukaina Bouarourou: LISAC Laboratory, Faculty of Sciences Dhar EL Mahraz, Sidi Mohamed Ben Abdellah University, Fez 30000, Morocco
Abderrahim Zannou: ERCI2A, Faculty of Science and Technology Al Hoceima, Abdelmalek Essaadi University, Tetouan 93000, Morocco
El Habib Nfaoui: LISAC Laboratory, Faculty of Sciences Dhar EL Mahraz, Sidi Mohamed Ben Abdellah University, Fez 30000, Morocco
Abdelhak Boulaalam: LISA Laboratory, National School of Applied Sciences, Sidi Mohamed Ben Abdellah University, Fez 30000, Morocco

Future Internet, 2023, vol. 15, issue 2, 1-27

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.

Keywords: wireless sensor networks; sink; multiple sink deployment; sink placement; sensor-to-sink routing; ant-clustering algorithm; data transmission; data transmission delay (search for similar items in EconPapers)
JEL-codes: O3 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1999-5903/15/2/75/pdf (application/pdf)
https://www.mdpi.com/1999-5903/15/2/75/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jftint:v:15:y:2023:i:2:p:75-:d:1069075

Access Statistics for this article

Future Internet is currently edited by Ms. Grace You

More articles in Future Internet from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().