Non-Cooperative Coexistence of Co-located Independent Wireless Mesh Networks

As more wireless networks are being deployed in a given geographic area, the problem of interference and coexistence of these independently operated networks is becoming an increasing problem. This paper looks at the coexistence of independent multihop wireless mesh networks (WMNs). We argue that cooperation is difficult in such scenarios. We define a coexistence game model and apply it to study channel assignment in co-located WMNs. In addition, we propose using no-regret learning algorithms that allow WMNs to iteratively arrive at Nash equilibrium outcomes. Simulation results show that the informed no-regret learning algorithms we have tested converge to a set of Nash equilibrium strategy profiles. We also show that network information is not critical for games with large numbers of players.