RMIS: an independent vertex set based sleep scheduling protocol for network lifetime maximization in WSNs.
Saved in:
| Title: | RMIS: an independent vertex set based sleep scheduling protocol for network lifetime maximization in WSNs. |
|---|---|
| Authors: | Bourebia, Nour El Houda1 (AUTHOR) houdabourebia@gmail.com, Bourebia, Soumia2 (AUTHOR) soumia.bourebia@univ-jijel.dz |
| Source: | Wireless Networks (10220038). Jun2025, Vol. 31 Issue 5, p3843-3864. 22p. |
| Subjects: | Independent sets, Comparative method, Energy consumption, Network performance, Data transmission systems, Wireless sensor networks, Multicasting (Computer networks) |
| Abstract: | The random and dense deployment of wireless sensor networks (WSNs) creates overlapping regions and correlated nodes which sense and report redundant data to the base station (BS), resulting in a significant energy consumption and shorter network lifetime. Reducing redundant data transmissions in the network, whilst maintaining sufficient data transfer to the BS, low energy consumption, and consistent network performance is a challenging task. This paper proposes a clustering-based sleep scheduling protocol (RMIS) that aims to reduce redundant transmissions and improve network energy consumption. To achieve this, it uses the set of independent vertices and a proposed ϵ -greedy triggering algorithm to rotate between sleep and awake states. The correlated nodes in a cluster are first identified according to their distance and sensing range, then used to generate a representative graph for each cluster according to the relationship between the nodes. To reduce data transmissions, RMIS considers the nodes in each cluster's independent vertex set as awake nodes. The node states are determined according to an ϵ -greedy triggering algorithm, which allows new cluster configurations to be explored and less energy-consuming ones to be exploited. RMIS also performs clustering using the Chinese Whisper algorithm, based on the distance and transmission range of the nodes, which helps create compact and separate clusters. The simulation results confirm the superiority of the proposed protocol over the comparative approaches, notably in terms of network lifetime, stability period, energy consumption, and number of alive nodes. [ABSTRACT FROM AUTHOR] |
| Copyright of Wireless Networks (10220038) is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The random and dense deployment of wireless sensor networks (WSNs) creates overlapping regions and correlated nodes which sense and report redundant data to the base station (BS), resulting in a significant energy consumption and shorter network lifetime. Reducing redundant data transmissions in the network, whilst maintaining sufficient data transfer to the BS, low energy consumption, and consistent network performance is a challenging task. This paper proposes a clustering-based sleep scheduling protocol (RMIS) that aims to reduce redundant transmissions and improve network energy consumption. To achieve this, it uses the set of independent vertices and a proposed ϵ -greedy triggering algorithm to rotate between sleep and awake states. The correlated nodes in a cluster are first identified according to their distance and sensing range, then used to generate a representative graph for each cluster according to the relationship between the nodes. To reduce data transmissions, RMIS considers the nodes in each cluster's independent vertex set as awake nodes. The node states are determined according to an ϵ -greedy triggering algorithm, which allows new cluster configurations to be explored and less energy-consuming ones to be exploited. RMIS also performs clustering using the Chinese Whisper algorithm, based on the distance and transmission range of the nodes, which helps create compact and separate clusters. The simulation results confirm the superiority of the proposed protocol over the comparative approaches, notably in terms of network lifetime, stability period, energy consumption, and number of alive nodes. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10220038 |
| DOI: | 10.1007/s11276-025-03971-x |
