TY - GEN
T1 - Multiple Redundant Weighted Cluster Path Scheduling Scheme for Damaged Sensor-Based Wireless Sensor Network
AU - Khayat, Grace
AU - Mavromoustakis, Constandinos X.
AU - Pitsillides, Andreas
AU - Batalla, Jordi Mongay
AU - Song, Houbing
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In a predefined geographical field, a group of sensor nodes communicating wirelessly form a Wireless Sensor Network (WSN). The sensors' goal is to upload the sensed data to the control station to determine if any immediate action should be taken or to analyze and monitor the situation. In clustering algorithms, the sensors are grouped as clusters, where each cluster has one sensor selected as the cluster head (CH) responsible for all inter-cluster communication. In a crisis scenario, the CH might be non-functional, resulting in a disconnected cluster. An enhanced WSN weighted cluster routing scheme is proposed in this paper. A cluster index based on distance, rewarding index, and energy is used to select the CH and cluster members (CM). The proposed scheme aims at ensuring that the data is uploaded even though the CH is non-functional by selecting a redundant CH for every node. Therefore, no matter how many sensors are inactive, a CH is still selected to ensure inter-cluster communication. The delays generated in the proposed routing scheme are studied using MATLAB simulation. In addition, the effect of different weights is studied on the delay.
AB - In a predefined geographical field, a group of sensor nodes communicating wirelessly form a Wireless Sensor Network (WSN). The sensors' goal is to upload the sensed data to the control station to determine if any immediate action should be taken or to analyze and monitor the situation. In clustering algorithms, the sensors are grouped as clusters, where each cluster has one sensor selected as the cluster head (CH) responsible for all inter-cluster communication. In a crisis scenario, the CH might be non-functional, resulting in a disconnected cluster. An enhanced WSN weighted cluster routing scheme is proposed in this paper. A cluster index based on distance, rewarding index, and energy is used to select the CH and cluster members (CM). The proposed scheme aims at ensuring that the data is uploaded even though the CH is non-functional by selecting a redundant CH for every node. Therefore, no matter how many sensors are inactive, a CH is still selected to ensure inter-cluster communication. The delays generated in the proposed routing scheme are studied using MATLAB simulation. In addition, the effect of different weights is studied on the delay.
KW - WSN
KW - cluster head
KW - cluster members
KW - cluster routing scheme
KW - crisis scenario
KW - routing scheme
KW - sensors
UR - http://www.scopus.com/inward/record.url?scp=85194140806&partnerID=8YFLogxK
U2 - 10.1109/FNWF58287.2023.10520576
DO - 10.1109/FNWF58287.2023.10520576
M3 - Conference contribution
AN - SCOPUS:85194140806
T3 - Proceedings - 2023 IEEE Future Networks World Forum: Future Networks: Imagining the Network of the Future, FNWF 2023
BT - Proceedings - 2023 IEEE Future Networks World Forum
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 6th IEEE Future Networks World Forum, FNWF 2023
Y2 - 13 November 2023 through 15 November 2023
ER -