A repeated game theoretical approach for clustering in mobile ad hoc networks

In view of energy, mobility and degree of the nodes, a clustering algorithm is proposed which provides an effective method for establishing a hierarchical structure of the mobile ad hoc networks. Moreover, a repeated game model together with limited punishment mechanism is introduced for constraining the selfish nodes that deceive to avoid being cluster-heads to save energy. It is also proved that the profile of acting honestly at each stage of the clustering will deduce the unique Nash Equilibrium of the game. So, with the incentive mechanism, the clustering algorithm will work much more efficiently and stably.