NRSM: node redeployment shrewd mechanism for wireless sensor network

Abstract

Despite numerous advantages, the challenges for wireless sensor communication always remains open due to which a continuous effort is being applied to tackle the unavoidable conditions regarding wireless network coverage. Somehow, the uncouth deployment of the sensor nodes is making the tribulation queue longer day by day which eventually has great impact over sensor coverage range. To address the issues related with network coverage and uncouth energy wastage, a sensor node redeployment-based shrewd mechanism (NRSM) has been proposed where new intended positions for sensor node are rummaged out in the coverage area. The proposed algorithm operates in two phases; in first phase it locates the intended node positions through Dissimilitude Enhancement Scheme (DES) and moves the node to new position. While second phase is called a Depuration, when the moving distance between initial and intended node position is shrewdly reduced. Further, different variation factors of NRSM such as loudness, pulse emission rate, maximum frequency, and sensing radius have been explored and related optimized parameters are identified. The performance metric has been meticulously analyzed through simulation rounds in Matlab and compared with state of art algorithms like Fruit Fly Optimization Algorithm (FOA), Jenga-inspired optimization algorithm (JOA) and Bacterial Foraging Algorithm (BFA) in terms of mean coverage range, computation time, standard deviation and network energy diminution. The performance metrics vouches the effectiveness of the proposed algorithm as compared to the FOA, JOA and BFA.