A GAME THEORETIC APPROACH FOR ENERGY OPTIMIZATION IN CLUSTERED WIRELESS AD HOC SENSOR NETWORKS

In this paper, our objective is to use the game-theoretic approach for clustered wireless ad-hoc networks to optimize system lifetime. Game theory (GT) has been exploited in the domain of biology and economics, but lately it is applied in routing and packet forwarding in Wireless Ad hoc Networks (WANETs). However, the clustering topic, concerned with self-directedness of sensor nodes into big groups, has not been examined under this model. Distance-based Clustered Routing For Selfish Sensors (D-CROSS) protocol assists in accomplishing energy conservation where every single sensor node is nominated as cluster head (CH) with zero probability rule (ZPR). Our analysis follows the non-cooperative game theoretic approach where each sensor node selfishly plays and tries to preserve its own energy and maximize its lifetime. We demonstrate here the Nash Equilibrium for mixed and pure strategies and anticipated payoffs. The comparison of the D-CROSS protocol with the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol through simulations demonstrates that D-CROSS achieves improved performance in terms of network lifetime. (C) 2019 INT TRANS J ENG MANAG SCI TECH.