Energy Efficient SOCGO Protocol for Hole Repair Node Scheduling in Reliable Sensor System

A sensor node in the wireless sensor network (WSN) has an inadequate energy, and it cannot be interchanged due to the arbitrary placement, so the objective is to extend the network lifetime. An inadequate energy becomes a crucial problem to solve energy efficiency in WSN. In this work, we propose a new Self-Organizing Cluster based Greedy best-first search Opportunistic routing (SOCGO) protocol for balanced energy routing. In our proposed work, the operation of work is divided into four stages for energy balanced routing. They are Sleep state, active state, guard state and death state. The residual energy consumed through the examining adjacent nodes is presented as an aspect to estimate the detection rate, and it can achieve through the novel approach named as hybrid K-means and Greedy best-first search algorithm. Furthermore, the presence of coverage holes pairs within WSN can be recovered through an Opportunistic routing algorithm. This method repairs the coverage hole pairs and improves the network lifetime. Then this proposed SOCGO protocol can be implemented in both the homogeneous and heterogeneous environment. Simulation outcomes deliberates that our proposed SOCGO algorithm attains enhanced performance regarding the network lifetime, throughput, energy consumption, average end to end delay and packet delivery ratio.