Research Article
Towards a Game Theoretic Formulation of Clustering Routing in Wireless Sensor Networks
@INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4407, author={Georgios Koltsidas and Fotini-Niovi Pavlidou}, title={Towards a Game Theoretic Formulation of Clustering Routing in Wireless Sensor Networks}, proceedings={2nd International ICST Workshop on Game Theory in Communication Networks}, publisher={ACM}, proceedings_a={GAMECOMM}, year={2010}, month={5}, keywords={clustering game theory mixed equilibria sensor networks}, doi={10.4108/ICST.VALUETOOLS2008.4407} }- Georgios Koltsidas
Fotini-Niovi Pavlidou
Year: 2010
Towards a Game Theoretic Formulation of Clustering Routing in Wireless Sensor Networks
GAMECOMM
ICST
DOI: 10.4108/ICST.VALUETOOLS2008.4407
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.
