Stochastic Geometry Based Medium Access Games in Wireless Ad Hoc Networks

International audienceThis paper studies the performance of a wireless network when the nodes, that form a Poisson point process, selfishly choose their Medium Access Probability (MAP). We define the utility of each node as a weighted difference between a performance metric and some transmission costs. We consider expected goodput and expected delay as the performance metrics. The relative preference of nodes for their performance metrics and the transmission costs is represented by a tradeoff factor. We first consider a scenario in which nodes can be priced for the channel access. We relate the tradeoff factor to some pricing mechanism and compute the symmetric Nash equilibria of the game in closed form as a function of the price factor. We show that simple pricing mechanisms can be used to maximize system efficiency. In particular, we show that for a specific value of price factor, the selfish behavior of the nodes can be used to achieve the same performance as social optima at equilibrium. In the case without pricing where the dis-utility coincides with the transmission energy costs, we analyze the Price of Anarchy for these games. For the game with goodput based utility, we show that the Price of Anarchy is infinite at the tradeoff factor that achieves the global optimal goodput. For the game with delay based utility, we bound the Price of Anarchy and study the effect of the tradeoff factor