CLUSTERING ROUTING PROTOCOL BASED ON GAME THEORY IN WIRELESS SENSOR NETWORKS

Panpan Dong, Bencan Gong, Peng Chen, and Wenqi Wu

Keywords

Environmental monitoring, wireless sensor networks, auction game, Nash equilibrium, clustering routing

Abstract

A clustering routing algorithm using game theory is presented to extend the lifetime of wireless sensor networks. In the cluster building stage, the cluster head election model is established by the remaining energy of nodes and the energy expenditure of cluster heads. The optimal cluster heads are chosen by Nash equilibrium probability. In the inter-cluster routing stage, cluster heads set their own bidding price according to their remaining energy, energy consumption and distance to sink, and finally form the optimal path to sink through multi-round auction game among neighbour cluster heads. The experiment results show that the routing algorithm can effectively extend the network lifetime, balance the energy expenditure of nodes, and increase the number of packets arriving at sink.

Important Links:



Go Back