a novel version of gsa and its application in the k-of-n lifetime problem in two-tiered wsn

For the past decades, we have witnessed an extraordinary advancement in the field of wireless sensor networks (wsns) in both academic and industrial settings. moreover, the network lifetime is regarded as one of the most critical issues in this field, and quite a large number of researchers are increasingly exploring this topic of interest. in this study, the linearscaling method is initially implemented onto the gravitational search algorithm (gsa) for the mass calculation. this is due to the fact that the exploitation and exploration abilities of the algorithm can be fully controlled using this approach. the results obtained from the simulation revealed that this novel gsa achieves the same level of performance as that of conventional gsa and significantly outperforms the state-of-the-art metaheuristic search algorithms. additionally, this improved gsa can be readily utilized to solve the k-of-n lifetime problem in twotiered wsn architecture. in our proposed method, the novel gsa was employed in order to find the optimum location of the base station to enhance network lifetime. furthermore, the simulation results indicated that despite the simplicity in implementation, our proposed method has a higher level of performance compared to other approaches used to address k-of-n lifetime problem in two-tiered wsn architecture.