Toward High-Payoff Nash Equilibria for Interference Game between Body Area Networks

Interference between adjacent body area networks (BANs), leading to dramatic performance degradation of the whole system, is always an unsolved issue. In this paper, we study the interference game in which BANs adjust their resource allocation strategies to avoid putting highly interfering sensors into the same time slots. Dickhaut-Kaplan algorithm is used to enumerate all the Nash equilibria (NE) of the game between 2 BANs with 3 sensors each. We find that a number of NE with different payoffs usually exist. This study motivates us to design algorithm for achieving high-payoff NE in the future work.