Abstract — In recent years wireless sensor network (WSN) is an active domain of research. A WSN consists of a number of sensor nodes each with limited energy, bandwidth, storage and processing capabilities. Clustering is one of the basic approaches that offer a practical way of providing scalability when designing a large and dense sensor networks. One of the approaches to enhance the survivability of WSN is to allow only some sensor nodes in a cluster of sensor nodes, called cluster heads, to communicate with the base station. In this paper we have proposed a Game theoretic approach for selecting a cluster head for every cluster in a WSN. Games can be a single round or repetitive. The scope a player enjoys in making his or her moves constitutes the player's "strategy". Rules govern the outcome for the set of moves taken by the players and outcomes produce payoffs for the various players which can be expressed by means of a payoff matrix. However, the clustering problem in wireless sensor network, related to self-organization of nodes into large groups and selection of head, has not been studied under this framework. In this work, our goal is to provide a game theoretical modeling of cluster-head selection for wireless sensor networks. A game of scheduling of nodes for taking the responsibility of cluster head, is an interactive decision making process between a set of self-interested nodes.