Game Theory Based Energy Balance Clustering Routing

As one of the ten most influential technologies in 21 Century, wireless sensor network(short for WSN) is composed of a large number of sensor nodes which are distributed in the detection area by the way of the self-organization. In recent years, with the rapid development of the embedded system and communication technology.In WSN, routing technology is one of the research hotspots. How to design a routing algorithm with the efficient utilization of the energy, high reliability and high security has been the goal. In the hierarchical routing, WSN is divided into multiple clusters, and each cluster has a cluster head. The cluster head which is closer to the sink node will cost more energy to forward the data which will cause the "energy hole".These phenomenon will affect the network performance. To solve this problem, this paper proposes the GBUC(Game Theory based energy balance unequal clustering routing). In this protocol, WSN is divided into clusters of different sizes. Closer to the sink node, the smaller the radius of clusters is. So the cost of the cluster head will be reduced. In order to balance the cost of the energy of the cluster heads, the network select the relay node with the high energy where the clusters are overlapping. The relay nodes will overcome the "energy hole". In the communication of the clusters, we construct a routing game model, and efficiency function was associated with the distance of the communication, the reliability of the link and the residual energy. Each node selects the node whose income was the highest as the next hop. If Nash equilibrium is reached,the optimal path is selected.Through experiment contrast, GBUC algorithm proposed in this paper on the node energy consumption balance, data transmission reliability are improved.