GTIACO: energy efficient clustering algorithm based on game theory and improved ant colony optimization

Abstract

Recently, wireless sensor networks have been widely used for environmental and structural safety monitoring. However, node batteries cannot be replaced or easily recharged in harsh environments. Maximizing network lifetime remains a challenging issue in designing WSN routing. This paper introduces GTIACO, a novel metaheuristic clustering protocol. It employs an optimal cluster head function to determine cluster number and utilizes game theory for selecting optimal cluster heads. To optimize inter-cluster routing, improved ant colony optimization (ACO) is introduced to construct gathering paths from clusters to the base station. Both blind pathways, pheromone concentration, and angle factors are considered to improve path exploration and transmission efficiency in ant colonies. To assess network performance, various scenarios involving different base station placements and network densities are examined. Experimental results demonstrate GTIACO's superiority over LEACH, ACO, SEP, and PRESPE protocols in network lifetime, stability, energy, and throughput. The proposed GTIACO shows an improvement of at least 4.3% in network lifetime and 32.8% in network throughout. It exhibits superior stability and transmission efficiency across diverse network densities.