A game theoretical approach to clustering of ad-hoc and sensor networks

Game theory has been used for decades in fields of science such as economics and biology, but recently it was used to model routing and packet forwarding in wireless ad-hoc and sensor networks. However, the clustering problem, related to self-organization of nodes into large groups, has not been studied under this framework. In this work our objective is to provide a game theoretical modeling of clustering for ad-hoc and sensor networks. The analysis is based on a non-cooperative game approach where each sensor behaves selfishly in order to conserve its energy and thus maximize its lifespan. We prove the Nash Equilibria of the game for pure and mixed strategies, the expected payoffs and the price of anarchy corresponding to these equilibria. Then, we use this analysis to formulate a clustering mechanism (which we called Clustered Routing for Selfish Sensors—CROSS), that can be applied to sensor networks in practice. Comparing this mechanism to a popular clustering technique, we show via simulations that CROSS achieves a performance similar to that of a very popular clustering algorithm.

[1]  Pietro Michiardi,et al.  Analysis of cooperation strategies in mobile ad hoc networks with imperfect monitoring , 2004 .

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

[3]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[4]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[5]  Levente Buttyán,et al.  Equilibrium Analysis of Packet Forwarding Strategies in Wireless Ad Hoc Networks - The Static Case , 2003, PWC.

[6]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

[7]  Sajal K. Das,et al.  A game theory based approach for security in wireless sensor networks , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[8]  Eitan Altman,et al.  Some Game-Theoretic Problems in Wireless Ad-Hoc Networks , 2004, EuroNGI Workshop.

[9]  Petteri Nurmi,et al.  Modelling routing in wireless ad hoc networks with dynamic Bayesian games , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[10]  Abraham O. Fapojuwo,et al.  A centralized energy-efficient routing protocol for wireless sensor networks , 2005, IEEE Communications Magazine.

[11]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

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

[13]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[14]  Zheng Zeng-Wei,et al.  Clustering routing algorithm using game-theoretic techniques for WSNs , 2004, 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512).

[15]  Mohan Singh,et al.  A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks , 2012 .

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[17]  Eitan Altman,et al.  Non-cooperative Forwarding in Ad-Hoc Networks , 2005, NETWORKING.

[18]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[19]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.