Fault‐tolerant independent gradient forwarding routing for wireless sensor network

Abstract

SummaryFor the sensor network, greedy forwarding is thought to be the best energy‐efficient routing method. There are two restrictions on greedy forwarding: a minimum local scenario and an intersection problem in which it is unable to locate an existing route. The proposed independent gradient forward (IGF) proves that the Euclidean equation used by greedy forwarding is less capable of dealing with the problems mentioned above. IGF considers each dimension independently to enhance the efficiency of greedy forwarding, sustaining its simplicity. It contributes to strengthening the suggested IGF's ability to manage holes and get around obstructions in the wireless sensor network. We have demonstrated that it travels a shorter potential path and avoids stuck nodes well in advance. It is more energy‐efficient since it can predict the void node and never visits a stalled node. We evaluated the suggested IGF's performance against other traditional boundary traversal‐based methods on both rare and dense networks. In comparison with other boundary traversal‐based algorithms, the simulation results indicate that it generates a 10% smaller route to bypass. The IGF average energy consumption increases slowly, rising by just 7% and 12.5% for dense and rare networks, respectively, with a fivefold increase in void size (from 100 to 500 m).