MAGNIFYING THE ENDURANCE OF NETWORK SECURITY BY DESTINATION SEQUENCED DISTANCE VECTOR PROTOCOL USING GAME THEORY TECHNIQUES IN NETWORKING
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
... ads, 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. In this work, our goal is to provide longitivity of network lifetime and network security by using 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. In this paper we consider cooperation between the cluster heads in data transmission .A mobile node may move to a new location, in which it is desirable for the node to join a group. Hence using game theory technique with DSDV protpcol and proposed algorithm we maximized the network lifetime , network security minimized the energy consumption and decrease in end to end delay. Also, we propose an algorithm for nodes to choose the best group in their signal range, using coalitional game theory.