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 to model routing packet forwarding wireless ad-hoc sensor networks. However, the clustering problem, related self-organization nodes into large groups, not studied under this framework. In work our objective is provide a game theoretical modeling The analysis based on non-cooperative approach where each behaves selfishly order conserve its energy thus maximize lifespan. We prove Nash Equilibria pure mixed strategies, expected payoffs price anarchy corresponding these equilibria. Then, we use formulate mechanism (which called Clustered Routing Selfish Sensors--CROSS), that can be applied networks practice. Comparing popular technique, show via simulations CROSS achieves performance similar very algorithm.