Towards a game theoretic formulation of clustering routing in wireless sensor networks

  • Authors:
  • Georgios Koltsidas;Fotini-Niovi Pavlidou

  • Affiliations:
  • Aristotle University of Thessaloniki, Thessaloniki, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Despite its long history, only recently game theory has been used to model routing and packet forwarding in wireless ad-hoc and sensor networks. However, the clustering problem has not been studied under this framework in detail. In this work our objective is to provide a game theoretical modeling of clustering routing for 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 and use them to formulate a clustering mechanism (which we called Clustered Routing for Selfish Sensors - CROSS), that can be applied to realistic networks. Comparing this mechanism to a popular clustering technique, we show via simulations that CROSS outperforms LEACH in most cases in terms of network lifetime, a crucial parameter for sensor networks.