A cluster cooperative routing algorithm based on evolutionary game

Since the existing cluster cooperative routing algorithms select cluster heads without considering the characteristics of cooperative communication and don't balance the cluster member according to the capacity of cluster heads, they can't fully exploit the advantage of cooperative communication on saving energy consumption. A cluster cooperative routing algorithm based on evolutionary game (CCREG) is proposed. Firstly, the energy of virtual node is the metric of cluster head selection. Secondly, the model of cluster membership based on the evolutionary game is formulated, where member nodes select different clusters to join in leading to different payoffs which are decided by the capacity of the cluster head and the number of cluster members. Each member node selects a cluster to join in, till it can't achieve more payoffs by changing the cluster to join in. The experiment shows that CCREG can prompt the network lifetime by 14%~70% with two cluster headers, by 5%~80% with three cluster headers, compared with cooperative multi-input multi-output routing (CMIMO).