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.

[1]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[2]  Refik Molva,et al.  Analysis of coalition formation and cooperation strategies in mobile ad hoc networks , 2005, Ad Hoc Networks.

[3]  N. Marchang,et al.  A Game Theoretical Approach for Efficient Deployment of Intrusion Detection System in Mobile Ad Hoc Networks , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).

[4]  黃依賢,et al.  Energy Efficient Clustering Technique for Multicast Routing Protocol in Wireless Ad Hoc Networks , 2007 .

[5]  P.S. Hiremath,et al.  Content Based Image Retrieval Using Color, Texture and Shape Features , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).

[6]  Qiang Liu,et al.  Improved Fuzzy Clustering Method Based on Entropy Coefficient and Its Application , 2008, ISNN.

[7]  Taek Jin Kwon,et al.  Energy Aware Passive Clustering in Wireless Mobile Networks , 2008, 2008 International Wireless Communications and Mobile Computing Conference.

[8]  V. Georgiev.  Using Game Theory to Analyze Wireless Ad Hoc Networks . ” , 2008 .

[9]  Abdelhakim Hafid,et al.  Energy and Mobility Aware Clustering Technique for Multicast Routing Protocols in Wireless Ad Hoc Networks , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[10]  Bin Li,et al.  A improved weight based clustering algorithm in mobile ad hoc networks , 2009, 2009 IEEE Youth Conference on Information, Computing and Telecommunication.

[11]  Abolfazle Akbari,et al.  Survey of Stable Clustering for Mobile Ad Hoc Networks , 2009, 2009 Second International Conference on Machine Vision.

[12]  Ali Khosrozadeh,et al.  Clustering Alghorithms in Mobile Ad Hoc Networks , 2009 .

[13]  Santanu Kumar Rath,et al.  A Survey on One-Hop Clustering Algorithms in Mobile Ad Hoc Networks , 2009, Journal of Network and Systems Management.

[14]  R. Srikant,et al.  A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks , 2010, Ad Hoc Networks.

[15]  Winston Khoon Guan Seah,et al.  Game-Theoretic Approach for Improving Cooperation in Wireless Multihop Networks , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[16]  Simon Pietro Romano,et al.  Smoothing Selfishness by Isolating Non-cooperative Nodes in Ad Hoc Wireless Networks , 2010, 2010 Second International Conference on Advances in Future Internet.

[17]  Mohammad Reza Meybodi,et al.  A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks , 2011, Cluster Computing.

[18]  Fotini-Niovi Pavlidou,et al.  A game theoretical approach to clustering of ad-hoc and sensor networks , 2011, Telecommun. Syst..