Multiple Redundant Weighted Cluster Path Scheduling Scheme for Damaged Sensor-Based Wireless Sensor Network

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.