Starvation mitigation for dense WLANs through distributed channel selection: Potential game approach
Bo Yin, Shotaro Kamiya, Koji Yamamoto, Takayuki Nishio, Masahiro Morikura, Hirantha Abeysekera · 2017
A potential game based distributed channel selection scheme is proposed in this paper to mitigate the flow-in-the-middle (FIM) throughput starvation problem that frequently occurs in dense wireless local area networks (WLANs). The FIM throughput starvation occurs when neighbors of a given node are not within the carrier sense ranges of each other. Since they spatially reuse the channel and at least one of them transmits with a high probability, the node in the middle would detect the channel being occupied for a prolonged time and therefore experience extremely low throughput. The basic idea of the proposed scheme is to let each access point (AP) select the channel that reduces the number of three-node chain topologies on its two-hop neighborhood contention graph. The proposed scheme is proved to be a potential game, i.e., the proposed scheme is guaranteed to converge. Graph-based simulation shows that starvation occurs on 20% of nodes when nodes randomly select their frequency channels. The proposed scheme significantly reduces the number of starved nodes along with iterations, outperforming the compared traditional potential game based scheme.